@procedures/collections 0.47.1 → 0.48.0

package/dist/behaviors/bounded.d.ts

@@ -1,79 +0,0 @@
-/**
- * Bounded behavior - Enforces capacity limits on collections.
- *
- * Wraps collections to prevent them from exceeding a maximum size.
- * Provides various overflow policies to handle full collections.
- *
- * @example
- * const list = compose(
- *   boundedList({ capacity: 100, policy: 'drop-oldest' })
- * )(arrayList<number>())
- *
- * // Add 101 elements - first element will be dropped
- * for (let i = 0; i < 101; i++) {
- *   list.add(i)
- * }
- */
-import type { Middleware } from "../core/middleware.js";
-import type { List } from "../interfaces/list.js";
-import type { Queue, Deque } from "../interfaces/queue.js";
-import type { MapLike } from "../interfaces/map.js";
-import type { Collection } from "../interfaces/collection.js";
-import type { OverflowPolicy, OverflowHandler, OverflowContext } from "../core/policies.js";
-/**
- * Options for bounded behavior.
- */
-export interface BoundedOptions<T> {
-    /**
-     * Maximum number of elements the collection can hold.
-     */
-    capacity: number;
-    /**
-     * Policy for handling overflow when collection is full.
-     * @default 'throw'
-     */
-    policy?: OverflowPolicy;
-    /**
-     * Optional callback invoked when overflow occurs.
-     * Called before the policy is applied.
-     */
-    onOverflow?: OverflowHandler<T>;
-}
-/**
- * Marker interface for bounded collections.
- */
-export interface BoundedCollection {
-    readonly capacity: number;
-    readonly isFull: boolean;
-    readonly remainingCapacity: number;
-}
-/**
- * Creates a bounded List middleware.
- *
- * Intercepts add operations to enforce capacity limits.
- * Supports multiple overflow policies.
- */
-export declare function boundedList<T>(options: BoundedOptions<T>): Middleware<List<T>, List<T> & BoundedCollection>;
-/**
- * Creates a bounded Queue middleware.
- */
-export declare function boundedQueue<T>(options: BoundedOptions<T>): Middleware<Queue<T>, Queue<T> & BoundedCollection>;
-/**
- * Creates a bounded Deque middleware.
- */
-export declare function boundedDeque<T>(options: BoundedOptions<T>): Middleware<Deque<T>, Deque<T> & BoundedCollection>;
-/**
- * Creates a bounded Map middleware.
- */
-export declare function boundedMap<K, V>(options: Omit<BoundedOptions<V>, "onOverflow"> & {
-    onOverflow?: (context: Omit<OverflowContext<V>, "newElement"> & {
-        key: K;
-        value: V;
-    }) => void;
-}): Middleware<MapLike<K, V>, MapLike<K, V> & BoundedCollection>;
-/**
- * Generic bounded collection middleware.
- * Works with any collection type.
- */
-export declare function bounded<C extends Collection<any>>(options: BoundedOptions<any>): Middleware<C, C & BoundedCollection>;
-//# sourceMappingURL=bounded.d.ts.map

package/dist/behaviors/bounded.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bounded.d.ts","sourceRoot":"","sources":["../../src/behaviors/bounded.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AACpD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,KAAK,EACV,cAAc,EACd,eAAe,EACf,eAAe,EAChB,MAAM,qBAAqB,CAAC;AAE7B;;GAEG;AACH,MAAM,WAAW,cAAc,CAAC,CAAC;IAC/B;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,MAAM,CAAC,EAAE,cAAc,CAAC;IAExB;;;OAGG;IACH,UAAU,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;CACjC;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;CACpC;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC,GACzB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAkKlD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC,GACzB,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAgEpD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC,GACzB,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAoEpD;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAC7B,OAAO,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,GAAG;IAC/C,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,GAAG;QAAE,GAAG,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,KAAK,IAAI,CAAC;CAC/F,GACA,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,iBAAiB,CAAC,CA0F9D;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,SAAS,UAAU,CAAC,GAAG,CAAC,EAC/C,OAAO,EAAE,cAAc,CAAC,GAAG,CAAC,GAC3B,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,CAEtC"}

package/dist/behaviors/bounded.js

