Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

BUGFIX: Make Subtree immutable and remove Subtrees #4536

Merged
merged 4 commits into from
Oct 19, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -64,7 +64,6 @@
use Neos\ContentRepository\Core\Projection\ContentGraph\References;
use Neos\ContentRepository\Core\Projection\ContentGraph\SearchTerm;
use Neos\ContentRepository\Core\Projection\ContentGraph\Subtree;
use Neos\ContentRepository\Core\Projection\ContentGraph\Subtrees;
use Neos\ContentRepository\Core\Projection\ContentGraph\VisibilityConstraints;
use Neos\ContentRepository\Core\SharedModel\Node\NodeAggregateClassification;
use Neos\ContentRepository\Core\SharedModel\Node\NodeAggregateId;
Expand Down Expand Up @@ -304,19 +303,22 @@ public function findSubtree(NodeAggregateId $entryNodeAggregateId, FindSubtreeFi
->setParameter('entryNodeAggregateId', $entryNodeAggregateId->value);

$result = $this->fetchCteResults($queryBuilderInitial, $queryBuilderRecursive, $queryBuilderCte, 'tree');
$subtreesByNodeId = [];
$rootSubtrees = $subtreesByNodeId['ROOT'] = Subtrees::createEmpty();
foreach ($result as $nodeData) {
$node = $this->nodeFactory->mapNodeRowToNode(
$nodeData,
$this->dimensionSpacePoint,
$this->visibilityConstraints
);
$subtree = new Subtree((int)$nodeData['level'], $node);
$subtreesByNodeId[$nodeData['parentNodeAggregateId']]->add($subtree);
$subtreesByNodeId[$nodeData['nodeaggregateid']] = $subtree;
/** @var array<string, Subtree[]> $subtreesByParentNodeId */
$subtreesByParentNodeId = [];
foreach (array_reverse($result) as $nodeData) {
$nodeAggregateId = $nodeData['nodeaggregateid'];
$parentNodeAggregateId = $nodeData['parentNodeAggregateId'];
$node = $this->nodeFactory->mapNodeRowToNode($nodeData, $this->dimensionSpacePoint, $this->visibilityConstraints);
$subtree = new Subtree((int)$nodeData['level'], $node, array_key_exists($nodeAggregateId, $subtreesByParentNodeId) ? array_reverse($subtreesByParentNodeId[$nodeAggregateId]) : []);
if ($subtree->level === 0) {
return $subtree;
}
if (!array_key_exists($parentNodeAggregateId, $subtreesByParentNodeId)) {
$subtreesByParentNodeId[$parentNodeAggregateId] = [];
}
$subtreesByParentNodeId[$parentNodeAggregateId][] = $subtree;
}
return $rootSubtrees->first();
return null;
}

public function findAncestorNodes(NodeAggregateId $entryNodeAggregateId, FindAncestorNodesFilter $filter): Nodes
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,6 @@
use Neos\ContentRepository\Core\Projection\ContentGraph\Reference;
use Neos\ContentRepository\Core\Projection\ContentGraph\References;
use Neos\ContentRepository\Core\Projection\ContentGraph\Subtree;
use Neos\ContentRepository\Core\Projection\ContentGraph\Subtrees;
use Neos\ContentRepository\Core\Projection\ContentGraph\Timestamps;
use Neos\ContentRepository\Core\SharedModel\Exception\NodeTypeNotFoundException;
use Neos\ContentRepository\Core\SharedModel\Node\ReferenceName;
Expand Down Expand Up @@ -161,21 +160,22 @@ public function mapNodeRowsToSubtree(
array $nodeRows,
VisibilityConstraints $visibilityConstraints
): ?Subtree {
$subtreesByParentNodeAggregateId = [];
foreach ($nodeRows as $nodeRow) {
$node = $this->mapNodeRowToNode(
$nodeRow,
$visibilityConstraints
);

$subtreesByParentNodeAggregateId[$nodeRow['parentnodeaggregateid']][] = new Subtree(
(int)$nodeRow['level'],
$node,
$subtreesByParentNodeAggregateId[$nodeRow['nodeaggregateid']] ?? []
);
/** @var array<string, Subtree[]> $subtreesByParentNodeId */
$subtreesByParentNodeId = [];
foreach (array_reverse($nodeRows) as $nodeRow) {
$nodeAggregateId = $nodeRow['nodeaggregateid'];
$parentNodeAggregateId = $nodeRow['parentnodeaggregateid'];
$node = $this->mapNodeRowToNode($nodeRow, $visibilityConstraints);
$subtree = new Subtree((int)$nodeRow['level'], $node, array_key_exists($nodeAggregateId, $subtreesByParentNodeId) ? array_reverse($subtreesByParentNodeId[$nodeAggregateId]) : []);
if ($subtree->level === 0) {
return $subtree;
}
if (!array_key_exists($parentNodeAggregateId, $subtreesByParentNodeId)) {
$subtreesByParentNodeId[$parentNodeAggregateId] = [];
}
$subtreesByParentNodeId[$parentNodeAggregateId][] = $subtree;
}

return Subtrees::fromArray($subtreesByParentNodeAggregateId['ROOT'])->first();
return null;
}

/**
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -10,20 +10,12 @@
final class Subtree
{
/**
* @param Subtree[] $children
* @param array<int,Subtree> $children
*/
public function __construct(
public readonly int $level,
public readonly Node $node,
public array $children = []
public readonly array $children
) {
}

/**
* @internal
*/
public function add(Subtree $subtree): void
{
$this->children[] = $subtree;
}
}

This file was deleted.

Loading