@ac-kit/core 0.1.0

package/dist/number/to-fixed-length.js

@@ -0,0 +1,90 @@
+import { round } from "../number/round.js";
+import { clamp } from "./clamp.js";
+/**
+ * Format a number to a fixed length string, with options for maximum fraction
+ * digits, fixed fraction digits, and rounding method. If the number exceeds the
+ * maximum value that can be represented with the given length and fraction
+ * digits, it will be clamped to that maximum value.
+ *
+ * Examples with fixedLength=5, fractionDigits=2, fixedFractionDigits=true :
+ * 0.012 => 00.01 (rounded) 0.123 => 00.12 (rounded) 1.234 => 01.23 (rounded)
+ * 12.345 => 12.35 (rounded) 123.456 => 99.99 (max) .. 123456.789 => 99.99
+ * (max)
+ *
+ * Examples with fixedLength=5, fractionDigits=2, fixedFractionDigits=false :
+ * 0.012 => 00.01 (rounded) 0.123 => 00.12 (rounded) 1.234 => 01.23 (rounded)
+ * 12.345 => 12.35 (rounded) 123.456 => 123.5 (rounded) 1234.567 => 999.9 (max)
+ * 12345.678 => 12346 (rounded) 123456.789 => 99999 (max)
+ *
+ * Examples with fixedLength=5, fractionDigits=3, fixedFractionDigits=false :
+ * 0.012 => 0.012 0.123 => 0.123 1.234 => 1.234 12.345 => 12.35 (rounded)
+ * 123.456 => 123.5 (rounded) 1234.567 => 999.9 (max) 12345.678 => 12346
+ * (rounded) 123456.789 => 99999 (max)
+ *
+ * Examples with fixedLength=6, fractionDigits=2, fixedFractionDigits=false :
+ * 0.012 => 000.01 (rounded) 0.123 => 000.12 (rounded) 1.234 => 001.23 (rounded)
+ * 12.345 => 012.35 (rounded) 123.456 => 123.46 (rounded) 1234.567 => 1234.6
+ * (rounded) 12345.678 => 9999.9 (max) 123456.789 => 123457 (rounded)
+ * 1234567.891 => 999999 (max)
+ *
+ * @param value The number to format.
+ * @param length The fixed length of the output string (including decimal point
+ *   if any).
+ * @param options Options for formatting.
+ * @returns The formatted number as a string.
+ */
+export function toFixedLength(value, length, options) {
+    let maxFractionDigits = options?.maxFractionDigits ?? 0;
+    let fixedFractionDigits = options?.fixedFractionDigits ?? false;
+    let roundingMethod = options?.roundingMethod ?? "round";
+    if (maxFractionDigits < 0) {
+        throw new Error("maxFractionDigits must be >= 0");
+    }
+    const effectiveLength = Math.abs(length) ?? maxFractionDigits;
+    let maxValue;
+    if (fixedFractionDigits) {
+        // max value that can be represented with a dot
+        maxValue =
+            (10 ** (effectiveLength - (maxFractionDigits ? 1 : 0)) - 1) *
+                10 ** -maxFractionDigits;
+    }
+    else {
+        // max value that can be represented without a dot
+        maxValue = 10 ** effectiveLength - 1;
+    }
+    value = round(clamp(value, -maxValue, maxValue), {
+        fractionDigits: maxFractionDigits,
+        roundingMethod,
+    });
+    if (!fixedFractionDigits) {
+        // try to reduce fraction digits to fit the length
+        while (maxFractionDigits > 0 &&
+            value.toFixed(maxFractionDigits).length > effectiveLength) {
+            maxFractionDigits--;
+            value = round(value, {
+                fractionDigits: maxFractionDigits,
+                roundingMethod,
+            });
+        }
+        // if no fraction digits left, but still not fitting the length, increase
+        // fraction digits to have at least one decimal
+        if (maxFractionDigits === 0 &&
+            value.toFixed(maxFractionDigits).length === effectiveLength - 1) {
+            maxFractionDigits++;
+            // 10^(effectiveLength - 1) - 1 gives us the max integer that can be
+            // represented with the given length and 1 decimal
+            // e.g. effectiveLength=5 => 9999.9
+            //      effectiveLength=6 => 99999.9
+            //      effectiveLength=7 => 999999.9
+            // We then multiply by 10^-maxFractionDigits to get the correct decimal place
+            // e.g. maxFractionDigits=1 => 10^-1 = 0.1
+            //      maxFractionDigits=2 => 10^-2 = 0.01
+            //      maxFractionDigits=3 => 10^-3 = 0.001
+            // This ensures that we have at least one decimal place while still fitting
+            // the length.
+            value = (10 ** (effectiveLength - 1) - 1) * 10 ** -maxFractionDigits;
+        }
+    }
+    return value.toFixed(maxFractionDigits).padStart(effectiveLength, "0");
+}
+//# sourceMappingURL=to-fixed-length.js.map