@@ -1,393 +0,0 @@
-/**
- * Bounded behavior - Enforces capacity limits on collections.
- *
- * Wraps collections to prevent them from exceeding a maximum size.
- * Provides various overflow policies to handle full collections.
- *
- * @example
- * const list = compose(
- *   boundedList({ capacity: 100, policy: 'drop-oldest' })
- * )(arrayList<number>())
- *
- * // Add 101 elements - first element will be dropped
- * for (let i = 0; i < 101; i++) {
- *   list.add(i)
- * }
- */
-/**
- * Creates a bounded List middleware.
- *
- * Intercepts add operations to enforce capacity limits.
- * Supports multiple overflow policies.
- */
-export function boundedList(options) {
-    const { capacity, policy = "throw", onOverflow } = options;
-    return (next) => {
-        // An unshift puts the element at the front, so drop-oldest drops the last element for it
-        const handleOverflow = (element, dropFrom = "first") => {
-            // Call overflow handler if provided
-            if (onOverflow) {
-                const context = {
-                    newElement: element,
-                    currentSize: next.size,
-                    capacity,
-                    timestamp: Date.now(),
-                };
-                onOverflow(context);
-            }
-            // Apply policy
-            switch (policy) {
-                case "throw":
-                    throw new Error(`List is full (capacity: ${capacity})`);
-                case "drop-oldest":
-                    // Remove one element: the first, or the last for an unshift
-                    if (!next.isEmpty) {
-                        if (dropFrom === "last")
-                            next.pop();
-                        else
-                            next.shift();
-                    }
-                    break;
-                case "drop-newest":
-                    // Don't add the new element (do nothing)
-                    return;
-                case "reject":
-                    // Silently reject (return false for add operations)
-                    return;
-                case "grow":
-                    // Allow growth (do nothing, element will be added)
-                    return;
-                case "block":
-                    throw new Error("Block policy not supported for sync collections");
-                default:
-                    throw new Error(`Unknown overflow policy: ${policy}`);
-            }
-        };
-        // After drop-oldest removed the first element, an index of the caller is one place lower
-        const shifted = (index) => (policy === "drop-oldest" ? Math.max(0, index - 1) : index);
-        return new Proxy(next, {
-            get(target, prop, receiver) {
-                // Capacity property
-                if (prop === "capacity") {
-                    return capacity;
-                }
-                // isFull property
-                if (prop === "isFull") {
-                    return target.size >= capacity;
-                }
-                // remainingCapacity property
-                if (prop === "remainingCapacity") {
-                    return Math.max(0, capacity - target.size);
-                }
-                const value = Reflect.get(target, prop, receiver);
-                // Intercept methods that add elements
-                if (typeof value === "function") {
-                    switch (prop) {
-                        case "add":
-                            return function (element) {
-                                if (target.size >= capacity && policy !== "grow") {
-                                    handleOverflow(element);
-                                    if (policy === "reject" || policy === "drop-newest") {
-                                        return false;
-                                    }
-                                }
-                                return value.call(target, element);
-                            };
-                        case "push":
-                            return function (element) {
-                                if (target.size >= capacity && policy !== "grow") {
-                                    handleOverflow(element);
-                                    if (policy === "reject" || policy === "drop-newest") {
-                                        return;
-                                    }
-                                }
-                                value.call(target, element);
-                            };
-                        case "unshift":
-                            return function (element) {
-                                if (target.size >= capacity && policy !== "grow") {
-                                    // One element goes: the last one (before, the first and the last went: audit pass 2)
-                                    handleOverflow(element, "last");
-                                    if (policy === "reject" || policy === "drop-newest") {
-                                        return;
-                                    }
-                                }
-                                value.call(target, element);
-                            };
-                        case "insert":
-                            return function (index, element) {
-                                let at = index;
-                                if (target.size >= capacity && policy !== "grow") {
-                                    handleOverflow(element);
-                                    if (policy === "reject" || policy === "drop-newest") {
-                                        return;
-                                    }
-                                    at = shifted(at);
-                                }
-                                value.call(target, at, element);
-                            };
-                        case "addAll":
-                        case "insertAll":
-                            return function (...args) {
-                                const elements = args[args.length - 1];
-                                const elementsArray = Array.from(elements);
-                                // Check if adding all elements would exceed capacity
-                                if (target.size + elementsArray.length > capacity && policy !== "grow") {
-                                    // Add elements one by one with overflow handling. An insert keeps the order of
-                                    // the elements, at an index that follows each drop.
-                                    let added = false;
-                                    let at = args[0];
-                                    for (const element of elementsArray) {
-                                        if (target.size >= capacity) {
-                                            handleOverflow(element);
-                                            if (policy === "reject" || policy === "drop-newest") {
-                                                break;
-                                            }
-                                            at = shifted(at);
-                                        }
-                                        if (prop === "addAll") {
-                                            target.add(element);
-                                        }
-                                        else {
-                                            target.insert(at, element);
-                                            at++;
-                                        }
-                                        added = true;
-                                    }
-                                    return added;
-                                }
-                                return value.apply(target, args);
-                            };
-                    }
-                }
-                return value;
-            },
-        });
-    };
-}
-/**
- * Creates a bounded Queue middleware.
- */
-export function boundedQueue(options) {
-    const { capacity, policy = "throw", onOverflow } = options;
-    return (next) => {
-        const handleOverflow = (element) => {
-            if (onOverflow) {
-                const context = {
-                    newElement: element,
-                    currentSize: next.size,
-                    capacity,
-                    timestamp: Date.now(),
-                };
-                onOverflow(context);
-            }
-            switch (policy) {
-                case "throw":
-                    throw new Error(`Queue is full (capacity: ${capacity})`);
-                case "drop-oldest":
-                    if (!next.isEmpty) {
-                        next.poll();
-                    }
-                    break;
-                case "drop-newest":
-                case "reject":
-                    return;
-                case "grow":
-                    return;
-                case "block":
-                    throw new Error("Block policy not supported for sync collections");
-                default:
-                    throw new Error(`Unknown overflow policy: ${policy}`);
-            }
-        };
-        return new Proxy(next, {
-            get(target, prop, receiver) {
-                if (prop === "capacity")
-                    return capacity;
-                if (prop === "isFull")
-                    return target.size >= capacity;
-                if (prop === "remainingCapacity")
-                    return Math.max(0, capacity - target.size);
-                const value = Reflect.get(target, prop, receiver);
-                if (typeof value === "function") {
-                    switch (prop) {
-                        case "offer":
-                        case "enqueue":
-                        case "add":
-                            return function (element) {
-                                if (target.size >= capacity && policy !== "grow") {
-                                    handleOverflow(element);
-                                    if (policy === "reject" || policy === "drop-newest") {
-                                        return false;
-                                    }
-                                }
-                                return value.call(target, element);
-                            };
-                    }
-                }
-                return value;
-            },
-        });
-    };
-}
-/**
- * Creates a bounded Deque middleware.
- */
-export function boundedDeque(options) {
-    const { capacity, policy = "throw", onOverflow } = options;
-    return (next) => {
-        const handleOverflow = (element) => {
-            if (onOverflow) {
-                const context = {
-                    newElement: element,
-                    currentSize: next.size,
-                    capacity,
-                    timestamp: Date.now(),
-                };
-                onOverflow(context);
-            }
-            switch (policy) {
-                case "throw":
-                    throw new Error(`Deque is full (capacity: ${capacity})`);
-                case "drop-oldest":
-                    if (!next.isEmpty) {
-                        next.removeFirst();
-                    }
-                    break;
-                case "drop-newest":
-                case "reject":
-                    return;
-                case "grow":
-                    return;
-                case "block":
-                    throw new Error("Block policy not supported for sync collections");
-                default:
-                    throw new Error(`Unknown overflow policy: ${policy}`);
-            }
-        };
-        return new Proxy(next, {
-            get(target, prop, receiver) {
-                if (prop === "capacity")
-                    return capacity;
-                if (prop === "isFull")
-                    return target.size >= capacity;
-                if (prop === "remainingCapacity")
-                    return Math.max(0, capacity - target.size);
-                const value = Reflect.get(target, prop, receiver);
-                if (typeof value === "function") {
-                    switch (prop) {
-                        case "addFirst":
-                        case "addLast":
-                        case "offerFirst":
-                        case "offerLast":
-                        case "push":
-                        case "offer":
-                        case "add":
-                            return function (element) {
-                                if (target.size >= capacity && policy !== "grow") {
-                                    handleOverflow(element);
-                                    if (policy === "reject" || policy === "drop-newest") {
-                                        return prop.startsWith("offer") || prop === "add" ? false : undefined;
-                                    }
-                                }
-                                return value.call(target, element);
-                            };
-                    }
-                }
-                return value;
-            },
-        });
-    };
-}
-/**
- * Creates a bounded Map middleware.
- */
-export function boundedMap(options) {
-    const { capacity, policy = "throw", onOverflow } = options;
-    return (next) => {
-        let insertionOrder = []; // Track insertion order for drop-oldest
-        const handleOverflow = (key, value) => {
-            if (onOverflow) {
-                onOverflow({
-                    key,
-                    value,
-                    currentSize: next.size,
-                    capacity,
-                    timestamp: Date.now(),
-                });
-            }
-            switch (policy) {
-                case "throw":
-                    throw new Error(`Map is full (capacity: ${capacity})`);
-                case "drop-oldest":
-                    // Remove oldest key
-                    if (insertionOrder.length > 0) {
-                        const oldestKey = insertionOrder.shift();
-                        next.delete(oldestKey);
-                    }
-                    break;
-                case "drop-newest":
-                case "reject":
-                    return;
-                case "grow":
-                    return;
-                case "block":
-                    throw new Error("Block policy not supported for sync collections");
-                default:
-                    throw new Error(`Unknown overflow policy: ${policy}`);
-            }
-        };
-        return new Proxy(next, {
-            get(target, prop, receiver) {
-                if (prop === "capacity")
-                    return capacity;
-                if (prop === "isFull")
-                    return target.size >= capacity;
-                if (prop === "remainingCapacity")
-                    return Math.max(0, capacity - target.size);
-                const value = Reflect.get(target, prop, receiver);
-                if (typeof value === "function") {
-                    switch (prop) {
-                        case "set":
-                            return function (key, val) {
-                                const hadKey = target.has(key);
-                                if (!hadKey && target.size >= capacity && policy !== "grow") {
-                                    handleOverflow(key, val);
-                                    if (policy === "reject" || policy === "drop-newest") {
-                                        return undefined;
-                                    }
-                                }
-                                const result = value.call(target, key, val);
-                                // Track insertion order
-                                if (!hadKey) {
-                                    insertionOrder.push(key);
-                                }
-                                return result;
-                            };
-                        case "delete":
-                            return function (key) {
-                                const result = value.call(target, key);
-                                // Remove from insertion order tracking
-                                insertionOrder = insertionOrder.filter((k) => !target.keyEq(k, key));
-                                return result;
-                            };
-                        case "clear":
-                            return function () {
-                                value.call(target);
-                                insertionOrder = [];
-                            };
-                    }
-                }
-                return value;
-            },
-        });
-    };
-}
-/**
- * Generic bounded collection middleware.
- * Works with any collection type.
- */
-export function bounded(options) {
-    return boundedList(options);
-}
-//# sourceMappingURL=bounded.js.map

