You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@jackrabbit.apache.org by re...@apache.org on 2026/01/27 19:08:35 UTC
(jackrabbit-filevault) branch test/reschke/JCRVLT-831 created (now f51dc340)
This is an automated email from the ASF dual-hosted git repository.
reschke pushed a change to branch test/reschke/JCRVLT-831
in repository https://gitbox.apache.org/repos/asf/jackrabbit-filevault.git
at f51dc340 JCRVLT-831: test another bottleneck fix
This branch includes the following new commits:
new f51dc340 JCRVLT-831: test another bottleneck fix
The 1 revisions listed above as "new" are entirely new to this
repository and will be described in separate emails. The revisions
listed as "add" were already present in the repository and have only
been added to this reference.
(jackrabbit-filevault) 01/01: JCRVLT-831: test another bottleneck fix
Posted by re...@apache.org.
This is an automated email from the ASF dual-hosted git repository.
reschke pushed a commit to branch test/reschke/JCRVLT-831
in repository https://gitbox.apache.org/repos/asf/jackrabbit-filevault.git
commit f51dc340ba6e39e31ffc78b8530603f7ab22ee28
Author: Julian Reschke <ju...@gmx.de>
AuthorDate: Tue Jan 27 20:08:15 2026 +0100
JCRVLT-831: test another bottleneck fix
---
.../main/java/org/apache/jackrabbit/vault/fs/impl/AggregateImpl.java | 4 +++-
1 file changed, 3 insertions(+), 1 deletion(-)
diff --git a/vault-core/src/main/java/org/apache/jackrabbit/vault/fs/impl/AggregateImpl.java b/vault-core/src/main/java/org/apache/jackrabbit/vault/fs/impl/AggregateImpl.java
index 525660fb..89e03524 100644
--- a/vault-core/src/main/java/org/apache/jackrabbit/vault/fs/impl/AggregateImpl.java
+++ b/vault-core/src/main/java/org/apache/jackrabbit/vault/fs/impl/AggregateImpl.java
@@ -462,7 +462,9 @@ public class AggregateImpl implements Aggregate {
aggregateWalkListener.onChildren(node, depth);
boolean hasOrderableChildNodes = node.getPrimaryNodeType().hasOrderableChildNodes();
- Iterable<Node> children = new NodeIterable(node.getNodes());
+ NodeIterator nit =
+ hasOrderableChildNodes ? node.getNodes() : getNodeIteratorFor(node, mgr.getWorkspaceFilter());
+ Iterable<Node> children = new NodeIterable(nit);
// if children not ordered: find included children, sort alphabetically
if (!hasOrderableChildNodes) {