package/dist/number/to-fixed-length.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"to-fixed-length.js","sourceRoot":"","sources":["../../src/number/to-fixed-length.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAuB,MAAM,oBAAoB,CAAC;AAChE,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAmBnC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,UAAU,aAAa,CAC5B,KAAa,EACb,MAAc,EACd,OAA8B;IAE9B,IAAI,iBAAiB,GAAG,OAAO,EAAE,iBAAiB,IAAI,CAAC,CAAC;IACxD,IAAI,mBAAmB,GAAG,OAAO,EAAE,mBAAmB,IAAI,KAAK,CAAC;IAChE,IAAI,cAAc,GAAG,OAAO,EAAE,cAAc,IAAI,OAAO,CAAC;IAExD,IAAI,iBAAiB,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,iBAAiB,CAAC;IAE9D,IAAI,QAAgB,CAAC;IACrB,IAAI,mBAAmB,EAAE,CAAC;QACzB,+CAA+C;QAC/C,QAAQ;YACP,CAAC,EAAE,IAAI,CAAC,eAAe,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC3D,EAAE,IAAI,CAAC,iBAAiB,CAAC;IAC3B,CAAC;SAAM,CAAC;QACP,kDAAkD;QAClD,QAAQ,GAAG,EAAE,IAAI,eAAe,GAAG,CAAC,CAAC;IACtC,CAAC;IAED,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE;QAChD,cAAc,EAAE,iBAAiB;QACjC,cAAc;KACd,CAAC,CAAC;IAEH,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC1B,kDAAkD;QAClD,OACC,iBAAiB,GAAG,CAAC;YACrB,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,MAAM,GAAG,eAAe,EACxD,CAAC;YACF,iBAAiB,EAAE,CAAC;YAEpB,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE;gBACpB,cAAc,EAAE,iBAAiB;gBACjC,cAAc;aACd,CAAC,CAAC;QACJ,CAAC;QAED,yEAAyE;QACzE,+CAA+C;QAC/C,IACC,iBAAiB,KAAK,CAAC;YACvB,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,MAAM,KAAK,eAAe,GAAG,CAAC,EAC9D,CAAC;YACF,iBAAiB,EAAE,CAAC;YAEpB,oEAAoE;YACpE,kDAAkD;YAClD,mCAAmC;YACnC,oCAAoC;YACpC,qCAAqC;YACrC,6EAA6E;YAC7E,0CAA0C;YAC1C,2CAA2C;YAC3C,4CAA4C;YAC5C,2EAA2E;YAC3E,cAAc;YACd,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,iBAAiB,CAAC;QACtE,CAAC;IACF,CAAC;IAED,OAAO,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,QAAQ,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;AACxE,CAAC"}

package/dist/number/ulp-distance.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Number of representable binary64 values between `a` and `b` — `0` when they
+ * are equal, `1` when they are adjacent.
+ *
+ * The raw count {@link isCloseUlp} thresholds. `±0` count as equal, matching
+ * `===`.
+ *
+ * @returns The ULP distance, or `Number.NaN` when either input is `NaN`. The
+ *   count is exact up to `Number.MAX_SAFE_INTEGER`, which only values nowhere
+ *   near each other can exceed.
+ */
+export declare function ulpDistance(a: number, b: number): number;
+//# sourceMappingURL=ulp-distance.d.ts.map

package/dist/number/ulp-distance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ulp-distance.d.ts","sourceRoot":"","sources":["../../src/number/ulp-distance.ts"],"names":[],"mappings":"AAoBA;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAaxD"}

package/dist/number/ulp-distance.js

@@ -0,0 +1,39 @@
+import { float64ToBits } from "./float64-bits.js";
+const SIGN_BIT_ = 1n << 63n;
+const MAGNITUDE_MASK_ = SIGN_BIT_ - 1n;
+/**
+ * Maps `value` onto a signed key ordered the same way the float is, so
+ * subtracting two keys counts the representable values between them.
+ *
+ * Sign-magnitude rather than the usual unsigned bias: it collapses `-0` and
+ * `+0` onto the same key, where any mapping that keeps their bit patterns apart
+ * leaves a vacant slot and reports one extra step across zero.
+ */
+function orderedKey_(value) {
+    const bits = float64ToBits(value);
+    const magnitude = bits & MAGNITUDE_MASK_;
+    return bits & SIGN_BIT_ ? -magnitude : magnitude;
+}
+/**
+ * Number of representable binary64 values between `a` and `b` — `0` when they
+ * are equal, `1` when they are adjacent.
+ *
+ * The raw count {@link isCloseUlp} thresholds. `±0` count as equal, matching
+ * `===`.
+ *
+ * @returns The ULP distance, or `Number.NaN` when either input is `NaN`. The
+ *   count is exact up to `Number.MAX_SAFE_INTEGER`, which only values nowhere
+ *   near each other can exceed.
+ */
+export function ulpDistance(a, b) {
+    if (Number.isNaN(a) || Number.isNaN(b)) {
+        return Number.NaN;
+    }
+    if (a === b) {
+        return 0;
+    }
+    const keyA = orderedKey_(a);
+    const keyB = orderedKey_(b);
+    return Number(keyA > keyB ? keyA - keyB : keyB - keyA);
+}
+//# sourceMappingURL=ulp-distance.js.map

