@mdfriday/foundry 0.1.0

package/dist/pkg/doctree/nodeshifttree.d.ts

@@ -0,0 +1,83 @@
+import { Tree as RadixTree } from '../radix';
+import { Dimension, DimensionFlag } from './dimensions';
+import { LockType, WalkContext } from './support';
+export interface Config<T> {
+    shifter: Shifter<T>;
+}
+export interface Shifter<T> {
+    forEachInDimension(n: T, d: number, f: (t: T) => boolean): void;
+    insert(old: T, newItem: T): T;
+    insertInto(old: T, newItem: T, dimension: Dimension): T;
+    delete(v: T, dimension: Dimension): [boolean, boolean];
+    shift(v: T, dimension: Dimension, exact: boolean): [T, boolean, DimensionFlag];
+}
+export declare class NodeShiftTree<T> {
+    tree: RadixTree;
+    dims: Dimension;
+    shifter: Shifter<T>;
+    private mu;
+    constructor(cfg: Config<T>);
+    static new<T>(cfg: Config<T>): NodeShiftTree<T>;
+    delete(key: string): void;
+    deleteAll(key: string): Promise<void>;
+    deletePrefix(prefix: string): Promise<number>;
+    private deleteInternal;
+    deletePrefixAll(prefix: string): Promise<number>;
+    increment(d: number): NodeShiftTree<T>;
+    insertIntoCurrentDimension(s: string, v: T): [T, boolean];
+    insertIntoValuesDimension(s: string, v: T): [T, boolean];
+    insertRawWithLock(s: string, v: any): [any, boolean];
+    insertWithLock(s: string, v: T): [T, boolean];
+    len(): number;
+    canLock(): boolean;
+    lock(writable: boolean): () => void;
+    longestPrefix(s: string, exact: boolean, predicate?: (v: T) => boolean): [string, T];
+    longestPrefixAll(s: string): [string, boolean];
+    getRaw(s: string): [T, boolean];
+    walkPrefixRaw(prefix: string, walker: (key: string, value: T) => Promise<boolean>): Promise<void>;
+    shape(d: number, v: number): NodeShiftTree<T>;
+    toString(): string;
+    get(s: string): T;
+    forEachInDimension(s: string, d: number, f: (t: T) => boolean): void;
+    has(s: string): boolean;
+    private clone;
+    private shift;
+    private getInternal;
+}
+export type WalkFunc<T> = (key: string, value: T) => [boolean, Error | null];
+export interface NodeShiftTreeWalkerConfig<T> {
+    tree: NodeShiftTree<T>;
+    handle: (s: string, v: T, exact: DimensionFlag) => Promise<[boolean, Error | null]>;
+    prefix?: string;
+    lockType?: LockType;
+    noShift?: boolean;
+    exact?: boolean;
+    debug?: boolean;
+    walkContext?: WalkContext<T> | undefined;
+}
+export declare class NodeShiftTreeWalker<T> {
+    tree: NodeShiftTree<T>;
+    handle: (s: string, v: T, exact: DimensionFlag) => Promise<[boolean, Error | null]>;
+    prefix: string;
+    lockType: LockType;
+    noShift: boolean;
+    exact: boolean;
+    debug: boolean;
+    walkContext?: WalkContext<T> | undefined;
+    private skipPrefixes;
+    constructor(config: NodeShiftTreeWalkerConfig<T>);
+    extend(): NodeShiftTreeWalker<T>;
+    skipPrefix(...prefixes: string[]): void;
+    shouldSkip(s: string): boolean;
+    walk(): Promise<Error | null>;
+    private resetLocalState;
+    private toT;
+}
+export interface WalkConfig<T> {
+    prefix?: string;
+    callback: (ctx: WalkContext<T>, s: string, t: T) => [boolean, Error | null];
+    lockType?: LockType;
+    noShift?: boolean;
+    exact?: boolean;
+}
+//# sourceMappingURL=nodeshifttree.d.ts.map

