@feelyourprotocol/binarytree 8141.0.0

package/dist/cjs/binaryTree.js

@@ -0,0 +1,606 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BinaryTree = void 0;
+const util_1 = require("@feelyourprotocol/util");
+const debug_1 = require("debug");
+const index_ts_1 = require("./db/index.js");
+const internalNode_ts_1 = require("./node/internalNode.js");
+const stemNode_ts_1 = require("./node/stemNode.js");
+const util_ts_1 = require("./node/util.js");
+const types_ts_1 = require("./types.js");
+/**
+ * The basic binary tree interface, use with `import { BinaryTree } from '@feelyourprotocol/binarytree'`.
+ *
+ * A BinaryTree object can be created with the constructor method:
+ *
+ * - {@link createBinaryTree}
+ */
+class BinaryTree {
+    /**
+     * Creates a new binary tree.
+     * @param opts Options for instantiating the binary tree
+     *
+     * Note: in most cases, the static {@link createBinaryTree} constructor should be used. It uses the same API but provides sensible defaults
+     */
+    constructor(opts) {
+        this._lock = new util_1.Lock();
+        this._debug = (0, debug_1.default)('binarytree:#');
+        this._opts = opts;
+        if (opts.db instanceof index_ts_1.CheckpointDB) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('Cannot pass in an instance of CheckpointDB');
+        }
+        this._db = new index_ts_1.CheckpointDB({ db: opts.db, cacheSize: opts.cacheSize });
+        this.EMPTY_TREE_ROOT = new Uint8Array(32);
+        this._hashLen = 32;
+        this._root = this.EMPTY_TREE_ROOT;
+        if (opts?.root) {
+            this.root(opts.root);
+        }
+        this.DEBUG = (0, util_1.isDebugEnabled)('ethjs');
+        this.debug = this.DEBUG
+            ? (message, namespaces = []) => {
+                let log = this._debug;
+                for (const name of namespaces) {
+                    log = log.extend(name);
+                }
+                log(message);
+            }
+            : (..._) => { };
+        this.DEBUG &&
+            this.debug(`Trie created:
+    || Root: ${(0, util_1.bytesToHex)(this._root)}
+    || Persistent: ${this._opts.useRootPersistence}
+    || CacheSize: ${this._opts.cacheSize}
+    || ----------------`);
+    }
+    /**
+     * Gets and/or Sets the current root of the `tree`
+     */
+    root(value) {
+        if (value !== undefined) {
+            if (value === null) {
+                value = this.EMPTY_TREE_ROOT;
+            }
+            if (value.length !== this._hashLen) {
+                throw (0, util_1.EthereumJSErrorWithoutCode)(`Invalid root length. Roots are ${this._hashLen} bytes`);
+            }
+            this._root = value;
+        }
+        return this._root;
+    }
+    /**
+     * Checks if a given root exists.
+     */
+    async checkRoot(root) {
+        try {
+            const value = await this._db.get(root);
+            return value !== undefined;
+        }
+        catch (error) {
+            if (error.message === 'Missing node in DB') {
+                return (0, util_1.equalsBytes)(root, this.EMPTY_TREE_ROOT);
+            }
+            else {
+                throw error;
+            }
+        }
+    }
+    /**
+     * Gets values at a given binary tree `stem` and set of suffixes
+     * @param stem - the stem of the stem node where we're seeking values
+     * @param suffixes - an array of suffixes corresponding to the values desired
+     * @returns A Promise that resolves to an array of `Uint8Array`s or `null` depending on if values were found.
+     * If the stem is not found, will return an empty array.
+     */
+    async get(stem, suffixes) {
+        if (stem.length !== 31)
+            throw (0, util_1.EthereumJSErrorWithoutCode)(`expected stem with length 31; got ${stem.length}`);
+        this.DEBUG && this.debug(`Stem: ${(0, util_1.bytesToHex)(stem)}; Suffix: ${suffixes}`, ['get']);
+        const stemPath = await this.findPath(stem);
+        if (stemPath.node instanceof stemNode_ts_1.StemBinaryNode) {
+            // The retrieved stem node contains an array of 256 possible values.
+            // We read all the suffixes to get the desired values
+            const values = [];
+            for (const suffix of suffixes) {
+                const value = stemPath.node.getValue(suffix);
+                this.DEBUG &&
+                    this.debug(`Suffix: ${suffix}; Value: ${value === null ? 'null' : (0, util_1.bytesToHex)(value)}`, [
+                        'get',
+                    ]);
+                values.push(value);
+            }
+            return values;
+        }
+        return [];
+    }
+    /**
+     * Stores a given `value` at the given `key` or performs a deletion if `value` is null.
+     * @param stem - the stem (must be 31 bytes) to store the value at.
+     * @param suffixes - array of suffixes at which to store individual values.
+     * @param values - the value(s) to store (or null for deletion).
+     * @returns A Promise that resolves once the value is stored.
+     */
+    async put(stem, suffixes, values) {
+        if (stem.length !== 31)
+            throw (0, util_1.EthereumJSErrorWithoutCode)(`expected stem with length 31, got ${stem.length}`);
+        if (values.length > 0 && values.length !== suffixes.length)
+            throw (0, util_1.EthereumJSErrorWithoutCode)(`expected number of values (${values.length}) to equal number of suffixes (${suffixes.length})`);
+        this.DEBUG && this.debug(`Stem: ${(0, util_1.bytesToHex)(stem)}`, ['put']);
+        const putStack = []; // A stack of updated nodes starting with the stem node being updated/created to be saved to the DB
+        // If the tree is empty, initialize it.
+        if ((0, util_1.equalsBytes)(this.root(), this.EMPTY_TREE_ROOT)) {
+            await this._createInitialNode(stem, suffixes, values);
+            return;
+        }
+        // Find the path to the node (or the nearest node) for the given stem.
+        const foundPath = await this.findPath(stem);
+        // We should always at least get the root node back
+        if (foundPath.stack.length === 0)
+            throw (0, util_1.EthereumJSErrorWithoutCode)(`Root node not found in trie`);
+        // Step 1) Create or update the stem node
+        let stemNode;
+        // If we found a stem node with the same stem, we'll update it.
+        if (foundPath.node &&
+            (0, util_ts_1.isStemBinaryNode)(foundPath.node) &&
+            (0, util_1.equalsBytes)(foundPath.node.stem, stem)) {
+            stemNode = foundPath.node;
+        }
+        else {
+            // Otherwise, we'll create a new stem node.
+            stemNode = stemNode_ts_1.StemBinaryNode.create(stem);
+            this.DEBUG && this.debug(`Creating new stem node for stem: ${(0, util_1.bytesToHex)(stem)}`, ['put']);
+        }
+        // Update the values in the stem node
+        for (let i = 0; i < suffixes.length; i++) {
+            const suffix = suffixes[i];
+            const value = values[i];
+            stemNode.setValue(suffix, value);
+            this.DEBUG &&
+                this.debug(`Setting value for suffix: ${suffix} to value: ${value instanceof Uint8Array ? (0, util_1.bytesToHex)(value) : value} at stem node with stem: ${(0, util_1.bytesToHex)(stem)}`, ['put']);
+        }
+        // If all values are null then we treat this as a deletion.
+        if (stemNode.values.every((val) => val === null)) {
+            if (foundPath.node !== null) {
+                this.DEBUG && this.debug(`Deleting stem node for stem: ${(0, util_1.bytesToHex)(stem)}`, ['put']);
+                putStack.push([this.merkelize(stemNode), null]);
+            }
+            else {
+                return; // nothing to delete
+            }
+        }
+        else {
+            // Otherwise, we add the new or updated stemNode to the putStack
+            putStack.push([this.merkelize(stemNode), stemNode]);
+        }
+        // Get the bit representation of the stem.
+        const stemBits = (0, util_1.bytesToBits)(stemNode.stem);
+        // We keep a reference to the current "parent" node path as we update up the tree.
+        let lastUpdatedParentPath = [];
+        // Step 2: Add any needed new internal nodes if inserting a new stem.
+        //         If updating an existing stem, just update the parent internal node reference
+        if (foundPath.stack.length > 1) {
+            // Pop the nearest node on the path.
+            const [nearestNode, nearestNodePath] = foundPath.stack.pop();
+            const parentPath = foundPath.stack[foundPath.stack.length - 1]?.[1] ?? [];
+            this.DEBUG && this.debug(`Adding necessary internal nodes.`, ['put']);
+            // Update the parent branch if necessary.
+            // If an update was necessary, updateBranch returns a stack of internal nodes
+            // that connect the new stem node to the previous parent inner node
+            const updated = this.updateBranch(stemNode, nearestNode, nearestNodePath, parentPath);
+            if (updated !== undefined) {
+                for (const update of updated) {
+                    putStack.push([this.merkelize(update.node), update.node]);
+                    lastUpdatedParentPath = update.parentPath;
+                }
+            }
+        }
+        // Step 3: Update remaining parent node hashes
+        while (foundPath.stack.length > 1) {
+            const [node, path] = foundPath.stack.pop();
+            if ((0, util_ts_1.isInternalBinaryNode)(node)) {
+                // Set child pointer to the last internal node in the putStack (last updated internal node)
+                node.setChild(lastUpdatedParentPath[lastUpdatedParentPath.length - 1], {
+                    hash: putStack[putStack.length - 1][0], // Reuse hash already computed above
+                    path: lastUpdatedParentPath,
+                });
+                putStack.push([this.merkelize(node), node]); // Update node hash and add to putStack
+                lastUpdatedParentPath = path;
+                this.DEBUG &&
+                    this.debug(`Updated parent internal node hash for path ${path.join(',')}`, ['put']);
+            }
+            else {
+                throw (0, util_1.EthereumJSErrorWithoutCode)(`Expected internal node at path ${path.join(',')}, got ${node}`);
+            }
+        }
+        // Step 4: Update the root node.
+        let rootNode = foundPath.stack.pop()[0]; // The root node.
+        const childReference = putStack[putStack.length - 1][1];
+        if ((0, util_ts_1.isStemBinaryNode)(rootNode)) {
+            // If the root is a stem node but its stem differs from the one we're updating,
+            // then we need to split the root. Per the spec, when two stems share a common prefix,
+            // we create one internal node per bit in that common prefix, and then at the first
+            // divergence, an internal node that points to both stem nodes.
+            if (!(0, util_1.equalsBytes)(rootNode.stem, stem)) {
+                this.DEBUG && this.debug(`Root stem differs from new stem. Splitting root.`, ['put']);
+                const rootBits = (0, util_1.bytesToBits)(rootNode.stem);
+                const commonPrefixLength = (0, util_1.matchingBitsLength)(rootBits, stemBits);
+                // Create the split node at the divergence bit.
+                const splitNode = internalNode_ts_1.InternalBinaryNode.create();
+                const branchForNew = stemBits[commonPrefixLength];
+                const branchForExisting = rootBits[commonPrefixLength];
+                splitNode.setChild(branchForNew, {
+                    hash: this.merkelize(stemNode),
+                    path: stemBits,
+                });
+                splitNode.setChild(branchForExisting, {
+                    hash: this.merkelize(rootNode),
+                    path: rootBits,
+                });
+                let newRoot = splitNode;
+                // If there is a common prefix (i.e. commonPrefixLength > 0), we build a chain
+                // of internal nodes representing that prefix.
+                for (let depth = commonPrefixLength - 1; depth >= 0; depth--) {
+                    this.DEBUG && this.debug(`Creating internal node at depth ${depth}`, ['put']);
+                    putStack.push([this.merkelize(newRoot), newRoot]);
+                    const parent = internalNode_ts_1.InternalBinaryNode.create();
+                    // At each level, the branch is determined by the bit of the new stem at position i.
+                    parent.setChild(stemBits[depth], {
+                        hash: this.merkelize(newRoot),
+                        path: stemBits.slice(0, depth + 1),
+                    });
+                    newRoot = parent;
+                }
+                // Now newRoot is an internal node chain that represents the entire common prefix,
+                // ending in a split node that distinguishes the two different stems.
+                rootNode = newRoot;
+            }
+        }
+        else {
+            // For an internal root node, we assign the last update child reference to the root.
+            if (childReference !== null) {
+                rootNode.setChild(stemBits[0], childReference !== null
+                    ? {
+                        hash: this.merkelize(childReference),
+                        path: (0, util_ts_1.isStemBinaryNode)(childReference) ? stemBits : lastUpdatedParentPath,
+                    }
+                    : null);
+            }
+        }
+        this.root(this.merkelize(rootNode));
+        putStack.push([this._root, rootNode]);
+        this.DEBUG && this.debug(`Updated root hash to ${(0, util_1.bytesToHex)(this._root)}`, ['put']);
+        await this.saveStack(putStack);
+    }
+    /**
+     * Helper method for updating or creating the parent internal node for a given stem node.
+     * If the nearest node is a stem node with a different stem, a new internal node is created
+     * to branch at the first differing bit.
+     * If the nearest node is an internal node, its child reference is updated.
+     *
+     * @param stemNode - The child stem node that will be referenced by the new/updated internal node.
+     * @param nearestNode - The nearest node to the new stem node.
+     * @param pathToNode - The path (in bits) to `nearestNode` as known from the trie.
+     * @returns An array of nodes and their partial paths from the new stem node to the branch parent node
+     *          or `undefined` if no changes were made.
+     */
+    updateBranch(stemNode, nearestNode, pathToNode, pathToParent) {
+        const stemBits = (0, util_1.bytesToBits)(stemNode.stem);
+        if ((0, util_ts_1.isStemBinaryNode)(nearestNode)) {
+            // For two different stems, find the first differing bit.
+            const nearestNodeStemBits = (0, util_1.bytesToBits)(nearestNode.stem);
+            const diffIndex = (0, util_1.matchingBitsLength)(stemBits, nearestNodeStemBits);
+            const parentDiffIndex = (0, util_1.matchingBitsLength)(pathToNode, pathToParent);
+            const newInternal = internalNode_ts_1.InternalBinaryNode.create();
+            // Set the child pointer for the new stem node using the bit at diffIndex.
+            newInternal.setChild(stemBits[diffIndex], {
+                hash: this.merkelize(stemNode),
+                path: stemBits,
+            });
+            // Set the child pointer for the existing stem node.
+            newInternal.setChild(nearestNodeStemBits[diffIndex], {
+                hash: this.merkelize(nearestNode),
+                path: nearestNodeStemBits,
+            });
+            const putStack = [{ node: newInternal, parentPath: stemBits.slice(0, diffIndex) }];
+            let parent = newInternal;
+            for (let depth = diffIndex - 1; depth > parentDiffIndex; depth--) {
+                this.DEBUG && this.debug(`Creating internal node at depth ${depth}`, ['put']);
+                const newParent = internalNode_ts_1.InternalBinaryNode.create();
+                // At each level, the branch is determined by the bit of the new stem at position i.
+                newParent.setChild(stemBits[depth], {
+                    hash: this.merkelize(parent),
+                    path: stemBits.slice(0, depth + 1),
+                });
+                putStack.push({ node: newParent, parentPath: stemBits.slice(0, depth) });
+                parent = newParent;
+            }
+            // Return the stack of new internal nodes that connect the new stem node to the previous parent inner node
+            return putStack;
+        }
+        else if ((0, util_ts_1.isInternalBinaryNode)(nearestNode)) {
+            // For an internal node, determine the branch index using the parent's known path length.
+            const branchIndex = stemBits[pathToNode.length];
+            nearestNode.setChild(branchIndex, {
+                hash: this.merkelize(stemNode),
+                path: stemBits,
+            });
+            return [{ node: nearestNode, parentPath: pathToNode }];
+        }
+        return undefined;
+    }
+    /**
+     * Tries to find a path to the node for the given key.
+     * It returns a `Path` object containing:
+     *   - `node`: the found node (if any),
+     *   - `stack`: an array of tuples [node, path] representing the nodes encountered,
+     *   - `remaining`: the bits of the key that were not matched.
+     *
+     * @param keyInBytes - the search key as a byte array.
+     * @returns A Promise that resolves to a Path object.
+     */
+    async findPath(keyInBytes) {
+        const keyInBits = (0, util_1.bytesToBits)(keyInBytes);
+        this.DEBUG && this.debug(`Searching for key: ${(0, util_1.bytesToHex)(keyInBytes)}`, ['find_path']);
+        const result = {
+            node: null,
+            stack: [],
+            remaining: keyInBits,
+        };
+        // If tree is empty, return empty path.
+        if ((0, util_1.equalsBytes)(this.root(), this.EMPTY_TREE_ROOT))
+            return result;
+        // Get the root node.
+        let rawNode = await this._db.get(this.root());
+        if (rawNode === undefined)
+            throw (0, util_1.EthereumJSErrorWithoutCode)('root node should exist');
+        const rootNode = (0, util_ts_1.decodeBinaryNode)(rawNode);
+        this.DEBUG && this.debug(`Starting with Root Node: [${(0, util_1.bytesToHex)(this.root())}]`, ['find_path']);
+        // Treat the root as being at an empty path.
+        result.stack.push([rootNode, []]);
+        // If the root node is a stem node, we're done.
+        if ((0, util_ts_1.isStemBinaryNode)(rootNode)) {
+            this.DEBUG && this.debug(`Found stem node at root.`, ['find_path']);
+            if ((0, util_1.equalsBytes)(keyInBytes, rootNode.stem)) {
+                result.node = rootNode;
+                result.remaining = [];
+            }
+            return result;
+        }
+        // The root is an internal node. Determine the branch to follow using the first bit of the key
+        let childNode = rootNode.getChild(keyInBits[0]);
+        let finished = false;
+        while (!finished) {
+            if (childNode === null)
+                break;
+            // Look up child node by its node hash.
+            rawNode = await this._db.get(childNode.hash);
+            if (rawNode === undefined)
+                throw (0, util_1.EthereumJSErrorWithoutCode)(`missing node at ${childNode.path}`);
+            const decodedNode = (0, util_ts_1.decodeBinaryNode)(rawNode);
+            // Determine how many bits match between keyInBits and the stored path in childNode.
+            const matchingKeyLength = (0, util_1.matchingBitsLength)(keyInBits, childNode.path);
+            // If we have an exact match (i.e. the stored path equals a prefix of the key)
+            // and either the key is fully consumed or we have reached a stem node, we stop.
+            if (matchingKeyLength === childNode.path.length &&
+                (matchingKeyLength === keyInBits.length || (0, util_ts_1.isStemBinaryNode)(decodedNode))) {
+                finished = true;
+                if (matchingKeyLength === keyInBits.length &&
+                    (0, util_1.equalsBits)(keyInBits, childNode.path) === true) {
+                    // We found the sought node
+                    this.DEBUG &&
+                        this.debug(`Path ${(0, util_1.bytesToHex)(keyInBytes)} - found full path to node ${(0, util_1.bytesToHex)(this.merkelize(decodedNode))}.`, ['find_path']);
+                    result.node = decodedNode;
+                    result.remaining = [];
+                    return result;
+                }
+                // We didn't find the sought node so record the unmatched tail of the key.
+                result.remaining = keyInBits.slice(matchingKeyLength);
+                result.stack.push([decodedNode, childNode.path]);
+                return result;
+            }
+            // Otherwise, push this internal node and continue.
+            result.stack.push([decodedNode, keyInBits.slice(0, matchingKeyLength)]);
+            this.DEBUG &&
+                this.debug(`Partial Path ${keyInBits.slice(0, matchingKeyLength)} - found next node in path ${(0, util_1.bytesToHex)(this.merkelize(decodedNode))}.`, ['find_path']);
+            // If the decoded node is not internal, then we cannot traverse further.
+            if (!(0, util_ts_1.isInternalBinaryNode)(decodedNode)) {
+                result.remaining = keyInBits.slice(matchingKeyLength);
+                finished = true;
+                break;
+            }
+            // The next branch is determined by the next bit after the matched prefix.
+            const childIndex = keyInBits[matchingKeyLength];
+            childNode = decodedNode.getChild(childIndex);
+            if (childNode === null) {
+                result.remaining = keyInBits.slice(matchingKeyLength);
+                finished = true;
+            }
+        }
+        this.DEBUG &&
+            this.debug(`Found partial path ${(0, util_1.bytesToHex)((0, util_1.bitsToBytes)(keyInBits.slice(256 - result.remaining.length)))} but sought node is not present in trie.`, ['find_path']);
+        return result;
+    }
+    /**
+     * Deletes a given `key` from the tree.
+     * @param stem - the stem of the stem node to delete from
+     * @param suffixes - the suffixes to delete
+     * @returns A Promise that resolves once the key is deleted.
+     */
+    async del(stem, suffixes) {
+        this.DEBUG && this.debug(`Stem: ${(0, util_1.bytesToHex)(stem)}; Suffix(es): ${suffixes}`, ['del']);
+        await this.put(stem, suffixes, new Array(suffixes.length).fill(null));
+    }
+    /**
+     * Create empty root node for initializing an empty tree.
+     */
+    async createRootNode() {
+        const rootNode = null;
+        this.DEBUG && this.debug(`No root node. Creating new root node`, ['initialize']);
+        this.root(this.merkelize(rootNode));
+        await this.saveStack([[this.root(), rootNode]]);
+        return;
+    }
+    /**
+     * Creates the initial node from an empty tree.
+     * @private
+     */
+    async _createInitialNode(stem, indexes, values) {
+        const initialNode = stemNode_ts_1.StemBinaryNode.create(stem);
+        for (let i = 0; i < indexes.length; i++) {
+            initialNode.setValue(indexes[i], values[i]);
+        }
+        this.root(this.merkelize(initialNode));
+        await this._db.put(this.root(), initialNode.serialize());
+        await this.persistRoot();
+    }
+    /**
+     * Saves a stack of nodes to the database.
+     *
+     * @param putStack - an array of tuples of keys (the partial path of the node in the trie) and nodes (BinaryNodes)
+     */
+    async saveStack(putStack) {
+        const opStack = putStack.map(([key, node]) => {
+            return {
+                type: node !== null ? 'put' : 'del',
+                key,
+                value: node !== null ? node.serialize() : null,
+            };
+        });
+        await this._db.batch(opStack);
+    }
+    /**
+     * Creates a proof from a tree and key that can be verified using {@link BinaryTree.verifyBinaryProof}.
+     * @param key a 32 byte binary tree key (31 byte stem + 1 byte suffix)
+     */
+    async createBinaryProof(key) {
+        this.DEBUG && this.debug(`creating proof for ${(0, util_1.bytesToHex)(key)}`, ['create_proof']);
+        // We only use the stem (i.e. the first 31 bytes) to find the path to the node
+        const { node, stack } = await this.findPath(key.slice(0, 31));
+        const proof = stack.map(([node, _]) => node.serialize());
+        if (node !== null) {
+            // If node is found, add node to proof
+            proof.push(node.serialize());
+        }
+        return proof;
+    }
+    /**
+     * The `data` event is given an `Object` that has two properties; the `key` and the `value`. Both should be Uint8Arrays.
+     * @return Returns a [stream](https://nodejs.org/dist/latest-v12.x/docs/api/stream.html#stream_class_stream_readable) of the contents of the `tree`
+     */
+    createReadStream() {
+        throw (0, util_1.EthereumJSErrorWithoutCode)('Not implemented');
+    }
+    /**
+     * Returns a copy of the underlying tree.
+     *
+     * Note on db: the copy will create a reference to the
+     * same underlying database.
+     *
+     * Note on cache: for memory reasons a copy will not
+     * recreate a new LRU cache but initialize with cache
+     * being deactivated.
+     *
+     * @param includeCheckpoints - If true and during a checkpoint, the copy will contain the checkpointing metadata and will use the same scratch as underlying db.
+     */
+    shallowCopy(includeCheckpoints = true) {
+        const tree = new BinaryTree({
+            ...this._opts,
+            db: this._db.db.shallowCopy(),
+            root: this.root(),
+            cacheSize: 0,
+        });
+        if (includeCheckpoints && this.hasCheckpoints()) {
+            tree._db.setCheckpoints(this._db.checkpoints);
+        }
+        return tree;
+    }
+    /**
+     * Persists the root hash in the underlying database
+     */
+    async persistRoot() {
+        if (this._opts.useRootPersistence === true) {
+            await this._db.put(types_ts_1.ROOT_DB_KEY, this.root());
+        }
+    }
+    /**
+     * Is the tree during a checkpoint phase?
+     */
+    hasCheckpoints() {
+        return this._db.hasCheckpoints();
+    }
+    /**
+     * Creates a checkpoint that can later be reverted to or committed.
+     * After this is called, all changes can be reverted until `commit` is called.
+     */
+    checkpoint() {
+        this._db.checkpoint(this.root());
+    }
+    /**
+     * Commits a checkpoint to disk, if current checkpoint is not nested.
+     * If nested, only sets the parent checkpoint as current checkpoint.
+     * @throws If not during a checkpoint phase
+     */
+    async commit() {
+        if (!this.hasCheckpoints()) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('trying to commit when not checkpointed');
+        }
+        await this._lock.acquire();
+        await this._db.commit();
+        await this.persistRoot();
+        this._lock.release();
+    }
+    /**
+     * Reverts the tree to the state it was at when `checkpoint` was first called.
+     * If during a nested checkpoint, sets root to most recent checkpoint, and sets
+     * parent checkpoint as current.
+     */
+    async revert() {
+        if (!this.hasCheckpoints()) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('trying to revert when not checkpointed');
+        }
+        await this._lock.acquire();
+        this.root(await this._db.revert());
+        await this.persistRoot();
+        this._lock.release();
+    }
+    /**
+     * Flushes all checkpoints, restoring the initial checkpoint state.
+     */
+    flushCheckpoints() {
+        this._db.checkpoints = [];
+    }
+    hash(msg) {
+        // As per spec, if value is null or a 64-byte array of 0s, hash(msg) is a 32-byte array of 0s
+        if (msg === null || (msg.length === 64 && msg.every((byte) => byte === 0))) {
+            return new Uint8Array(32);
+        }
+        if (msg.length !== 32 && msg.length !== 64) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('Data must be 32 or 64 bytes');
+        }
+        return Uint8Array.from(this._opts.hashFunction.call(undefined, msg));
+    }
+    merkelize(node) {
+        if (node === null) {
+            return new Uint8Array(32);
+        }
+        if ((0, util_ts_1.isInternalBinaryNode)(node)) {
+            const [leftChild, rightChild] = node.children;
+            return this.hash((0, util_1.concatBytes)(leftChild === null ? this.hash(null) : leftChild.hash, rightChild === null ? this.hash(null) : rightChild.hash));
+        }
+        // Otherwise, it's a stem node.
+        // Map each value in node.values through the hash function.
+        let currentLayerHashes = node.values.map((value) => this.hash(value));
+        // While there is more than one hash at the current layer, combine them pairwise.
+        while (currentLayerHashes.length > 1) {
+            const newLayerHashes = [];
+            for (let i = 0; i < currentLayerHashes.length; i += 2) {
+                newLayerHashes.push(this.hash((0, util_1.concatBytes)(currentLayerHashes[i], currentLayerHashes[i + 1])));
+            }
+            currentLayerHashes = newLayerHashes;
+        }
+        // Return the hash of the concatenation of node.stem appended with 00 and the final level hash.
+        return this.hash((0, util_1.concatBytes)((0, util_1.setLengthRight)(node.stem, 32), currentLayerHashes[0]));
+    }
+}
+exports.BinaryTree = BinaryTree;
+//# sourceMappingURL=binaryTree.js.map