package/dist/number/ulp-distance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ulp-distance.js","sourceRoot":"","sources":["../../src/number/ulp-distance.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAElD,MAAM,SAAS,GAAG,EAAE,IAAI,GAAG,CAAC;AAC5B,MAAM,eAAe,GAAG,SAAS,GAAG,EAAE,CAAC;AAEvC;;;;;;;GAOG;AACH,SAAS,WAAW,CAAC,KAAa;IACjC,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,GAAG,eAAe,CAAC;IAEzC,OAAO,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;AAClD,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC/C,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QACxC,OAAO,MAAM,CAAC,GAAG,CAAC;IACnB,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACb,OAAO,CAAC,CAAC;IACV,CAAC;IAED,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAE5B,OAAO,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;AACxD,CAAC"}

package/dist/number/ulp.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Width of one unit in the last place at `value` — the gap between `|value|`
+ * and the next representable binary64 away from zero.
+ *
+ * @returns The ULP width, `Number.NaN` for `NaN`, or `Infinity` for an infinite
+ *   input.
+ */
+export declare function ulp(value: number): number;
+//# sourceMappingURL=ulp.d.ts.map

package/dist/number/ulp.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ulp.d.ts","sourceRoot":"","sources":["../../src/number/ulp.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,wBAAgB,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAiBzC"}

package/dist/number/ulp.js

@@ -0,0 +1,24 @@
+import { nextAfter } from "./next-after.js";
+/**
+ * Width of one unit in the last place at `value` — the gap between `|value|`
+ * and the next representable binary64 away from zero.
+ *
+ * @returns The ULP width, `Number.NaN` for `NaN`, or `Infinity` for an infinite
+ *   input.
+ */
+export function ulp(value) {
+    if (Number.isNaN(value)) {
+        return Number.NaN;
+    }
+    if (!Number.isFinite(value)) {
+        return Number.POSITIVE_INFINITY;
+    }
+    const magnitude = Math.abs(value);
+    const next = nextAfter(magnitude, Number.POSITIVE_INFINITY);
+    // At MAX_VALUE the step away from zero overflows to Infinity, so the gap is
+    // measured on the other side, where the exponent is the same.
+    return Number.isFinite(next)
+        ? next - magnitude
+        : magnitude - nextAfter(magnitude, 0);
+}
+//# sourceMappingURL=ulp.js.map

package/dist/number/ulp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ulp.js","sourceRoot":"","sources":["../../src/number/ulp.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAE5C;;;;;;GAMG;AACH,MAAM,UAAU,GAAG,CAAC,KAAa;IAChC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC,GAAG,CAAC;IACnB,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,MAAM,CAAC,iBAAiB,CAAC;IACjC,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAE5D,4EAA4E;IAC5E,8DAA8D;IAC9D,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;QAC3B,CAAC,CAAC,IAAI,GAAG,SAAS;QAClB,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC"}

package/dist/object/clone.d.ts

@@ -0,0 +1,78 @@
+/** What to do with a value that cannot be copied. */
+export type CloneUnsupportedPolicy = "throw" | "reference" | "omit";
+export type CloneOptions = {
+    /**
+     * Whether to clone nested values too, so the copy shares no reference with
+     * the original. Defaults to `false`.
+     *
+     * Recursing costs the whole tree rather than the top level. Cycles and
+     * repeated references are preserved: an object reached twice is cloned once
+     * and the copy is shared, exactly as the original was.
+     */
+    recursive?: boolean;
+    /**
+     * `ArrayBuffer`s to move into the clone instead of copying. Each one is
+     * detached from the caller, so the original and every view over it become
+     * unusable — in exchange the bytes are never copied.
+     *
+     * Only an `ArrayBuffer` can be transferred. The other `Transferable` types
+     * (`MessagePort`, the stream types, `ImageBitmap`, …) can only be moved by
+     * the host, so passing one throws.
+     *
+     * Every entry must be reached by the value being cloned, or it throws. This
+     * deliberately differs from `structuredClone`, which detaches an unreachable
+     * entry anyway and then discards it.
+     *
+     * Without `recursive`, only buffers reachable at depth 1 are considered,
+     * since nothing deeper is visited.
+     */
+    transfer?: readonly ArrayBuffer[];
+    /**
+     * `"preserve"` (default) keeps the original's prototype, so a class instance
+     * clones as an instance of the same class. `"plain"` produces an ordinary
+     * object instead, the way `structuredClone` does.
+     */
+    prototype?: "preserve" | "plain";
+    /** Whether to copy symbol-keyed properties. Defaults to `true`. */
+    symbolKeys?: boolean;
+    /** Whether to copy non-enumerable properties. Defaults to `true`. */
+    nonEnumerable?: boolean;
+    /**
+     * Whether to copy property attributes — writable, enumerable, configurable,
+     * and getters/setters. Defaults to `true`.
+     *
+     * An accessor cannot be deep-copied: its getter and setter are functions, so
+     * preserving one shares those functions with the original. Set this to
+     * `false` to read each accessor once and store the result as a plain writable
+     * data property, which is what a consumer that intends to overwrite the copy
+     * needs.
+     */
+    descriptors?: boolean;
+    /**
+     * What to do with a value that cannot be copied — a function, a symbol, a
+     * `WeakMap`/`WeakSet`, a `Promise`. `"throw"` (default) reports it,
+     * `"reference"` shares the original, `"omit"` drops the property holding it.
+     *
+     * Only consulted for values actually visited, so a shallow clone never
+     * inspects property values and never applies this to them.
+     */
+    unsupported?: CloneUnsupportedPolicy;
+};
+/**
+ * Clone a value.
+ *
+ * By default the copy is faithful: it keeps the original's prototype, its
+ * symbol-keyed and non-enumerable properties, and its property attributes. Pass
+ * `recursive` to copy nested values too.
+ *
+ * Time complexity: O(1) in the size of the tree for a shallow clone, O(n) over
+ * every reachable value for a recursive one.
+ *
+ * @param value The value to clone
+ * @param options Clone options
+ * @returns The cloned value
+ * @throws {UnsupportedError} If a value cannot be copied and `unsupported` is
+ *   `"throw"`, or if the transfer list is invalid or not fully reached.
+ */
+export declare function clone<T>(value: T, options?: CloneOptions): T;
+//# sourceMappingURL=clone.d.ts.map