package/dist/pkg/doctree/nodeshifttree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeshifttree.d.ts","sourceRoot":"","sources":["../../../pkg/doctree/nodeshifttree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,SAAS,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,WAAW,EAA6B,MAAM,WAAW,CAAC;AAE7E,MAAM,WAAW,MAAM,CAAC,CAAC;IAErB,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;CACvB;AAGD,MAAM,WAAW,OAAO,CAAC,CAAC;IAGtB,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,IAAI,CAAC;IAKhE,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC;IAK9B,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,GAAG,CAAC,CAAC;IAGxD,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAKvD,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;CAClF;AAKD,qBAAa,aAAa,CAAC,CAAC;IACjB,IAAI,EAAE,SAAS,CAAC;IAGhB,IAAI,EAAE,SAAS,CAAC;IAChB,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAE3B,OAAO,CAAC,EAAE,CAMR;gBAEU,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;IA0C1B,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;IAI/C,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAInB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAUrC,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAenD,OAAO,CAAC,cAAc;IAahB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IActD,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC;IAItC,0BAA0B,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC;IAUzD,yBAAyB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC;IAUxD,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC;IASpD,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC;IAS7C,GAAG,IAAI,MAAM;IAIb,OAAO,IAAI,OAAO;IAUlB,IAAI,CAAC,QAAQ,EAAE,OAAO,GAAG,MAAM,IAAI;IAiBnC,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IAgCpF,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC;IAK9C,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC;IASzB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAOvG,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC;IAM7C,QAAQ,IAAI,MAAM;IAIlB,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC;IAKjB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,IAAI;IASpE,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAKvB,OAAO,CAAC,KAAK;IAOb,OAAO,CAAC,KAAK;IAKb,OAAO,CAAC,WAAW;CAUtB;AAED,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;AAE7E,MAAM,WAAW,yBAAyB,CAAC,CAAC;IAExC,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IAIvB,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,aAAa,KAAK,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;IAGpF,MAAM,CAAC,EAAE,MAAM,CAAC;IAGhB,QAAQ,CAAC,EAAE,QAAQ,CAAC;IAGpB,OAAO,CAAC,EAAE,OAAO,CAAC;IAGlB,KAAK,CAAC,EAAE,OAAO,CAAC;IAGhB,KAAK,CAAC,EAAE,OAAO,CAAC;IAGhB,WAAW,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;CAC5C;AAED,qBAAa,mBAAmB,CAAC,CAAC;IAE9B,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IAGvB,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,aAAa,KAAK,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;IAGpF,MAAM,EAAE,MAAM,CAAC;IAGf,QAAQ,EAAE,QAAQ,CAAC;IAGnB,OAAO,EAAE,OAAO,CAAC;IAGjB,KAAK,EAAE,OAAO,CAAC;IAGf,KAAK,EAAE,OAAO,CAAC;IAGf,WAAW,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAGzC,OAAO,CAAC,YAAY,CAAgB;gBAExB,MAAM,EAAE,yBAAyB,CAAC,CAAC,CAAC;IAkBhD,MAAM,IAAI,mBAAmB,CAAC,CAAC,CAAC;IAgBhC,UAAU,CAAC,GAAG,QAAQ,EAAE,MAAM,EAAE,GAAG,IAAI;IAKvC,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IASxB,IAAI,IAAI,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC;IA0CnC,OAAO,CAAC,eAAe;IAIvB,OAAO,CAAC,GAAG;CAQd;AAED,MAAM,WAAW,UAAU,CAAC,CAAC;IAEzB,MAAM,CAAC,EAAE,MAAM,CAAC;IAIhB,QAAQ,EAAE,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;IAG5E,QAAQ,CAAC,EAAE,QAAQ,CAAC;IAGpB,OAAO,CAAC,EAAE,OAAO,CAAC;IAIlB,KAAK,CAAC,EAAE,OAAO,CAAC;CACnB"}

package/dist/pkg/doctree/nodeshifttree.js