package/dist/behaviors/bounded.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bounded.js","sourceRoot":"","sources":["../../src/behaviors/bounded.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AA4CH;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,OAA0B;IAE1B,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;IAE3D,OAAO,CAAC,IAAa,EAA+B,EAAE;QACpD,yFAAyF;QACzF,MAAM,cAAc,GAAG,CAAC,OAAU,EAAE,QAAQ,GAAqB,OAAO,EAAQ,EAAE;YAChF,oCAAoC;YACpC,IAAI,UAAU,EAAE,CAAC;gBACf,MAAM,OAAO,GAAuB;oBAClC,UAAU,EAAE,OAAO;oBACnB,WAAW,EAAE,IAAI,CAAC,IAAI;oBACtB,QAAQ;oBACR,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;iBACtB,CAAC;gBACF,UAAU,CAAC,OAAO,CAAC,CAAC;YACtB,CAAC;YAED,eAAe;YACf,QAAQ,MAAM,EAAE,CAAC;gBACf,KAAK,OAAO;oBACV,MAAM,IAAI,KAAK,CAAC,2BAA2B,QAAQ,GAAG,CAAC,CAAC;gBAE1D,KAAK,aAAa;oBAChB,4DAA4D;oBAC5D,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;wBAClB,IAAI,QAAQ,KAAK,MAAM;4BAAE,IAAI,CAAC,GAAG,EAAE,CAAC;;4BAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;oBACpB,CAAC;oBACD,MAAM;gBAER,KAAK,aAAa;oBAChB,yCAAyC;oBACzC,OAAO;gBAET,KAAK,QAAQ;oBACX,oDAAoD;oBACpD,OAAO;gBAET,KAAK,MAAM;oBACT,mDAAmD;oBACnD,OAAO;gBAET,KAAK,OAAO;oBACV,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;gBAErE;oBACE,MAAM,IAAI,KAAK,CAAC,4BAA4B,MAAM,EAAE,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC,CAAC;QAEF,yFAAyF;QACzF,MAAM,OAAO,GAAG,CAAC,KAAa,EAAU,EAAE,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAEvG,OAAO,IAAI,KAAK,CAAC,IAAI,EAAE;YACrB,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ;gBACxB,oBAAoB;gBACpB,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;oBACxB,OAAO,QAAQ,CAAC;gBAClB,CAAC;gBAED,kBAAkB;gBAClB,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;oBACtB,OAAO,MAAM,CAAC,IAAI,IAAI,QAAQ,CAAC;gBACjC,CAAC;gBAED,6BAA6B;gBAC7B,IAAI,IAAI,KAAK,mBAAmB,EAAE,CAAC;oBACjC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC7C,CAAC;gBAED,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAElD,sCAAsC;gBACtC,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;oBAChC,QAAQ,IAAI,EAAE,CAAC;wBACb,KAAK,KAAK;4BACR,OAAO,UAAU,OAAU;gCACzB,IAAI,MAAM,CAAC,IAAI,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oCACjD,cAAc,CAAC,OAAO,CAAC,CAAC;oCACxB,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,aAAa,EAAE,CAAC;wCACpD,OAAO,KAAK,CAAC;oCACf,CAAC;gCACH,CAAC;gCACD,OAAQ,KAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;4BACnD,CAAC,CAAC;wBAEJ,KAAK,MAAM;4BACT,OAAO,UAAU,OAAU;gCACzB,IAAI,MAAM,CAAC,IAAI,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oCACjD,cAAc,CAAC,OAAO,CAAC,CAAC;oCACxB,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,aAAa,EAAE,CAAC;wCACpD,OAAO;oCACT,CAAC;gCACH,CAAC;gCACA,KAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;4BAC5C,CAAC,CAAC;wBAEJ,KAAK,SAAS;4BACZ,OAAO,UAAU,OAAU;gCACzB,IAAI,MAAM,CAAC,IAAI,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oCACjD,qFAAqF;oCACrF,cAAc,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;oCAChC,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,aAAa,EAAE,CAAC;wCACpD,OAAO;oCACT,CAAC;gCACH,CAAC;gCACA,KAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;4BAC5C,CAAC,CAAC;wBAEJ,KAAK,QAAQ;4BACX,OAAO,UAAU,KAAa,EAAE,OAAU;gCACxC,IAAI,EAAE,GAAG,KAAK,CAAC;gCACf,IAAI,MAAM,CAAC,IAAI,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oCACjD,cAAc,CAAC,OAAO,CAAC,CAAC;oCACxB,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,aAAa,EAAE,CAAC;wCACpD,OAAO;oCACT,CAAC;oCACD,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;gCACnB,CAAC;gCACA,KAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;4BAChD,CAAC,CAAC;wBAEJ,KAAK,QAAQ,CAAC;wBACd,KAAK,WAAW;4BACd,OAAO,UAAU,GAAG,IAAW;gCAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAgB,CAAC;gCACtD,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gCAE3C,qDAAqD;gCACrD,IAAI,MAAM,CAAC,IAAI,GAAG,aAAa,CAAC,MAAM,GAAG,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oCACvE,+EAA+E;oCAC/E,oDAAoD;oCACpD,IAAI,KAAK,GAAG,KAAK,CAAC;oCAClB,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;oCAC3B,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;wCACpC,IAAI,MAAM,CAAC,IAAI,IAAI,QAAQ,EAAE,CAAC;4CAC5B,cAAc,CAAC,OAAO,CAAC,CAAC;4CACxB,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,aAAa,EAAE,CAAC;gDACpD,MAAM;4CACR,CAAC;4CACD,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;wCACnB,CAAC;wCACD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;4CACtB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;wCACtB,CAAC;6CAAM,CAAC;4CACN,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;4CAC3B,EAAE,EAAE,CAAC;wCACP,CAAC;wCACD,KAAK,GAAG,IAAI,CAAC;oCACf,CAAC;oCACD,OAAO,KAAK,CAAC;gCACf,CAAC;gCAED,OAAQ,KAAkB,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;4BACjD,CAAC,CAAC;oBACN,CAAC;gBACH,CAAC;gBAED,OAAO,KAAK,CAAC;YACf,CAAC;SACF,CAAgC,CAAC;IACpC,CAAC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAC1B,OAA0B;IAE1B,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;IAE3D,OAAO,CAAC,IAAc,EAAgC,EAAE;QACtD,MAAM,cAAc,GAAG,CAAC,OAAU,EAAQ,EAAE;YAC1C,IAAI,UAAU,EAAE,CAAC;gBACf,MAAM,OAAO,GAAuB;oBAClC,UAAU,EAAE,OAAO;oBACnB,WAAW,EAAE,IAAI,CAAC,IAAI;oBACtB,QAAQ;oBACR,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;iBACtB,CAAC;gBACF,UAAU,CAAC,OAAO,CAAC,CAAC;YACtB,CAAC;YAED,QAAQ,MAAM,EAAE,CAAC;gBACf,KAAK,OAAO;oBACV,MAAM,IAAI,KAAK,CAAC,4BAA4B,QAAQ,GAAG,CAAC,CAAC;gBAC3D,KAAK,aAAa;oBAChB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;wBAClB,IAAI,CAAC,IAAI,EAAE,CAAC;oBACd,CAAC;oBACD,MAAM;gBACR,KAAK,aAAa,CAAC;gBACnB,KAAK,QAAQ;oBACX,OAAO;gBACT,KAAK,MAAM;oBACT,OAAO;gBACT,KAAK,OAAO;oBACV,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;gBACrE;oBACE,MAAM,IAAI,KAAK,CAAC,4BAA4B,MAAM,EAAE,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC,CAAC;QAEF,OAAO,IAAI,KAAK,CAAC,IAAI,EAAE;YACrB,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ;gBACxB,IAAI,IAAI,KAAK,UAAU;oBAAE,OAAO,QAAQ,CAAC;gBACzC,IAAI,IAAI,KAAK,QAAQ;oBAAE,OAAO,MAAM,CAAC,IAAI,IAAI,QAAQ,CAAC;gBACtD,IAAI,IAAI,KAAK,mBAAmB;oBAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;gBAE7E,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAElD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;oBAChC,QAAQ,IAAI,EAAE,CAAC;wBACb,KAAK,OAAO,CAAC;wBACb,KAAK,SAAS,CAAC;wBACf,KAAK,KAAK;4BACR,OAAO,UAAU,OAAU;gCACzB,IAAI,MAAM,CAAC,IAAI,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oCACjD,cAAc,CAAC,OAAO,CAAC,CAAC;oCACxB,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,aAAa,EAAE,CAAC;wCACpD,OAAO,KAAK,CAAC;oCACf,CAAC;gCACH,CAAC;gCACD,OAAQ,KAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;4BACnD,CAAC,CAAC;oBACN,CAAC;gBACH,CAAC;gBAED,OAAO,KAAK,CAAC;YACf,CAAC;SACF,CAAiC,CAAC;IACrC,CAAC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAC1B,OAA0B;IAE1B,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;IAE3D,OAAO,CAAC,IAAc,EAAgC,EAAE;QACtD,MAAM,cAAc,GAAG,CAAC,OAAU,EAAQ,EAAE;YAC1C,IAAI,UAAU,EAAE,CAAC;gBACf,MAAM,OAAO,GAAuB;oBAClC,UAAU,EAAE,OAAO;oBACnB,WAAW,EAAE,IAAI,CAAC,IAAI;oBACtB,QAAQ;oBACR,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;iBACtB,CAAC;gBACF,UAAU,CAAC,OAAO,CAAC,CAAC;YACtB,CAAC;YAED,QAAQ,MAAM,EAAE,CAAC;gBACf,KAAK,OAAO;oBACV,MAAM,IAAI,KAAK,CAAC,4BAA4B,QAAQ,GAAG,CAAC,CAAC;gBAC3D,KAAK,aAAa;oBAChB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;wBAClB,IAAI,CAAC,WAAW,EAAE,CAAC;oBACrB,CAAC;oBACD,MAAM;gBACR,KAAK,aAAa,CAAC;gBACnB,KAAK,QAAQ;oBACX,OAAO;gBACT,KAAK,MAAM;oBACT,OAAO;gBACT,KAAK,OAAO;oBACV,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;gBACrE;oBACE,MAAM,IAAI,KAAK,CAAC,4BAA4B,MAAM,EAAE,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC,CAAC;QAEF,OAAO,IAAI,KAAK,CAAC,IAAI,EAAE;YACrB,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ;gBACxB,IAAI,IAAI,KAAK,UAAU;oBAAE,OAAO,QAAQ,CAAC;gBACzC,IAAI,IAAI,KAAK,QAAQ;oBAAE,OAAO,MAAM,CAAC,IAAI,IAAI,QAAQ,CAAC;gBACtD,IAAI,IAAI,KAAK,mBAAmB;oBAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;gBAE7E,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAElD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;oBAChC,QAAQ,IAAI,EAAE,CAAC;wBACb,KAAK,UAAU,CAAC;wBAChB,KAAK,SAAS,CAAC;wBACf,KAAK,YAAY,CAAC;wBAClB,KAAK,WAAW,CAAC;wBACjB,KAAK,MAAM,CAAC;wBACZ,KAAK,OAAO,CAAC;wBACb,KAAK,KAAK;4BACR,OAAO,UAAU,OAAU;gCACzB,IAAI,MAAM,CAAC,IAAI,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oCACjD,cAAc,CAAC,OAAO,CAAC,CAAC;oCACxB,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,aAAa,EAAE,CAAC;wCACpD,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;oCACxE,CAAC;gCACH,CAAC;gCACD,OAAQ,KAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;4BACnD,CAAC,CAAC;oBACN,CAAC;gBACH,CAAC;gBAED,OAAO,KAAK,CAAC;YACf,CAAC;SACF,CAAiC,CAAC;IACrC,CAAC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CACxB,OAEC;IAED,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;IAE3D,OAAO,CAAC,IAAmB,EAAqC,EAAE;QAChE,IAAI,cAAc,GAAQ,EAAE,CAAC,CAAC,wCAAwC;QAEtE,MAAM,cAAc,GAAG,CAAC,GAAM,EAAE,KAAQ,EAAQ,EAAE;YAChD,IAAI,UAAU,EAAE,CAAC;gBACf,UAAU,CAAC;oBACT,GAAG;oBACH,KAAK;oBACL,WAAW,EAAE,IAAI,CAAC,IAAI;oBACtB,QAAQ;oBACR,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;iBACtB,CAAC,CAAC;YACL,CAAC;YAED,QAAQ,MAAM,EAAE,CAAC;gBACf,KAAK,OAAO;oBACV,MAAM,IAAI,KAAK,CAAC,0BAA0B,QAAQ,GAAG,CAAC,CAAC;gBACzD,KAAK,aAAa;oBAChB,oBAAoB;oBACpB,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC9B,MAAM,SAAS,GAAG,cAAc,CAAC,KAAK,EAAG,CAAC;wBAC1C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;oBACzB,CAAC;oBACD,MAAM;gBACR,KAAK,aAAa,CAAC;gBACnB,KAAK,QAAQ;oBACX,OAAO;gBACT,KAAK,MAAM;oBACT,OAAO;gBACT,KAAK,OAAO;oBACV,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;gBACrE;oBACE,MAAM,IAAI,KAAK,CAAC,4BAA4B,MAAM,EAAE,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC,CAAC;QAEF,OAAO,IAAI,KAAK,CAAC,IAAI,EAAE;YACrB,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ;gBACxB,IAAI,IAAI,KAAK,UAAU;oBAAE,OAAO,QAAQ,CAAC;gBACzC,IAAI,IAAI,KAAK,QAAQ;oBAAE,OAAO,MAAM,CAAC,IAAI,IAAI,QAAQ,CAAC;gBACtD,IAAI,IAAI,KAAK,mBAAmB;oBAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;gBAE7E,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAElD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;oBAChC,QAAQ,IAAI,EAAE,CAAC;wBACb,KAAK,KAAK;4BACR,OAAO,UAAU,GAAM,EAAE,GAAM;gCAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gCAE/B,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oCAC5D,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;oCACzB,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,aAAa,EAAE,CAAC;wCACpD,OAAO,SAAS,CAAC;oCACnB,CAAC;gCACH,CAAC;gCAED,MAAM,MAAM,GAAI,KAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;gCAE1D,wBAAwB;gCACxB,IAAI,CAAC,MAAM,EAAE,CAAC;oCACZ,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gCAC3B,CAAC;gCAED,OAAO,MAAM,CAAC;4BAChB,CAAC,CAAC;wBAEJ,KAAK,QAAQ;4BACX,OAAO,UAAU,GAAM;gCACrB,MAAM,MAAM,GAAI,KAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gCACrD,uCAAuC;gCACvC,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gCACrE,OAAO,MAAM,CAAC;4BAChB,CAAC,CAAC;wBAEJ,KAAK,OAAO;4BACV,OAAO;gCACJ,KAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gCACjC,cAAc,GAAG,EAAE,CAAC;4BACtB,CAAC,CAAC;oBACN,CAAC;gBACH,CAAC;gBAED,OAAO,KAAK,CAAC;YACf,CAAC;SACF,CAAsC,CAAC;IAC1C,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,OAAO,CACrB,OAA4B;IAE5B,OAAO,WAAW,CAAC,OAAO,CAAQ,CAAC;AACrC,CAAC"}

