@uipath/apollo-wind 2.67.1 → 2.69.0

package/dist/components/ui/json-tree-view/RowActions.js

@@ -13,32 +13,38 @@ const ACTION_TONE_CLASS = {
     warning: 'text-warning hover:text-warning',
     error: 'text-error hover:text-error'
 };
-function RowActions({ node, actions, maxInline }) {
+function RowActions({ node, actions, maxInline, meta }) {
     const strings = useJsonTreeViewStrings();
     const [menuOpen, setMenuOpen] = useState(false);
-    if (0 === actions.length) return null;
+    if (0 === actions.length && null == meta) return null;
     const overflowing = actions.length > maxInline;
     const inline = overflowing ? [] : actions;
     const overflow = overflowing ? actions : [];
     const moreLabel = strings.moreActions;
+    const renderInline = (action)=>/*#__PURE__*/ jsx(JsonTreeTooltip, {
+            content: action.tooltip ?? action.label,
+            placement: "top",
+            delay: true,
+            children: /*#__PURE__*/ jsx(Button, {
+                variant: "ghost",
+                size: "4xs",
+                icon: true,
+                disabled: action.disabled,
+                onClick: ()=>action.onSelect(node),
+                "aria-label": action.label,
+                className: cn(ACTION_BUTTON_CLASS, '[&_svg]:size-2.75', action.tone && ACTION_TONE_CLASS[action.tone], action.persistent && 'opacity-100', action.active && 'text-brand opacity-100 hover:text-brand'),
+                children: action.icon
+            })
+        }, action.id);
     return /*#__PURE__*/ jsxs("span", {
         className: "ml-auto flex shrink-0 items-center gap-0.5",
         children: [
-            inline.map((action)=>/*#__PURE__*/ jsx(JsonTreeTooltip, {
-                    content: action.tooltip ?? action.label,
-                    placement: "top",
-                    delay: true,
-                    children: /*#__PURE__*/ jsx(Button, {
-                        variant: "ghost",
-                        size: "4xs",
-                        icon: true,
-                        disabled: action.disabled,
-                        onClick: ()=>action.onSelect(node),
-                        "aria-label": action.label,
-                        className: cn(ACTION_BUTTON_CLASS, '[&_svg]:size-2.75', action.tone && ACTION_TONE_CLASS[action.tone], action.active && 'text-brand opacity-100 hover:text-brand'),
-                        children: action.icon
-                    })
-                }, action.id)),
+            inline.filter((action)=>'start' === action.placement).map(renderInline),
+            null != meta && /*#__PURE__*/ jsx("span", {
+                className: "mx-1.5 flex shrink-0 items-center",
+                children: meta
+            }),
+            inline.filter((action)=>'start' !== action.placement).map(renderInline),
             overflow.length > 0 && /*#__PURE__*/ jsxs(DropdownMenu, {
                 open: menuOpen,
                 onOpenChange: setMenuOpen,

package/dist/components/ui/json-tree-view/buildJsonTree.cjs

@@ -33,6 +33,7 @@ __webpack_require__.d(__webpack_exports__, {
     inferValueType: ()=>inferValueType,
     isArrayItemTemplateRoot: ()=>isArrayItemTemplateRoot,
     isJsonObject: ()=>isJsonObject,
+    isPathCollapsed: ()=>isPathCollapsed,
     removeValueAtPath: ()=>removeValueAtPath,
     schemaDisplayType: ()=>schemaDisplayType,
     setValueAtPath: ()=>setValueAtPath
@@ -41,6 +42,9 @@ const IDENTIFIER_RE = /^[A-Za-z_$][A-Za-z0-9_$]*$/;
 function hasOwn(object, key) {
     return Object.prototype.hasOwnProperty.call(object, key);
 }
+function isPathCollapsed(collapsed, path) {
+    return hasOwn(collapsed, path) && !!collapsed[path];
+}
 function isJsonObject(value) {
     return 'object' == typeof value && null !== value && !Array.isArray(value);
 }
@@ -79,7 +83,29 @@ function schemaDisplayType(schema) {
     if (void 0 !== enumSample) return inferValueType(enumSample);
     return 'null';
 }
-function buildNode(input) {
+function buildNodes(inputs) {
+    const roots = [];
+    const stack = [];
+    for(let index = inputs.length - 1; index >= 0; index -= 1)stack.push({
+        input: inputs[index],
+        siblings: roots
+    });
+    while(stack.length > 0){
+        const { input, siblings } = stack.pop();
+        const node = createNode(input);
+        siblings.push(node);
+        const childInputs = 'object' === node.type ? objectChildInputs(input.hasValue ? input.value : void 0, input.schema, input.segments, input.path, input.isTemplate) : 'array' === node.type ? arrayChildInputs(input.schema, input.value, input.hasValue, input.segments, input.path, input.isTemplate) : void 0;
+        if (!childInputs) continue;
+        const children = [];
+        node.children = children;
+        for(let index = childInputs.length - 1; index >= 0; index -= 1)stack.push({
+            input: childInputs[index],
+            siblings: children
+        });
+    }
+    return roots;
+}
+function createNode(input) {
     const type = input.hasValue ? inferValueType(input.value) : schemaDisplayType(input.schema);
     const node = {
         key: input.key,
@@ -91,13 +117,11 @@ function buildNode(input) {
     };
     if (input.hasValue) node.value = input.value;
     if (input.isTemplate) node.isArrayItemTemplate = true;
-    if ('object' === type) node.children = buildObjectChildren(input.hasValue ? input.value : void 0, input.schema, input.segments, input.path, input.isTemplate);
-    else if ('array' === type) node.children = buildArrayChildren(input.schema, input.value, input.hasValue, input.segments, input.path, input.isTemplate);
     return node;
 }
-function buildArrayChildren(schema, value, hasValue, segments, path, isTemplate) {
+function arrayChildInputs(schema, value, hasValue, segments, path, isTemplate) {
     const items = hasValue && Array.isArray(value) ? value : [];
-    if (items.length > 0) return items.map((item, index)=>buildNode({
+    if (items.length > 0) return items.map((item, index)=>({
             key: String(index),
             segments: [
                 ...segments,
@@ -110,7 +134,7 @@ function buildArrayChildren(schema, value, hasValue, segments, path, isTemplate)
             isTemplate
         }));
     if (schema?.items) return [
-        buildNode({
+        {
             key: '0',
             segments: [
                 ...segments,
@@ -120,18 +144,18 @@ function buildArrayChildren(schema, value, hasValue, segments, path, isTemplate)
             schema: schema.items,
             hasValue: false,
             isTemplate: true
-        })
+        }
     ];
     return [];
 }
-function buildObjectChildren(value, schema, segments, path, isTemplate) {
+function objectChildInputs(value, schema, segments, path, isTemplate) {
     const properties = schema?.properties ?? {};
     const required = new Set(schema?.required ?? []);
     const additional = 'object' == typeof schema?.additionalProperties ? schema.additionalProperties : void 0;
     const children = [];
     for (const [key, childSchema] of Object.entries(properties)){
         const hasValue = void 0 !== value && hasOwn(value, key);
-        children.push(buildNode({
+        children.push({
             key,
             segments: [
                 ...segments,
@@ -143,10 +167,10 @@ function buildObjectChildren(value, schema, segments, path, isTemplate) {
             hasValue,
             required: required.has(key),
             isTemplate
-        }));
+        });
     }
     if (void 0 !== value) {
-        for (const [key, childValue] of Object.entries(value))if (!hasOwn(properties, key)) children.push(buildNode({
+        for (const [key, childValue] of Object.entries(value))if (!hasOwn(properties, key)) children.push({
             key,
             segments: [
                 ...segments,
@@ -156,15 +180,15 @@ function buildObjectChildren(value, schema, segments, path, isTemplate) {
             schema: additional,
             value: childValue,
             hasValue: true
-        }));
+        });
     }
     return children;
 }
 function buildJsonTree(options) {
     const { schema, value, basePath = '' } = options;
     const rootIsArray = void 0 !== value ? Array.isArray(value) : !!schema && 'array' === schemaDisplayType(schema);
-    if (rootIsArray) return buildArrayChildren(schema, value, void 0 !== value, [], basePath);
-    return buildObjectChildren(isJsonObject(value) ? value : void 0, schema, [], basePath);
+    if (rootIsArray) return buildNodes(arrayChildInputs(schema, value, void 0 !== value, [], basePath));
+    return buildNodes(objectChildInputs(isJsonObject(value) ? value : void 0, schema, [], basePath));
 }
 function isArrayItemTemplateRoot(node) {
     return !!node.isArrayItemTemplate && 'number' == typeof node.segments[node.segments.length - 1];
@@ -176,47 +200,76 @@ function nodeSelfMatchesQuery(node, query, displayTexts) {
     if (display?.sublabel?.toLowerCase().includes(query)) return true;
     return void 0 !== node.value && null !== node.value && 'object' != typeof node.value && String(node.value).toLowerCase().includes(query);
 }
-function nodeMatchesQuery(node, query, displayTexts) {
-    if (nodeSelfMatchesQuery(node, query, displayTexts)) return true;
-    return node.children?.some((c)=>nodeMatchesQuery(c, query, displayTexts)) ?? false;
-}
-function nodeOrDescendantMatches(node, predicate) {
-    if (predicate(node)) return true;
-    return node.children?.some((c)=>nodeOrDescendantMatches(c, predicate)) ?? false;
+function indexMatches(nodes, test) {
+    const self = new Set();
+    const below = new Set();
+    const order = [];
+    const stack = [
+        ...nodes
+    ];
+    while(stack.length > 0){
+        const node = stack.pop();
+        order.push(node);
+        if (node.children) for (const child of node.children)stack.push(child);
+    }
+    for(let index = order.length - 1; index >= 0; index -= 1){
+        const node = order[index];
+        if (test(node)) self.add(node);
+        if (node.children?.some((child)=>self.has(child) || below.has(child))) below.add(node);
+    }
+    return {
+        self,
+        below
+    };
 }
 function flattenJsonTree(nodes, options = {}, depth = 0) {
-    const { collapsed = {}, filterPredicate } = options;
-    const query = options.query?.trim().toLowerCase() ?? '';
+    const { collapsed = {}, displayTexts } = options;
     const rows = [];
-    for (const node of nodes){
-        const selfQueryMatch = !!query && nodeSelfMatchesQuery(node, query, options.displayTexts);
-        if (query && !selfQueryMatch && !(node.children?.some((c)=>nodeMatchesQuery(c, query, options.displayTexts)) ?? false)) continue;
-        const selfPredicateMatch = !!filterPredicate && filterPredicate(node);
-        if (!filterPredicate || selfPredicateMatch || (node.children?.some((c)=>nodeOrDescendantMatches(c, filterPredicate)) ?? false)) {
-            rows.push({
-                node,
-                depth
-            });
-            if (node.children && !collapsed[node.path]) {
-                const childOptions = selfQueryMatch || selfPredicateMatch ? {
-                    ...options,
-                    query: selfQueryMatch ? '' : options.query,
-                    filterPredicate: selfPredicateMatch ? void 0 : filterPredicate
-                } : options;
-                for (const row of flattenJsonTree(node.children, childOptions, depth + 1))rows.push(row);
-            }
-        }
+    const stack = [];
+    const pushChildren = (children, childDepth, query, filterPredicate)=>{
+        for(let index = children.length - 1; index >= 0; index -= 1)stack.push({
+            node: children[index],
+            depth: childDepth,
+            query,
+            filterPredicate
+        });
+    };
+    const rootQuery = options.query?.trim().toLowerCase() ?? '';
+    pushChildren(nodes, depth, rootQuery, options.filterPredicate);
+    const queryMatches = rootQuery ? indexMatches(nodes, (node)=>nodeSelfMatchesQuery(node, rootQuery, displayTexts)) : void 0;
+    const predicateMatches = options.filterPredicate ? indexMatches(nodes, options.filterPredicate) : void 0;
+    while(stack.length > 0){
+        const { node, depth: nodeDepth, query, filterPredicate } = stack.pop();
+        const selfQueryMatch = !!query && !!queryMatches?.self.has(node);
+        if (query && !selfQueryMatch && !queryMatches?.below.has(node)) continue;
+        const selfPredicateMatch = !!filterPredicate && !!predicateMatches?.self.has(node);
+        if (filterPredicate && !selfPredicateMatch && !predicateMatches?.below.has(node)) continue;
+        rows.push({
+            node,
+            depth: nodeDepth
+        });
+        if (node.children && !isPathCollapsed(collapsed, node.path)) pushChildren(node.children, nodeDepth + 1, selfQueryMatch ? '' : query, selfPredicateMatch ? void 0 : filterPredicate);
     }
     return rows;
 }
 function collectContainerPaths(nodes, depth = 0) {
     const paths = [];
-    for (const node of nodes)if (node.children) {
+    const stack = [];
+    for(let index = nodes.length - 1; index >= 0; index -= 1)stack.push({
+        node: nodes[index],
+        depth
+    });
+    while(stack.length > 0){
+        const { node, depth: nodeDepth } = stack.pop();
+        if (!node.children) continue;
         paths.push({
             path: node.path,
-            depth
+            depth: nodeDepth
+        });
+        for(let index = node.children.length - 1; index >= 0; index -= 1)stack.push({
+            node: node.children[index],
+            depth: nodeDepth + 1
         });
-        for (const child of collectContainerPaths(node.children, depth + 1))paths.push(child);
     }
     return paths;
 }
@@ -302,6 +355,7 @@ exports.getValueAtPath = __webpack_exports__.getValueAtPath;
 exports.inferValueType = __webpack_exports__.inferValueType;
 exports.isArrayItemTemplateRoot = __webpack_exports__.isArrayItemTemplateRoot;
 exports.isJsonObject = __webpack_exports__.isJsonObject;
+exports.isPathCollapsed = __webpack_exports__.isPathCollapsed;
 exports.removeValueAtPath = __webpack_exports__.removeValueAtPath;
 exports.schemaDisplayType = __webpack_exports__.schemaDisplayType;
 exports.setValueAtPath = __webpack_exports__.setValueAtPath;
@@ -315,6 +369,7 @@ for(var __rspack_i in __webpack_exports__)if (-1 === [
     "inferValueType",
     "isArrayItemTemplateRoot",
     "isJsonObject",
+    "isPathCollapsed",
     "removeValueAtPath",
     "schemaDisplayType",
     "setValueAtPath"

package/dist/components/ui/json-tree-view/buildJsonTree.d.ts

@@ -1,4 +1,10 @@
 import type { JsonContainer, JsonObject, JsonSchema, JsonTreeNode, JsonTreeNodeType, JsonValue, PathSegment } from './JsonTree.types';
+/**
+ * Whether `path` is collapsed. Own keys only: paths are arbitrary JSON keys, and
+ * one named after an Object.prototype member (`constructor`, `toString`, …)
+ * would otherwise read the inherited function and stay collapsed.
+ */
+export declare function isPathCollapsed(collapsed: Record<string, boolean>, path: string): boolean;
 export declare function isJsonObject(value: JsonValue | undefined): value is JsonObject;
 /** Appends a segment to an expression path (`a.b`, `a["x-y"]`, `a[0]`). */
 export declare function appendPathSegment(path: string, segment: PathSegment): string;
@@ -48,13 +54,20 @@ export interface FlattenOptions {
     /** Lets search also match consumer display labels (e.g. decoration labels). */
     displayTexts?: NodeDisplayTexts;
 }
-/** Flattens the tree to visible rows, honoring collapse state, search, and filter. */
+/**
+ * Flattens the tree to visible rows, honoring collapse state, search, and filter.
+ * Walks depth-first with an explicit stack rather than recursion, so a deeply
+ * nested tree can't overflow the call stack.
+ */
 export declare function flattenJsonTree(nodes: JsonTreeNode[], options?: FlattenOptions, depth?: number): FlatJsonTreeRow[];
 export interface ContainerPath {
     path: string;
     depth: number;
 }
-/** All container (object/array) paths in the tree, with their depth. */
+/**
+ * All container (object/array) paths in the tree, with their depth, in tree
+ * order. Walks with an explicit stack, so deep trees can't overflow the call stack.
+ */
 export declare function collectContainerPaths(nodes: JsonTreeNode[], depth?: number): ContainerPath[];
 export declare function getValueAtPath(root: JsonValue | undefined, segments: PathSegment[]): JsonValue | undefined;
 /**

package/dist/components/ui/json-tree-view/buildJsonTree.js

@@ -2,6 +2,9 @@ const IDENTIFIER_RE = /^[A-Za-z_$][A-Za-z0-9_$]*$/;
 function hasOwn(object, key) {
     return Object.prototype.hasOwnProperty.call(object, key);
 }
+function isPathCollapsed(collapsed, path) {
+    return hasOwn(collapsed, path) && !!collapsed[path];
+}
 function isJsonObject(value) {
     return 'object' == typeof value && null !== value && !Array.isArray(value);
 }
@@ -40,7 +43,29 @@ function schemaDisplayType(schema) {
     if (void 0 !== enumSample) return inferValueType(enumSample);
     return 'null';
 }
-function buildNode(input) {
+function buildNodes(inputs) {
+    const roots = [];
+    const stack = [];
+    for(let index = inputs.length - 1; index >= 0; index -= 1)stack.push({
+        input: inputs[index],
+        siblings: roots
+    });
+    while(stack.length > 0){
+        const { input, siblings } = stack.pop();
+        const node = createNode(input);
+        siblings.push(node);
+        const childInputs = 'object' === node.type ? objectChildInputs(input.hasValue ? input.value : void 0, input.schema, input.segments, input.path, input.isTemplate) : 'array' === node.type ? arrayChildInputs(input.schema, input.value, input.hasValue, input.segments, input.path, input.isTemplate) : void 0;
+        if (!childInputs) continue;
+        const children = [];
+        node.children = children;
+        for(let index = childInputs.length - 1; index >= 0; index -= 1)stack.push({
+            input: childInputs[index],
+            siblings: children
+        });
+    }
+    return roots;
+}
+function createNode(input) {
     const type = input.hasValue ? inferValueType(input.value) : schemaDisplayType(input.schema);
     const node = {
         key: input.key,
@@ -52,13 +77,11 @@ function buildNode(input) {
     };
     if (input.hasValue) node.value = input.value;
     if (input.isTemplate) node.isArrayItemTemplate = true;
-    if ('object' === type) node.children = buildObjectChildren(input.hasValue ? input.value : void 0, input.schema, input.segments, input.path, input.isTemplate);
-    else if ('array' === type) node.children = buildArrayChildren(input.schema, input.value, input.hasValue, input.segments, input.path, input.isTemplate);
     return node;
 }
-function buildArrayChildren(schema, value, hasValue, segments, path, isTemplate) {
+function arrayChildInputs(schema, value, hasValue, segments, path, isTemplate) {
     const items = hasValue && Array.isArray(value) ? value : [];
-    if (items.length > 0) return items.map((item, index)=>buildNode({
+    if (items.length > 0) return items.map((item, index)=>({
             key: String(index),
             segments: [
                 ...segments,
@@ -71,7 +94,7 @@ function buildArrayChildren(schema, value, hasValue, segments, path, isTemplate)
             isTemplate
         }));
     if (schema?.items) return [
-        buildNode({
+        {
             key: '0',
             segments: [
                 ...segments,
@@ -81,18 +104,18 @@ function buildArrayChildren(schema, value, hasValue, segments, path, isTemplate)
             schema: schema.items,
             hasValue: false,
             isTemplate: true
-        })
+        }
     ];
     return [];
 }
-function buildObjectChildren(value, schema, segments, path, isTemplate) {
+function objectChildInputs(value, schema, segments, path, isTemplate) {
     const properties = schema?.properties ?? {};
     const required = new Set(schema?.required ?? []);
     const additional = 'object' == typeof schema?.additionalProperties ? schema.additionalProperties : void 0;
     const children = [];
     for (const [key, childSchema] of Object.entries(properties)){
         const hasValue = void 0 !== value && hasOwn(value, key);
-        children.push(buildNode({
+        children.push({
             key,
             segments: [
                 ...segments,
@@ -104,10 +127,10 @@ function buildObjectChildren(value, schema, segments, path, isTemplate) {
             hasValue,
             required: required.has(key),
             isTemplate
-        }));
+        });
     }
     if (void 0 !== value) {
-        for (const [key, childValue] of Object.entries(value))if (!hasOwn(properties, key)) children.push(buildNode({
+        for (const [key, childValue] of Object.entries(value))if (!hasOwn(properties, key)) children.push({
             key,
             segments: [
                 ...segments,
@@ -117,15 +140,15 @@ function buildObjectChildren(value, schema, segments, path, isTemplate) {
             schema: additional,
             value: childValue,
             hasValue: true
-        }));
+        });
     }
     return children;
 }
 function buildJsonTree(options) {
     const { schema, value, basePath = '' } = options;
     const rootIsArray = void 0 !== value ? Array.isArray(value) : !!schema && 'array' === schemaDisplayType(schema);
-    if (rootIsArray) return buildArrayChildren(schema, value, void 0 !== value, [], basePath);
-    return buildObjectChildren(isJsonObject(value) ? value : void 0, schema, [], basePath);
+    if (rootIsArray) return buildNodes(arrayChildInputs(schema, value, void 0 !== value, [], basePath));
+    return buildNodes(objectChildInputs(isJsonObject(value) ? value : void 0, schema, [], basePath));
 }
 function isArrayItemTemplateRoot(node) {
     return !!node.isArrayItemTemplate && 'number' == typeof node.segments[node.segments.length - 1];
@@ -137,47 +160,76 @@ function nodeSelfMatchesQuery(node, query, displayTexts) {
     if (display?.sublabel?.toLowerCase().includes(query)) return true;
     return void 0 !== node.value && null !== node.value && 'object' != typeof node.value && String(node.value).toLowerCase().includes(query);
 }
-function nodeMatchesQuery(node, query, displayTexts) {
-    if (nodeSelfMatchesQuery(node, query, displayTexts)) return true;
-    return node.children?.some((c)=>nodeMatchesQuery(c, query, displayTexts)) ?? false;
-}
-function nodeOrDescendantMatches(node, predicate) {
-    if (predicate(node)) return true;
-    return node.children?.some((c)=>nodeOrDescendantMatches(c, predicate)) ?? false;
+function indexMatches(nodes, test) {
+    const self = new Set();
+    const below = new Set();
+    const order = [];
+    const stack = [
+        ...nodes
+    ];
+    while(stack.length > 0){
+        const node = stack.pop();
+        order.push(node);
+        if (node.children) for (const child of node.children)stack.push(child);
+    }
+    for(let index = order.length - 1; index >= 0; index -= 1){
+        const node = order[index];
+        if (test(node)) self.add(node);
+        if (node.children?.some((child)=>self.has(child) || below.has(child))) below.add(node);
+    }
+    return {
+        self,
+        below
+    };
 }
 function flattenJsonTree(nodes, options = {}, depth = 0) {
-    const { collapsed = {}, filterPredicate } = options;
-    const query = options.query?.trim().toLowerCase() ?? '';
+    const { collapsed = {}, displayTexts } = options;
     const rows = [];
-    for (const node of nodes){
-        const selfQueryMatch = !!query && nodeSelfMatchesQuery(node, query, options.displayTexts);
-        if (query && !selfQueryMatch && !(node.children?.some((c)=>nodeMatchesQuery(c, query, options.displayTexts)) ?? false)) continue;
-        const selfPredicateMatch = !!filterPredicate && filterPredicate(node);
-        if (!filterPredicate || selfPredicateMatch || (node.children?.some((c)=>nodeOrDescendantMatches(c, filterPredicate)) ?? false)) {
-            rows.push({
-                node,
-                depth
-            });
-            if (node.children && !collapsed[node.path]) {
-                const childOptions = selfQueryMatch || selfPredicateMatch ? {
-                    ...options,
-                    query: selfQueryMatch ? '' : options.query,
-                    filterPredicate: selfPredicateMatch ? void 0 : filterPredicate
-                } : options;
-                for (const row of flattenJsonTree(node.children, childOptions, depth + 1))rows.push(row);
-            }
-        }
+    const stack = [];
+    const pushChildren = (children, childDepth, query, filterPredicate)=>{
+        for(let index = children.length - 1; index >= 0; index -= 1)stack.push({
+            node: children[index],
+            depth: childDepth,
+            query,
+            filterPredicate
+        });
+    };
+    const rootQuery = options.query?.trim().toLowerCase() ?? '';
+    pushChildren(nodes, depth, rootQuery, options.filterPredicate);
+    const queryMatches = rootQuery ? indexMatches(nodes, (node)=>nodeSelfMatchesQuery(node, rootQuery, displayTexts)) : void 0;
+    const predicateMatches = options.filterPredicate ? indexMatches(nodes, options.filterPredicate) : void 0;
+    while(stack.length > 0){
+        const { node, depth: nodeDepth, query, filterPredicate } = stack.pop();
+        const selfQueryMatch = !!query && !!queryMatches?.self.has(node);
+        if (query && !selfQueryMatch && !queryMatches?.below.has(node)) continue;
+        const selfPredicateMatch = !!filterPredicate && !!predicateMatches?.self.has(node);
+        if (filterPredicate && !selfPredicateMatch && !predicateMatches?.below.has(node)) continue;
+        rows.push({
+            node,
+            depth: nodeDepth
+        });
+        if (node.children && !isPathCollapsed(collapsed, node.path)) pushChildren(node.children, nodeDepth + 1, selfQueryMatch ? '' : query, selfPredicateMatch ? void 0 : filterPredicate);
     }
     return rows;
 }
 function collectContainerPaths(nodes, depth = 0) {
     const paths = [];
-    for (const node of nodes)if (node.children) {
+    const stack = [];
+    for(let index = nodes.length - 1; index >= 0; index -= 1)stack.push({
+        node: nodes[index],
+        depth
+    });
+    while(stack.length > 0){
+        const { node, depth: nodeDepth } = stack.pop();
+        if (!node.children) continue;
         paths.push({
             path: node.path,
-            depth
+            depth: nodeDepth
+        });
+        for(let index = node.children.length - 1; index >= 0; index -= 1)stack.push({
+            node: node.children[index],
+            depth: nodeDepth + 1
         });
-        for (const child of collectContainerPaths(node.children, depth + 1))paths.push(child);
     }
     return paths;
 }
@@ -254,4 +306,4 @@ function formatLeafValue(type, value, options) {
     if ('string' === type) return options?.preserveStringWhitespace ? `"${value}"` : JSON.stringify(value);
     return String(value);
 }
-export { appendPathSegment, buildJsonTree, collectContainerPaths, flattenJsonTree, formatLeafValue, getValueAtPath, inferValueType, isArrayItemTemplateRoot, isJsonObject, removeValueAtPath, schemaDisplayType, setValueAtPath };
+export { appendPathSegment, buildJsonTree, collectContainerPaths, flattenJsonTree, formatLeafValue, getValueAtPath, inferValueType, isArrayItemTemplateRoot, isJsonObject, isPathCollapsed, removeValueAtPath, schemaDisplayType, setValueAtPath };