package/dist/object/clone.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"clone.d.ts","sourceRoot":"","sources":["../../src/object/clone.ts"],"names":[],"mappings":"AAiBA,qDAAqD;AACrD,MAAM,MAAM,sBAAsB,GAAG,OAAO,GAAG,WAAW,GAAG,MAAM,CAAC;AAEpE,MAAM,MAAM,YAAY,GAAG;IAC1B;;;;;;;OAOG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IAEpB;;;;;;;;;;;;;;;OAeG;IACH,QAAQ,CAAC,EAAE,SAAS,WAAW,EAAE,CAAC;IAElC;;;;OAIG;IACH,SAAS,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC;IAEjC,mEAAmE;IACnE,UAAU,CAAC,EAAE,OAAO,CAAC;IAErB,qEAAqE;IACrE,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;;;;;;;OASG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB;;;;;;;OAOG;IACH,WAAW,CAAC,EAAE,sBAAsB,CAAC;CACrC,CAAC;AAiDF;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,CAAC,CA0B5D"}

package/dist/object/clone.js

@@ -0,0 +1,359 @@
+import { UnsupportedError } from "../error/unsupported-error.js";
+import { isArrayBuffer } from "../guards/is-array-buffer.js";
+import { isDataView } from "../guards/is-data-view.js";
+import { isDate } from "../guards/is-date.js";
+import { isMap } from "../guards/is-map.js";
+import { isPrimitive } from "../guards/is-primitive.js";
+import { isPromise } from "../guards/is-promise.js";
+import { isRegExp } from "../guards/is-regexp.js";
+import { isSet } from "../guards/is-set.js";
+import { isSharedArrayBuffer } from "../guards/is-shared-array-buffer.js";
+import { isTypedArray } from "../guards/is-typed-array.js";
+import { isWeakMap } from "../guards/is-weak-map.js";
+import { isWeakSet } from "../guards/is-weak-set.js";
+import { getObjectKeys } from "./get-object-keys.js";
+/** Signals that a value was dropped, so its property is skipped entirely. */
+const OMIT_ = Symbol("clone.omit");
+/**
+ * Platform types whose data lives in internal slots rather than in properties,
+ * so copying their descriptors would yield a hollow object. Only the host can
+ * copy these, so they are handed to `structuredClone` — which ignores every
+ * fidelity option below, because it is the only implementation available.
+ *
+ * Anything absent from this set, including a class carrying its own
+ * `Symbol.toStringTag`, is copied normally and keeps its prototype.
+ */
+const HOST_OBJECT_TAGS_ = new Set([
+    "[object AudioData]",
+    "[object Blob]",
+    "[object CryptoKey]",
+    "[object DOMException]",
+    "[object DOMMatrix]",
+    "[object DOMMatrixReadOnly]",
+    "[object DOMPoint]",
+    "[object DOMPointReadOnly]",
+    "[object DOMQuad]",
+    "[object DOMRect]",
+    "[object DOMRectReadOnly]",
+    "[object File]",
+    "[object FileList]",
+    "[object ImageBitmap]",
+    "[object ImageData]",
+    "[object RTCCertificate]",
+    "[object VideoFrame]",
+]);
+/**
+ * Clone a value.
+ *
+ * By default the copy is faithful: it keeps the original's prototype, its
+ * symbol-keyed and non-enumerable properties, and its property attributes. Pass
+ * `recursive` to copy nested values too.
+ *
+ * Time complexity: O(1) in the size of the tree for a shallow clone, O(n) over
+ * every reachable value for a recursive one.
+ *
+ * @param value The value to clone
+ * @param options Clone options
+ * @returns The cloned value
+ * @throws {UnsupportedError} If a value cannot be copied and `unsupported` is
+ *   `"throw"`, or if the transfer list is invalid or not fully reached.
+ */
+export function clone(value, options) {
+    const recursive = options?.recursive ?? false;
+    const pending = options?.transfer === undefined ? null : prepareTransfer_(options.transfer);
+    const resolved = {
+        recursive,
+        prototype: options?.prototype ?? "preserve",
+        symbolKeys: options?.symbolKeys ?? true,
+        nonEnumerable: options?.nonEnumerable ?? true,
+        descriptors: options?.descriptors ?? true,
+        unsupported: options?.unsupported ?? "throw",
+        moved: pending === null ? null : new Map(),
+        pending,
+        seen: recursive ? new WeakMap() : null,
+    };
+    const cloned = cloneValue_(value, resolved);
+    if (pending !== null && pending.size > 0) {
+        throw new UnsupportedError("transfer list holds an ArrayBuffer the cloned value does not reach");
+    }
+    return (cloned === OMIT_ ? undefined : cloned);
+}
+function prepareTransfer_(transfer) {
+    const pending = new Set();
+    for (const buffer of transfer) {
+        if (isSharedArrayBuffer(buffer)) {
+            throw new UnsupportedError("a SharedArrayBuffer is shared, not transferable");
+        }
+        if (!isArrayBuffer(buffer)) {
+            throw new UnsupportedError(`only an ArrayBuffer can be transferred, got ${describe_(buffer)}`);
+        }
+        if (buffer.detached) {
+            throw new UnsupportedError("an already-detached ArrayBuffer");
+        }
+        if (pending.has(buffer)) {
+            throw new UnsupportedError("a duplicate ArrayBuffer in the transfer list");
+        }
+        pending.add(buffer);
+    }
+    return pending;
+}
+function cloneValue_(value, options) {
+    if (isPrimitive(value)) {
+        // every primitive but a symbol is already immutable
+        return typeof value === "symbol"
+            ? unsupported_(value, "a symbol", options)
+            : value;
+    }
+    if (typeof value === "function") {
+        return unsupported_(value, "a function", options);
+    }
+    const seen = options.seen?.get(value);
+    if (seen !== undefined) {
+        return seen;
+    }
+    return cloneObject_(value, options);
+}
+function cloneObject_(value, options) {
+    // bytes first: these own storage rather than properties
+    if (isArrayBuffer(value)) {
+        return remember_(value, takeMoved_(value, options) ?? value.slice(0), options);
+    }
+    if (isSharedArrayBuffer(value)) {
+        // copying shared memory would defeat the point of sharing it
+        return remember_(value, value, options);
+    }
+    if (isTypedArray(value) || isDataView(value)) {
+        return remember_(value, cloneView_(value, options), options);
+    }
+    if (isWeakMap(value)) {
+        return unsupported_(value, "a WeakMap", options);
+    }
+    if (isWeakSet(value)) {
+        return unsupported_(value, "a WeakSet", options);
+    }
+    if (isPromise(value)) {
+        return unsupported_(value, "a Promise", options);
+    }
+    if (Array.isArray(value)) {
+        return cloneArray_(value, options);
+    }
+    if (isMap(value)) {
+        return cloneMap_(value, options);
+    }
+    if (isSet(value)) {
+        return cloneSet_(value, options);
+    }
+    if (isDate(value)) {
+        return remember_(value, cloneDate_(value, options), options);
+    }
+    if (isRegExp(value)) {
+        return remember_(value, cloneRegExp_(value, options), options);
+    }
+    if (HOST_OBJECT_TAGS_.has(Object.prototype.toString.call(value))) {
+        return remember_(value, cloneHostObject_(value, options), options);
+    }
+    return cloneOrdinary_(value, options);
+}
+function cloneOrdinary_(value, options) {
+    const prototype = options.prototype === "preserve"
+        ? Object.getPrototypeOf(value)
+        : Object.prototype;
+    // nothing is visited, so the whole copy is one call
+    if (!options.recursive &&
+        options.descriptors &&
+        options.symbolKeys &&
+        options.nonEnumerable &&
+        options.moved === null) {
+        return Object.create(prototype, Object.getOwnPropertyDescriptors(value));
+    }
+    const target = Object.create(prototype);
+    remember_(value, target, options);
+    copyOwnProperties_(target, value, options, null);
+    return target;
+}
+function cloneArray_(value, options) {
+    // oxlint-disable-next-line unicorn/no-new-array -- Array.from writes undefined into every slot, which costs a pass and fills the holes this must preserve
+    const target = new Array(value.length);
+    remember_(value, target, options);
+    // `length` is already set, and every present index is an own key
+    copyOwnProperties_(target, value, options, (key) => key === "length");
+    return target;
+}
+function cloneMap_(value, options) {
+    const target = new Map();
+    remember_(value, target, options);
+    for (const [key, item] of value) {
+        const clonedKey = cloneChild_(key, options);
+        const clonedValue = cloneChild_(item, options);
+        if (clonedKey === OMIT_ || clonedValue === OMIT_) {
+            continue;
+        }
+        target.set(clonedKey, clonedValue);
+    }
+    copyOwnProperties_(target, value, options, null);
+    return target;
+}
+function cloneSet_(value, options) {
+    const target = new Set();
+    remember_(value, target, options);
+    for (const item of value) {
+        const cloned = cloneChild_(item, options);
+        if (cloned !== OMIT_) {
+            target.add(cloned);
+        }
+    }
+    copyOwnProperties_(target, value, options, null);
+    return target;
+}
+function cloneDate_(value, options) {
+    const target = new Date(value.getTime());
+    copyOwnProperties_(target, value, options, null);
+    return target;
+}
+function cloneRegExp_(value, options) {
+    const target = new RegExp(value.source, value.flags);
+    target.lastIndex = value.lastIndex;
+    copyOwnProperties_(target, value, options, (key) => key === "lastIndex");
+    return target;
+}
+function cloneHostObject_(value, options) {
+    try {
+        return structuredClone(value);
+    }
+    catch (error) {
+        return unsupported_(value, describe_(value), options, error);
+    }
+}
+function cloneView_(value, options) {
+    const buffer = value.buffer;
+    // read the geometry first: transferring the buffer detaches this view too
+    const byteOffset = value.byteOffset;
+    const length = isDataView(value) ? value.byteLength : value.length;
+    if (isArrayBuffer(buffer)) {
+        const moved = takeMoved_(buffer, options);
+        if (moved !== null) {
+            return rebuildView_(value, moved, byteOffset, length);
+        }
+    }
+    // a shared buffer stays shared; the view over it is still a fresh object
+    if (isSharedArrayBuffer(buffer)) {
+        return rebuildView_(value, buffer, byteOffset, length);
+    }
+    return rebuildView_(value, buffer.slice(0), byteOffset, length);
+}
+function rebuildView_(value, buffer, byteOffset, length) {
+    // every view constructor takes (buffer, byteOffset, length), but the union of
+    // their types exposes no single callable signature
+    const construct = value.constructor;
+    return new construct(buffer, byteOffset, length);
+}
+function takeMoved_(buffer, options) {
+    const moved = options.moved;
+    if (moved === null) {
+        return null;
+    }
+    // a buffer with several views is transferred once, then reused
+    const already = moved.get(buffer);
+    if (already !== undefined) {
+        return already;
+    }
+    if (options.pending?.delete(buffer) !== true) {
+        return null;
+    }
+    const transferred = buffer.transfer();
+    moved.set(buffer, transferred);
+    return transferred;
+}
+/**
+ * Clone a value held by a container, honouring the shallow mode's promise to
+ * leave nested values alone — except for a buffer the caller asked to move.
+ */
+function cloneChild_(value, options) {
+    if (options.recursive) {
+        return cloneValue_(value, options);
+    }
+    if (options.moved === null) {
+        return value;
+    }
+    if (isArrayBuffer(value)) {
+        return takeMoved_(value, options) ?? value;
+    }
+    if (isTypedArray(value) || isDataView(value)) {
+        const buffer = value.buffer;
+        if (isArrayBuffer(buffer)) {
+            // read the geometry first: transferring detaches this view too
+            const byteOffset = value.byteOffset;
+            const length = isDataView(value) ? value.byteLength : value.length;
+            const moved = takeMoved_(buffer, options);
+            if (moved !== null) {
+                return rebuildView_(value, moved, byteOffset, length);
+            }
+        }
+    }
+    return value;
+}
+function copyOwnProperties_(target, source, options, skip) {
+    for (const key of ownKeys_(source, options)) {
+        if (skip?.(key) === true) {
+            continue;
+        }
+        const descriptor = Object.getOwnPropertyDescriptor(source, key);
+        if (descriptor === undefined) {
+            continue;
+        }
+        // an accessor's getter and setter are functions, so preserving one shares
+        // them; `descriptors: false` reads it once into a data property instead
+        if (options.descriptors &&
+            (descriptor.get !== undefined || descriptor.set !== undefined)) {
+            Object.defineProperty(target, key, descriptor);
+            continue;
+        }
+        const raw = "value" in descriptor ? descriptor.value : descriptor.get?.call(source);
+        const value = cloneChild_(raw, options);
+        if (value === OMIT_) {
+            continue;
+        }
+        Object.defineProperty(target, key, {
+            value,
+            writable: options.descriptors ? (descriptor.writable ?? true) : true,
+            enumerable: options.descriptors ? descriptor.enumerable : true,
+            configurable: options.descriptors ? descriptor.configurable : true,
+        });
+    }
+}
+function ownKeys_(source, options) {
+    // one call answers the default, where nothing is filtered out
+    if (options.symbolKeys && options.nonEnumerable) {
+        return Reflect.ownKeys(source);
+    }
+    return getObjectKeys(source, {
+        includeSymbolKeys: options.symbolKeys,
+        includeNonEnumerable: options.nonEnumerable,
+        includePrototypeChain: false,
+    }).map((key) => key.property);
+}
+function remember_(original, cloned, options) {
+    options.seen?.set(original, cloned);
+    return cloned;
+}
+function unsupported_(value, description, options, cause) {
+    switch (options.unsupported) {
+        case "reference":
+            return value;
+        case "omit":
+            return OMIT_;
+        default:
+            throw new UnsupportedError(`cannot clone ${description}`, cause === undefined ? undefined : { cause });
+    }
+}
+/** Names a value by kind, never by content, so no secret reaches a message. */
+function describe_(value) {
+    if (value === null) {
+        return "null";
+    }
+    if (typeof value !== "object") {
+        return `a ${typeof value}`;
+    }
+    return Object.prototype.toString.call(value);
+}
+//# sourceMappingURL=clone.js.map