@@ -0,0 +1,363 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.NodeShiftTreeWalker = exports.NodeShiftTree = void 0;
+const radix_1 = require("../radix");
+const dimensions_1 = require("./dimensions");
+const support_1 = require("./support");
+// NodeShiftTree is the root of a tree that can be shaped using the Shape method.
+// Note that multiple shapes of the same tree is meant to be used concurrently,
+// so use the applicable locking when needed.
+class NodeShiftTree {
+    constructor(cfg) {
+        if (!cfg.shifter) {
+            throw new Error("Shifter is required");
+        }
+        this.shifter = cfg.shifter;
+        this.tree = new radix_1.Tree();
+        this.dims = [0]; // Initialize with default dimension
+        // Simple mutex implementation
+        let locked = false;
+        let readLocks = 0;
+        this.mu = {
+            lock: () => {
+                while (locked || readLocks > 0) {
+                    // Busy wait
+                }
+                locked = true;
+            },
+            unlock: () => {
+                locked = false;
+            },
+            rLock: () => {
+                while (locked) {
+                    // Busy wait
+                }
+                readLocks++;
+            },
+            rUnlock: () => {
+                readLocks--;
+            },
+            tryLock: () => {
+                if (locked || readLocks > 0) {
+                    return false;
+                }
+                locked = true;
+                return true;
+            }
+        };
+    }
+    static new(cfg) {
+        return new NodeShiftTree(cfg);
+    }
+    delete(key) {
+        this.deleteInternal(key);
+    }
+    async deleteAll(key) {
+        await this.tree.walkPrefix(key, (k, value) => {
+            const [v, ok] = this.tree.delete(k);
+            if (ok) {
+                // Note: stale.MarkStale(v) is ignored as per requirements
+            }
+            return Promise.resolve(false);
+        });
+    }
+    async deletePrefix(prefix) {
+        let count = 0;
+        const keys = [];
+        await this.tree.walkPrefix(prefix, (key, value) => {
+            keys.push(key);
+            return Promise.resolve(false);
+        });
+        for (const key of keys) {
+            if (this.deleteInternal(key)) {
+                count++;
+            }
+        }
+        return count;
+    }
+    deleteInternal(key) {
+        let wasDeleted = false;
+        const [v, ok] = this.tree.get(key);
+        if (ok) {
+            const [deleted, isEmpty] = this.shifter.delete(v, this.dims);
+            wasDeleted = deleted;
+            if (isEmpty) {
+                this.tree.delete(key);
+            }
+        }
+        return wasDeleted;
+    }
+    async deletePrefixAll(prefix) {
+        let count = 0;
+        await this.tree.walkPrefix(prefix, (key, value) => {
+            const [v, ok] = this.tree.delete(key);
+            if (ok) {
+                // Note: stale.MarkStale(v) is ignored as per requirements
+                count++;
+            }
+            return Promise.resolve(false);
+        });
+        return count;
+    }
+    // Increment the value of dimension d by 1.
+    increment(d) {
+        return this.shape(d, this.dims[d] + 1);
+    }
+    insertIntoCurrentDimension(s, v) {
+        s = (0, support_1.mustValidateKey)((0, support_1.cleanKey)(s));
+        const [vv, ok] = this.tree.get(s);
+        if (ok) {
+            v = this.shifter.insertInto(vv, v, this.dims);
+        }
+        this.tree.insert(s, v);
+        return [v, true];
+    }
+    insertIntoValuesDimension(s, v) {
+        s = (0, support_1.mustValidateKey)((0, support_1.cleanKey)(s));
+        const [vv, ok] = this.tree.get(s);
+        if (ok) {
+            v = this.shifter.insert(vv, v);
+        }
+        this.tree.insert(s, v);
+        return [v, true];
+    }
+    insertRawWithLock(s, v) {
+        this.mu.lock();
+        try {
+            return this.tree.insert(s, v);
+        }
+        finally {
+            this.mu.unlock();
+        }
+    }
+    insertWithLock(s, v) {
+        this.mu.lock();
+        try {
+            return this.insertIntoValuesDimension(s, v);
+        }
+        finally {
+            this.mu.unlock();
+        }
+    }
+    len() {
+        return this.tree.len();
+    }
+    canLock() {
+        const ok = this.mu.tryLock();
+        if (ok) {
+            this.mu.unlock();
+        }
+        return ok;
+    }
+    // Lock locks the data store for read or read/write access until commit is invoked.
+    // Note that Root is not thread-safe outside of this transaction construct.
+    lock(writable) {
+        if (writable) {
+            this.mu.lock();
+        }
+        else {
+            this.mu.rLock();
+        }
+        return () => {
+            if (writable) {
+                this.mu.unlock();
+            }
+            else {
+                this.mu.rUnlock();
+            }
+        };
+    }
+    // LongestPrefix finds the longest prefix of s that exists in the tree that also matches the predicate (if set).
+    // Set exact to true to only match exact in the current dimension (e.g. language).
+    longestPrefix(s, exact, predicate) {
+        let currentPath = s;
+        while (true) {
+            const [longestPrefix, v, found] = this.tree.longestPrefix(currentPath);
+            if (found) {
+                const [t, ok] = this.shift(v, exact);
+                if (ok && (!predicate || predicate(t))) {
+                    return [longestPrefix, t];
+                }
+            }
+            if (currentPath === '' || currentPath === '/') {
+                const zero = undefined;
+                return ['', zero];
+            }
+            // Walk up to find a node in the correct dimension.
+            const lastSlash = currentPath.lastIndexOf('/');
+            if (lastSlash === 0) {
+                currentPath = '';
+            }
+            else if (lastSlash > 0) {
+                currentPath = currentPath.substring(0, lastSlash);
+            }
+            else {
+                break;
+            }
+        }
+        const zero = undefined;
+        return ['', zero];
+    }
+    // LongestPrefixAll returns the longest prefix considering all tree dimensions.
+    longestPrefixAll(s) {
+        const [key, , found] = this.tree.longestPrefix(s);
+        return [key, found];
+    }
+    getRaw(s) {
+        const [v, ok] = this.tree.get(s);
+        if (!ok) {
+            const zero = undefined;
+            return [zero, false];
+        }
+        return [v, true];
+    }
+    async walkPrefixRaw(prefix, walker) {
+        await this.tree.walkPrefix(prefix, (key, value) => {
+            return walker(key, value);
+        });
+    }
+    // Shape the tree for dimension d to value v.
+    shape(d, v) {
+        const x = this.clone();
+        x.dims[d] = v;
+        return x;
+    }
+    toString() {
+        return `Root{${this.dims}}`;
+    }
+    get(s) {
+        const [t] = this.getInternal(s);
+        return t;
+    }
+    forEachInDimension(s, d, f) {
+        s = (0, support_1.cleanKey)(s);
+        const [v, ok] = this.tree.get(s);
+        if (!ok) {
+            return;
+        }
+        this.shifter.forEachInDimension(v, d, f);
+    }
+    has(s) {
+        const [, ok] = this.getInternal(s);
+        return ok;
+    }
+    clone() {
+        const cloned = Object.create(NodeShiftTree.prototype);
+        Object.assign(cloned, this);
+        cloned.dims = [...this.dims];
+        return cloned;
+    }
+    shift(t, exact) {
+        const [shifted, ok] = this.shifter.shift(t, this.dims, exact);
+        return [shifted, ok];
+    }
+    getInternal(s) {
+        s = (0, support_1.cleanKey)(s);
+        const [v, ok] = this.tree.get(s);
+        if (!ok) {
+            const zero = undefined;
+            return [zero, false];
+        }
+        const [t, success] = this.shift(v, true);
+        return [t, success];
+    }
+}
+exports.NodeShiftTree = NodeShiftTree;
+class NodeShiftTreeWalker {
+    constructor(config) {
+        // Local state.
+        this.skipPrefixes = [];
+        if (!config.tree) {
+            throw new Error("Tree is required");
+        }
+        this.tree = config.tree;
+        this.handle = config.handle;
+        this.prefix = config.prefix || '';
+        this.lockType = config.lockType || support_1.LockType.LockTypeNone;
+        this.noShift = config.noShift || false;
+        this.exact = config.exact || false;
+        this.debug = config.debug || false;
+        this.walkContext = config.walkContext;
+    }
+    // Extend returns a new NodeShiftTreeWalker with the same configuration as the
+    // and the same WalkContext as the original.
+    // Any local state is reset.
+    extend() {
+        const extended = new NodeShiftTreeWalker({
+            tree: this.tree,
+            handle: this.handle,
+            prefix: this.prefix,
+            lockType: this.lockType,
+            noShift: this.noShift,
+            exact: this.exact,
+            debug: this.debug,
+            walkContext: this.walkContext
+        });
+        extended.resetLocalState();
+        return extended;
+    }
+    // SkipPrefix adds a prefix to be skipped in the walk.
+    skipPrefix(...prefixes) {
+        this.skipPrefixes.push(...prefixes);
+    }
+    // ShouldSkip returns whether the given key should be skipped in the walk.
+    shouldSkip(s) {
+        for (const prefix of this.skipPrefixes) {
+            if (s.startsWith(prefix)) {
+                return true;
+            }
+        }
+        return false;
+    }
+    async walk() {
+        this.resetLocalState();
+        let commit = null;
+        if (this.lockType > support_1.LockType.LockTypeNone) {
+            commit = this.tree.lock(this.lockType === support_1.LockType.LockTypeWrite);
+        }
+        try {
+            let err = null;
+            const fnMain = async (s, v) => {
+                if (this.shouldSkip(s)) {
+                    return false;
+                }
+                const [t, ok, exact] = this.toT(this.tree, v);
+                if (!ok) {
+                    return false;
+                }
+                const [terminate, error] = await this.handle(s, t, exact);
+                if (terminate || error) {
+                    err = error;
+                    return true;
+                }
+                return false;
+            };
+            if (this.prefix !== '') {
+                await this.tree.tree.walkPrefix(this.prefix, fnMain);
+            }
+            else {
+                await this.tree.tree.walk(fnMain);
+            }
+            return err;
+        }
+        finally {
+            if (commit) {
+                commit();
+            }
+        }
+    }
+    resetLocalState() {
+        this.skipPrefixes = [];
+    }
+    toT(tree, v) {
+        if (this.noShift) {
+            return [v, true, dimensions_1.DimensionFlag.DimensionNone];
+        }
+        else {
+            const [t, ok, exact] = tree.shifter.shift(v, tree.dims, this.exact);
+            return [t, ok, exact];
+        }
+    }
+}
+exports.NodeShiftTreeWalker = NodeShiftTreeWalker;
+//# sourceMappingURL=nodeshifttree.js.map

