@itwin/core-geometry 4.4.0-dev.8 → 4.5.0-dev.0

package/lib/esm/polyface/RangeTree/RangeTreeNode.js

@@ -0,0 +1,497 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { assert } from "@itwin/core-bentley";
+import { Range3d } from "../../geometry3d/Range";
+/**
+ * Map an (unchecked) integer to a parameterized type T, where the data argument can be either:
+ * * an array of type T
+ * * a function which takes an index and returns type T
+ * @internal
+ */
+function evaluateIndexToType(data, index) {
+    if (Array.isArray(data))
+        return data[index];
+    return data(index);
+}
+/**
+ * Get data by index from a source that may be undefined, an array of item of type T, or a singleton of the item type.
+ * @internal
+ */
+function getByIndex(index, data) {
+    if (data !== undefined) {
+        if (Array.isArray(data)) {
+            if (index < data.length)
+                return data[index];
+        }
+        else {
+            return data;
+        }
+    }
+    return undefined;
+}
+/**
+ * Return the number of items in an object that can be undefined, an array of item of type T, or a singleton of the item type.
+ * @internal
+ */
+function getFlexDataCount(data) {
+    if (data !== undefined) {
+        if (Array.isArray(data)) {
+            return data.length;
+        }
+        else {
+            return 1;
+        }
+    }
+    return 0;
+}
+/**
+ * Abstract class for handler objects called during traversal of a single range tree.
+ * @internal
+ */
+export class SingleTreeSearchHandler {
+    /**
+     * Query to see if the active search has been aborted.
+     * * Default implementation returns false so query runs to completion.
+     * * Search processes check this after range tests and child processing.
+     */
+    // eslint-disable-next-line @itwin/prefer-get
+    isAborted() { return false; }
+}
+/**
+ * Abstract class for handler objects called during traversal of two range trees.
+ * @internal
+ */
+export class TwoTreeSearchHandler {
+    /**
+     * Query to see if the active search has been aborted.
+     * * Default implementation returns false so query runs to completion.
+     * * Search processes check this after range tests and child processing.
+     */
+    // eslint-disable-next-line @itwin/prefer-get
+    isAborted() { return false; }
+}
+/**
+ * This class refines the TwoTreeSearchHandler with an implementation of `isRangePairActive` appropriate for computing the minimum distance between trees.
+ * * The concrete class must implement `getCurrentDistance()` method to provide the best-so-far distance.
+ * * The implementation of `isRangePairActive` returns true if the distance between ranges is less than or equal to the `getCurrentDistance()` value.
+ * @internal
+ */
+export class TwoTreeDistanceMinimizationSearchHandler extends TwoTreeSearchHandler {
+    /**
+     * Method called to decide whether to process subtrees and immediate child appData items from a left tree node and right tree node.
+     * @param leftRange range from a node in the left tree
+     * @param rightRange range from a node in the right tree.
+     * @returns true if the smallest distance from leftRange to rightRange is less than or equal to getCurrentDistance()
+     */
+    isRangePairActive(leftRange, rightRange) {
+        const currentDistance = this.getCurrentDistance();
+        const distanceBetweenRanges = leftRange.distanceToRange(rightRange);
+        if (distanceBetweenRanges <= currentDistance) {
+            return true;
+        }
+        return false;
+    }
+}
+let numNodeCreated = 0;
+/**
+ * * TREE STRUCTURE
+ *   * A RangeTreeNode is part of a range tree.
+ *   * TREE is used here in a strictly _structural_ sense, which has no broad promises about data members.
+ *   * Each RangeNode points to 0, 1 or many children.
+ *   * Each child has (but does not point back to) a single parent.
+ *   * The overall tree has a single root.
+ *   * Each node is effectively the root of the tree of its children.
+ * * NON-TREE DATA MEMBERS
+ *   * Data members in each node (in addition to children) are
+ *     * _range = the union of ranges below in the heap
+ *     * _appData = application data associated with the node.
+ *       * Construction methods may place multiple _appData items in each node.
+ * * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.
+ * * CONSTRUCTION
+ *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.
+ *     * The appData is placed entirely in the leaves.
+ *     * caller can specify:
+ *       * the number of _appData items per leaf
+ *       * the number of children per node within the tree.
+ *     * "deep" trees (2 children per node and one appData per leaf) may have (compared to shallow trees with many children per node and many appData per leaf)
+ *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.
+ *       * larger memory use because of more nodes
+ *   * For future construction methods:
+ *      * _appData "above the leaves" may allow nodes below to have smaller ranges, but add complexity to search.
+ * @internal
+ */
+export class RangeTreeNode {
+    /**
+     * CONSTRUCTOR
+     * CAPTURE (not copy)
+     * * range = range for search algorithms
+     * * appData = application data relevant to this node.
+     * * children = child node reference(s).
+     */
+    constructor(range, appData, children) {
+        this._range = range;
+        this._appData = appData;
+        this._children = children;
+        this._id = numNodeCreated++;
+        // const childIds: number[] = [];
+        // if (Array.isArray(this._children))
+        //   for (const c of this._children) childIds.push(c._id);
+        // else if (this._children instanceof RangeTreeNode)
+        //   childIds.push(this._children._id);
+        // const numAppData = getFlexDataCount(appData);
+        // console.log({ id: this._id, childIds, numAppData });
+    }
+    /** Simplest public create: capture the range, appData, and children. */
+    static createCapture(range, appData, children) {
+        return new RangeTreeNode(range, appData, children);
+    }
+    /** copy (not capture) from given data into the range in this RangeEntry */
+    setRange(data) {
+        this._range.setFrom(data);
+    }
+    /** return (a copy of) the range in this RangeEntry */
+    getRange(data) {
+        return this._range.clone(data);
+    }
+    /** return (a reference to) the range in this RangeEntry */
+    getRangeRef() {
+        return this._range;
+    }
+    /**
+     * Access a child by index.
+     * * If the child data is an array, this dereferences the array.
+     * * If the child data is a singleton, treat it as index 0.
+     * * return undefined if there are no children.
+     * @param index index of item to access.
+     */
+    getChildByIndex(index) {
+        return getByIndex(index, this._children);
+    }
+    /**
+     * * Access an appData by index.
+     * * If the appData data is an array, this dereferences the array.
+     * * If the appData data is a singleton, treat it as if it is at index 0 in an array
+     * * return undefined if there are no appData or for any index out of range.
+     * @param index index of item to access.
+     */
+    getAppDataByIndex(index) {
+        return getByIndex(index, this._appData);
+    }
+    /** Access the children or child (does not clone). */
+    getAllChildren() {
+        return this._children;
+    }
+    /** Access the appData array or singleton (does not clone). */
+    getAllAppData() {
+        return this._appData;
+    }
+    /**
+     * Count the direct children in this node of the tree.
+     * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveNodeCount`.
+     */
+    getNumChildren() {
+        return getFlexDataCount(this._children);
+    }
+    /**
+     * Count the appData items in this node of the tree.
+     * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveAppDataCount`.
+     */
+    getNumAppData() {
+        return getFlexDataCount(this._appData);
+    }
+    /**
+     * Depth-first tree iteration, calling `announceNode` on each node.
+     * @param announceNode callback that returns true to recurse into children
+     */
+    recurseIntoTree(announceNode) {
+        const doChildren = announceNode(this);
+        if (doChildren) {
+            if (Array.isArray(this._children)) {
+                for (const child of this._children)
+                    child.recurseIntoTree(announceNode);
+            }
+            else if (this._children !== undefined) {
+                this._children.recurseIntoTree(announceNode);
+            }
+        }
+    }
+    /**
+     * Depth-first tree iteration via handler.
+     * * if handler decides the instance range is active, process appData, then recurse on children
+     * * if handler decides to abort after processing an appData, skip processing rest of appData and children
+     */
+    searchTopDown(handler) {
+        if (handler.isRangeActive(this._range)) {
+            let itemToProcess;
+            for (let i = 0; undefined !== (itemToProcess = this.getAppDataByIndex(i)); i++) {
+                // console.log(itemToProcess);
+                handler.processAppData(itemToProcess);
+                if (handler.isAborted())
+                    return;
+            }
+            let child;
+            for (let i = 0; undefined !== (child = this.getChildByIndex(i)); i++) {
+                child.searchTopDown(handler);
+            }
+        }
+    }
+    /**
+     * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightStack.
+     * @param leftAppData singleton or array with data "from left"
+     * @param rightStack stack of nodes to process from right path.
+     * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.
+     * @param handler search handler
+     */
+    static processAppDataAndAppDataStack(leftAppData, rightStack, reverseArgs, handler) {
+        if (leftAppData !== undefined) {
+            let leftItem;
+            let rightItem;
+            // hmm.. we ASSUME that if the tip ranges passed, then all parent ranges would pass without further test.
+            for (let rangeIndex = rightStack.length; rangeIndex-- > 0;) {
+                const rightAppData = rightStack[rangeIndex]._appData;
+                for (let rightIndex = 0; undefined !== (rightItem = getByIndex(rightIndex, rightAppData)); rightIndex++) {
+                    for (let leftIndex = 0; undefined !== (leftItem = getByIndex(leftIndex, leftAppData)); leftIndex++) {
+                        if (!reverseArgs)
+                            handler.processAppDataPair(leftItem, rightItem);
+                        else
+                            handler.processAppDataPair(rightItem, leftItem);
+                        if (handler.isAborted())
+                            return;
+                    }
+                }
+            }
+        }
+    }
+    /**
+     * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightAppData.
+     * @param leftAppData singleton or array with data "from left"
+     * @param rightAppData singleton or array with data "from right"
+     * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.
+     * @param handler search handler
+     */
+    static processAppDataAndAppData(leftAppData, rightAppData, reverseArgs, handler) {
+        if (leftAppData !== undefined && rightAppData !== undefined) {
+            let leftItem;
+            let rightItem;
+            for (let rightIndex = 0; undefined !== (rightItem = getByIndex(rightIndex, rightAppData)); rightIndex++) {
+                for (let leftIndex = 0; undefined !== (leftItem = getByIndex(leftIndex, leftAppData)); leftIndex++) {
+                    if (!reverseArgs)
+                        handler.processAppDataPair(leftItem, rightItem);
+                    else
+                        handler.processAppDataPair(rightItem, leftItem);
+                    if (handler.isAborted())
+                        return;
+                }
+            }
+        }
+    }
+    /**
+     * Push the tip node to stack(s).
+     * @param tip new node (to be pushed)
+     * @param fullPath complete path, which is always extended
+     * @param partialPath partial path, which is only extended if the tip has _appData.
+     */
+    static pushPaths(tip, fullPath, partialPath) {
+        fullPath.push(tip);
+        if (tip._appData !== undefined) {
+            partialPath.push(tip);
+        }
+    }
+    /**
+     * Pop the tip node from stack(s).
+     * @param tip should match the fullPath tip.
+     * @param fullPath complete path, which is always popped
+     * @param partialPath partial path, which is only popped if the tip has _appData.
+     */
+    static popPaths(tip, fullPath, partialPath) {
+        assert(fullPath[fullPath.length - 1] === tip);
+        fullPath.pop();
+        if (tip._appData !== undefined) {
+            partialPath.pop();
+        }
+    }
+    /**
+     * Process nodes from left and right trees of dual search.
+     * * The separate stacks for nodes that have appData is for efficiency.
+     * * If data is entirely in the leaves (or just in a few nodes), the stacks will all be empty (or very small) and no time will be wasted looking up the stacks for appData to process with the other tip.
+     * @param leftTip tip node being explored on left
+     * @param leftStack stack of prior left nodes
+     * @param leftStackWithAppData stack of prior left nodes which have appData.
+     * @param rightTip tip node being explored on right.
+     * @param rightStack stack of prior right nodes.
+     * @param rightStackWithAppData stack of prior right nodes which have appData.
+     * @param handler search handler
+     */
+    static recursivePairSearch(leftTip, leftStack, leftStackWithAppData, rightTip, rightStack, rightStackWithAppData, handler) {
+        // console.log({ leftId: leftTip._id, rightId: rightTip._id });
+        const leftTipHasAppData = leftTip._appData !== undefined;
+        const rightTipHasAppData = rightTip._appData !== undefined;
+        let leftChild;
+        let rightChild;
+        // process immediate appData from each tip node with the entire prior path of the other side (each stack currently lacks the tip).
+        if (leftTipHasAppData && rightStackWithAppData.length > 0) {
+            this.processAppDataAndAppDataStack(leftTip._appData, rightStackWithAppData, false, handler);
+        }
+        if (leftStackWithAppData.length > 0 && rightTipHasAppData) {
+            this.processAppDataAndAppDataStack(rightTip._appData, leftStackWithAppData, true, handler);
+        }
+        if (handler.isRangePairActive(leftTip._range, rightTip._range)) {
+            this.processAppDataAndAppData(leftTip._appData, rightTip._appData, false, handler);
+            if (leftTip._children !== undefined && rightTip._children !== undefined) {
+                this.pushPaths(leftTip, leftStack, leftStackWithAppData);
+                this.pushPaths(rightTip, rightStack, rightStackWithAppData);
+                for (let leftIndex = 0; undefined !== (leftChild = getByIndex(leftIndex, leftTip._children)); leftIndex++) {
+                    for (let rightIndex = 0; undefined !== (rightChild = getByIndex(rightIndex, rightTip._children)); rightIndex++) {
+                        this.recursivePairSearch(leftChild, leftStack, leftStackWithAppData, rightChild, rightStack, rightStackWithAppData, handler);
+                    }
+                }
+                this.popPaths(leftTip, leftStack, leftStackWithAppData);
+                this.popPaths(rightTip, rightStack, rightStackWithAppData);
+            }
+            else if (leftTip._children !== undefined) {
+                this.leftRecursivePairSearch(leftTip, rightTip, rightStackWithAppData, false, handler);
+            }
+            else if (rightTip._children !== undefined) {
+                this.leftRecursivePairSearch(rightTip, leftTip, leftStackWithAppData, true, handler);
+            }
+        }
+    }
+    /**
+     * Recurse below the tip of leftTip, offering each level's appData to the appData of rightTip and rightStackWithAppData.
+     * @param leftTip tip node being explored on left. Its appData is not processed.
+     * @param rightTip tip node being explored on right. It has no children.
+     * @param rightStackWithAppData stack of prior right nodes which have appData.
+     * @param reverseArgs true if the caller is exchanging the sense of left and right
+     * @param handler search handler
+     */
+    static leftRecursivePairSearch(leftTip, rightTip, rightStackWithAppData, reverseArgs, handler) {
+        assert(rightTip._children === undefined);
+        // The (possibly deep) left children appData needs to be offered to the right path (including tip)
+        // Note that there are no stack push/pop operations -- the right stack is already reaching to leaf level, so there are no range or appData nodes to add.
+        let leftChild;
+        for (let leftIndex = 0; undefined !== (leftChild = getByIndex(leftIndex, leftTip._children)); leftIndex++) {
+            if (handler.isRangePairActive(leftChild._range, rightTip._range)) {
+                this.processAppDataAndAppData(leftChild._appData, rightTip._appData, reverseArgs, handler);
+                this.processAppDataAndAppDataStack(leftChild._appData, rightStackWithAppData, reverseArgs, handler);
+                this.leftRecursivePairSearch(leftChild, rightTip, rightStackWithAppData, reverseArgs, handler);
+            }
+        }
+    }
+    /**
+     * Recursive search down two trees, with range tests and child processing under control of a handler.
+     * @param leftRoot root of left tree
+     * @param rightRoot root of right tree
+     * @param handler handler for range tests and child process
+     */
+    static searchTwoTreesTopDown(leftRoot, rightRoot, handler) {
+        this.recursivePairSearch(leftRoot, [], [], rightRoot, [], [], handler);
+    }
+}
+/**
+ * Utilities for various operations on RangeTree
+ * @internal
+ */
+export class RangeTreeOps {
+    /** Count nodes in this tree. */
+    static getRecursiveNodeCount(root) {
+        let count = 0;
+        root.recurseIntoTree((_node) => { count++; return true; });
+        return count;
+    }
+    /** Count appData in this tree. */
+    static getRecursiveAppDataCount(root) {
+        let count = 0;
+        root.recurseIntoTree((node) => { count += node.getNumAppData(); return true; });
+        return count;
+    }
+    /**
+     * Create a leaf referencing appData items indexed index0<=index<index1 and with combined range of the same indices
+     * @param ranges access to ranges
+     * @param appData access to AppDataType items
+     * @param index0 first index for block of items
+     * @param index1 upper limit index for block of items.
+     * @param arrayLength one more than the largest range/appData index
+     * @returns newly created node.
+     */
+    static createLeafInIndexRange(ranges, appData, index0, index1, arrayLength) {
+        const appDataBlock = [];
+        const range = Range3d.createNull();
+        index1 = Math.min(index1, arrayLength);
+        // console.log({ case: "LEAF", index0, index1 });
+        for (let i = index0; i < index1; i++) {
+            appDataBlock.push(evaluateIndexToType(appData, i));
+            range.extendRange(evaluateIndexToType(ranges, i));
+        }
+        return RangeTreeNode.createCapture(range, appDataBlock, undefined);
+    }
+    /**
+     * Split the array entries appData[index0 <= i < index1] into blocks of at most maxChildPerNode * maxAppDataPerLeaf and assemble into a tree structure.
+     * @param ranges access to ranges
+     * @param appData access to AppDataType items
+     * @param index0 start index of the block to access
+     * @param index1 terminal index for the block (one after final)
+     * @param arrayLength one more than the largest range/appData index
+     * @param maxChildPerNode max number of child nodes in each interior node
+     * @param maxAppDataPerLeaf max number of appData items in each leaf.
+     * @returns
+     */
+    static createRecursiveByIndexSplits(ranges, appData, index0, index1, arrayLength, maxChildPerNode, maxAppDataPerLeaf) {
+        if (index1 > arrayLength)
+            index1 = arrayLength;
+        const range = Range3d.createNull();
+        const children = [];
+        const maxChildrenAppData = maxChildPerNode * maxAppDataPerLeaf;
+        // console.log({ name: "createRecursive", index0, index1, maxChildrenAppData });
+        if (index1 <= index0 + maxChildrenAppData) { // index range is small enough to hold the appData in leaf children
+            // console.log({ case: "LEAF GROUP", index0, index1 });
+            for (let indexA = index0 + maxAppDataPerLeaf; index0 < index1; index0 = indexA, indexA = Math.min(indexA + maxAppDataPerLeaf, index1)) {
+                const leaf = RangeTreeOps.createLeafInIndexRange(ranges, appData, index0, indexA, arrayLength);
+                if (leaf !== undefined) {
+                    range.extendRange(leaf.getRangeRef());
+                    children.push(leaf);
+                }
+            }
+        }
+        else { // split the appData among interior and leaf children
+            // console.log({ case: "INTERIOR", index0, index1 });
+            const numPerGulp = Math.ceil((index1 - index0) / maxChildPerNode);
+            for (let indexA = index0 + numPerGulp; index0 < index1; index0 = indexA, indexA = Math.min(indexA + numPerGulp, index1)) {
+                const child = this.createRecursiveByIndexSplits(ranges, appData, index0, indexA, arrayLength, maxChildPerNode, maxAppDataPerLeaf);
+                if (child !== undefined) {
+                    range.extendRange(child.getRangeRef());
+                    children.push(child);
+                }
+            }
+        }
+        return (children.length > 0) ? RangeTreeNode.createCapture(range, undefined, children) : undefined;
+    }
+    /**
+     * Create a range tree by simple left-right split of given ranges.
+     * * Leaves carry the inputs in left-to-right order.
+     * * Each leaf range is labeled by its corresponding object(s) in the appData array.
+     * @param ranges access to ranges.
+     * @param appData access to AppDataType items (for leaves).
+     * @param arrayLength one more than the largest range/appData index
+     * @param maxChildrenPerNode max number of child nodes allowed for each interior node.
+     * @param maxAppDataPerLeaf max number of appData items allowed in each leaf.
+     * @returns the root of the new tree, or undefined if array lengths differ or are zero.
+     */
+    static createByIndexSplits(ranges, appData, arrayLength, maxChildrenPerNode = 2, maxAppDataPerLeaf = 2) {
+        // console.log();
+        // const numData = getFlexDataCount(appData);
+        // console.log({ numData });
+        if (arrayLength <= 0
+            || (Array.isArray(ranges) && ranges.length !== arrayLength)
+            || (Array.isArray(appData) && appData.length !== arrayLength))
+            return undefined;
+        if (maxChildrenPerNode < 2)
+            maxChildrenPerNode = 2;
+        return RangeTreeOps.createRecursiveByIndexSplits(ranges, appData, 0, arrayLength, arrayLength, maxChildrenPerNode, maxAppDataPerLeaf);
+    }
+}
+//# sourceMappingURL=RangeTreeNode.js.map

