In the content graph we have some methods returning NodeAggregates and others iterable<NodeAggregate> while it seems like it, the iterable is also not lazy and yielded but fetches all nodes eagerly so there is no performance / memory gain.
2.) NodeAggregate::getNodes might return Nodes instead but its internal and Nodes usually represent a flat list in the same dimension and not a list cross dimensional.
ContentGraphIn the content graph we have some methods returning
NodeAggregatesand othersiterable<NodeAggregate>while it seems like it, theiterableis also not lazy and yielded but fetches all nodes eagerly so there is no performance / memory gain.2.)
NodeAggregate::getNodesmight returnNodesinstead but its internal andNodesusually represent a flat list in the same dimension and not a list cross dimensional.3.)
ContentDimensionSourceInterface::getContentDimensionsOrderedByPriority4.)
ContentDimension::getSpecializationsandgetRootValues5.)
InterDimensionalVariationGrap::getRootGeneralizationsand others6.)
NodeType::getPropertiesand co https://github.com/neos/neos-development-collection/issues/42287.)
WorkspaceMaintenanceService::rebaseOutdatedWorkspacesreturnsarray<string,Workspace>8.)
Workspacerelated things https://github.com/neos/neos-development-collection/issues/4683