package/dist/pkg/doctree/nodeshifttree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeshifttree.js","sourceRoot":"","sources":["../../../pkg/doctree/nodeshifttree.ts"],"names":[],"mappings":";;;AAAA,oCAA6C;AAC7C,6CAAwD;AACxD,uCAA6E;AAgC7E,iFAAiF;AACjF,+EAA+E;AAC/E,6CAA6C;AAC7C,MAAa,aAAa;IAetB,YAAY,GAAc;QACtB,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC3C,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC;QAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,YAAS,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAoC;QAErD,8BAA8B;QAC9B,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,IAAI,CAAC,EAAE,GAAG;YACN,IAAI,EAAE,GAAG,EAAE;gBACP,OAAO,MAAM,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;oBAC7B,YAAY;gBAChB,CAAC;gBACD,MAAM,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,EAAE,GAAG,EAAE;gBACT,MAAM,GAAG,KAAK,CAAC;YACnB,CAAC;YACD,KAAK,EAAE,GAAG,EAAE;gBACR,OAAO,MAAM,EAAE,CAAC;oBACZ,YAAY;gBAChB,CAAC;gBACD,SAAS,EAAE,CAAC;YAChB,CAAC;YACD,OAAO,EAAE,GAAG,EAAE;gBACV,SAAS,EAAE,CAAC;YAChB,CAAC;YACD,OAAO,EAAE,GAAG,EAAE;gBACV,IAAI,MAAM,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;oBAC1B,OAAO,KAAK,CAAC;gBACjB,CAAC;gBACD,MAAM,GAAG,IAAI,CAAC;gBACd,OAAO,IAAI,CAAC;YAChB,CAAC;SACJ,CAAC;IACN,CAAC;IAED,MAAM,CAAC,GAAG,CAAI,GAAc;QACxB,OAAO,IAAI,aAAa,CAAI,GAAG,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,GAAW;QACd,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,GAAW;QACvB,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAS,EAAE,KAAU,EAAoB,EAAE;YACxE,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,EAAE,EAAE,CAAC;gBACL,0DAA0D;YAC9D,CAAC;YACD,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACP,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,MAAc;QAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,GAAW,EAAE,KAAU,EAAoB,EAAE;YAC7E,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3B,KAAK,EAAE,CAAC;YACZ,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAEO,cAAc,CAAC,GAAW;QAC9B,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,EAAE,EAAE,CAAC;YACL,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAClE,UAAU,GAAG,OAAO,CAAC;YACrB,IAAI,OAAO,EAAE,CAAC;gBACV,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC1B,CAAC;QACL,CAAC;QACD,OAAO,UAAU,CAAC;IACtB,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,MAAc;QAChC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,GAAW,EAAE,KAAU,EAAoB,EAAE;YAC7E,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACtC,IAAI,EAAE,EAAE,CAAC;gBACL,0DAA0D;gBAC1D,KAAK,EAAE,CAAC;YACZ,CAAC;YACD,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,2CAA2C;IAC3C,SAAS,CAAC,CAAS;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,0BAA0B,CAAC,CAAS,EAAE,CAAI;QACtC,CAAC,GAAG,IAAA,yBAAe,EAAC,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,EAAE,EAAE,CAAC;YACL,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAO,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvB,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,yBAAyB,CAAC,CAAS,EAAE,CAAI;QACrC,CAAC,GAAG,IAAA,yBAAe,EAAC,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,EAAE,EAAE,CAAC;YACL,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAO,EAAE,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvB,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,iBAAiB,CAAC,CAAS,EAAE,CAAM;QAC/B,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACf,IAAI,CAAC;YACD,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC;gBAAS,CAAC;YACP,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC;QACrB,CAAC;IACL,CAAC;IAED,cAAc,CAAC,CAAS,EAAE,CAAI;QAC1B,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACf,IAAI,CAAC;YACD,OAAO,IAAI,CAAC,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,CAAC;gBAAS,CAAC;YACP,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC;QACrB,CAAC;IACL,CAAC;IAED,GAAG;QACC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;IAC3B,CAAC;IAED,OAAO;QACH,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC;QAC7B,IAAI,EAAE,EAAE,CAAC;YACL,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC;QACrB,CAAC;QACD,OAAO,EAAE,CAAC;IACd,CAAC;IAED,mFAAmF;IACnF,2EAA2E;IAC3E,IAAI,CAAC,QAAiB;QAClB,IAAI,QAAQ,EAAE,CAAC;YACX,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACnB,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;QACpB,CAAC;QACD,OAAO,GAAG,EAAE;YACR,IAAI,QAAQ,EAAE,CAAC;gBACX,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACJ,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC;YACtB,CAAC;QACL,CAAC,CAAC;IACN,CAAC;IAED,gHAAgH;IAChH,kFAAkF;IAClF,aAAa,CAAC,CAAS,EAAE,KAAc,EAAE,SAA6B;QAClE,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,OAAO,IAAI,EAAE,CAAC;YACV,MAAM,CAAC,aAAa,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;YAEvE,IAAI,KAAK,EAAE,CAAC;gBACR,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAM,EAAE,KAAK,CAAC,CAAC;gBAC1C,IAAI,EAAE,IAAI,CAAC,CAAC,SAAS,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrC,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;gBAC9B,CAAC;YACL,CAAC;YAED,IAAI,WAAW,KAAK,EAAE,IAAI,WAAW,KAAK,GAAG,EAAE,CAAC;gBAC5C,MAAM,IAAI,GAAG,SAAc,CAAC;gBAC5B,OAAO,CAAC,EAAE,EAAE,IAAK,CAAC,CAAC;YACvB,CAAC;YAED,mDAAmD;YACnD,MAAM,SAAS,GAAG,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YAC/C,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBAClB,WAAW,GAAG,EAAE,CAAC;YACrB,CAAC;iBAAM,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBACvB,WAAW,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YACtD,CAAC;iBAAM,CAAC;gBACJ,MAAM;YACV,CAAC;QACL,CAAC;QACD,MAAM,IAAI,GAAG,SAAc,CAAC;QAC5B,OAAO,CAAC,EAAE,EAAE,IAAK,CAAC,CAAC;IACvB,CAAC;IAED,+EAA+E;IAC/E,gBAAgB,CAAC,CAAS;QACtB,MAAM,CAAC,GAAG,EAAE,AAAD,EAAG,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAClD,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,CAAC,CAAS;QACZ,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,EAAE,EAAE,CAAC;YACN,MAAM,IAAI,GAAG,SAAc,CAAC;YAC5B,OAAO,CAAC,IAAK,EAAE,KAAK,CAAC,CAAC;QAC1B,CAAC;QACD,OAAO,CAAC,CAAM,EAAE,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,MAAc,EAAE,MAAmD;QACnF,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,GAAW,EAAE,KAAU,EAAmB,EAAE;YAC5E,OAAO,MAAM,CAAC,GAAG,EAAE,KAAU,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACP,CAAC;IAED,6CAA6C;IAC7C,KAAK,CAAC,CAAS,EAAE,CAAS;QACtB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACvB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,CAAC;IACb,CAAC;IAED,QAAQ;QACJ,OAAO,QAAQ,IAAI,CAAC,IAAI,GAAG,CAAC;IAChC,CAAC;IAED,GAAG,CAAC,CAAS;QACT,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAChC,OAAO,CAAC,CAAC;IACb,CAAC;IAED,kBAAkB,CAAC,CAAS,EAAE,CAAS,EAAE,CAAoB;QACzD,CAAC,GAAG,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,EAAE,EAAE,CAAC;YACN,OAAO;QACX,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,GAAG,CAAC,CAAS;QACT,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACnC,OAAO,EAAE,CAAC;IACd,CAAC;IAEO,KAAK;QACT,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACtD,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAc,CAAC;QAC1C,OAAO,MAAM,CAAC;IAClB,CAAC;IAEO,KAAK,CAAC,CAAI,EAAE,KAAc;QAC9B,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC9D,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACzB,CAAC;IAEO,WAAW,CAAC,CAAS;QACzB,CAAC,GAAG,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,EAAE,EAAE,CAAC;YACN,MAAM,IAAI,GAAG,SAAc,CAAC;YAC5B,OAAO,CAAC,IAAK,EAAE,KAAK,CAAC,CAAC;QAC1B,CAAC;QACD,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAM,EAAE,IAAI,CAAC,CAAC;QAC9C,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACxB,CAAC;CACJ;AAtSD,sCAsSC;AA+BD,MAAa,mBAAmB;IA4B5B,YAAY,MAAoC;QAHhD,eAAe;QACP,iBAAY,GAAa,EAAE,CAAC;QAGhC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;QACxC,CAAC;QAED,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAC5B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,kBAAQ,CAAC,YAAY,CAAC;QACzD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,KAAK,CAAC;QACvC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,KAAK,CAAC;QACnC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,KAAK,CAAC;QACnC,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;IAC1C,CAAC;IAED,8EAA8E;IAC9E,4CAA4C;IAC5C,4BAA4B;IAC5B,MAAM;QACF,MAAM,QAAQ,GAAG,IAAI,mBAAmB,CAAC;YACrC,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,WAAW,EAAE,IAAI,CAAC,WAAW;SAChC,CAAC,CAAC;QACH,QAAQ,CAAC,eAAe,EAAE,CAAC;QAC3B,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED,sDAAsD;IACtD,UAAU,CAAC,GAAG,QAAkB;QAC5B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED,0EAA0E;IAC1E,UAAU,CAAC,CAAS;QAChB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACrC,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,IAAI;QACN,IAAI,CAAC,eAAe,EAAE,CAAC;QAEvB,IAAI,MAAM,GAAwB,IAAI,CAAC;QACvC,IAAI,IAAI,CAAC,QAAQ,GAAG,kBAAQ,CAAC,YAAY,EAAE,CAAC;YACxC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,kBAAQ,CAAC,aAAa,CAAC,CAAC;QACtE,CAAC;QAED,IAAI,CAAC;YACD,IAAI,GAAG,GAAiB,IAAI,CAAC;YAC7B,MAAM,MAAM,GAAG,KAAK,EAAE,CAAS,EAAE,CAAM,EAAoB,EAAE;gBACzD,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrB,OAAO,KAAK,CAAC;gBACjB,CAAC;gBAED,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAC9C,IAAI,CAAC,EAAE,EAAE,CAAC;oBACN,OAAO,KAAK,CAAC;gBACjB,CAAC;gBAED,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC1D,IAAI,SAAS,IAAI,KAAK,EAAE,CAAC;oBACrB,GAAG,GAAG,KAAK,CAAC;oBACZ,OAAO,IAAI,CAAC;gBAChB,CAAC;gBACD,OAAO,KAAK,CAAC;YACjB,CAAC,CAAC;YAEF,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;gBACrB,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACJ,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtC,CAAC;YAED,OAAO,GAAG,CAAC;QACf,CAAC;gBAAS,CAAC;YACP,IAAI,MAAM,EAAE,CAAC;gBACT,MAAM,EAAE,CAAC;YACb,CAAC;QACL,CAAC;IACL,CAAC;IAEO,eAAe;QACnB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;IAC3B,CAAC;IAEO,GAAG,CAAC,IAAsB,EAAE,CAAM;QACtC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,OAAO,CAAC,CAAM,EAAE,IAAI,EAAE,0BAAa,CAAC,aAAa,CAAC,CAAC;QACvD,CAAC;aAAM,CAAC;YACJ,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACzE,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QAC1B,CAAC;IACL,CAAC;CACJ;AAlID,kDAkIC"}

