NodeDataRepository

Constructor

Adds a NodeData object to this repository.

This repository keeps track of added and removed nodes (additionally to the other Unit of Work) in order to find in-memory nodes.

Removes an object to the persistence.

This repository keeps track of added and removed nodes (additionally to the other Unit of Work) in order to find in-memory nodes.

No description

Find a single node by exact path.

Find a shadow node by exact path

This finds nodes by path and delivers a raw, unfiltered result.

To get a "usable" set of nodes, filtering by workspaces, dimensions and removed nodes must be done on the result.

Finds a node by its path and context.

If the node does not exist in the specified context's workspace, this function will try to find one with the given path in one of the base workspaces (if any).

Examples for valid paths:

/ the root node /foo node "foo" on the first level /foo/bar node "bar" on the second level /foo/ first node on second level, below "foo"

Finds a node by its identifier and workspace.

If the node does not exist in the specified workspace, this function will try to find one with the given identifier in one of the base workspaces (if any).

Find all objects and return an IterableResult

Iterate over an IterableResult and return a Generator

This method is useful for batch processing a huge result set.

Assigns an index to the given node which reflects the specified position.

If the position is "before" or "after", an index will be chosen which makes the given node the previous or next node of the given reference node. If the position "last" is specified, an index higher than any existing index will be chosen.

If no free index is available between two nodes (for "before" and "after"), the whole index of the current node level will be renumbered.

Finds recursively nodes by its parent and (optionally) by its node type.

Finds nodes by its parent and (optionally) by its node type.

If the $recursive flag is set to true, all matching nodes underneath $parentPath will be returned

Note: Filters out removed nodes.

The primary sort key is the index, the secondary sort key (if indices are equal, which only occurs in very rare cases) is the identifier.

Improve implementation by using DQL

Internal method

Find NodeData by parent path without any dimension reduction and grouping by identifier

Only used internally for setting the path of all child nodes

Find NodeData by identifier path without any dimension reduction

Only used internally for finding whether the node exists in another dimension

Finds nodes by its parent and (optionally) by its node type given a Context

TODO Move to a new Node operation getDescendantNodes(...)

Counts nodes by its parent and (optionally) by its node type.

NOTE: Only considers persisted nodes!

Make room in the sortindex-index space of a given path in preparation to inserting a node.

All indices that are greater or equal to the given referenceIndex are incremented by 100

Finds the next free index on the level below the given parent path across all workspaces.

No description

Returns the next-lower-index seen from the given reference index in the level below the specified parent path. If no node with a lower than the given index exists at that level, the reference index is returned.

The result is determined workspace-agnostic.

Returns the next-higher-index seen from the given reference index in the level below the specified parent path. If no node with a higher than the given index exists at that level, NULL is returned.

The result is determined workspace-agnostic.

Counts the number of nodes within the specified workspace

Note: Also counts removed nodes

Sorts the given nodes by their index

Finds a single node by its parent and (optionally) by its node type

Finds a single node by its parent and (optionally) by its node type

Finds all nodes of the specified workspace lying on the path specified by (and including) the given starting point and end point and (optionally) a node type filter.

If some node does not exist in the specified workspace, this function will try to find a corresponding node in one of the base workspaces (if any).

findOnPath should probably not return child nodes of removed nodes unless removed nodes are included.

Find nodes by a value in properties

This method is internal and will be replaced with better search capabilities.

Flushes the addedNodes and removedNodes registry.

This method is (and should only be) used as a slot to the allObjectsPersisted signal.

Add node type filter constraints to the query builder

Generates a two dimensional array with the filters. First level is: 'excludeNodeTypes' 'includeNodeTypes'

Both are numeric arrays with the respective node types that are included or excluded.

No description

Iterates of the array of objects and removes all those which have recently been removed from the repository, but whose removal has not yet been persisted.

Technically this is a check of the given array against $this->removedNodes.

Returns a subset of $nodes which are not flagged as removed.

Returns a subset of $nodes which are flagged as removed.

Persists all entities managed by the repository and all cascading dependencies

Signals that persistEntities() in this repository finished correctly.

If $dimensions is not empty, adds join constraints to the given $queryBuilder limiting the query result to matching hits.

Given an array with duplicate nodes (from different workspaces and dimensions) those are reduced to uniqueness (by node identifier)

Given an array with duplicate nodes (from different workspaces) those are reduced to uniqueness (by node identifier and dimensions hash)

Find all NodeData objects inside a given workspace sorted by path to be used in publishing. The order makes sure that parent nodes are published first.

Shadow nodes are excluded, because they will be published when publishing the moved node.

Find out if the given path exists anywhere in the CR. (internal) If you need this functionality use \Neos\ContentRepository\Domain\Service\NodeService::nodePathExistsInAnyContext()

Find all node data in a path matching the given workspace hierarchy

Internal method, used by Node::setPath

Searches for possible relations to the given entity identifiers in NodeData.

Will return all possible NodeData objects that contain this identifiers. See buildQueryBuilderForRelationMap for the relationMap definition.

Note: This is an internal method that is likely to be replaced in the future.

Searches for possible relations to the given entity identifiers in NodeData using a path prefix.

Will return all possible NodeData objects that contain this identifiers. See buildQueryBuilderForRelationMap for the relationMap definition.

Note: This is an internal method that is likely to be replaced in the future.

Remove all nodes below a given path. Does not care about workspaces and dimensions.

Test if a given NodeData is in the set of removed node data objects

No description

No description

No description

No description

No description

Returns an array that contains the given workspace and all base (parent) workspaces of it.

Returns a query builder for a query on node data using the given relation map.

$objectTypeMap = [ 'Neos\Media\Domain\Model\Asset' => ['some-uuid-here'], 'Neos\Media\Domain\Model\ImageVariant' => ['some-uuid-here', 'another-uuid-here'] ]