package/dist/object/clone.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clone.js","sourceRoot":"","sources":["../../src/object/clone.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,gBAAgB,EAAE,MAAM,+BAA+B,CAAC;AACjE,OAAO,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,qCAAqC,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAC3D,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACrD,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACrD,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAsErD,6EAA6E;AAC7E,MAAM,KAAK,GAAkB,MAAM,CAAC,YAAY,CAAC,CAAC;AAElD;;;;;;;;GAQG;AACH,MAAM,iBAAiB,GAAwB,IAAI,GAAG,CAAC;IACtD,oBAAoB;IACpB,eAAe;IACf,oBAAoB;IACpB,uBAAuB;IACvB,oBAAoB;IACpB,4BAA4B;IAC5B,mBAAmB;IACnB,2BAA2B;IAC3B,kBAAkB;IAClB,kBAAkB;IAClB,0BAA0B;IAC1B,eAAe;IACf,mBAAmB;IACnB,sBAAsB;IACtB,oBAAoB;IACpB,yBAAyB;IACzB,qBAAqB;CACrB,CAAC,CAAC;AAiBH;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,KAAK,CAAI,KAAQ,EAAE,OAAsB;IACxD,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,KAAK,CAAC;IAC9C,MAAM,OAAO,GACZ,OAAO,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAE7E,MAAM,QAAQ,GAAc;QAC3B,SAAS;QACT,SAAS,EAAE,OAAO,EAAE,SAAS,IAAI,UAAU;QAC3C,UAAU,EAAE,OAAO,EAAE,UAAU,IAAI,IAAI;QACvC,aAAa,EAAE,OAAO,EAAE,aAAa,IAAI,IAAI;QAC7C,WAAW,EAAE,OAAO,EAAE,WAAW,IAAI,IAAI;QACzC,WAAW,EAAE,OAAO,EAAE,WAAW,IAAI,OAAO;QAC5C,KAAK,EAAE,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE;QAC1C,OAAO;QACP,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI;KACtC,CAAC;IAEF,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAE5C,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,gBAAgB,CACzB,oEAAoE,CACpE,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAM,CAAC;AACrD,CAAC;AAED,SAAS,gBAAgB,CAAC,QAAgC;IACzD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAe,CAAC;IAEvC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,mBAAmB,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,gBAAgB,CACzB,iDAAiD,CACjD,CAAC;QACH,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,gBAAgB,CACzB,+CAA+C,SAAS,CAAC,MAAM,CAAC,EAAE,CAClE,CAAC;QACH,CAAC;QACD,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACrB,MAAM,IAAI,gBAAgB,CAAC,iCAAiC,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,gBAAgB,CACzB,8CAA8C,CAC9C,CAAC;QACH,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,WAAW,CAAC,KAAc,EAAE,OAAkB;IACtD,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QACxB,oDAAoD;QACpD,OAAO,OAAO,KAAK,KAAK,QAAQ;YAC/B,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC;YAC1C,CAAC,CAAC,KAAK,CAAC;IACV,CAAC;IAED,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;QACjC,OAAO,YAAY,CAAC,KAAK,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IACb,CAAC;IAED,OAAO,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,YAAY,CAAC,KAAa,EAAE,OAAkB;IACtD,wDAAwD;IACxD,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,SAAS,CACf,KAAK,EACL,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAC5C,OAAO,CACP,CAAC;IACH,CAAC;IACD,IAAI,mBAAmB,CAAC,KAAK,CAAC,EAAE,CAAC;QAChC,6DAA6D;QAC7D,OAAO,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACzC,CAAC;IACD,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9C,OAAO,SAAS,CAAC,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAC9D,CAAC;IAED,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC;IACD,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC;IACD,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACpC,CAAC;IACD,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,SAAS,CAAC,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,SAAS,CAAC,KAAK,EAAE,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAChE,CAAC;IAED,IAAI,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QAClE,OAAO,SAAS,CAAC,KAAK,EAAE,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IACpE,CAAC;IAED,OAAO,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,cAAc,CAAC,KAAa,EAAE,OAAkB;IACxD,MAAM,SAAS,GACd,OAAO,CAAC,SAAS,KAAK,UAAU;QAC/B,CAAC,CAAE,MAAM,CAAC,cAAc,CAAC,KAAK,CAAmB;QACjD,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC;IAErB,oDAAoD;IACpD,IACC,CAAC,OAAO,CAAC,SAAS;QAClB,OAAO,CAAC,WAAW;QACnB,OAAO,CAAC,UAAU;QAClB,OAAO,CAAC,aAAa;QACrB,OAAO,CAAC,KAAK,KAAK,IAAI,EACrB,CAAC;QACF,OAAO,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAW,CAAC;IAClD,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAClC,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IAEjD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAAC,KAAgB,EAAE,OAAkB;IACxD,0JAA0J;IAC1J,MAAM,MAAM,GAAG,IAAI,KAAK,CAAU,KAAK,CAAC,MAAM,CAAC,CAAC;IAChD,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAClC,iEAAiE;IACjE,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,QAAQ,CAAC,CAAC;IAEtE,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,SAAS,CACjB,KAA4B,EAC5B,OAAkB;IAElB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAElC,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QACjC,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAC5C,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC/C,IAAI,SAAS,KAAK,KAAK,IAAI,WAAW,KAAK,KAAK,EAAE,CAAC;YAClD,SAAS;QACV,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACpC,CAAC;IAED,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IAEjD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,SAAS,CAAC,KAAmB,EAAE,OAAkB;IACzD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAW,CAAC;IAClC,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAElC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1C,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,CAAC;IACF,CAAC;IAED,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IAEjD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,UAAU,CAAC,KAAW,EAAE,OAAkB;IAClD,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IACzC,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IAEjD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CAAC,KAAa,EAAE,OAAkB;IACtD,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;IACnC,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,WAAW,CAAC,CAAC;IAEzE,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,gBAAgB,CAAC,KAAa,EAAE,OAAkB;IAC1D,IAAI,CAAC;QACJ,OAAO,eAAe,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QAChB,OAAO,YAAY,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IAC9D,CAAC;AACF,CAAC;AASD,SAAS,UAAU,CAClB,KAA4B,EAC5B,OAAkB;IAElB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,0EAA0E;IAC1E,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;IACpC,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IAEnE,IAAI,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC1C,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACpB,OAAO,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;QACvD,CAAC;IACF,CAAC;IAED,yEAAyE;IACzE,IAAI,mBAAmB,CAAC,MAAM,CAAC,EAAE,CAAC;QACjC,OAAO,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;IACxD,CAAC;IAED,OAAO,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,YAAY,CACpB,KAA4B,EAC5B,MAAuB,EACvB,UAAkB,EAClB,MAAc;IAEd,8EAA8E;IAC9E,mDAAmD;IACnD,MAAM,SAAS,GAAG,KAAK,CAAC,WAA0C,CAAC;IAEnE,OAAO,IAAI,SAAS,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,UAAU,CAClB,MAAmB,EACnB,OAAkB;IAElB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5B,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC;IACb,CAAC;IAED,+DAA+D;IAC/D,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAClC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,OAAO,CAAC;IAChB,CAAC;IAED,IAAI,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;QAC9C,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;IACtC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAE/B,OAAO,WAAW,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAAC,KAAc,EAAE,OAAkB;IACtD,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;QACvB,OAAO,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACpC,CAAC;IACD,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;QAC5B,OAAO,KAAK,CAAC;IACd,CAAC;IAED,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,KAAK,CAAC;IAC5C,CAAC;IACD,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,IAAI,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,+DAA+D;YAC/D,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;YACpC,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;YACnE,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAC1C,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACpB,OAAO,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;YACvD,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,kBAAkB,CAC1B,MAAc,EACd,MAAc,EACd,OAAkB,EAClB,IAAgD;IAEhD,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;QAC7C,IAAI,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;YAC1B,SAAS;QACV,CAAC;QAED,MAAM,UAAU,GAAG,MAAM,CAAC,wBAAwB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAChE,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC9B,SAAS;QACV,CAAC;QAED,0EAA0E;QAC1E,wEAAwE;QACxE,IACC,OAAO,CAAC,WAAW;YACnB,CAAC,UAAU,CAAC,GAAG,KAAK,SAAS,IAAI,UAAU,CAAC,GAAG,KAAK,SAAS,CAAC,EAC7D,CAAC;YACF,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;YAC/C,SAAS;QACV,CAAC;QAED,MAAM,GAAG,GACR,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACzE,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACxC,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;YACrB,SAAS;QACV,CAAC;QAED,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE;YAClC,KAAK;YACL,QAAQ,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI;YACpE,UAAU,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI;YAC9D,YAAY,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI;SAClE,CAAC,CAAC;IACJ,CAAC;AACF,CAAC;AAED,SAAS,QAAQ,CAAC,MAAc,EAAE,OAAkB;IACnD,8DAA8D;IAC9D,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;QACjD,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,aAAa,CAAC,MAAM,EAAE;QAC5B,iBAAiB,EAAE,OAAO,CAAC,UAAU;QACrC,oBAAoB,EAAE,OAAO,CAAC,aAAa;QAC3C,qBAAqB,EAAE,KAAK;KAC5B,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,SAAS,CAAI,QAAgB,EAAE,MAAS,EAAE,OAAkB;IACpE,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAEpC,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CACpB,KAAc,EACd,WAAmB,EACnB,OAAkB,EAClB,KAAe;IAEf,QAAQ,OAAO,CAAC,WAAW,EAAE,CAAC;QAC7B,KAAK,WAAW;YACf,OAAO,KAAK,CAAC;QACd,KAAK,MAAM;YACV,OAAO,KAAK,CAAC;QACd;YACC,MAAM,IAAI,gBAAgB,CACzB,gBAAgB,WAAW,EAAE,EAC7B,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAC3C,CAAC;IACJ,CAAC;AACF,CAAC;AAED,+EAA+E;AAC/E,SAAS,SAAS,CAAC,KAAc;IAChC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACpB,OAAO,MAAM,CAAC;IACf,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC/B,OAAO,KAAK,OAAO,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED,OAAO,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC9C,CAAC"}