package/dist/pkg/doctree/simpletree.d.ts

@@ -0,0 +1,20 @@
+import { Tree as RadixTree } from '../radix';
+import { LockType } from './support';
+export interface Tree<T> {
+    get(s: string): T;
+    longestPrefix(s: string): [string, T];
+    insert(s: string, v: T): T;
+    walkPrefix(lockType: LockType, s: string, f: (s: string, v: T) => [boolean, Error | null]): Promise<Error | null>;
+}
+export declare function newSimpleTree<T>(): SimpleTree<T>;
+export declare class SimpleTree<T> implements Tree<T> {
+    private mu;
+    tree: RadixTree;
+    private zero;
+    constructor();
+    get(s: string): T;
+    longestPrefix(s: string): [string, T];
+    insert(s: string, v: T): T;
+    walkPrefix(lockType: LockType, s: string, f: (s: string, v: T) => [boolean, Error | null]): Promise<Error | null>;
+}
+//# sourceMappingURL=simpletree.d.ts.map

package/dist/pkg/doctree/simpletree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"simpletree.d.ts","sourceRoot":"","sources":["../../../pkg/doctree/simpletree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,SAAS,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAGrC,MAAM,WAAW,IAAI,CAAC,CAAC;IACnB,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;IAClB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACtC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC3B,UAAU,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;CACrH;AAGD,wBAAgB,aAAa,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAEhD;AAGD,qBAAa,UAAU,CAAC,CAAC,CAAE,YAAW,IAAI,CAAC,CAAC,CAAC;IACzC,OAAO,CAAC,EAAE,CAAmF;IAC7F,IAAI,EAAE,SAAS,CAAC;IAChB,OAAO,CAAC,IAAI,CAAI;;IAkChB,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC;IAajB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IAarC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC;IAUpB,UAAU,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC;CAoC1H"}