package/lib/esm/polyface/RangeTree/RangeTreeNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RangeTreeNode.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeNode.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAejD;;;;;GAKG;AACH,SAAS,mBAAmB,CAAI,IAAoB,EAAE,KAAa;IACjE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;AACrB,CAAC;AACD;;;GAGG;AACH,SAAS,UAAU,CAAI,KAAa,EAAE,IAAiB;IACrD,IAAI,IAAI,KAAK,SAAS,EAAE;QACtB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACvB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM;gBACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;SACtB;aAAM;YACL,OAAO,IAAI,CAAC;SACb;KACF;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AACD;;;GAGG;AACH,SAAS,gBAAgB,CAAI,IAAiB;IAC5C,IAAI,IAAI,KAAK,SAAS,EAAE;QACtB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACvB,OAAO,IAAI,CAAC,MAAM,CAAC;SACpB;aAAM;YACL,OAAO,CAAC,CAAC;SACV;KACF;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AACD;;;GAGG;AACH,MAAM,OAAgB,uBAAuB;IAS3C;;;;OAIG;IACH,6CAA6C;IACtC,SAAS,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;CAC9C;AACD;;;GAGG;AACH,MAAM,OAAgB,oBAAoB;IAUxC;;;;OAIG;IACH,6CAA6C;IACtC,SAAS,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;CAC9C;AACD;;;;;GAKG;AACH,MAAM,OAAgB,wCAAsD,SAAQ,oBAAiC;IAOnH;;;;;OAKG;IACa,iBAAiB,CAAC,SAAkB,EAAE,UAAmB;QACvE,MAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAClD,MAAM,qBAAqB,GAAG,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QACpE,IAAI,qBAAqB,IAAI,eAAe,EAAE;YAC5C,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AACD,IAAI,cAAc,GAAG,CAAC,CAAC;AACvB;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,OAAO,aAAa;IAMxB;;;;;;OAMG;IACH,YAAoB,KAAc,EAAE,OAA8B,EAAE,QAA8C;QAChH,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,GAAG,GAAG,cAAc,EAAE,CAAC;QAC5B,iCAAiC;QACjC,qCAAqC;QACrC,0DAA0D;QAC1D,oDAAoD;QACpD,uCAAuC;QACvC,gDAAgD;QAChD,uDAAuD;IACzD,CAAC;IACD,wEAAwE;IACjE,MAAM,CAAC,aAAa,CACzB,KAAc,EACd,OAA8B,EAC9B,QAA8C;QAC9C,OAAO,IAAI,aAAa,CAAc,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAClE,CAAC;IACD,2EAA2E;IACpE,QAAQ,CAAC,IAAa;QAC3B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,sDAAsD;IAC/C,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,2DAA2D;IACpD,WAAW;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;;;;OAMG;IACI,eAAe,CAAC,KAAa;QAClC,OAAO,UAAU,CAA6B,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACvE,CAAC;IACD;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAa;QACpC,OAAO,UAAU,CAAc,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IACD,qDAAqD;IAC9C,cAAc;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,8DAA8D;IACvD,aAAa;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IACD;;;OAGG;IACI,cAAc;QACnB,OAAO,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IACD;;;OAGG;IACI,aAAa;QAClB,OAAO,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IACD;;;OAGG;IACI,eAAe,CAAC,YAA2D;QAChF,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,UAAU,EAAE;YACd,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE;gBACjC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS;oBAChC,KAAK,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;aACvC;iBAAM,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE;gBACvC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;aAC9C;SACF;IACH,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,OAA6C;QAChE,IAAI,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YACtC,IAAI,aAAsC,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC9E,8BAA8B;gBAC9B,OAAO,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;gBACtC,IAAI,OAAO,CAAC,SAAS,EAAE;oBACrB,OAAO;aACV;YACD,IAAI,KAA6C,CAAC;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACpE,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;aAC9B;SACF;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,6BAA6B,CAC1C,WAAkC,EAClC,UAAwC,EACxC,WAAoB,EACpB,OAA0C;QAE1C,IAAI,WAAW,KAAK,SAAS,EAAE;YAC7B,IAAI,QAAiC,CAAC;YACtC,IAAI,SAAkC,CAAC;YACvC,yGAAyG;YACzG,KAAK,IAAI,UAAU,GAAG,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,CAAC,GAAG;gBAC1D,MAAM,YAAY,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC;gBACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAAc,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE;oBACpH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAc,SAAS,EAAE,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE;wBAC/G,IAAI,CAAC,WAAW;4BACd,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;;4BAEhD,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;wBAClD,IAAI,OAAO,CAAC,SAAS,EAAE;4BACrB,OAAO;qBACV;iBACF;aACF;SACF;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,wBAAwB,CACrC,WAAkC,EAClC,YAAmC,EACnC,WAAoB,EACpB,OAA0C;QAE1C,IAAI,WAAW,KAAK,SAAS,IAAI,YAAY,KAAK,SAAS,EAAE;YAC3D,IAAI,QAAiC,CAAC;YACtC,IAAI,SAAkC,CAAC;YACvC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAAc,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE;gBACpH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAc,SAAS,EAAE,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE;oBAC/G,IAAI,CAAC,WAAW;wBACd,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;;wBAEhD,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAClD,IAAI,OAAO,CAAC,SAAS,EAAE;wBACrB,OAAO;iBACV;aACF;SACF;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,SAAS,CACtB,GAA+B,EAC/B,QAAsC,EACtC,WAAyC;QAEzC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE;YAC9B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SACvB;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,QAAQ,CACrB,GAA+B,EAC/B,QAAsC,EACtC,WAAyC;QAEzC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QAC9C,QAAQ,CAAC,GAAG,EAAE,CAAC;QACf,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE;YAC9B,WAAW,CAAC,GAAG,EAAE,CAAC;SACnB;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACK,MAAM,CAAC,mBAAmB,CAChC,OAAmC,EACnC,SAAuC,EACvC,oBAAkD,EAClD,QAAoC,EACpC,UAAwC,EACxC,qBAAmD,EACnD,OAA0C;QAE1C,+DAA+D;QAC/D,MAAM,iBAAiB,GAAG,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC;QACzD,MAAM,kBAAkB,GAAG,QAAQ,CAAC,QAAQ,KAAK,SAAS,CAAC;QAC3D,IAAI,SAAiD,CAAC;QACtD,IAAI,UAAkD,CAAC;QAEvD,kIAAkI;QAClI,IAAI,iBAAiB,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE;YACzD,IAAI,CAAC,6BAA6B,CAAc,OAAO,CAAC,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;SAC1G;QACD,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,IAAI,kBAAkB,EAAE;YACzD,IAAI,CAAC,6BAA6B,CAAc,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;SACzG;QAED,IAAI,OAAO,CAAC,iBAAiB,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE;YAC9D,IAAI,CAAC,wBAAwB,CAAc,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAEhG,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE;gBACvE,IAAI,CAAC,SAAS,CAAc,OAAO,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;gBACtE,IAAI,CAAC,SAAS,CAAc,QAAQ,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;gBACzE,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAA6B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE;oBACrI,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,UAAU,GAAG,UAAU,CAA6B,UAAU,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE;wBAC1I,IAAI,CAAC,mBAAmB,CACtB,SAAS,EAAE,SAAS,EAAE,oBAAoB,EAC1C,UAAU,EAAE,UAAU,EAAE,qBAAqB,EAC7C,OAAO,CAAC,CAAC;qBACZ;iBACF;gBACD,IAAI,CAAC,QAAQ,CAAc,OAAO,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;gBACrE,IAAI,CAAC,QAAQ,CAAc,QAAQ,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;aACzE;iBAAM,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE;gBAC1C,IAAI,CAAC,uBAAuB,CAAc,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;aACrG;iBAAM,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE;gBAC3C,IAAI,CAAC,uBAAuB,CAAc,QAAQ,EAAE,OAAO,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;aACnG;SACF;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,uBAAuB,CACpC,OAAmC,EACnC,QAAoC,EACpC,qBAAmD,EACnD,WAAoB,EACpB,OAA0C;QAE1C,MAAM,CAAC,QAAQ,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;QACzC,kGAAkG;QAClG,wJAAwJ;QACxJ,IAAI,SAAiD,CAAC;QACtD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAA6B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE;YACrI,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE;gBAChE,IAAI,CAAC,wBAAwB,CAAc,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;gBACxG,IAAI,CAAC,6BAA6B,CAAc,SAAS,CAAC,QAAQ,EAAE,qBAAqB,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;gBACjH,IAAI,CAAC,uBAAuB,CAAc,SAAS,EAAE,QAAQ,EAAE,qBAAqB,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;aAC7G;SACF;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,qBAAqB,CACjC,QAAoC,EACpC,SAAqC,EACrC,OAA0C;QAE1C,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IACzE,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,YAAY;IACvB,gCAAgC;IACzB,MAAM,CAAC,qBAAqB,CAAc,IAAgC;QAC/E,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,CAAC,CAAC,KAAiC,EAAW,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kCAAkC;IAC3B,MAAM,CAAC,wBAAwB,CAAc,IAAgC;QAClF,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,CAClB,CAAC,IAAgC,EAAW,EAAE,GAAG,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAClG,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;OAQG;IACK,MAAM,CAAC,sBAAsB,CACnC,MAA4B,EAC5B,OAAiC,EACjC,MAAc,EACd,MAAc,EACd,WAAmB;QACnB,MAAM,YAAY,GAAkB,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACvC,iDAAiD;QACjD,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,YAAY,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,KAAK,CAAC,WAAW,CAAC,mBAAmB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;SACnD;QACD,OAAO,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IACrE,CAAC;IACD;;;;;;;;;;OAUG;IACK,MAAM,CAAC,4BAA4B,CACzC,MAA4B,EAC5B,OAAiC,EACjC,MAAc,EACd,MAAc,EACd,WAAmB,EACnB,eAAuB,EACvB,iBAAyB;QAEzB,IAAI,MAAM,GAAG,WAAW;YACtB,MAAM,GAAG,WAAW,CAAC;QAEvB,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAClD,MAAM,kBAAkB,GAAG,eAAe,GAAG,iBAAiB,CAAC;QAC/D,gFAAgF;QAEhF,IAAI,MAAM,IAAI,MAAM,GAAG,kBAAkB,EAAE,EAAG,mEAAmE;YAC/G,uDAAuD;YACvD,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,iBAAiB,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,iBAAiB,EAAE,MAAM,CAAC,EAAE;gBACrI,MAAM,IAAI,GAAG,YAAY,CAAC,sBAAsB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC/F,IAAI,IAAI,KAAK,SAAS,EAAE;oBACtB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;oBACtC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBACrB;aACF;SACF;aAAM,EAAG,qDAAqD;YAC7D,qDAAqD;YACrD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC;YAClE,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,CAAC,EAAE;gBACvH,MAAM,KAAK,GAAG,IAAI,CAAC,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,iBAAiB,CAAC,CAAC;gBAClI,IAAI,KAAK,KAAK,SAAS,EAAE;oBACvB,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;oBACvC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACtB;aACF;SACF;QACD,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAA4B,EAC5B,OAAiC,EACjC,WAAmB,EACnB,qBAA6B,CAAC,EAC9B,oBAA4B,CAAC;QAE7B,iBAAiB;QACjB,6CAA6C;QAC7C,4BAA4B;QAC5B,IAAI,WAAW,IAAI,CAAC;eACf,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC;eACxD,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,CAAC;YAC7D,OAAO,SAAS,CAAC;QACnB,IAAI,kBAAkB,GAAG,CAAC;YACxB,kBAAkB,GAAG,CAAC,CAAC;QACzB,OAAO,YAAY,CAAC,4BAA4B,CAAc,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE,kBAAkB,EAAE,iBAAiB,CAAC,CAAC;IACrJ,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module RangeSearch\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Range3d } from \"../../geometry3d/Range\";\n\n/** Type name FlexData is shorthand for a member or parameter which can be:\n * * undefined\n * * an array of values of type T\n * * a singleton of type T\n */\ntype FlexData<T> = undefined | T[] | T;\n/**\n * Type name IndexToType is shorthand for a member or parameter which can be:\n * * an array of values of type T\n * * a function from integers to type T.\n */\ntype IndexToType<T> = T[] | ((index: number) => T);\n\n/**\n * Map an (unchecked) integer to a parameterized type T, where the data argument can be either:\n * * an array of type T\n * * a function which takes an index and returns type T\n * @internal\n */\nfunction evaluateIndexToType<T>(data: IndexToType<T>, index: number): T {\n  if (Array.isArray(data))\n    return data[index];\n  return data(index);\n}\n/**\n * Get data by index from a source that may be undefined, an array of item of type T, or a singleton of the item type.\n * @internal\n */\nfunction getByIndex<T>(index: number, data: FlexData<T>): T | undefined {\n  if (data !== undefined) {\n    if (Array.isArray(data)) {\n      if (index < data.length)\n        return data[index];\n    } else {\n      return data;\n    }\n  }\n  return undefined;\n}\n/**\n * Return the number of items in an object that can be undefined, an array of item of type T, or a singleton of the item type.\n * @internal\n */\nfunction getFlexDataCount<T>(data: FlexData<T>): number {\n  if (data !== undefined) {\n    if (Array.isArray(data)) {\n      return data.length;\n    } else {\n      return 1;\n    }\n  }\n  return 0;\n}\n/**\n * Abstract class for handler objects called during traversal of a single range tree.\n * @internal\n */\nexport abstract class SingleTreeSearchHandler<AppDataType> {\n  /** Return true if appData within the range should be offered to `processAppData`. */\n  public abstract isRangeActive(range: Range3d): boolean;\n  /**\n   * Called for a (single) child referenced by a tree.\n   * * This is only called when range checks on the path from root have been passed.\n   * @param item child (of type AppDataType) in the tree.\n   */\n  public abstract processAppData(item: AppDataType): void;\n  /**\n   * Query to see if the active search has been aborted.\n   * * Default implementation returns false so query runs to completion.\n   * * Search processes check this after range tests and child processing.\n   */\n  // eslint-disable-next-line @itwin/prefer-get\n  public isAborted(): boolean { return false; }\n}\n/**\n * Abstract class for handler objects called during traversal of two range trees.\n * @internal\n */\nexport abstract class TwoTreeSearchHandler<AppDataType> {\n  /** Return true if appData within the ranges should be offered to `processAppDataPair`. */\n  public abstract isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean;\n  /**\n   * Called with AppDataType items from left tree and right tree.\n   * * This is only called when range tests have been passed.\n   * @param leftItem\n   * @param rightItem\n   */\n  public abstract processAppDataPair(leftItem: AppDataType, rightItem: AppDataType): void;\n  /**\n   * Query to see if the active search has been aborted.\n   * * Default implementation returns false so query runs to completion.\n   * * Search processes check this after range tests and child processing.\n   */\n  // eslint-disable-next-line @itwin/prefer-get\n  public isAborted(): boolean { return false; }\n}\n/**\n * This class refines the TwoTreeSearchHandler with an implementation of `isRangePairActive` appropriate for computing the minimum distance between trees.\n * * The concrete class must implement `getCurrentDistance()` method to provide the best-so-far distance.\n * * The implementation of `isRangePairActive` returns true if the distance between ranges is less than or equal to the `getCurrentDistance()` value.\n * @internal\n */\nexport abstract class TwoTreeDistanceMinimizationSearchHandler<AppDataType> extends TwoTreeSearchHandler<AppDataType>{\n  /**\n   * Provides the allowable distance between ranges.\n   * * Range pairs with more than this distance separation are rejected.\n   * * The implementation may alter (probably reduce) the getCurrentDistance() value as the search progresses.\n   */\n  public abstract getCurrentDistance(): number;\n  /**\n   * Method called to decide whether to process subtrees and immediate child appData items from a left tree node and right tree node.\n   * @param leftRange range from a node in the left tree\n   * @param rightRange range from a node in the right tree.\n   * @returns true if the smallest distance from leftRange to rightRange is less than or equal to getCurrentDistance()\n   */\n  public override isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean {\n    const currentDistance = this.getCurrentDistance();\n    const distanceBetweenRanges = leftRange.distanceToRange(rightRange);\n    if (distanceBetweenRanges <= currentDistance) {\n      return true;\n    }\n    return false;\n  }\n}\nlet numNodeCreated = 0;\n/**\n * * TREE STRUCTURE\n *   * A RangeTreeNode is part of a range tree.\n *   * TREE is used here in a strictly _structural_ sense, which has no broad promises about data members.\n *   * Each RangeNode points to 0, 1 or many children.\n *   * Each child has (but does not point back to) a single parent.\n *   * The overall tree has a single root.\n *   * Each node is effectively the root of the tree of its children.\n * * NON-TREE DATA MEMBERS\n *   * Data members in each node (in addition to children) are\n *     * _range = the union of ranges below in the heap\n *     * _appData = application data associated with the node.\n *       * Construction methods may place multiple _appData items in each node.\n * * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.\n * * CONSTRUCTION\n *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.\n *     * The appData is placed entirely in the leaves.\n *     * caller can specify:\n *       * the number of _appData items per leaf\n *       * the number of children per node within the tree.\n *     * \"deep\" trees (2 children per node and one appData per leaf) may have (compared to shallow trees with many children per node and many appData per leaf)\n *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.\n *       * larger memory use because of more nodes\n *   * For future construction methods:\n *      * _appData \"above the leaves\" may allow nodes below to have smaller ranges, but add complexity to search.\n * @internal\n */\nexport class RangeTreeNode<AppDataType> {\n  private _range: Range3d;\n  private _appData: FlexData<AppDataType>;\n  private _children: FlexData<RangeTreeNode<AppDataType>>;\n  /** an id assigned sequentially as nodes are created.  For debugging use only. */\n  private _id: number;\n  /**\n   * CONSTRUCTOR\n   * CAPTURE (not copy)\n   * * range = range for search algorithms\n   * * appData = application data relevant to this node.\n   * * children = child node reference(s).\n   */\n  private constructor(range: Range3d, appData: FlexData<AppDataType>, children: FlexData<RangeTreeNode<AppDataType>>) {\n    this._range = range;\n    this._appData = appData;\n    this._children = children;\n    this._id = numNodeCreated++;\n    // const childIds: number[] = [];\n    // if (Array.isArray(this._children))\n    //   for (const c of this._children) childIds.push(c._id);\n    // else if (this._children instanceof RangeTreeNode)\n    //   childIds.push(this._children._id);\n    // const numAppData = getFlexDataCount(appData);\n    // console.log({ id: this._id, childIds, numAppData });\n  }\n  /** Simplest public create: capture the range, appData, and children. */\n  public static createCapture<AppDataType>(\n    range: Range3d,\n    appData: FlexData<AppDataType>,\n    children: FlexData<RangeTreeNode<AppDataType>>): RangeTreeNode<AppDataType> {\n    return new RangeTreeNode<AppDataType>(range, appData, children);\n  }\n  /** copy (not capture) from given data into the range in this RangeEntry */\n  public setRange(data: Range3d) {\n    this._range.setFrom(data);\n  }\n  /** return (a copy of) the range in this RangeEntry */\n  public getRange(data?: Range3d): Range3d {\n    return this._range.clone(data);\n  }\n  /** return (a reference to) the range in this RangeEntry */\n  public getRangeRef(): Range3d {\n    return this._range;\n  }\n  /**\n   * Access a child by index.\n   * * If the child data is an array, this dereferences the array.\n   * * If the child data is a singleton, treat it as index 0.\n   * * return undefined if there are no children.\n   * @param index index of item to access.\n   */\n  public getChildByIndex(index: number): RangeTreeNode<AppDataType> | undefined {\n    return getByIndex<RangeTreeNode<AppDataType>>(index, this._children);\n  }\n  /**\n   * * Access an appData by index.\n   * * If the appData data is an array, this dereferences the array.\n   * * If the appData data is a singleton, treat it as if it is at index 0 in an array\n   * * return undefined if there are no appData or for any index out of range.\n   * @param index index of item to access.\n   */\n  public getAppDataByIndex(index: number): AppDataType | undefined {\n    return getByIndex<AppDataType>(index, this._appData);\n  }\n  /** Access the children or child (does not clone). */\n  public getAllChildren(): FlexData<RangeTreeNode<AppDataType>> {\n    return this._children;\n  }\n  /** Access the appData array or singleton (does not clone). */\n  public getAllAppData(): FlexData<AppDataType> {\n    return this._appData;\n  }\n  /**\n   * Count the direct children in this node of the tree.\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveNodeCount`.\n   */\n  public getNumChildren(): number {\n    return getFlexDataCount(this._children);\n  }\n  /**\n   * Count the appData items in this node of the tree.\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveAppDataCount`.\n   */\n  public getNumAppData(): number {\n    return getFlexDataCount(this._appData);\n  }\n  /**\n   * Depth-first tree iteration, calling `announceNode` on each node.\n   * @param announceNode callback that returns true to recurse into children\n   */\n  public recurseIntoTree(announceNode: (node: RangeTreeNode<AppDataType>) => boolean) {\n    const doChildren = announceNode(this);\n    if (doChildren) {\n      if (Array.isArray(this._children)) {\n        for (const child of this._children)\n          child.recurseIntoTree(announceNode);\n      } else if (this._children !== undefined) {\n        this._children.recurseIntoTree(announceNode);\n      }\n    }\n  }\n  /**\n   * Depth-first tree iteration via handler.\n   * * if handler decides the instance range is active, process appData, then recurse on children\n   * * if handler decides to abort after processing an appData, skip processing rest of appData and children\n   */\n  public searchTopDown(handler: SingleTreeSearchHandler<AppDataType>) {\n    if (handler.isRangeActive(this._range)) {\n      let itemToProcess: AppDataType | undefined;\n      for (let i = 0; undefined !== (itemToProcess = this.getAppDataByIndex(i)); i++) {\n        // console.log(itemToProcess);\n        handler.processAppData(itemToProcess);\n        if (handler.isAborted())\n          return;\n      }\n      let child: RangeTreeNode<AppDataType> | undefined;\n      for (let i = 0; undefined !== (child = this.getChildByIndex(i)); i++) {\n        child.searchTopDown(handler);\n      }\n    }\n  }\n\n  /**\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightStack.\n   * @param leftAppData singleton or array with data \"from left\"\n   * @param rightStack stack of nodes to process from right path.\n   * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.\n   * @param handler search handler\n   */\n  private static processAppDataAndAppDataStack<AppDataType>(\n    leftAppData: FlexData<AppDataType>,\n    rightStack: RangeTreeNode<AppDataType>[],\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    if (leftAppData !== undefined) {\n      let leftItem: AppDataType | undefined;\n      let rightItem: AppDataType | undefined;\n      // hmm.. we ASSUME that if the tip ranges passed, then all parent ranges would pass without further test.\n      for (let rangeIndex = rightStack.length; rangeIndex-- > 0;) {\n        const rightAppData = rightStack[rangeIndex]._appData;\n        for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\n          for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\n            if (!reverseArgs)\n              handler.processAppDataPair(leftItem, rightItem);\n            else\n              handler.processAppDataPair(rightItem, leftItem);\n            if (handler.isAborted())\n              return;\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightAppData.\n   * @param leftAppData singleton or array with data \"from left\"\n   * @param rightAppData singleton or array with data \"from right\"\n   * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.\n   * @param handler search handler\n   */\n  private static processAppDataAndAppData<AppDataType>(\n    leftAppData: FlexData<AppDataType>,\n    rightAppData: FlexData<AppDataType>,\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    if (leftAppData !== undefined && rightAppData !== undefined) {\n      let leftItem: AppDataType | undefined;\n      let rightItem: AppDataType | undefined;\n      for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\n        for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\n          if (!reverseArgs)\n            handler.processAppDataPair(leftItem, rightItem);\n          else\n            handler.processAppDataPair(rightItem, leftItem);\n          if (handler.isAborted())\n            return;\n        }\n      }\n    }\n  }\n  /**\n   * Push the tip node to stack(s).\n   * @param tip new node (to be pushed)\n   * @param fullPath complete path, which is always extended\n   * @param partialPath partial path, which is only extended if the tip has _appData.\n   */\n  private static pushPaths<AppDataType>(\n    tip: RangeTreeNode<AppDataType>,\n    fullPath: RangeTreeNode<AppDataType>[],\n    partialPath: RangeTreeNode<AppDataType>[],\n  ) {\n    fullPath.push(tip);\n    if (tip._appData !== undefined) {\n      partialPath.push(tip);\n    }\n  }\n  /**\n   * Pop the tip node from stack(s).\n   * @param tip should match the fullPath tip.\n   * @param fullPath complete path, which is always popped\n   * @param partialPath partial path, which is only popped if the tip has _appData.\n   */\n  private static popPaths<AppDataType>(\n    tip: RangeTreeNode<AppDataType>,\n    fullPath: RangeTreeNode<AppDataType>[],\n    partialPath: RangeTreeNode<AppDataType>[],\n  ) {\n    assert(fullPath[fullPath.length - 1] === tip);\n    fullPath.pop();\n    if (tip._appData !== undefined) {\n      partialPath.pop();\n    }\n  }\n  /**\n   * Process nodes from left and right trees of dual search.\n   * * The separate stacks for nodes that have appData is for efficiency.\n   * * If data is entirely in the leaves (or just in a few nodes), the stacks will all be empty (or very small) and no time will be wasted looking up the stacks for appData to process with the other tip.\n   * @param leftTip tip node being explored on left\n   * @param leftStack stack of prior left nodes\n   * @param leftStackWithAppData stack of prior left nodes which have appData.\n   * @param rightTip tip node being explored on right.\n   * @param rightStack stack of prior right nodes.\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\n   * @param handler search handler\n   */\n  private static recursivePairSearch<AppDataType>(\n    leftTip: RangeTreeNode<AppDataType>,\n    leftStack: RangeTreeNode<AppDataType>[],\n    leftStackWithAppData: RangeTreeNode<AppDataType>[],\n    rightTip: RangeTreeNode<AppDataType>,\n    rightStack: RangeTreeNode<AppDataType>[],\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    // console.log({ leftId: leftTip._id, rightId: rightTip._id });\n    const leftTipHasAppData = leftTip._appData !== undefined;\n    const rightTipHasAppData = rightTip._appData !== undefined;\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\n    let rightChild: RangeTreeNode<AppDataType> | undefined;\n\n    // process immediate appData from each tip node with the entire prior path of the other side (each stack currently lacks the tip).\n    if (leftTipHasAppData && rightStackWithAppData.length > 0) {\n      this.processAppDataAndAppDataStack<AppDataType>(leftTip._appData, rightStackWithAppData, false, handler);\n    }\n    if (leftStackWithAppData.length > 0 && rightTipHasAppData) {\n      this.processAppDataAndAppDataStack<AppDataType>(rightTip._appData, leftStackWithAppData, true, handler);\n    }\n\n    if (handler.isRangePairActive(leftTip._range, rightTip._range)) {\n      this.processAppDataAndAppData<AppDataType>(leftTip._appData, rightTip._appData, false, handler);\n\n      if (leftTip._children !== undefined && rightTip._children !== undefined) {\n        this.pushPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\n        this.pushPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\n        for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\n          for (let rightIndex = 0; undefined !== (rightChild = getByIndex<RangeTreeNode<AppDataType>>(rightIndex, rightTip._children)); rightIndex++) {\n            this.recursivePairSearch(\n              leftChild, leftStack, leftStackWithAppData,\n              rightChild, rightStack, rightStackWithAppData,\n              handler);\n          }\n        }\n        this.popPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\n        this.popPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\n      } else if (leftTip._children !== undefined) {\n        this.leftRecursivePairSearch<AppDataType>(leftTip, rightTip, rightStackWithAppData, false, handler);\n      } else if (rightTip._children !== undefined) {\n        this.leftRecursivePairSearch<AppDataType>(rightTip, leftTip, leftStackWithAppData, true, handler);\n      }\n    }\n  }\n  /**\n   * Recurse below the tip of leftTip, offering each level's appData to the appData of rightTip and rightStackWithAppData.\n   * @param leftTip tip node being explored on left. Its appData is not processed.\n   * @param rightTip tip node being explored on right. It has no children.\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\n   * @param reverseArgs true if the caller is exchanging the sense of left and right\n   * @param handler search handler\n   */\n  private static leftRecursivePairSearch<AppDataType>(\n    leftTip: RangeTreeNode<AppDataType>,\n    rightTip: RangeTreeNode<AppDataType>,\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    assert(rightTip._children === undefined);\n    // The (possibly deep) left children appData needs to be offered to the right path (including tip)\n    // Note that there are no stack push/pop operations -- the right stack is already reaching to leaf level, so there are no range or appData nodes to add.\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\n    for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\n      if (handler.isRangePairActive(leftChild._range, rightTip._range)) {\n        this.processAppDataAndAppData<AppDataType>(leftChild._appData, rightTip._appData, reverseArgs, handler);\n        this.processAppDataAndAppDataStack<AppDataType>(leftChild._appData, rightStackWithAppData, reverseArgs, handler);\n        this.leftRecursivePairSearch<AppDataType>(leftChild, rightTip, rightStackWithAppData, reverseArgs, handler);\n      }\n    }\n  }\n  /**\n   * Recursive search down two trees, with range tests and child processing under control of a handler.\n   * @param leftRoot root of left tree\n   * @param rightRoot root of right tree\n   * @param handler handler for range tests and child process\n   */\n  public static searchTwoTreesTopDown<AppDataType>(\n    leftRoot: RangeTreeNode<AppDataType>,\n    rightRoot: RangeTreeNode<AppDataType>,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    this.recursivePairSearch(leftRoot, [], [], rightRoot, [], [], handler);\n  }\n}\n/**\n * Utilities for various operations on RangeTree\n * @internal\n */\nexport class RangeTreeOps {\n  /** Count nodes in this tree. */\n  public static getRecursiveNodeCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\n    let count = 0;\n    root.recurseIntoTree((_node: RangeTreeNode<AppDataType>): boolean => { count++; return true; });\n    return count;\n  }\n  /** Count appData in this tree. */\n  public static getRecursiveAppDataCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\n    let count = 0;\n    root.recurseIntoTree(\n      (node: RangeTreeNode<AppDataType>): boolean => { count += node.getNumAppData(); return true; });\n    return count;\n  }\n  /**\n   * Create a leaf referencing appData items indexed index0<=index<index1 and with combined range of the same indices\n   * @param ranges access to ranges\n   * @param appData access to AppDataType items\n   * @param index0 first index for block of items\n   * @param index1 upper limit index for block of items.\n   * @param arrayLength one more than the largest range/appData index\n   * @returns newly created node.\n   */\n  private static createLeafInIndexRange<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    index0: number,\n    index1: number,\n    arrayLength: number): RangeTreeNode<AppDataType> {\n    const appDataBlock: AppDataType[] = [];\n    const range = Range3d.createNull();\n    index1 = Math.min(index1, arrayLength);\n    // console.log({ case: \"LEAF\", index0, index1 });\n    for (let i = index0; i < index1; i++) {\n      appDataBlock.push(evaluateIndexToType(appData, i));\n      range.extendRange(evaluateIndexToType(ranges, i));\n    }\n    return RangeTreeNode.createCapture(range, appDataBlock, undefined);\n  }\n  /**\n   * Split the array entries appData[index0 <= i < index1] into blocks of at most maxChildPerNode * maxAppDataPerLeaf and assemble into a tree structure.\n   * @param ranges access to ranges\n   * @param appData access to AppDataType items\n   * @param index0 start index of the block to access\n   * @param index1 terminal index for the block (one after final)\n   * @param arrayLength one more than the largest range/appData index\n   * @param maxChildPerNode max number of child nodes in each interior node\n   * @param maxAppDataPerLeaf max number of appData items in each leaf.\n   * @returns\n   */\n  private static createRecursiveByIndexSplits<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    index0: number,\n    index1: number,\n    arrayLength: number,\n    maxChildPerNode: number,\n    maxAppDataPerLeaf: number,\n  ): RangeTreeNode<AppDataType> | undefined {\n    if (index1 > arrayLength)\n      index1 = arrayLength;\n\n    const range = Range3d.createNull();\n    const children: RangeTreeNode<AppDataType>[] = [];\n    const maxChildrenAppData = maxChildPerNode * maxAppDataPerLeaf;\n    // console.log({ name: \"createRecursive\", index0, index1, maxChildrenAppData });\n\n    if (index1 <= index0 + maxChildrenAppData) {  // index range is small enough to hold the appData in leaf children\n      // console.log({ case: \"LEAF GROUP\", index0, index1 });\n      for (let indexA = index0 + maxAppDataPerLeaf; index0 < index1; index0 = indexA, indexA = Math.min(indexA + maxAppDataPerLeaf, index1)) {\n        const leaf = RangeTreeOps.createLeafInIndexRange(ranges, appData, index0, indexA, arrayLength);\n        if (leaf !== undefined) {\n          range.extendRange(leaf.getRangeRef());\n          children.push(leaf);\n        }\n      }\n    } else {  // split the appData among interior and leaf children\n      // console.log({ case: \"INTERIOR\", index0, index1 });\n      const numPerGulp = Math.ceil((index1 - index0) / maxChildPerNode);\n      for (let indexA = index0 + numPerGulp; index0 < index1; index0 = indexA, indexA = Math.min(indexA + numPerGulp, index1)) {\n        const child = this.createRecursiveByIndexSplits(ranges, appData, index0, indexA, arrayLength, maxChildPerNode, maxAppDataPerLeaf);\n        if (child !== undefined) {\n          range.extendRange(child.getRangeRef());\n          children.push(child);\n        }\n      }\n    }\n    return (children.length > 0) ? RangeTreeNode.createCapture(range, undefined, children) : undefined;\n  }\n  /**\n   * Create a range tree by simple left-right split of given ranges.\n   * * Leaves carry the inputs in left-to-right order.\n   * * Each leaf range is labeled by its corresponding object(s) in the appData array.\n   * @param ranges access to ranges.\n   * @param appData access to AppDataType items (for leaves).\n   * @param arrayLength one more than the largest range/appData index\n   * @param maxChildrenPerNode max number of child nodes allowed for each interior node.\n   * @param maxAppDataPerLeaf max number of appData items allowed in each leaf.\n   * @returns the root of the new tree, or undefined if array lengths differ or are zero.\n   */\n  public static createByIndexSplits<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    arrayLength: number,\n    maxChildrenPerNode: number = 2,\n    maxAppDataPerLeaf: number = 2,\n  ): RangeTreeNode<AppDataType> | undefined {\n    // console.log();\n    // const numData = getFlexDataCount(appData);\n    // console.log({ numData });\n    if (arrayLength <= 0\n      || (Array.isArray(ranges) && ranges.length !== arrayLength)\n      || (Array.isArray(appData) && appData.length !== arrayLength))\n      return undefined;\n    if (maxChildrenPerNode < 2)\n      maxChildrenPerNode = 2;\n    return RangeTreeOps.createRecursiveByIndexSplits<AppDataType>(ranges, appData, 0, arrayLength, arrayLength, maxChildrenPerNode, maxAppDataPerLeaf);\n  }\n}\n\n"]}