@procedures/client 0.0.0-stage → 0.1.0

package/dist/collections/impl/hash-set.js

@@ -0,0 +1,264 @@
+/**
+ * HashSet implementation - A set backed by a HashMap.
+ *
+ * Provides O(1) average case for add, remove, and contains operations.
+ * Elements are unique based on custom equality and hash functions.
+ * Mirrors java.util.HashSet.
+ *
+ * @example
+ * const set = hashSet<number>()
+ * set.add(1)
+ * set.add(2)
+ * set.add(1) // Returns false, already present
+ * set.size // 2
+ */
+import { HashMap } from "./hash-map.js";
+import { defaultEq, defaultHash } from "../utils/defaults.js";
+/**
+ * Dummy value used for the HashMap backing the set.
+ */
+const PRESENT = Symbol("PRESENT");
+/**
+ * HashSet<T> - Hash table implementation of the Set interface.
+ *
+ * Backed by a HashMap where values are a dummy constant.
+ * Provides constant-time performance for basic operations.
+ *
+ * Not thread-safe. Use synchronized() behavior for concurrent access.
+ */
+export class HashSet {
+    _map;
+    _eq;
+    constructor(options = {}) {
+        const { initialCapacity = 16, loadFactor = 0.75, eq = defaultEq, hash = defaultHash, } = options;
+        this._eq = eq;
+        this._map = new HashMap({
+            initialCapacity,
+            loadFactor,
+            keyEq: eq,
+            keyHash: hash,
+        });
+    }
+    // ========================================================================
+    // Size
+    // ========================================================================
+    get size() {
+        return this._map.size;
+    }
+    get isEmpty() {
+        return this._map.isEmpty;
+    }
+    get eq() {
+        return this._eq;
+    }
+    // ========================================================================
+    // Core set operations
+    // ========================================================================
+    add(element) {
+        const hadElement = this._map.has(element);
+        this._map.set(element, PRESENT);
+        return !hadElement;
+    }
+    remove(element) {
+        return this._map.delete(element) !== undefined;
+    }
+    contains(element) {
+        return this._map.has(element);
+    }
+    // ========================================================================
+    // Bulk operations
+    // ========================================================================
+    addAll(other) {
+        let modified = false;
+        for (const element of other) {
+            if (this.add(element)) {
+                modified = true;
+            }
+        }
+        return modified;
+    }
+    removeAll(other) {
+        let modified = false;
+        for (const element of other) {
+            if (this.remove(element)) {
+                modified = true;
+            }
+        }
+        return modified;
+    }
+    retainAll(other) {
+        const toRetain = new globalThis.Set(other);
+        const toRemove = [];
+        for (const element of this) {
+            let shouldRetain = false;
+            for (const retainElement of toRetain) {
+                if (this._eq(element, retainElement)) {
+                    shouldRetain = true;
+                    break;
+                }
+            }
+            if (!shouldRetain) {
+                toRemove.push(element);
+            }
+        }
+        let modified = false;
+        for (const element of toRemove) {
+            this.remove(element);
+            modified = true;
+        }
+        return modified;
+    }
+    containsAll(other) {
+        for (const element of other) {
+            if (!this.contains(element)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    clear() {
+        this._map.clear();
+    }
+    // ========================================================================
+    // Set operations (mathematical)
+    // ========================================================================
+    /**
+     * Returns a new set that is the union of this set and the other set.
+     * Contains all elements from both sets.
+     */
+    union(other) {
+        const result = this.clone();
+        result.addAll(other);
+        return result;
+    }
+    /**
+     * Returns a new set that is the intersection of this set and the other set.
+     * Contains only elements present in both sets.
+     */
+    intersection(other) {
+        const result = new HashSet({ eq: this._eq });
+        for (const element of this) {
+            for (const otherElement of other) {
+                if (this._eq(element, otherElement)) {
+                    result.add(element);
+                    break;
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     * Returns a new set that is the difference of this set and the other set.
+     * Contains elements in this set but not in the other set.
+     */
+    difference(other) {
+        const result = this.clone();
+        result.removeAll(other);
+        return result;
+    }
+    /**
+     * Returns a new set that is the symmetric difference of this set and the other set.
+     * Contains elements in either set but not in both.
+     */
+    symmetricDifference(other) {
+        const result = this.union(other);
+        const inter = this.intersection(other);
+        result.removeAll(inter);
+        return result;
+    }
+    /**
+     * Returns true if this set is a subset of the other set.
+     * All elements in this set are also in the other set.
+     */
+    isSubsetOf(other) {
+        const otherSet = new HashSet({ eq: this._eq });
+        otherSet.addAll(other);
+        for (const element of this) {
+            if (!otherSet.contains(element)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * Returns true if this set is a superset of the other set.
+     * All elements in the other set are also in this set.
+     */
+    isSupersetOf(other) {
+        for (const element of other) {
+            if (!this.contains(element)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * Returns true if this set and the other set have no elements in common.
+     */
+    isDisjointFrom(other) {
+        for (const element of other) {
+            if (this.contains(element)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    // ========================================================================
+    // Iteration
+    // ========================================================================
+    *[Symbol.iterator]() {
+        for (const entry of this._map) {
+            yield entry.key;
+        }
+    }
+    forEach(action) {
+        let index = 0;
+        for (const element of this) {
+            action(element, index++);
+        }
+    }
+    toArray() {
+        return Array.from(this);
+    }
+    // ========================================================================
+    // Utility methods
+    // ========================================================================
+    /**
+     * Creates a shallow copy of this set.
+     */
+    clone() {
+        const clone = new HashSet({ eq: this._eq });
+        clone.addAll(this);
+        return clone;
+    }
+    /**
+     * Returns statistics about the underlying hash table.
+     */
+    getStats() {
+        return this._map.getStats();
+    }
+    /**
+     * Returns a string representation for debugging.
+     */
+    toString() {
+        return `HashSet{${this.toArray().join(", ")}}`;
+    }
+}
+/**
+ * Factory function to create a HashSet.
+ *
+ * @example
+ * const set = hashSet<number>()
+ * const setFromArray = hashSet([1, 2, 3, 2, 1]) // {1, 2, 3}
+ * const setWithOptions = hashSet<string>({ initialCapacity: 32 })
+ */
+export function hashSet(optionsOrElements) {
+    // Check if it's an iterable (not options)
+    if (optionsOrElements && Symbol.iterator in optionsOrElements) {
+        const set = new HashSet();
+        set.addAll(optionsOrElements);
+        return set;
+    }
+    return new HashSet(optionsOrElements);
+}
+//# sourceMappingURL=hash-set.js.map

package/dist/collections/impl/hash-set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash-set.js","sourceRoot":"","sources":["../../../src/collections/impl/hash-set.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAE9D;;GAEG;AACH,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;AA+BlC;;;;;;;GAOG;AACH,MAAM,OAAO,OAAO;IACD,IAAI,CAAqB;IACzB,GAAG,CAAQ;IAE5B,YAAY,UAA6B,EAAE;QACzC,MAAM,EACJ,eAAe,GAAG,EAAE,EACpB,UAAU,GAAG,IAAI,EACjB,EAAE,GAAG,SAAS,EACd,IAAI,GAAG,WAAW,GACnB,GAAG,OAAO,CAAC;QAEZ,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,IAAI,GAAG,IAAI,OAAO,CAAY;YACjC,eAAe;YACf,UAAU;YACV,KAAK,EAAE,EAAE;YACT,OAAO,EAAE,IAAI;SACd,CAAC,CAAC;IACL,CAAC;IAED,2EAA2E;IAC3E,OAAO;IACP,2EAA2E;IAE3E,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;IAC3B,CAAC;IAED,IAAI,EAAE;QACJ,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IAED,2EAA2E;IAC3E,sBAAsB;IACtB,2EAA2E;IAE3E,GAAG,CAAC,OAAU;QACZ,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAChC,OAAO,CAAC,UAAU,CAAC;IACrB,CAAC;IAED,MAAM,CAAC,OAAU;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;IACjD,CAAC;IAED,QAAQ,CAAC,OAAU;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E,MAAM,CAAC,KAAkB;QACvB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACtB,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,SAAS,CAAC,KAAkB;QAC1B,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;gBACzB,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,SAAS,CAAC,KAAkB;QAC1B,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,QAAQ,GAAQ,EAAE,CAAC;QAEzB,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,YAAY,GAAG,KAAK,CAAC;YACzB,KAAK,MAAM,aAAa,IAAI,QAAQ,EAAE,CAAC;gBACrC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;oBACrC,YAAY,GAAG,IAAI,CAAC;oBACpB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACrB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,WAAW,CAAC,KAAkB;QAC5B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;IAED,2EAA2E;IAC3E,gCAAgC;IAChC,2EAA2E;IAE3E;;;OAGG;IACH,KAAK,CAAC,KAAkB;QACtB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,KAAkB;QAC7B,MAAM,MAAM,GAAG,IAAI,OAAO,CAAI,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAChD,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,KAAK,MAAM,YAAY,IAAI,KAAK,EAAE,CAAC;gBACjC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,EAAE,CAAC;oBACpC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBACpB,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,KAAkB;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,mBAAmB,CAAC,KAAkB;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,KAAkB;QAC3B,MAAM,QAAQ,GAAG,IAAI,OAAO,CAAI,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAClD,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEvB,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAChC,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,KAAkB;QAC7B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,KAAkB;QAC/B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC3B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2EAA2E;IAC3E,YAAY;IACZ,2EAA2E;IAE3E,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC9B,MAAM,KAAK,CAAC,GAAG,CAAC;QAClB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAA2C;QACjD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E;;OAEG;IACH,KAAK;QACH,MAAM,KAAK,GAAG,IAAI,OAAO,CAAI,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAC/C,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,WAAW,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IACjD,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,OAAO,CACrB,iBAAmD;IAEnD,0CAA0C;IAC1C,IAAI,iBAAiB,IAAI,MAAM,CAAC,QAAQ,IAAI,iBAAiB,EAAE,CAAC;QAC9D,MAAM,GAAG,GAAG,IAAI,OAAO,EAAK,CAAC;QAC7B,GAAG,CAAC,MAAM,CAAC,iBAAgC,CAAC,CAAC;QAC7C,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO,IAAI,OAAO,CAAI,iBAAsC,CAAC,CAAC;AAChE,CAAC"}

package/dist/collections/impl/linked-hash-map.d.ts

@@ -0,0 +1,141 @@
+/**
+ * LinkedHashMap - HashMap that maintains insertion order.
+ *
+ * Combines a hash table with a doubly-linked list to maintain predictable
+ * iteration order. Mirrors java.util.LinkedHashMap.
+ *
+ * Key features:
+ * - O(1) access, insert, delete (like HashMap)
+ * - Predictable iteration order (insertion order or access order)
+ * - Perfect for LRU caches when accessOrder is true
+ *
+ * @example
+ * const map = linkedHashMap<string, number>()
+ * map.set('a', 1)
+ * map.set('b', 2)
+ * map.set('c', 3)
+ * // Iteration order: a, b, c (insertion order)
+ *
+ * @example
+ * // LRU cache with access order
+ * const lru = linkedHashMap<string, number>({ accessOrder: true })
+ * lru.set('a', 1)
+ * lru.set('b', 2)
+ * lru.get('a') // Moves 'a' to end
+ * // Iteration order: b, a (access order)
+ */
+import type { MapLike, Entry } from "../interfaces/map.js";
+import type { Eq, Hash } from "../core/traits.js";
+/**
+ * Options for creating a LinkedHashMap.
+ */
+export interface LinkedHashMapOptions<K, V> {
+    /**
+     * Initial capacity of the hash table.
+     * @default 16
+     */
+    initialCapacity?: number;
+    /**
+     * Load factor before resizing.
+     * @default 0.75
+     */
+    loadFactor?: number;
+    /**
+     * Equality function for keys.
+     * @default defaultEq
+     */
+    eq?: Eq<K>;
+    /**
+     * Hash function for keys.
+     * @default defaultHash
+     */
+    hash?: Hash<K>;
+    /**
+     * Equality function for values.
+     * @default defaultEq
+     */
+    valueEq?: Eq<V>;
+    /**
+     * If true, maintain access order instead of insertion order.
+     * Useful for LRU caches.
+     * @default false
+     */
+    accessOrder?: boolean;
+}
+/**
+ * LinkedHashMap<K, V> - Hash map with predictable iteration order.
+ *
+ * Maintains a doubly-linked list of entries to preserve insertion order
+ * (or access order if accessOrder is true).
+ */
+export declare class LinkedHashMap<K, V> implements MapLike<K, V> {
+    private _buckets;
+    private _size;
+    private readonly _loadFactor;
+    private readonly _eq;
+    private readonly _hash;
+    private readonly _valueEq;
+    private readonly _accessOrder;
+    private _head;
+    private _tail;
+    constructor(options?: LinkedHashMapOptions<K, V>);
+    get size(): number;
+    get isEmpty(): boolean;
+    get eq(): Eq<K>;
+    get keyEq(): Eq<K>;
+    get valueEq(): Eq<V>;
+    get hash(): Hash<K>;
+    has(key: K): boolean;
+    containsKey(key: K): boolean;
+    containsValue(value: V): boolean;
+    get(key: K): V;
+    getOrUndefined(key: K): V | undefined;
+    getOrDefault(key: K, defaultValue: V): V;
+    set(key: K, value: V): V | undefined;
+    setIfAbsent(key: K, value: V): V;
+    replace(key: K, value: V): V | undefined;
+    replaceEntry(key: K, oldValue: V, newValue: V): boolean;
+    delete(key: K): V | undefined;
+    deleteEntry(key: K, value: V): boolean;
+    clear(): void;
+    putAll(other: MapLike<K, V> | Iterable<Entry<K, V>>): void;
+    computeIfAbsent(key: K, mappingFunction: (key: K) => V): V;
+    computeIfPresent(key: K, remappingFunction: (key: K, value: V) => V | undefined): V | undefined;
+    compute(key: K, remappingFunction: (key: K, value: V | undefined) => V | undefined): V | undefined;
+    merge(key: K, value: V, remappingFunction: (oldValue: V, newValue: V) => V | undefined): V | undefined;
+    keys(): IterableIterator<K>;
+    values(): IterableIterator<V>;
+    entries(): IterableIterator<Entry<K, V>>;
+    [Symbol.iterator](): Iterator<Entry<K, V>>;
+    forEach(action: (value: V, key: K, map: this) => void): void;
+    toArray(): Entry<K, V>[];
+    private getNode;
+    private getBucketIndex;
+    private removeFromBucket;
+    private addToEnd;
+    private removeFromList;
+    private moveToEnd;
+    private resize;
+    toString(): string;
+}
+/**
+ * Factory function to create a LinkedHashMap.
+ *
+ * @example
+ * const map = linkedHashMap<string, number>()
+ * map.set('a', 1)
+ * map.set('b', 2)
+ *
+ * @example
+ * // With initial entries
+ * const map = linkedHashMap<string, number>([
+ *   ['a', 1],
+ *   ['b', 2]
+ * ])
+ *
+ * @example
+ * // LRU cache with access order
+ * const lru = linkedHashMap<string, number>({ accessOrder: true })
+ */
+export declare function linkedHashMap<K, V>(optionsOrEntries?: LinkedHashMapOptions<K, V> | Iterable<[K, V]>): LinkedHashMap<K, V>;
+//# sourceMappingURL=linked-hash-map.d.ts.map

package/dist/collections/impl/linked-hash-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"linked-hash-map.d.ts","sourceRoot":"","sources":["../../../src/collections/impl/linked-hash-map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAC3D,OAAO,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AAclD;;GAEG;AACH,MAAM,WAAW,oBAAoB,CAAC,CAAC,EAAE,CAAC;IACxC;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;OAGG;IACH,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAEX;;;OAGG;IACH,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAEf;;;OAGG;IACH,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAEhB;;;;OAIG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB;AAED;;;;;GAKG;AACH,qBAAa,aAAa,CAAC,CAAC,EAAE,CAAC,CAAE,YAAW,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IACvD,OAAO,CAAC,QAAQ,CAA8B;IAC9C,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAC5B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAU;IAChC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAQ;IACjC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAU;IAGvC,OAAO,CAAC,KAAK,CAAiC;IAC9C,OAAO,CAAC,KAAK,CAAiC;gBAElC,OAAO,GAAE,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAM;IAsBpD,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAEd;IAED,IAAI,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAEjB;IAED,IAAI,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,CAEnB;IAED,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,CAElB;IAMD,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,WAAW,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAI5B,aAAa,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAWhC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;IAWd,cAAc,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IASrC,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,CAAC;IAaxC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAyCpC,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC;IAYhC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAWxC,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,OAAO;IAYvD,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAgB7B,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO;IAgBtC,KAAK,IAAI,IAAI;IAWb,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI;IAgB1D,eAAe,CAAC,GAAG,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC;IAa1D,gBAAgB,CAAC,GAAG,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS;IAgB/F,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS;IAelG,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS;IAyBrG,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAQ3B,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAQ7B,OAAO,IAAI,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAQxC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAI3C,OAAO,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI;IAM5D,OAAO,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;IAQxB,OAAO,CAAC,OAAO;IAef,OAAO,CAAC,cAAc;IAItB,OAAO,CAAC,gBAAgB;IAmBxB,OAAO,CAAC,QAAQ;IAgBhB,OAAO,CAAC,cAAc;IActB,OAAO,CAAC,SAAS;IA2BjB,OAAO,CAAC,MAAM;IAkBd,QAAQ,IAAI,MAAM;CAMnB;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,CAAC,EAChC,gBAAgB,CAAC,EAAE,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAC/D,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAUrB"}