package/dist/behaviors/composite.d.ts

@@ -1,17 +0,0 @@
-/**
- * Composite map methods built on `has`, `get`, `set` and `delete`.
- *
- * A map behavior (lruMap, ttlMap) intercepts the primitive methods. It returns these
- * implementations for the composite methods, bound to the behavior's own proxy, so a call such
- * as `setIfAbsent` goes through the behavior's `set` and keeps its rules: capacity and recency
- * for LRU, expiry for TTL. (BUGS-2026-07 L13: the composite methods went straight to the map
- * below, so they bypassed the behavior.)
- *
- * The semantics follow HashMap. One difference: `replaceEntry` and `deleteEntry` compare
- * values with Object.is, not with a map's custom value equality.
- */
-import type { MapLike } from "../interfaces/map.js";
-type AnyFn = (...args: never[]) => unknown;
-export declare function compositeMapMethod<K, V>(map: MapLike<K, V>, name: PropertyKey): AnyFn | undefined;
-export {};
-//# sourceMappingURL=composite.d.ts.map

package/dist/behaviors/composite.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"composite.d.ts","sourceRoot":"","sources":["../../src/behaviors/composite.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAS,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAE3D,KAAK,KAAK,GAAG,CAAC,GAAG,IAAI,EAAE,KAAK,EAAE,KAAK,OAAO,CAAC;AAE3C,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,GAAG,KAAK,GAAG,SAAS,CAiFjG"}