package/dist/cjs/binaryTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binaryTree.js","sourceRoot":"","sources":["../../src/binaryTree.ts"],"names":[],"mappings":";;;AAAA,2CAYyB;AACzB,iCAAyB;AAEzB,4CAA4C;AAC5C,4DAA2D;AAC3D,oDAAmD;AACnD,4CAAyF;AACzF,yCAA6D;AAY7D;;;;;;GAMG;AACH,MAAa,UAAU;IAerB;;;;;OAKG;IACH,YAAY,IAAoB;QAZtB,UAAK,GAAG,IAAI,WAAI,EAAE,CAAA;QAIlB,WAAM,GAAa,IAAA,eAAK,EAAC,cAAc,CAAC,CAAA;QAShD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;QAEjB,IAAI,IAAI,CAAC,EAAE,YAAY,uBAAY,EAAE,CAAC;YACpC,MAAM,IAAA,iCAA0B,EAAC,4CAA4C,CAAC,CAAA;QAChF,CAAC;QACD,IAAI,CAAC,GAAG,GAAG,IAAI,uBAAY,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAA;QAEvE,IAAI,CAAC,eAAe,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAA;QACzC,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,eAAe,CAAA;QAEjC,IAAI,IAAI,EAAE,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACtB,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,IAAA,qBAAc,EAAC,OAAO,CAAC,CAAA;QACpC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;YACrB,CAAC,CAAC,CAAC,OAAe,EAAE,aAAuB,EAAE,EAAE,EAAE;gBAC7C,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;gBACrB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;oBAC9B,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACxB,CAAC;gBACD,GAAG,CAAC,OAAO,CAAC,CAAA;YACd,CAAC;YACH,CAAC,CAAC,CAAC,GAAG,CAAM,EAAE,EAAE,GAAE,CAAC,CAAA;QAErB,IAAI,CAAC,KAAK;YACR,IAAI,CAAC,KAAK,CAAC;eACF,IAAA,iBAAU,EAAC,IAAI,CAAC,KAAK,CAAC;qBAChB,IAAI,CAAC,KAAK,CAAC,kBAAkB;oBAC9B,IAAI,CAAC,KAAK,CAAC,SAAS;wBAChB,CAAC,CAAA;IACvB,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAyB;QAC5B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACnB,KAAK,GAAG,IAAI,CAAC,eAAe,CAAA;YAC9B,CAAC;YAED,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACnC,MAAM,IAAA,iCAA0B,EAAC,kCAAkC,IAAI,CAAC,QAAQ,QAAQ,CAAC,CAAA;YAC3F,CAAC;YAED,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QACpB,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,IAAgB;QAC9B,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACtC,OAAO,KAAK,KAAK,SAAS,CAAA;QAC5B,CAAC;QAAC,OAAO,KAAU,EAAE,CAAC;YACpB,IAAI,KAAK,CAAC,OAAO,KAAK,oBAAoB,EAAE,CAAC;gBAC3C,OAAO,IAAA,kBAAW,EAAC,IAAI,EAAE,IAAI,CAAC,eAAe,CAAC,CAAA;YAChD,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,GAAG,CAAC,IAAgB,EAAE,QAAkB;QAC5C,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE;YACpB,MAAM,IAAA,iCAA0B,EAAC,qCAAqC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;QACtF,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,IAAA,iBAAU,EAAC,IAAI,CAAC,aAAa,QAAQ,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;QACnF,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QAC1C,IAAI,QAAQ,CAAC,IAAI,YAAY,4BAAc,EAAE,CAAC;YAC5C,oEAAoE;YACpE,qDAAqD;YACrD,MAAM,MAAM,GAAG,EAAE,CAAA;YACjB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;gBAC5C,IAAI,CAAC,KAAK;oBACR,IAAI,CAAC,KAAK,CAAC,WAAW,MAAM,YAAY,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAA,iBAAU,EAAC,KAAK,CAAC,EAAE,EAAE;wBACrF,KAAK;qBACN,CAAC,CAAA;gBACJ,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACpB,CAAC;YACD,OAAO,MAAM,CAAA;QACf,CAAC;QAED,OAAO,EAAE,CAAA;IACX,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,GAAG,CAAC,IAAgB,EAAE,QAAkB,EAAE,MAA6B;QAC3E,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE;YACpB,MAAM,IAAA,iCAA0B,EAAC,qCAAqC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;QACtF,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM;YACxD,MAAM,IAAA,iCAA0B,EAC9B,8BAA8B,MAAM,CAAC,MAAM,kCAAkC,QAAQ,CAAC,MAAM,GAAG,CAChG,CAAA;QAEH,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,IAAA,iBAAU,EAAC,IAAI,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;QAC9D,MAAM,QAAQ,GAAsC,EAAE,CAAA,CAAC,mGAAmG;QAE1J,uCAAuC;QACvC,IAAI,IAAA,kBAAW,EAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;YACrD,OAAM;QACR,CAAC;QAED,sEAAsE;QACtE,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QAE3C,mDAAmD;QACnD,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAC9B,MAAM,IAAA,iCAA0B,EAAC,6BAA6B,CAAC,CAAA;QAEjE,yCAAyC;QACzC,IAAI,QAAwB,CAAA;QAC5B,+DAA+D;QAC/D,IACE,SAAS,CAAC,IAAI;YACd,IAAA,0BAAgB,EAAC,SAAS,CAAC,IAAI,CAAC;YAChC,IAAA,kBAAW,EAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EACtC,CAAC;YACD,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAA;QAC3B,CAAC;aAAM,CAAC;YACN,2CAA2C;YAC3C,QAAQ,GAAG,4BAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACtC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,oCAAoC,IAAA,iBAAU,EAAC,IAAI,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;QAC3F,CAAC;QAED,qCAAqC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;YAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;YACvB,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;YAChC,IAAI,CAAC,KAAK;gBACR,IAAI,CAAC,KAAK,CACR,6BAA6B,MAAM,cAAc,KAAK,YAAY,UAAU,CAAC,CAAC,CAAC,IAAA,iBAAU,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,4BAA4B,IAAA,iBAAU,EAAC,IAAI,CAAC,EAAE,EACtJ,CAAC,KAAK,CAAC,CACR,CAAA;QACL,CAAC;QAED,2DAA2D;QAC3D,IAAI,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,EAAE,CAAC;YACjD,IAAI,SAAS,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,gCAAgC,IAAA,iBAAU,EAAC,IAAI,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;gBACrF,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA;YACjD,CAAC;iBAAM,CAAC;gBACN,OAAM,CAAC,oBAAoB;YAC7B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,gEAAgE;YAChE,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAA;QACrD,CAAC;QAED,0CAA0C;QAC1C,MAAM,QAAQ,GAAG,IAAA,kBAAW,EAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QAC3C,kFAAkF;QAClF,IAAI,qBAAqB,GAAa,EAAE,CAAA;QAExC,qEAAqE;QACrE,uFAAuF;QACvF,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,oCAAoC;YACpC,MAAM,CAAC,WAAW,EAAE,eAAe,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,EAAG,CAAA;YAC7D,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;YACzE,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,kCAAkC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;YACrE,yCAAyC;YACzC,6EAA6E;YAC7E,mEAAmE;YACnE,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,WAAW,EAAE,eAAe,EAAE,UAAU,CAAC,CAAA;YACrF,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;oBACzD,qBAAqB,GAAG,MAAM,CAAC,UAAU,CAAA;gBAC3C,CAAC;YACH,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,OAAO,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,EAAG,CAAA;YAC3C,IAAI,IAAA,8BAAoB,EAAC,IAAI,CAAC,EAAE,CAAC;gBAC/B,2FAA2F;gBAC3F,IAAI,CAAC,QAAQ,CAAC,qBAAqB,CAAC,qBAAqB,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;oBACrE,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,oCAAoC;oBAC5E,IAAI,EAAE,qBAAqB;iBAC5B,CAAC,CAAA;gBACF,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA,CAAC,uCAAuC;gBACnF,qBAAqB,GAAG,IAAI,CAAA;gBAC5B,IAAI,CAAC,KAAK;oBACR,IAAI,CAAC,KAAK,CAAC,8CAA8C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;YACvF,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAA,iCAA0B,EAC9B,kCAAkC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,IAAI,EAAE,CAChE,CAAA;YACH,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,IAAI,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC,CAAC,CAAC,CAAA,CAAC,iBAAiB;QAC1D,MAAM,cAAc,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAEvD,IAAI,IAAA,0BAAgB,EAAC,QAAQ,CAAC,EAAE,CAAC;YAC/B,+EAA+E;YAC/E,sFAAsF;YACtF,mFAAmF;YACnF,+DAA+D;YAC/D,IAAI,CAAC,IAAA,kBAAW,EAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,kDAAkD,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;gBACrF,MAAM,QAAQ,GAAG,IAAA,kBAAW,EAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;gBAC3C,MAAM,kBAAkB,GAAG,IAAA,yBAAkB,EAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;gBACjE,+CAA+C;gBAC/C,MAAM,SAAS,GAAG,oCAAkB,CAAC,MAAM,EAAE,CAAA;gBAC7C,MAAM,YAAY,GAAG,QAAQ,CAAC,kBAAkB,CAAC,CAAA;gBACjD,MAAM,iBAAiB,GAAG,QAAQ,CAAC,kBAAkB,CAAC,CAAA;gBACtD,SAAS,CAAC,QAAQ,CAAC,YAAY,EAAE;oBAC/B,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;oBAC9B,IAAI,EAAE,QAAQ;iBACf,CAAC,CAAA;gBACF,SAAS,CAAC,QAAQ,CAAC,iBAAiB,EAAE;oBACpC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;oBAC9B,IAAI,EAAE,QAAQ;iBACf,CAAC,CAAA;gBAEF,IAAI,OAAO,GAAG,SAAS,CAAA;gBAEvB,8EAA8E;gBAC9E,8CAA8C;gBAC9C,KAAK,IAAI,KAAK,GAAG,kBAAkB,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;oBAC7D,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,mCAAmC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;oBAC7E,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAA;oBACjD,MAAM,MAAM,GAAG,oCAAkB,CAAC,MAAM,EAAE,CAAA;oBAC1C,oFAAoF;oBACpF,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;wBAC/B,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;wBAC7B,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;qBACnC,CAAC,CAAA;oBACF,OAAO,GAAG,MAAM,CAAA;gBAClB,CAAC;gBACD,kFAAkF;gBAClF,qEAAqE;gBACrE,QAAQ,GAAG,OAAO,CAAA;YACpB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,oFAAoF;YACpF,IAAI,cAAc,KAAK,IAAI,EAAE,CAAC;gBAC5B,QAAQ,CAAC,QAAQ,CACf,QAAQ,CAAC,CAAC,CAAC,EACX,cAAc,KAAK,IAAI;oBACrB,CAAC,CAAC;wBACE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC;wBACpC,IAAI,EAAE,IAAA,0BAAgB,EAAC,cAAc,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,qBAAqB;qBAC1E;oBACH,CAAC,CAAC,IAAI,CACT,CAAA;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAA;QACnC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAA;QACrC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,wBAAwB,IAAA,iBAAU,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;QACnF,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAA;IAChC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,YAAY,CACV,QAAwB,EACxB,WAAuB,EACvB,UAAoB,EACpB,YAAsB;QAEtB,MAAM,QAAQ,GAAG,IAAA,kBAAW,EAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QAC3C,IAAI,IAAA,0BAAgB,EAAC,WAAW,CAAC,EAAE,CAAC;YAClC,yDAAyD;YACzD,MAAM,mBAAmB,GAAG,IAAA,kBAAW,EAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACzD,MAAM,SAAS,GAAG,IAAA,yBAAkB,EAAC,QAAQ,EAAE,mBAAmB,CAAC,CAAA;YACnE,MAAM,eAAe,GAAG,IAAA,yBAAkB,EAAC,UAAU,EAAE,YAAY,CAAC,CAAA;YAEpE,MAAM,WAAW,GAAG,oCAAkB,CAAC,MAAM,EAAE,CAAA;YAC/C,0EAA0E;YAC1E,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;gBACxC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;gBAC9B,IAAI,EAAE,QAAQ;aACf,CAAC,CAAA;YAEF,oDAAoD;YACpD,WAAW,CAAC,QAAQ,CAAC,mBAAmB,CAAC,SAAS,CAAC,EAAE;gBACnD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC;gBACjC,IAAI,EAAE,mBAAmB;aAC1B,CAAC,CAAA;YACF,MAAM,QAAQ,GAAG,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC,CAAA;YAElF,IAAI,MAAM,GAAG,WAAW,CAAA;YACxB,KAAK,IAAI,KAAK,GAAG,SAAS,GAAG,CAAC,EAAE,KAAK,GAAG,eAAe,EAAE,KAAK,EAAE,EAAE,CAAC;gBACjE,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,mCAAmC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;gBAC7E,MAAM,SAAS,GAAG,oCAAkB,CAAC,MAAM,EAAE,CAAA;gBAC7C,oFAAoF;gBACpF,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;oBAClC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;oBAC5B,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;iBACnC,CAAC,CAAA;gBACF,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAA;gBACxE,MAAM,GAAG,SAAS,CAAA;YACpB,CAAC;YAED,0GAA0G;YAC1G,OAAO,QAAQ,CAAA;QACjB,CAAC;aAAM,IAAI,IAAA,8BAAoB,EAAC,WAAW,CAAC,EAAE,CAAC;YAC7C,yFAAyF;YACzF,MAAM,WAAW,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;YAC/C,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE;gBAChC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;gBAC9B,IAAI,EAAE,QAAQ;aACf,CAAC,CAAA;YACF,OAAO,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC,CAAA;QACxD,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,QAAQ,CAAC,UAAsB;QACnC,MAAM,SAAS,GAAG,IAAA,kBAAW,EAAC,UAAU,CAAC,CAAA;QACzC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,sBAAsB,IAAA,iBAAU,EAAC,UAAU,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAA;QACvF,MAAM,MAAM,GAAS;YACnB,IAAI,EAAE,IAAI;YACV,KAAK,EAAE,EAAE;YACT,SAAS,EAAE,SAAS;SACrB,CAAA;QAED,uCAAuC;QACvC,IAAI,IAAA,kBAAW,EAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,eAAe,CAAC;YAAE,OAAO,MAAM,CAAA;QAEjE,qBAAqB;QACrB,IAAI,OAAO,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;QAC7C,IAAI,OAAO,KAAK,SAAS;YAAE,MAAM,IAAA,iCAA0B,EAAC,wBAAwB,CAAC,CAAA;QACrF,MAAM,QAAQ,GAAG,IAAA,0BAAgB,EAAC,OAAO,CAAC,CAAA;QAE1C,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,6BAA6B,IAAA,iBAAU,EAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,CAAA;QAChG,4CAA4C;QAC5C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAA;QAEjC,+CAA+C;QAC/C,IAAI,IAAA,0BAAgB,EAAC,QAAQ,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,0BAA0B,EAAE,CAAC,WAAW,CAAC,CAAC,CAAA;YACnE,IAAI,IAAA,kBAAW,EAAC,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3C,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAA;gBACtB,MAAM,CAAC,SAAS,GAAG,EAAE,CAAA;YACvB,CAAC;YACD,OAAO,MAAM,CAAA;QACf,CAAC;QAED,8FAA8F;QAC9F,IAAI,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;QAE/C,IAAI,QAAQ,GAAG,KAAK,CAAA;QACpB,OAAO,CAAC,QAAQ,EAAE,CAAC;YACjB,IAAI,SAAS,KAAK,IAAI;gBAAE,MAAK;YAE7B,uCAAuC;YACvC,OAAO,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;YAC5C,IAAI,OAAO,KAAK,SAAS;gBACvB,MAAM,IAAA,iCAA0B,EAAC,mBAAmB,SAAS,CAAC,IAAI,EAAE,CAAC,CAAA;YACvE,MAAM,WAAW,GAAG,IAAA,0BAAgB,EAAC,OAAO,CAAC,CAAA;YAE7C,oFAAoF;YACpF,MAAM,iBAAiB,GAAG,IAAA,yBAAkB,EAAC,SAAS,EAAE,SAAS,CAAC,IAAI,CAAC,CAAA;YAEvE,8EAA8E;YAC9E,gFAAgF;YAChF,IACE,iBAAiB,KAAK,SAAS,CAAC,IAAI,CAAC,MAAM;gBAC3C,CAAC,iBAAiB,KAAK,SAAS,CAAC,MAAM,IAAI,IAAA,0BAAgB,EAAC,WAAW,CAAC,CAAC,EACzE,CAAC;gBACD,QAAQ,GAAG,IAAI,CAAA;gBACf,IACE,iBAAiB,KAAK,SAAS,CAAC,MAAM;oBACtC,IAAA,iBAAU,EAAC,SAAS,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,EAC9C,CAAC;oBACD,2BAA2B;oBAC3B,IAAI,CAAC,KAAK;wBACR,IAAI,CAAC,KAAK,CACR,QAAQ,IAAA,iBAAU,EAAC,UAAU,CAAC,8BAA8B,IAAA,iBAAU,EACpE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAC5B,GAAG,EACJ,CAAC,WAAW,CAAC,CACd,CAAA;oBACH,MAAM,CAAC,IAAI,GAAG,WAAW,CAAA;oBACzB,MAAM,CAAC,SAAS,GAAG,EAAE,CAAA;oBACrB,OAAO,MAAM,CAAA;gBACf,CAAC;gBACD,0EAA0E;gBAC1E,MAAM,CAAC,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAA;gBACrD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAA;gBAChD,OAAO,MAAM,CAAA;YACf,CAAC;YACD,mDAAmD;YACnD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAA;YACvE,IAAI,CAAC,KAAK;gBACR,IAAI,CAAC,KAAK,CACR,gBAAgB,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,8BAA8B,IAAA,iBAAU,EAC3F,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAC5B,GAAG,EACJ,CAAC,WAAW,CAAC,CACd,CAAA;YAEH,wEAAwE;YACxE,IAAI,CAAC,IAAA,8BAAoB,EAAC,WAAW,CAAC,EAAE,CAAC;gBACvC,MAAM,CAAC,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAA;gBACrD,QAAQ,GAAG,IAAI,CAAA;gBACf,MAAK;YACP,CAAC;YACD,0EAA0E;YAC1E,MAAM,UAAU,GAAG,SAAS,CAAC,iBAAiB,CAAC,CAAA;YAC/C,SAAS,GAAG,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAA;YAC5C,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,MAAM,CAAC,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAA;gBACrD,QAAQ,GAAG,IAAI,CAAA;YACjB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK;YACR,IAAI,CAAC,KAAK,CACR,sBAAsB,IAAA,iBAAU,EAAC,IAAA,kBAAW,EAAC,SAAS,CAAC,KAAK,CAAC,GAAG,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,0CAA0C,EACvI,CAAC,WAAW,CAAC,CACd,CAAA;QACH,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,GAAG,CAAC,IAAgB,EAAE,QAAkB;QAC5C,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,IAAA,iBAAU,EAAC,IAAI,CAAC,iBAAiB,QAAQ,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;QACvF,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;IACvE,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAA;QACrB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,sCAAsC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAA;QAChF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAA;QACnC,MAAM,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAA;QAC/C,OAAM;IACR,CAAC;IAED;;;OAGG;IACO,KAAK,CAAC,kBAAkB,CAChC,IAAgB,EAChB,OAAiB,EACjB,MAA6B;QAE7B,MAAM,WAAW,GAAG,4BAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,WAAW,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QAC7C,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAA;QACtC,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,WAAW,CAAC,SAAS,EAAE,CAAC,CAAA;QACxD,MAAM,IAAI,CAAC,WAAW,EAAE,CAAA;IAC1B,CAAC;IAED;;;;OAIG;IAEH,KAAK,CAAC,SAAS,CAAC,QAA2C;QACzD,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE;YAC3C,OAAO;gBACL,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK;gBACnC,GAAG;gBACH,KAAK,EAAE,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,IAAI;aACnC,CAAA;QACf,CAAC,CAAC,CAAA;QACF,MAAM,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IAC/B,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,iBAAiB,CAAC,GAAe;QACrC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,sBAAsB,IAAA,iBAAU,EAAC,GAAG,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAA;QACnF,8EAA8E;QAE9E,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;QAC7D,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAA;QACxD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,sCAAsC;YACtC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAA;QAC9B,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;OAGG;IACH,gBAAgB;QACd,MAAM,IAAA,iCAA0B,EAAC,iBAAiB,CAAC,CAAA;IACrD,CAAC;IAED;;;;;;;;;;;OAWG;IACH,WAAW,CAAC,kBAAkB,GAAG,IAAI;QACnC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC;YAC1B,GAAG,IAAI,CAAC,KAAK;YACb,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,EAAE;YAC7B,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;YACjB,SAAS,EAAE,CAAC;SACb,CAAC,CAAA;QACF,IAAI,kBAAkB,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC;YAChD,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;QAC/C,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW;QACf,IAAI,IAAI,CAAC,KAAK,CAAC,kBAAkB,KAAK,IAAI,EAAE,CAAC;YAC3C,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,sBAAW,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;QAC9C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,OAAO,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,CAAA;IAClC,CAAC;IAED;;;OAGG;IACH,UAAU;QACR,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;IAClC,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,MAAM;QACV,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAA,iCAA0B,EAAC,wCAAwC,CAAC,CAAA;QAC5E,CAAC;QAED,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAA;QAC1B,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAA;QACvB,MAAM,IAAI,CAAC,WAAW,EAAE,CAAA;QACxB,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAA;IACtB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,MAAM;QACV,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAA,iCAA0B,EAAC,wCAAwC,CAAC,CAAA;QAC5E,CAAC;QAED,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAA;QAC1B,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAA;QAClC,MAAM,IAAI,CAAC,WAAW,EAAE,CAAA;QACxB,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAA;IACtB,CAAC;IAED;;OAEG;IACH,gBAAgB;QACd,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,EAAE,CAAA;IAC3B,CAAC;IAES,IAAI,CAAC,GAAsB;QACnC,6FAA6F;QAC7F,IAAI,GAAG,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3E,OAAO,IAAI,UAAU,CAAC,EAAE,CAAC,CAAA;QAC3B,CAAC;QAED,IAAI,GAAG,CAAC,MAAM,KAAK,EAAE,IAAI,GAAG,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAA,iCAA0B,EAAC,6BAA6B,CAAC,CAAA;QACjE,CAAC;QAED,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAA;IACtE,CAAC;IAES,SAAS,CAAC,IAAuB;QACzC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,IAAI,UAAU,CAAC,EAAE,CAAC,CAAA;QAC3B,CAAC;QAED,IAAI,IAAA,8BAAoB,EAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAA;YAE7C,OAAO,IAAI,CAAC,IAAI,CACd,IAAA,kBAAW,EACT,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EACrD,UAAU,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CACxD,CACF,CAAA;QACH,CAAC;QAED,+BAA+B;QAC/B,2DAA2D;QAC3D,IAAI,kBAAkB,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;QAErE,iFAAiF;QACjF,OAAO,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,EAAE,CAAA;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtD,cAAc,CAAC,IAAI,CACjB,IAAI,CAAC,IAAI,CAAC,IAAA,kBAAW,EAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACzE,CAAA;YACH,CAAC;YACD,kBAAkB,GAAG,cAAc,CAAA;QACrC,CAAC;QAED,+FAA+F;QAC/F,OAAO,IAAI,CAAC,IAAI,CAAC,IAAA,kBAAW,EAAC,IAAA,qBAAc,EAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACrF,CAAC;CACF;AA/rBD,gCA+rBC"}

package/dist/cjs/constructors.d.ts

@@ -0,0 +1,4 @@
+import { BinaryTree } from './binaryTree.ts';
+import type { BinaryTreeOpts } from './types.ts';
+export declare function createBinaryTree(opts?: Partial<BinaryTreeOpts>): Promise<BinaryTree>;
+//# sourceMappingURL=constructors.d.ts.map

package/dist/cjs/constructors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constructors.d.ts","sourceRoot":"","sources":["../../src/constructors.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAA;AAG5C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAA;AAEhD,wBAAsB,gBAAgB,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,uBAmCpE"}