package/dist/pkg/doctree/simpletree.js

@@ -0,0 +1,116 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SimpleTree = void 0;
+exports.newSimpleTree = newSimpleTree;
+const radix_1 = require("../radix");
+const support_1 = require("./support");
+// NewSimpleTree creates a new SimpleTree.
+function newSimpleTree() {
+    return new SimpleTree();
+}
+// SimpleTree is a thread safe radix tree that holds T.
+class SimpleTree {
+    constructor() {
+        this.tree = new radix_1.Tree();
+        this.zero = undefined;
+        // Simple mutex implementation for TypeScript
+        let locked = false;
+        let readLocks = 0;
+        this.mu = {
+            lock: () => {
+                // In a real implementation, this would use proper async locking
+                // For now, we'll use a simple synchronous approach
+                while (locked || readLocks > 0) {
+                    // Busy wait - in production, use proper async locks
+                }
+                locked = true;
+            },
+            unlock: () => {
+                locked = false;
+            },
+            rLock: () => {
+                while (locked) {
+                    // Busy wait
+                }
+                readLocks++;
+            },
+            rUnlock: () => {
+                readLocks--;
+            }
+        };
+    }
+    get(s) {
+        this.mu.rLock();
+        try {
+            const [v, ok] = this.tree.get(s);
+            if (ok) {
+                return v;
+            }
+            return this.zero;
+        }
+        finally {
+            this.mu.rUnlock();
+        }
+    }
+    longestPrefix(s) {
+        this.mu.rLock();
+        try {
+            const [key, v, ok] = this.tree.longestPrefix(s);
+            if (ok) {
+                return [key, v];
+            }
+            return ['', this.zero];
+        }
+        finally {
+            this.mu.rUnlock();
+        }
+    }
+    insert(s, v) {
+        this.mu.lock();
+        try {
+            this.tree.insert(s, v);
+            return v;
+        }
+        finally {
+            this.mu.unlock();
+        }
+    }
+    async walkPrefix(lockType, s, f) {
+        switch (lockType) {
+            case support_1.LockType.LockTypeNone:
+                break;
+            case support_1.LockType.LockTypeRead:
+                this.mu.rLock();
+                break;
+            case support_1.LockType.LockTypeWrite:
+                this.mu.lock();
+                break;
+        }
+        try {
+            let err = null;
+            await this.tree.walkPrefix(s, async (key, v) => {
+                const [shouldStop, error] = f(key, v);
+                if (error) {
+                    err = error;
+                    return Promise.resolve(true);
+                }
+                return shouldStop;
+            });
+            return err;
+        }
+        finally {
+            switch (lockType) {
+                case support_1.LockType.LockTypeNone:
+                    break;
+                case support_1.LockType.LockTypeRead:
+                    this.mu.rUnlock();
+                    break;
+                case support_1.LockType.LockTypeWrite:
+                    this.mu.unlock();
+                    break;
+            }
+        }
+    }
+}
+exports.SimpleTree = SimpleTree;
+//# sourceMappingURL=simpletree.js.map