package/dist/behaviors/composite.js

@@ -1,93 +0,0 @@
-/**
- * Composite map methods built on `has`, `get`, `set` and `delete`.
- *
- * A map behavior (lruMap, ttlMap) intercepts the primitive methods. It returns these
- * implementations for the composite methods, bound to the behavior's own proxy, so a call such
- * as `setIfAbsent` goes through the behavior's `set` and keeps its rules: capacity and recency
- * for LRU, expiry for TTL. (BUGS-2026-07 L13: the composite methods went straight to the map
- * below, so they bypassed the behavior.)
- *
- * The semantics follow HashMap. One difference: `replaceEntry` and `deleteEntry` compare
- * values with Object.is, not with a map's custom value equality.
- */
-export function compositeMapMethod(map, name) {
-    switch (name) {
-        case "setIfAbsent":
-            return ((key, value) => {
-                if (map.has(key))
-                    return map.get(key);
-                map.set(key, value);
-                return value;
-            });
-        case "replace":
-            return ((key, value) => (map.has(key) ? map.set(key, value) : undefined));
-        case "replaceEntry":
-            return ((key, oldValue, newValue) => {
-                if (!map.has(key) || !Object.is(map.get(key), oldValue))
-                    return false;
-                map.set(key, newValue);
-                return true;
-            });
-        case "deleteEntry":
-            return ((key, value) => {
-                if (!map.has(key) || !Object.is(map.get(key), value))
-                    return false;
-                map.delete(key);
-                return true;
-            });
-        case "computeIfAbsent":
-            return ((key, mappingFunction) => {
-                if (map.has(key))
-                    return map.get(key);
-                const value = mappingFunction(key);
-                map.set(key, value);
-                return value;
-            });
-        case "computeIfPresent":
-            return ((key, remapping) => {
-                if (!map.has(key))
-                    return undefined;
-                const value = remapping(key, map.get(key));
-                if (value === undefined) {
-                    map.delete(key);
-                    return undefined;
-                }
-                map.set(key, value);
-                return value;
-            });
-        case "compute":
-            return ((key, remapping) => {
-                const present = map.has(key);
-                const value = remapping(key, present ? map.get(key) : undefined);
-                if (value === undefined) {
-                    if (present)
-                        map.delete(key);
-                    return undefined;
-                }
-                map.set(key, value);
-                return value;
-            });
-        case "merge":
-            return ((key, value, remapping) => {
-                if (!map.has(key)) {
-                    map.set(key, value);
-                    return value;
-                }
-                const merged = remapping(map.get(key), value);
-                if (merged === undefined) {
-                    map.delete(key);
-                    return undefined;
-                }
-                map.set(key, merged);
-                return merged;
-            });
-        case "putAll":
-            return ((other) => {
-                for (const entry of other) {
-                    map.set(entry.key, entry.value);
-                }
-            });
-    }
-    return undefined;
-}
-//# sourceMappingURL=composite.js.map

