@aztec/merkle-tree 0.7.2 → 0.7.3

package/dest/standard_indexed_tree/standard_indexed_tree.js

@@ -0,0 +1,488 @@
+import { toBigIntBE, toBufferBE } from '@aztec/foundation/bigint-buffer';
+import { createDebugLogger } from '@aztec/foundation/log';
+import { SiblingPath } from '@aztec/types';
+import { TreeBase } from '../tree_base.js';
+const log = createDebugLogger('aztec:standard-indexed-tree');
+const indexToKeyLeaf = (name, index) => {
+    return `${name}:leaf:${index}`;
+};
+const zeroLeaf = {
+    value: 0n,
+    nextValue: 0n,
+    nextIndex: 0n,
+};
+/**
+ * Pre-compute empty witness.
+ * @param treeHeight - Height of tree for sibling path.
+ * @returns An empty witness.
+ */
+function getEmptyLowLeafWitness(treeHeight) {
+    return {
+        leafData: zeroLeaf,
+        index: 0n,
+        siblingPath: new SiblingPath(treeHeight, Array(treeHeight).fill(toBufferBE(0n, 32))),
+    };
+}
+// eslint-disable-next-line @typescript-eslint/no-unused-vars
+const encodeTreeValue = (leafData) => {
+    const valueAsBuffer = toBufferBE(leafData.value, 32);
+    const indexAsBuffer = toBufferBE(leafData.nextIndex, 32);
+    const nextValueAsBuffer = toBufferBE(leafData.nextValue, 32);
+    return Buffer.concat([valueAsBuffer, indexAsBuffer, nextValueAsBuffer]);
+};
+const decodeTreeValue = (buf) => {
+    const value = toBigIntBE(buf.subarray(0, 32));
+    const nextIndex = toBigIntBE(buf.subarray(32, 64));
+    const nextValue = toBigIntBE(buf.subarray(64, 96));
+    return {
+        value,
+        nextIndex,
+        nextValue,
+    };
+};
+/**
+ * Indexed merkle tree.
+ */
+export class StandardIndexedTree extends TreeBase {
+    constructor() {
+        super(...arguments);
+        this.leaves = [];
+        this.cachedLeaves = {};
+    }
+    /**
+     * Appends the given leaves to the tree.
+     * @param _leaves - The leaves to append.
+     * @returns Empty promise.
+     * @remarks Use batchInsert method instead.
+     */
+    appendLeaves(_leaves) {
+        throw new Error('Not implemented');
+    }
+    /**
+     * Commits the changes to the database.
+     * @returns Empty promise.
+     */
+    async commit() {
+        await super.commit();
+        await this.commitLeaves();
+    }
+    /**
+     * Rolls back the not-yet-committed changes.
+     * @returns Empty promise.
+     */
+    async rollback() {
+        await super.rollback();
+        this.clearCachedLeaves();
+    }
+    /**
+     * Gets the value of the leaf at the given index.
+     * @param index - Index of the leaf of which to obtain the value.
+     * @param includeUncommitted - Indicates whether to include uncommitted leaves in the computation.
+     * @returns The value of the leaf at the given index or undefined if the leaf is empty.
+     */
+    getLeafValue(index, includeUncommitted) {
+        const leaf = this.getLatestLeafDataCopy(Number(index), includeUncommitted);
+        if (!leaf)
+            return Promise.resolve(undefined);
+        return Promise.resolve(toBufferBE(leaf.value, 32));
+    }
+    /**
+     * Finds the index of the largest leaf whose value is less than or equal to the provided value.
+     * @param newValue - The new value to be inserted into the tree.
+     * @param includeUncommitted - If true, the uncommitted changes are included in the search.
+     * @returns The found leaf index and a flag indicating if the corresponding leaf's value is equal to `newValue`.
+     */
+    findIndexOfPreviousValue(newValue, includeUncommitted) {
+        const numLeaves = this.getNumLeaves(includeUncommitted);
+        const diff = [];
+        for (let i = 0; i < numLeaves; i++) {
+            const storedLeaf = this.getLatestLeafDataCopy(i, includeUncommitted);
+            // The stored leaf can be undefined if it addresses an empty leaf
+            // If the leaf is empty we do the same as if the leaf was larger
+            if (storedLeaf === undefined) {
+                diff.push(newValue);
+            }
+            else if (storedLeaf.value > newValue) {
+                diff.push(newValue);
+            }
+            else if (storedLeaf.value === newValue) {
+                return { index: i, alreadyPresent: true };
+            }
+            else {
+                diff.push(newValue - storedLeaf.value);
+            }
+        }
+        const minIndex = this.findMinIndex(diff);
+        return { index: minIndex, alreadyPresent: false };
+    }
+    /**
+     * Gets the latest LeafData copy.
+     * @param index - Index of the leaf of which to obtain the LeafData copy.
+     * @param includeUncommitted - If true, the uncommitted changes are included in the search.
+     * @returns A copy of the leaf data at the given index or undefined if the leaf was not found.
+     */
+    getLatestLeafDataCopy(index, includeUncommitted) {
+        const leaf = !includeUncommitted ? this.leaves[index] : this.cachedLeaves[index] ?? this.leaves[index];
+        return leaf
+            ? {
+                value: leaf.value,
+                nextIndex: leaf.nextIndex,
+                nextValue: leaf.nextValue,
+            }
+            : undefined;
+    }
+    /**
+     * Finds the index of the minimum value in an array.
+     * @param values - The collection of values to be searched.
+     * @returns The index of the minimum value in the array.
+     */
+    findMinIndex(values) {
+        if (!values.length) {
+            return 0;
+        }
+        let minIndex = 0;
+        for (let i = 1; i < values.length; i++) {
+            if (values[minIndex] > values[i]) {
+                minIndex = i;
+            }
+        }
+        return minIndex;
+    }
+    /**
+     * Initializes the tree.
+     * @param prefilledSize - A number of leaves that are prefilled with values.
+     * @returns Empty promise.
+     *
+     * @remarks Explanation of pre-filling:
+     *    There needs to be an initial (0,0,0) leaf in the tree, so that when we insert the first 'proper' leaf, we can
+     *    prove that any value greater than 0 doesn't exist in the tree yet. We prefill/pad the tree with "the number of
+     *    leaves that are added by one block" so that the first 'proper' block can insert a full subtree.
+     *
+     *    Without this padding, there would be a leaf (0,0,0) at leaf index 0, making it really difficult to insert e.g.
+     *    1024 leaves for the first block, because there's only neat space for 1023 leaves after 0. By padding with 1023
+     *    more leaves, we can then insert the first block of 1024 leaves into indices 1024:2047.
+     */
+    async init(prefilledSize) {
+        if (prefilledSize < 1) {
+            throw new Error(`Prefilled size must be at least 1!`);
+        }
+        const leaves = [];
+        for (let i = 0n; i < prefilledSize; i++) {
+            const newLeaf = {
+                value: toBigIntBE(Buffer.from([Number(i)])),
+                nextIndex: i + 1n,
+                nextValue: i + 1n,
+            };
+            leaves.push(newLeaf);
+        }
+        // Make the first leaf have 0 value
+        leaves[0].value = 0n;
+        // Make the last leaf point to the first leaf
+        leaves[prefilledSize - 1].nextIndex = 0n;
+        leaves[prefilledSize - 1].nextValue = 0n;
+        await this.encodeAndAppendLeaves(leaves, true);
+        await this.commit();
+    }
+    /**
+     * Loads Merkle tree data from a database and assigns them to this object.
+     */
+    async initFromDb() {
+        const startingIndex = 0n;
+        const values = [];
+        const promise = new Promise((resolve, reject) => {
+            this.db
+                .createReadStream({
+                gte: indexToKeyLeaf(this.getName(), startingIndex),
+                lte: indexToKeyLeaf(this.getName(), 2n ** BigInt(this.getDepth())),
+            })
+                .on('data', function (data) {
+                const index = Number(data.key);
+                values[index] = decodeTreeValue(data.value);
+            })
+                .on('close', function () { })
+                .on('end', function () {
+                resolve();
+            })
+                .on('error', function () {
+                log.error('stream error');
+                reject();
+            });
+        });
+        await promise;
+        this.leaves = values;
+    }
+    /**
+     * Commits all the leaves to the database and removes them from a cache.
+     */
+    async commitLeaves() {
+        const batch = this.db.batch();
+        const keys = Object.getOwnPropertyNames(this.cachedLeaves);
+        for (const key of keys) {
+            const index = Number(key);
+            batch.put(key, this.cachedLeaves[index]);
+            this.leaves[index] = this.cachedLeaves[index];
+        }
+        await batch.write();
+        this.clearCachedLeaves();
+    }
+    /**
+     * Clears the cache.
+     */
+    clearCachedLeaves() {
+        this.cachedLeaves = {};
+    }
+    /**
+     * Updates a leaf in the tree.
+     * @param leaf - New contents of the leaf.
+     * @param index - Index of the leaf to be updated.
+     */
+    async updateLeaf(leaf, index) {
+        if (index > this.maxIndex) {
+            throw Error(`Index out of bounds. Index ${index}, max index: ${this.maxIndex}.`);
+        }
+        const encodedLeaf = this.encodeLeaf(leaf, true);
+        await this.addLeafToCacheAndHashToRoot(encodedLeaf, index);
+        const numLeaves = this.getNumLeaves(true);
+        if (index >= numLeaves) {
+            this.cachedSize = index + 1n;
+        }
+    }
+    /* eslint-disable jsdoc/require-description-complete-sentence */
+    /* The following doc block messes up with complete-sentence, so we just disable it */
+    /**
+     *
+     * Each base rollup needs to provide non membership / inclusion proofs for each of the nullifier.
+     * This method will return membership proofs and perform partial node updates that will
+     * allow the circuit to incrementally update the tree and perform a batch insertion.
+     *
+     * This offers massive circuit performance savings over doing incremental insertions.
+     *
+     * A description of the algorithm can be found here: https://colab.research.google.com/drive/1A0gizduSi4FIiIJZ8OylwIpO9-OTqV-R
+     *
+     * WARNING: This function has side effects, it will insert values into the tree.
+     *
+     * Assumptions:
+     * 1. There are 8 nullifiers provided and they are either unique or empty. (denoted as 0)
+     * 2. If kc 0 has 1 nullifier, and kc 1 has 3 nullifiers the layout will assume to be the sparse
+     *   nullifier layout: [kc0-0, 0, 0, 0, kc1-0, kc1-1, kc1-2, 0]
+     *
+     * Algorithm overview
+     *
+     * In general, if we want to batch insert items, we first need to update their low nullifier to point to them,
+     * then batch insert all of the values at once in the final step.
+     * To update a low nullifier, we provide an insertion proof that the low nullifier currently exists to the
+     * circuit, then update the low nullifier.
+     * Updating this low nullifier will in turn change the root of the tree. Therefore future low nullifier insertion proofs
+     * must be given against this new root.
+     * As a result, each low nullifier membership proof will be provided against an intermediate tree state, each with differing
+     * roots.
+     *
+     * This become tricky when two items that are being batch inserted need to update the same low nullifier, or need to use
+     * a value that is part of the same batch insertion as their low nullifier. In this case a zero low nullifier path is given
+     * to the circuit, and it must determine from the set of batch inserted values if the insertion is valid.
+     *
+     * The following example will illustrate attempting to insert 2,3,20,19 into a tree already containing 0,5,10,15
+     *
+     * The example will explore two cases. In each case the values low nullifier will exist within the batch insertion,
+     * One where the low nullifier comes before the item in the set (2,3), and one where it comes after (20,19).
+     *
+     * The original tree:                       Pending insertion subtree
+     *
+     *  index     0       2       3       4         -       -       -       -
+     *  -------------------------------------      ----------------------------
+     *  val       0       5      10      15         -       -       -       -
+     *  nextIdx   1       2       3       0         -       -       -       -
+     *  nextVal   5      10      15       0         -       -       -       -
+     *
+     *
+     * Inserting 2: (happy path)
+     * 1. Find the low nullifier (0) - provide inclusion proof
+     * 2. Update its pointers
+     * 3. Insert 2 into the pending subtree
+     *
+     *  index     0       2       3       4         5       -       -       -
+     *  -------------------------------------      ----------------------------
+     *  val       0       5      10      15         2       -       -       -
+     *  nextIdx   5       2       3       0         2       -       -       -
+     *  nextVal   2      10      15       0         5       -       -       -
+     *
+     * Inserting 3: The low nullifier exists within the insertion current subtree
+     * 1. When looking for the low nullifier for 3, we will receive 0 again as we have not inserted 2 into the main tree
+     *    This is problematic, as we cannot use either 0 or 2 as our inclusion proof.
+     *    Why cant we?
+     *      - Index 0 has a val 0 and nextVal of 2. This is NOT enough to prove non inclusion of 2.
+     *      - Our existing tree is in a state where we cannot prove non inclusion of 3.
+     *    We do not provide a non inclusion proof to out circuit, but prompt it to look within the insertion subtree.
+     * 2. Update pending insertion subtree
+     * 3. Insert 3 into pending subtree
+     *
+     * (no inclusion proof provided)
+     *  index     0       2       3       4         5       6       -       -
+     *  -------------------------------------      ----------------------------
+     *  val       0       5      10      15         2       3       -       -
+     *  nextIdx   5       2       3       0         6       2       -       -
+     *  nextVal   2      10      15       0         3       5       -       -
+     *
+     * Inserting 20: (happy path)
+     * 1. Find the low nullifier (15) - provide inclusion proof
+     * 2. Update its pointers
+     * 3. Insert 20 into the pending subtree
+     *
+     *  index     0       2       3       4         5       6       7       -
+     *  -------------------------------------      ----------------------------
+     *  val       0       5      10      15         2       3      20       -
+     *  nextIdx   5       2       3       7         6       2       0       -
+     *  nextVal   2      10      15      20         3       5       0       -
+     *
+     * Inserting 19:
+     * 1. In this case we can find a low nullifier, but we are updating a low nullifier that has already been updated
+     *    We can provide an inclusion proof of this intermediate tree state.
+     * 2. Update its pointers
+     * 3. Insert 19 into the pending subtree
+     *
+     *  index     0       2       3       4         5       6       7       8
+     *  -------------------------------------      ----------------------------
+     *  val       0       5      10      15         2       3      20       19
+     *  nextIdx   5       2       3       8         6       2       0       7
+     *  nextVal   2      10      15      19         3       5       0       20
+     *
+     * Perform subtree insertion
+     *
+     *  index     0       2       3       4       5       6       7       8
+     *  ---------------------------------------------------------------------
+     *  val       0       5      10      15       2       3      20       19
+     *  nextIdx   5       2       3       8       6       2       0       7
+     *  nextVal   2      10      15      19       3       5       0       20
+     *
+     * TODO: this implementation will change once the zero value is changed from h(0,0,0). Changes incoming over the next sprint
+     * @param leaves - Values to insert into the tree.
+     * @param subtreeHeight - Height of the subtree.
+     * @returns The data for the leaves to be updated when inserting the new ones.
+     */
+    async batchInsert(leaves, subtreeHeight) {
+        // Keep track of touched low leaves
+        const touched = new Map();
+        const emptyLowLeafWitness = getEmptyLowLeafWitness(this.getDepth());
+        // Accumulators
+        const lowLeavesWitnesses = [];
+        const pendingInsertionSubtree = [];
+        // Start info
+        const startInsertionIndex = this.getNumLeaves(true);
+        // Get insertion path for each leaf
+        for (let i = 0; i < leaves.length; i++) {
+            const newValue = toBigIntBE(leaves[i]);
+            // Keep space and just insert zero values
+            if (newValue === 0n) {
+                pendingInsertionSubtree.push(zeroLeaf);
+                lowLeavesWitnesses.push(emptyLowLeafWitness);
+                continue;
+            }
+            const indexOfPrevious = this.findIndexOfPreviousValue(newValue, true);
+            // If a touched node has a value that is less than the current value
+            const prevNodes = touched.get(indexOfPrevious.index);
+            if (prevNodes && prevNodes.some(v => v < newValue)) {
+                // check the pending low nullifiers for a low nullifier that works
+                // This is the case where the next value is less than the pending
+                for (let j = 0; j < pendingInsertionSubtree.length; j++) {
+                    if (pendingInsertionSubtree[j].value === 0n)
+                        continue;
+                    if (pendingInsertionSubtree[j].value < newValue &&
+                        (pendingInsertionSubtree[j].nextValue > newValue || pendingInsertionSubtree[j].nextValue === 0n)) {
+                        // add the new value to the pending low nullifiers
+                        const currentLowLeaf = {
+                            value: newValue,
+                            nextValue: pendingInsertionSubtree[j].nextValue,
+                            nextIndex: pendingInsertionSubtree[j].nextIndex,
+                        };
+                        pendingInsertionSubtree.push(currentLowLeaf);
+                        // Update the pending low leaf to point at the new value
+                        pendingInsertionSubtree[j].nextValue = newValue;
+                        pendingInsertionSubtree[j].nextIndex = startInsertionIndex + BigInt(i);
+                        break;
+                    }
+                }
+                // Any node updated in this space will need to calculate its low nullifier from a previously inserted value
+                lowLeavesWitnesses.push(emptyLowLeafWitness);
+            }
+            else {
+                // Update the touched mapping
+                if (prevNodes) {
+                    prevNodes.push(newValue);
+                    touched.set(indexOfPrevious.index, prevNodes);
+                }
+                else {
+                    touched.set(indexOfPrevious.index, [newValue]);
+                }
+                // get the low leaf
+                const lowLeaf = this.getLatestLeafDataCopy(indexOfPrevious.index, true);
+                if (lowLeaf === undefined) {
+                    return [undefined, await this.getSubtreeSiblingPath(subtreeHeight, true)];
+                }
+                const siblingPath = await this.getSiblingPath(BigInt(indexOfPrevious.index), true);
+                const witness = {
+                    leafData: { ...lowLeaf },
+                    index: BigInt(indexOfPrevious.index),
+                    siblingPath,
+                };
+                // Update the running paths
+                lowLeavesWitnesses.push(witness);
+                const currentLowLeaf = {
+                    value: newValue,
+                    nextValue: lowLeaf.nextValue,
+                    nextIndex: lowLeaf.nextIndex,
+                };
+                pendingInsertionSubtree.push(currentLowLeaf);
+                lowLeaf.nextValue = newValue;
+                lowLeaf.nextIndex = startInsertionIndex + BigInt(i);
+                const lowLeafIndex = indexOfPrevious.index;
+                this.cachedLeaves[lowLeafIndex] = lowLeaf;
+                await this.updateLeaf(lowLeaf, BigInt(lowLeafIndex));
+            }
+        }
+        const newSubtreeSiblingPath = await this.getSubtreeSiblingPath(subtreeHeight, true);
+        // Perform batch insertion of new pending values
+        // Note: In this case we set `hash0Leaf` param to false because batch insertion algorithm use forced null leaf
+        // inclusion. See {@link encodeLeaf} for  a more through param explanation.
+        await this.encodeAndAppendLeaves(pendingInsertionSubtree, false);
+        return [lowLeavesWitnesses, newSubtreeSiblingPath];
+    }
+    async getSubtreeSiblingPath(subtreeHeight, includeUncommitted) {
+        const nextAvailableLeafIndex = this.getNumLeaves(includeUncommitted);
+        const fullSiblingPath = await this.getSiblingPath(nextAvailableLeafIndex, includeUncommitted);
+        // Drop the first subtreeHeight items since we only care about the path to the subtree root
+        return fullSiblingPath.getSubtreeSiblingPath(subtreeHeight);
+    }
+    /**
+     * Encodes leaves and appends them to a tree.
+     * @param leaves - Leaves to encode.
+     * @param hash0Leaf - Indicates whether 0 value leaf should be hashed. See {@link encodeLeaf}.
+     * @returns Empty promise
+     */
+    async encodeAndAppendLeaves(leaves, hash0Leaf) {
+        const startInsertionIndex = Number(this.getNumLeaves(true));
+        const serialisedLeaves = leaves.map((leaf, i) => {
+            this.cachedLeaves[startInsertionIndex + i] = leaf;
+            return this.encodeLeaf(leaf, hash0Leaf);
+        });
+        await super.appendLeaves(serialisedLeaves);
+    }
+    /**
+     * Encode a leaf into a buffer.
+     * @param leaf - Leaf to encode.
+     * @param hash0Leaf - Indicates whether 0 value leaf should be hashed. Not hashing 0 value can represent a forced
+     *                    null leaf insertion. Detecting this case by checking for 0 value is safe as in the case of
+     *                    nullifier it is improbable that a valid nullifier would be 0.
+     * @returns Leaf encoded in a buffer.
+     */
+    encodeLeaf(leaf, hash0Leaf) {
+        let encodedLeaf;
+        if (!hash0Leaf && leaf.value == 0n) {
+            encodedLeaf = toBufferBE(0n, 32);
+        }
+        else {
+            encodedLeaf = this.hasher.compressInputs([leaf.value, leaf.nextIndex, leaf.nextValue].map(val => toBufferBE(val, 32)));
+        }
+        return encodedLeaf;
+    }
+}
+//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"standard_indexed_tree.js","sourceRoot":"","sources":["../../src/standard_indexed_tree/standard_indexed_tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AACzE,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAG3C,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAE3C,MAAM,GAAG,GAAG,iBAAiB,CAAC,6BAA6B,CAAC,CAAC;AAE7D,MAAM,cAAc,GAAG,CAAC,IAAY,EAAE,KAAa,EAAE,EAAE;IACrD,OAAO,GAAG,IAAI,SAAS,KAAK,EAAE,CAAC;AACjC,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAa;IACzB,KAAK,EAAE,EAAE;IACT,SAAS,EAAE,EAAE;IACb,SAAS,EAAE,EAAE;CACd,CAAC;AAoBF;;;;GAIG;AACH,SAAS,sBAAsB,CAAmB,UAAa;IAC7D,OAAO;QACL,QAAQ,EAAE,QAAQ;QAClB,KAAK,EAAE,EAAE;QACT,WAAW,EAAE,IAAI,WAAW,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;KACrF,CAAC;AACJ,CAAC;AAED,6DAA6D;AAC7D,MAAM,eAAe,GAAG,CAAC,QAAkB,EAAE,EAAE;IAC7C,MAAM,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACrD,MAAM,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IACzD,MAAM,iBAAiB,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IAC7D,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,aAAa,EAAE,aAAa,EAAE,iBAAiB,CAAC,CAAC,CAAC;AAC1E,CAAC,CAAC;AAEF,MAAM,eAAe,GAAG,CAAC,GAAW,EAAE,EAAE;IACtC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACnD,OAAO;QACL,KAAK;QACL,SAAS;QACT,SAAS;KACE,CAAC;AAChB,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,OAAO,mBAAoB,SAAQ,QAAQ;IAAjD;;QACY,WAAM,GAAe,EAAE,CAAC;QACxB,iBAAY,GAAgC,EAAE,CAAC;IA2f3D,CAAC;IAzfC;;;;;OAKG;IACI,YAAY,CAAC,OAAiB;QACnC,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,MAAM;QACjB,MAAM,KAAK,CAAC,MAAM,EAAE,CAAC;QACrB,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,QAAQ;QACnB,MAAM,KAAK,CAAC,QAAQ,EAAE,CAAC;QACvB,IAAI,CAAC,iBAAiB,EAAE,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,KAAa,EAAE,kBAA2B;QAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,qBAAqB,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,kBAAkB,CAAC,CAAC;QAC3E,IAAI,CAAC,IAAI;YAAE,OAAO,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;IACrD,CAAC;IAED;;;;;OAKG;IACH,wBAAwB,CACtB,QAAgB,EAChB,kBAA2B;QAW3B,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC;QACxD,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YAClC,MAAM,UAAU,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,EAAE,kBAAkB,CAAE,CAAC;YAEtE,iEAAiE;YACjE,gEAAgE;YAChE,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aACrB;iBAAM,IAAI,UAAU,CAAC,KAAK,GAAG,QAAQ,EAAE;gBACtC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aACrB;iBAAM,IAAI,UAAU,CAAC,KAAK,KAAK,QAAQ,EAAE;gBACxC,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC;aAC3C;iBAAM;gBACL,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;aACxC;SACF;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACzC,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;IACpD,CAAC;IAED;;;;;OAKG;IACI,qBAAqB,CAAC,KAAa,EAAE,kBAA2B;QACrE,MAAM,IAAI,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvG,OAAO,IAAI;YACT,CAAC,CAAE;gBACC,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,SAAS,EAAE,IAAI,CAAC,SAAS;aACb;YAChB,CAAC,CAAC,SAAS,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,MAAgB;QACnC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAClB,OAAO,CAAC,CAAC;SACV;QACD,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE;gBAChC,QAAQ,GAAG,CAAC,CAAC;aACd;SACF;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACI,KAAK,CAAC,IAAI,CAAC,aAAqB;QACrC,IAAI,aAAa,GAAG,CAAC,EAAE;YACrB,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;SACvD;QAED,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,OAAO,GAAG;gBACd,KAAK,EAAE,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,SAAS,EAAE,CAAC,GAAG,EAAE;gBACjB,SAAS,EAAE,CAAC,GAAG,EAAE;aAClB,CAAC;YACF,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SACtB;QAED,mCAAmC;QACnC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;QAErB,6CAA6C;QAC7C,MAAM,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC;QACzC,MAAM,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC;QAEzC,MAAM,IAAI,CAAC,qBAAqB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC/C,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;IACtB,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,UAAU;QACrB,MAAM,aAAa,GAAG,EAAE,CAAC;QACzB,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACpD,IAAI,CAAC,EAAE;iBACJ,gBAAgB,CAAC;gBAChB,GAAG,EAAE,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,aAAa,CAAC;gBAClD,GAAG,EAAE,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;aACnE,CAAC;iBACD,EAAE,CAAC,MAAM,EAAE,UAAU,IAAI;gBACxB,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC/B,MAAM,CAAC,KAAK,CAAC,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9C,CAAC,CAAC;iBACD,EAAE,CAAC,OAAO,EAAE,cAAa,CAAC,CAAC;iBAC3B,EAAE,CAAC,KAAK,EAAE;gBACT,OAAO,EAAE,CAAC;YACZ,CAAC,CAAC;iBACD,EAAE,CAAC,OAAO,EAAE;gBACX,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;gBAC1B,MAAM,EAAE,CAAC;YACX,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QACH,MAAM,OAAO,CAAC;QACd,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,YAAY;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;YACtB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;YAC1B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;SAC/C;QACD,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,iBAAiB,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,iBAAiB;QACvB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACO,KAAK,CAAC,UAAU,CAAC,IAAc,EAAE,KAAa;QACtD,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE;YACzB,MAAM,KAAK,CAAC,8BAA8B,KAAK,gBAAgB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;SAClF;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAChD,MAAM,IAAI,CAAC,2BAA2B,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,KAAK,IAAI,SAAS,EAAE;YACtB,IAAI,CAAC,UAAU,GAAG,KAAK,GAAG,EAAE,CAAC;SAC9B;IACH,CAAC;IAED,gEAAgE;IAChE,qFAAqF;IAErF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6GG;IACI,KAAK,CAAC,WAAW,CAKtB,MAAgB,EAChB,aAA4B;QAK5B,mCAAmC;QACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE5C,MAAM,mBAAmB,GAAG,sBAAsB,CAAC,IAAI,CAAC,QAAQ,EAAgB,CAAC,CAAC;QAClF,eAAe;QACf,MAAM,kBAAkB,GAAqC,EAAE,CAAC;QAChE,MAAM,uBAAuB,GAAe,EAAE,CAAC;QAE/C,aAAa;QACb,MAAM,mBAAmB,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAEpD,mCAAmC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAEvC,yCAAyC;YACzC,IAAI,QAAQ,KAAK,EAAE,EAAE;gBACnB,uBAAuB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvC,kBAAkB,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;gBAC7C,SAAS;aACV;YAED,MAAM,eAAe,GAAG,IAAI,CAAC,wBAAwB,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAEtE,oEAAoE;YACpE,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YACrD,IAAI,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE;gBAClD,kEAAkE;gBAClE,iEAAiE;gBACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,uBAAuB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACvD,IAAI,uBAAuB,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE;wBAAE,SAAS;oBAEtD,IACE,uBAAuB,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,QAAQ;wBAC3C,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,QAAQ,IAAI,uBAAuB,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE,CAAC,EAChG;wBACA,kDAAkD;wBAClD,MAAM,cAAc,GAAa;4BAC/B,KAAK,EAAE,QAAQ;4BACf,SAAS,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC,SAAS;4BAC/C,SAAS,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC,SAAS;yBAChD,CAAC;wBAEF,uBAAuB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;wBAE7C,wDAAwD;wBACxD,uBAAuB,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,QAAQ,CAAC;wBAChD,uBAAuB,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,mBAAmB,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;wBAEvE,MAAM;qBACP;iBACF;gBAED,2GAA2G;gBAC3G,kBAAkB,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;aAC9C;iBAAM;gBACL,6BAA6B;gBAC7B,IAAI,SAAS,EAAE;oBACb,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;iBAC/C;qBAAM;oBACL,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;iBAChD;gBAED,mBAAmB;gBACnB,MAAM,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBACxE,IAAI,OAAO,KAAK,SAAS,EAAE;oBACzB,OAAO,CAAC,SAAS,EAAE,MAAM,IAAI,CAAC,qBAAqB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC;iBAC3E;gBACD,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,cAAc,CAAa,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;gBAE/F,MAAM,OAAO,GAAmC;oBAC9C,QAAQ,EAAE,EAAE,GAAG,OAAO,EAAE;oBACxB,KAAK,EAAE,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC;oBACpC,WAAW;iBACZ,CAAC;gBAEF,2BAA2B;gBAC3B,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAEjC,MAAM,cAAc,GAAa;oBAC/B,KAAK,EAAE,QAAQ;oBACf,SAAS,EAAE,OAAO,CAAC,SAAS;oBAC5B,SAAS,EAAE,OAAO,CAAC,SAAS;iBAC7B,CAAC;gBAEF,uBAAuB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBAE7C,OAAO,CAAC,SAAS,GAAG,QAAQ,CAAC;gBAC7B,OAAO,CAAC,SAAS,GAAG,mBAAmB,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAEpD,MAAM,YAAY,GAAG,eAAe,CAAC,KAAK,CAAC;gBAC3C,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,OAAO,CAAC;gBAC1C,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;aACtD;SACF;QAED,MAAM,qBAAqB,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAC5D,aAAa,EACb,IAAI,CACL,CAAC;QAEF,gDAAgD;QAChD,8GAA8G;QAC9G,2EAA2E;QAC3E,MAAM,IAAI,CAAC,qBAAqB,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC;QACjE,OAAO,CAAC,kBAAkB,EAAE,qBAAqB,CAAC,CAAC;IACrD,CAAC;IAED,KAAK,CAAC,qBAAqB,CACzB,aAA4B,EAC5B,kBAA2B;QAE3B,MAAM,sBAAsB,GAAG,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC;QACrE,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,sBAAsB,EAAE,kBAAkB,CAAC,CAAC;QAE9F,2FAA2F;QAC3F,OAAO,eAAe,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;IAC9D,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,qBAAqB,CAAC,MAAkB,EAAE,SAAkB;QACxE,MAAM,mBAAmB,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;QAE5D,MAAM,gBAAgB,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YAC9C,IAAI,CAAC,YAAY,CAAC,mBAAmB,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;YAClD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,MAAM,KAAK,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;;;OAOG;IACK,UAAU,CAAC,IAAc,EAAE,SAAkB;QACnD,IAAI,WAAW,CAAC;QAChB,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE;YAClC,WAAW,GAAG,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;SAClC;aAAM;YACL,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CACtC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAC7E,CAAC;SACH;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;CACF"}

package/dest/standard_indexed_tree/test/standard_indexed_tree.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=standard_indexed_tree.test.d.ts.map

package/dest/standard_indexed_tree/test/standard_indexed_tree.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"standard_indexed_tree.test.d.ts","sourceRoot":"","sources":["../../../src/standard_indexed_tree/test/standard_indexed_tree.test.ts"],"names":[],"mappings":""}