package/dist/pkg/doctree/simpletree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simpletree.js","sourceRoot":"","sources":["../../../pkg/doctree/simpletree.ts"],"names":[],"mappings":";;;AAYA,sCAEC;AAdD,oCAA6C;AAC7C,uCAAqC;AAUrC,0CAA0C;AAC1C,SAAgB,aAAa;IACzB,OAAO,IAAI,UAAU,EAAK,CAAC;AAC/B,CAAC;AAED,uDAAuD;AACvD,MAAa,UAAU;IAKnB;QACI,IAAI,CAAC,IAAI,GAAG,IAAI,YAAS,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,GAAG,SAAc,CAAC;QAE3B,6CAA6C;QAC7C,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,IAAI,CAAC,EAAE,GAAG;YACN,IAAI,EAAE,GAAG,EAAE;gBACP,gEAAgE;gBAChE,mDAAmD;gBACnD,OAAO,MAAM,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;oBAC7B,oDAAoD;gBACxD,CAAC;gBACD,MAAM,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,EAAE,GAAG,EAAE;gBACT,MAAM,GAAG,KAAK,CAAC;YACnB,CAAC;YACD,KAAK,EAAE,GAAG,EAAE;gBACR,OAAO,MAAM,EAAE,CAAC;oBACZ,YAAY;gBAChB,CAAC;gBACD,SAAS,EAAE,CAAC;YAChB,CAAC;YACD,OAAO,EAAE,GAAG,EAAE;gBACV,SAAS,EAAE,CAAC;YAChB,CAAC;SACJ,CAAC;IACN,CAAC;IAED,GAAG,CAAC,CAAS;QACT,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;QAChB,IAAI,CAAC;YACD,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,EAAE,EAAE,CAAC;gBACL,OAAO,CAAM,CAAC;YAClB,CAAC;YACD,OAAO,IAAI,CAAC,IAAI,CAAC;QACrB,CAAC;gBAAS,CAAC;YACP,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC;QACtB,CAAC;IACL,CAAC;IAED,aAAa,CAAC,CAAS;QACnB,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;QAChB,IAAI,CAAC;YACD,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,EAAE,EAAE,CAAC;gBACL,OAAO,CAAC,GAAG,EAAE,CAAM,CAAC,CAAC;YACzB,CAAC;YACD,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;gBAAS,CAAC;YACP,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC;QACtB,CAAC;IACL,CAAC;IAED,MAAM,CAAC,CAAS,EAAE,CAAI;QAClB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACf,IAAI,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvB,OAAO,CAAC,CAAC;QACb,CAAC;gBAAS,CAAC;YACP,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC;QACrB,CAAC;IACL,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,QAAkB,EAAE,CAAS,EAAE,CAA+C;QAC3F,QAAQ,QAAQ,EAAE,CAAC;YACf,KAAK,kBAAQ,CAAC,YAAY;gBACtB,MAAM;YACV,KAAK,kBAAQ,CAAC,YAAY;gBACtB,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;gBAChB,MAAM;YACV,KAAK,kBAAQ,CAAC,aAAa;gBACvB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;gBACf,MAAM;QACd,CAAC;QAED,IAAI,CAAC;YACD,IAAI,GAAG,GAAiB,IAAI,CAAC;YAC7B,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,GAAW,EAAE,CAAM,EAAoB,EAAE;gBAC1E,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAM,CAAC,CAAC;gBAC3C,IAAI,KAAK,EAAE,CAAC;oBACR,GAAG,GAAG,KAAK,CAAC;oBACZ,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACjC,CAAC;gBACD,OAAO,UAAU,CAAC;YACtB,CAAC,CAAC,CAAC;YACH,OAAO,GAAG,CAAC;QACf,CAAC;gBAAS,CAAC;YACP,QAAQ,QAAQ,EAAE,CAAC;gBACf,KAAK,kBAAQ,CAAC,YAAY;oBACtB,MAAM;gBACV,KAAK,kBAAQ,CAAC,YAAY;oBACtB,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC;oBAClB,MAAM;gBACV,KAAK,kBAAQ,CAAC,aAAa;oBACvB,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC;oBACjB,MAAM;YACd,CAAC;QACL,CAAC;IACL,CAAC;CACJ;AA7GD,gCA6GC"}