package/dist/behaviors/composite.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"composite.js","sourceRoot":"","sources":["../../src/behaviors/composite.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAMH,MAAM,UAAU,kBAAkB,CAAO,GAAkB,EAAE,IAAiB;IAC5E,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,aAAa;YAChB,OAAO,CAAC,CAAC,GAAM,EAAE,KAAQ,EAAK,EAAE;gBAC9B,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACtC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBACpB,OAAO,KAAK,CAAC;YACf,CAAC,CAAU,CAAC;QAEd,KAAK,SAAS;YACZ,OAAO,CAAC,CAAC,GAAM,EAAE,KAAQ,EAAiB,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAU,CAAC;QAE1G,KAAK,cAAc;YACjB,OAAO,CAAC,CAAC,GAAM,EAAE,QAAW,EAAE,QAAW,EAAW,EAAE;gBACpD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACtE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gBACvB,OAAO,IAAI,CAAC;YACd,CAAC,CAAU,CAAC;QAEd,KAAK,aAAa;YAChB,OAAO,CAAC,CAAC,GAAM,EAAE,KAAQ,EAAW,EAAE;gBACpC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACnE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAChB,OAAO,IAAI,CAAC;YACd,CAAC,CAAU,CAAC;QAEd,KAAK,iBAAiB;YACpB,OAAO,CAAC,CAAC,GAAM,EAAE,eAA8B,EAAK,EAAE;gBACpD,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACtC,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;gBACnC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBACpB,OAAO,KAAK,CAAC;YACf,CAAC,CAAU,CAAC;QAEd,KAAK,kBAAkB;YACrB,OAAO,CAAC,CAAC,GAAM,EAAE,SAA8C,EAAiB,EAAE;gBAChF,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,OAAO,SAAS,CAAC;gBACpC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC3C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBAChB,OAAO,SAAS,CAAC;gBACnB,CAAC;gBACD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBACpB,OAAO,KAAK,CAAC;YACf,CAAC,CAAU,CAAC;QAEd,KAAK,SAAS;YACZ,OAAO,CAAC,CAAC,GAAM,EAAE,SAA0D,EAAiB,EAAE;gBAC5F,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC7B,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACjE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,IAAI,OAAO;wBAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBAC7B,OAAO,SAAS,CAAC;gBACnB,CAAC;gBACD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBACpB,OAAO,KAAK,CAAC;YACf,CAAC,CAAU,CAAC;QAEd,KAAK,OAAO;YACV,OAAO,CAAC,CAAC,GAAM,EAAE,KAAQ,EAAE,SAAsD,EAAiB,EAAE;gBAClG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAClB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;oBACpB,OAAO,KAAK,CAAC;gBACf,CAAC;gBACD,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC9C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACzB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBAChB,OAAO,SAAS,CAAC;gBACnB,CAAC;gBACD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;gBACrB,OAAO,MAAM,CAAC;YAChB,CAAC,CAAU,CAAC;QAEd,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC,KAA4B,EAAQ,EAAE;gBAC7C,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;oBAC1B,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC,CAAU,CAAC;IAChB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}