@czap/core 0.1.0

package/dist/blend.d.ts

@@ -0,0 +1,61 @@
+/**
+ * BlendTree -- weighted multi-state blending.
+ *
+ * A blend tree holds named numeric-record values with weights.
+ * `compute()` returns the weighted average of all values.
+ *
+ * @module
+ */
+import type { Scope } from 'effect';
+import { Effect, Stream } from 'effect';
+interface BlendNodeShape<T> {
+    readonly value: T;
+    readonly weight: number;
+}
+interface BlendTreeShape<T extends Record<string, number>> {
+    add(name: string, value: T, weight: number): void;
+    remove(name: string): void;
+    setWeight(name: string, weight: number): void;
+    compute(): T;
+    readonly changes: Stream.Stream<T>;
+}
+/**
+ * Creates a new BlendTree for weighted multi-state blending of numeric records.
+ * Requires a Scope for lifecycle management of the change stream.
+ *
+ * @example
+ * ```ts
+ * const program = Effect.scoped(Effect.gen(function* () {
+ *   const tree = yield* BlendTree.make<{ x: number; y: number }>();
+ *   tree.add('idle', { x: 0, y: 0 }, 0.3);
+ *   tree.add('active', { x: 100, y: 50 }, 0.7);
+ *   const blended = tree.compute(); // { x: 70, y: 35 }
+ * }));
+ * ```
+ */
+declare function _make<T extends Record<string, number>>(): Effect.Effect<BlendTreeShape<T>, never, Scope.Scope>;
+/**
+ * BlendTree -- weighted multi-state blending for numeric records.
+ * Add named nodes with values and weights, then compute the weighted average.
+ *
+ * @example
+ * ```ts
+ * const program = Effect.scoped(Effect.gen(function* () {
+ *   const tree = yield* BlendTree.make<{ opacity: number }>();
+ *   tree.add('fadeIn', { opacity: 1 }, 0.8);
+ *   tree.add('fadeOut', { opacity: 0 }, 0.2);
+ *   const result = tree.compute(); // { opacity: 0.8 }
+ * }));
+ * ```
+ */
+export declare const BlendTree: {
+    make: typeof _make;
+};
+export declare namespace BlendTree {
+    /** Structural shape of a blend-tree instance: `sample(weights)` over a `Record<string, number>` space. */
+    type Shape<T extends Record<string, number>> = BlendTreeShape<T>;
+    /** Individual leaf/intermediate node in a blend tree. */
+    type Node<T> = BlendNodeShape<T>;
+}
+export {};
+//# sourceMappingURL=blend.d.ts.map

package/dist/blend.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blend.d.ts","sourceRoot":"","sources":["../src/blend.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAC;AACpC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAU,MAAM,QAAQ,CAAC;AAEhD,UAAU,cAAc,CAAC,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAClB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,UAAU,cAAc,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IACvD,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAClD,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9C,OAAO,IAAI,CAAC,CAAC;IACb,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;CACpC;AAED;;;;;;;;;;;;;GAaG;AACH,iBAAS,KAAK,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAwEvG;AAED;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,SAAS;;CAAkB,CAAC;AAEzC,MAAM,CAAC,OAAO,WAAW,SAAS,CAAC;IACjC,0GAA0G;IAC1G,KAAY,KAAK,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC;IACxE,yDAAyD;IACzD,KAAY,IAAI,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC;CACzC"}

package/dist/blend.js

@@ -0,0 +1,100 @@
+/**
+ * BlendTree -- weighted multi-state blending.
+ *
+ * A blend tree holds named numeric-record values with weights.
+ * `compute()` returns the weighted average of all values.
+ *
+ * @module
+ */
+import { Effect, Stream, PubSub } from 'effect';
+/**
+ * Creates a new BlendTree for weighted multi-state blending of numeric records.
+ * Requires a Scope for lifecycle management of the change stream.
+ *
+ * @example
+ * ```ts
+ * const program = Effect.scoped(Effect.gen(function* () {
+ *   const tree = yield* BlendTree.make<{ x: number; y: number }>();
+ *   tree.add('idle', { x: 0, y: 0 }, 0.3);
+ *   tree.add('active', { x: 100, y: 50 }, 0.7);
+ *   const blended = tree.compute(); // { x: 70, y: 35 }
+ * }));
+ * ```
+ */
+function _make() {
+    return Effect.gen(function* () {
+        const nodes = new Map();
+        const pubsub = yield* PubSub.unbounded();
+        // The computed result is a Record<string, number> whose keys match T's keys by
+        // construction (we only write keys copied from node.value, which is T). TS can't
+        // track that structural promise, so we contain one cast in a named helper.
+        const finalizeBlend = (record) => record;
+        function computeBlend() {
+            const result = {};
+            let totalWeight = 0;
+            for (const node of nodes.values()) {
+                if (node.weight > 0)
+                    totalWeight += node.weight;
+            }
+            if (totalWeight === 0 || nodes.size === 0) {
+                return finalizeBlend(result);
+            }
+            let initialized = false;
+            for (const node of nodes.values()) {
+                const w = node.weight > 0 ? node.weight / totalWeight : 0;
+                for (const key in node.value) {
+                    if (Object.prototype.hasOwnProperty.call(node.value, key)) {
+                        if (!initialized || !(key in result)) {
+                            result[key] = 0;
+                        }
+                        result[key] += node.value[key] * w;
+                    }
+                }
+                initialized = true;
+            }
+            return finalizeBlend(result);
+        }
+        function notifyChange() {
+            const blended = computeBlend();
+            Effect.runSync(PubSub.publish(pubsub, blended));
+        }
+        const tree = {
+            add(name, value, weight) {
+                nodes.set(name, { value, weight });
+                notifyChange();
+            },
+            remove(name) {
+                nodes.delete(name);
+                notifyChange();
+            },
+            setWeight(name, weight) {
+                const node = nodes.get(name);
+                if (node) {
+                    nodes.set(name, { ...node, weight });
+                    notifyChange();
+                }
+            },
+            compute() {
+                return computeBlend();
+            },
+            changes: Stream.fromPubSub(pubsub),
+        };
+        return tree;
+    });
+}
+/**
+ * BlendTree -- weighted multi-state blending for numeric records.
+ * Add named nodes with values and weights, then compute the weighted average.
+ *
+ * @example
+ * ```ts
+ * const program = Effect.scoped(Effect.gen(function* () {
+ *   const tree = yield* BlendTree.make<{ opacity: number }>();
+ *   tree.add('fadeIn', { opacity: 1 }, 0.8);
+ *   tree.add('fadeOut', { opacity: 0 }, 0.2);
+ *   const result = tree.compute(); // { opacity: 0.8 }
+ * }));
+ * ```
+ */
+export const BlendTree = { make: _make };
+//# sourceMappingURL=blend.js.map

package/dist/blend.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blend.js","sourceRoot":"","sources":["../src/blend.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAehD;;;;;;;;;;;;;GAaG;AACH,SAAS,KAAK;IACZ,OAAO,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QACzB,MAAM,KAAK,GAAG,IAAI,GAAG,EAA6B,CAAC;QACnD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,SAAS,EAAK,CAAC;QAE5C,+EAA+E;QAC9E,iFAAiF;QACjF,2EAA2E;QAC5E,MAAM,aAAa,GAAG,CAAC,MAA8B,EAAK,EAAE,CAAC,MAAsB,CAAC;QAEpF,SAAS,YAAY;YACnB,MAAM,MAAM,GAA2B,EAAE,CAAC;YAC1C,IAAI,WAAW,GAAG,CAAC,CAAC;YAEpB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;oBAAE,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC;YAClD,CAAC;YAED,IAAI,WAAW,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC1C,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;YAED,IAAI,WAAW,GAAG,KAAK,CAAC;YACxB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1D,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC7B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;wBAC1D,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE,CAAC;4BACrC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBAClB,CAAC;wBACD,MAAM,CAAC,GAAG,CAAE,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAE,GAAG,CAAC,CAAC;oBACvC,CAAC;gBACH,CAAC;gBACD,WAAW,GAAG,IAAI,CAAC;YACrB,CAAC;YAED,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QAED,SAAS,YAAY;YACnB,MAAM,OAAO,GAAG,YAAY,EAAE,CAAC;YAC/B,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,MAAM,IAAI,GAAsB;YAC9B,GAAG,CAAC,IAAY,EAAE,KAAQ,EAAE,MAAc;gBACxC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;gBACnC,YAAY,EAAE,CAAC;YACjB,CAAC;YAED,MAAM,CAAC,IAAY;gBACjB,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACnB,YAAY,EAAE,CAAC;YACjB,CAAC;YAED,SAAS,CAAC,IAAY,EAAE,MAAc;gBACpC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC7B,IAAI,IAAI,EAAE,CAAC;oBACT,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;oBACrC,YAAY,EAAE,CAAC;gBACjB,CAAC;YACH,CAAC;YAED,OAAO;gBACL,OAAO,YAAY,EAAE,CAAC;YACxB,CAAC;YAED,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC;SACnC,CAAC;QAEF,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC"}

package/dist/boundary.d.ts

@@ -0,0 +1,154 @@
+/**
+ * BoundaryDef -- the core primitive of constraint-based adaptive rendering.
+ *
+ * A boundary defines quantization: how a continuous signal value maps
+ * to a discrete set of named states. Content-addressed via FNV-1a.
+ *
+ * @module
+ */
+import type { SignalInput, ThresholdValue, ContentAddress } from './brands.js';
+/** The core primitive. Source of truth for quantization boundaries. */
+interface BoundaryDef<I extends string = string, S extends readonly [string, ...string[]] = readonly [string, ...string[]]> {
+    readonly _tag: 'BoundaryDef';
+    readonly _version: 1;
+    readonly id: ContentAddress;
+    readonly input: SignalInput<I>;
+    readonly thresholds: readonly ThresholdValue[];
+    readonly states: S;
+    readonly hysteresis?: number;
+    readonly spec?: BoundarySpec;
+}
+interface BoundaryFactory {
+    make<I extends string, const S extends readonly [string, ...string[]]>(config: {
+        readonly input: I;
+        readonly at: {
+            readonly [K in keyof S]: readonly [number, S[K]];
+        };
+        readonly hysteresis?: number;
+        readonly spec?: BoundarySpec;
+    }): BoundaryDef<I, S>;
+}
+/**
+ * Evaluate which state a value falls into given a boundary (binary search).
+ *
+ * Uses binary search to find the rightmost threshold `<= value`, returning
+ * the corresponding state name.
+ *
+ * @example
+ * ```ts
+ * const bp = Boundary.make({ input: 'viewport.width', at: [[0, 'sm'], [768, 'md'], [1024, 'lg']] });
+ * const state = Boundary.evaluate(bp, 800);
+ * // state === 'md'
+ * ```
+ */
+declare function _evaluate<B extends BoundaryDef>(boundary: B, value: number): B['states'][number];
+/**
+ * Evaluate with hysteresis (requires previous state). Half-width dead zone algorithm.
+ *
+ * Prevents flickering at boundary edges by requiring the value to cross
+ * beyond a dead zone (half the hysteresis width) before transitioning states.
+ *
+ * @example
+ * ```ts
+ * const bp = Boundary.make({ input: 'viewport.width', at: [[0, 'sm'], [768, 'md']], hysteresis: 20 });
+ * const state1 = Boundary.evaluateWithHysteresis(bp, 770, 'sm');
+ * // state1 === 'sm' (within dead zone, stays at previous)
+ * const state2 = Boundary.evaluateWithHysteresis(bp, 780, 'sm');
+ * // state2 === 'md' (past dead zone, transitions)
+ * ```
+ */
+declare function _evaluateWithHysteresis<B extends BoundaryDef>(boundary: B, value: number, previousState: B['states'][number]): B['states'][number];
+/**
+ * Boundary namespace -- the core primitive of constraint-based adaptive rendering.
+ *
+ * Create boundaries that quantize continuous signal values into discrete named
+ * states. Supports hysteresis for flicker-free transitions at threshold edges.
+ *
+ * @example
+ * ```ts
+ * import { Boundary } from '@czap/core';
+ *
+ * const bp = Boundary.make({
+ *   input: 'viewport.width',
+ *   at: [[0, 'mobile'], [768, 'tablet'], [1024, 'desktop']],
+ *   hysteresis: 20,
+ * });
+ * const state = Boundary.evaluate(bp, 900);
+ * // state === 'tablet'
+ * const stableState = Boundary.evaluateWithHysteresis(bp, 770, 'mobile');
+ * // stableState === 'mobile' (within dead zone)
+ * ```
+ */
+/**
+ * Check whether a boundary is active given its optional spec and current context.
+ * Returns true if the boundary has no spec or the spec allows evaluation.
+ */
+declare function _isActive<B extends BoundaryDef>(boundary: B, context?: {
+    capabilities?: Record<string, unknown>;
+    nowMs?: number;
+    activeExperiments?: ReadonlyArray<string>;
+}): boolean;
+/**
+ * Boundary — core primitive of constraint-based adaptive rendering.
+ *
+ * A boundary quantizes a continuous signal (viewport, scroll, audio, …) into
+ * a discrete set of named states. Every boundary is content-addressed via
+ * FNV-1a, supports optional hysteresis to prevent flicker at thresholds, and
+ * can be gated by a {@link BoundarySpec} for A/B or device-conditional activation.
+ *
+ * @example
+ * ```ts
+ * import { Boundary } from '@czap/core';
+ *
+ * const viewport = Boundary.make({
+ *   input: 'viewport.width',
+ *   at: [[0, 'mobile'], [640, 'tablet'], [1024, 'desktop']] as const,
+ *   hysteresis: 16,
+ * });
+ * Boundary.evaluate(viewport, 800); // 'tablet'
+ * ```
+ */
+export declare const Boundary: BoundaryFactory & {
+    evaluate: typeof _evaluate;
+    evaluateWithHysteresis: typeof _evaluateWithHysteresis;
+    isActive: typeof _isActive;
+};
+/**
+ * BoundarySpec: optional filter that gates whether a boundary is active.
+ * Enables A/B testing, time-bounded experiments, and device targeting
+ * without external wrapping logic.
+ *
+ * **Phase 2**: Spec evaluation is implemented and tested but not yet wired
+ * into the Compositor evaluation loop. Call `BoundarySpec.isActive()` or
+ * `Boundary.isActive()` manually to check activation in the interim.
+ */
+export interface BoundarySpec {
+    /** Only evaluate this boundary when the device filter returns true. */
+    readonly deviceFilter?: (capabilities: Record<string, unknown>) => boolean;
+    /** Only evaluate this boundary within this time range (epoch ms). */
+    readonly timeRange?: {
+        readonly from?: number;
+        readonly until?: number;
+    };
+    /** Only evaluate this boundary for participants in this experiment. */
+    readonly experimentId?: string;
+}
+/** Check if a BoundarySpec allows evaluation given current context. */
+declare function _isSpecActive(spec: BoundarySpec | undefined, context?: {
+    capabilities?: Record<string, unknown>;
+    nowMs?: number;
+    activeExperiments?: ReadonlyArray<string>;
+}): boolean;
+/** BoundarySpec namespace — helpers for working with the optional activation filter on a boundary. */
+export declare const BoundarySpec: {
+    /** Check whether a {@link BoundarySpec} allows evaluation in the given context. */
+    isActive: typeof _isSpecActive;
+};
+export declare namespace Boundary {
+    /** Structural shape of a boundary definition parameterized by input name `I` and state tuple `S`. */
+    type Shape<I extends string = string, S extends readonly [string, ...string[]] = readonly [string, ...string[]]> = BoundaryDef<I, S>;
+    /** Alias for {@link BoundarySpec}. */
+    type Spec = BoundarySpec;
+}
+export {};
+//# sourceMappingURL=boundary.d.ts.map

package/dist/boundary.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"boundary.d.ts","sourceRoot":"","sources":["../src/boundary.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAM/E,uEAAuE;AACvE,UAAU,WAAW,CACnB,CAAC,SAAS,MAAM,GAAG,MAAM,EACzB,CAAC,SAAS,SAAS,CAAC,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;IAEzE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;IACrB,QAAQ,CAAC,EAAE,EAAE,cAAc,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/B,QAAQ,CAAC,UAAU,EAAE,SAAS,cAAc,EAAE,CAAC;IAC/C,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IACnB,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,IAAI,CAAC,EAAE,YAAY,CAAC;CAC9B;AAED,UAAU,eAAe;IACvB,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,CAAC,CAAC,SAAS,SAAS,CAAC,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE;QAC7E,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;QAClB,QAAQ,CAAC,EAAE,EAAE;YAAE,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;SAAE,CAAC;QAClE,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;QAC7B,QAAQ,CAAC,IAAI,CAAC,EAAE,YAAY,CAAC;KAC9B,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACvB;AA2BD;;;;;;;;;;;;GAYG;AACH,iBAAS,SAAS,CAAC,CAAC,SAAS,WAAW,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAwCzF;AAED;;;;;;;;;;;;;;GAcG;AACH,iBAAS,uBAAuB,CAAC,CAAC,SAAS,WAAW,EACpD,QAAQ,EAAE,CAAC,EACX,KAAK,EAAE,MAAM,EACb,aAAa,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GACjC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAwCrB;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH;;;GAGG;AACH,iBAAS,SAAS,CAAC,CAAC,SAAS,WAAW,EACtC,QAAQ,EAAE,CAAC,EACX,OAAO,CAAC,EAAE;IACR,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iBAAiB,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;CAC3C,GACA,OAAO,CAET;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,eAAO,MAAM,QAAQ,EAAE,eAAe,GAAG;IACvC,QAAQ,EAAE,OAAO,SAAS,CAAC;IAC3B,sBAAsB,EAAE,OAAO,uBAAuB,CAAC;IACvD,QAAQ,EAAE,OAAO,SAAS,CAAC;CAiE5B,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,WAAW,YAAY;IAC3B,uEAAuE;IACvE,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,OAAO,CAAC;IAC3E,qEAAqE;IACrE,QAAQ,CAAC,SAAS,CAAC,EAAE;QAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IACzE,uEAAuE;IACvE,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;CAChC;AAED,uEAAuE;AACvE,iBAAS,aAAa,CACpB,IAAI,EAAE,YAAY,GAAG,SAAS,EAC9B,OAAO,CAAC,EAAE;IACR,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iBAAiB,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;CAC3C,GACA,OAAO,CAcT;AAED,sGAAsG;AACtG,eAAO,MAAM,YAAY;IACvB,mFAAmF;;CAEpF,CAAC;AAEF,MAAM,CAAC,OAAO,WAAW,QAAQ,CAAC;IAChC,qGAAqG;IACrG,KAAY,KAAK,CACf,CAAC,SAAS,MAAM,GAAG,MAAM,EACzB,CAAC,SAAS,SAAS,CAAC,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC,IACvE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,sCAAsC;IACtC,KAAY,IAAI,GAAG,YAAY,CAAC;CACjC"}

package/dist/boundary.js

@@ -0,0 +1,269 @@
+/**
+ * BoundaryDef -- the core primitive of constraint-based adaptive rendering.
+ *
+ * A boundary defines quantization: how a continuous signal value maps
+ * to a discrete set of named states. Content-addressed via FNV-1a.
+ *
+ * @module
+ */
+import { SignalInput as mkSignalInput, ThresholdValue as mkThresholdValue } from './brands.js';
+import { CanonicalCbor } from './cbor.js';
+import { fnv1aBytes } from './fnv.js';
+import { CzapValidationError } from './validation-error.js';
+/**
+ * Compute the content address for a boundary synchronously.
+ * FNV-1a hash of the RFC 8949 §4.2.1 canonical CBOR encoding (ADR-0003).
+ * Cross-machine stable: identical definitions produce byte-identical IDs.
+ */
+function deterministicId(input, thresholds, states, hysteresis, spec) {
+    return fnv1aBytes(CanonicalCbor.encode({
+        _tag: 'BoundaryDef',
+        _version: 1,
+        input,
+        thresholds,
+        states,
+        hysteresis: hysteresis ?? null,
+        spec: spec ?? null,
+    }));
+}
+/**
+ * Evaluate which state a value falls into given a boundary (binary search).
+ *
+ * Uses binary search to find the rightmost threshold `<= value`, returning
+ * the corresponding state name.
+ *
+ * @example
+ * ```ts
+ * const bp = Boundary.make({ input: 'viewport.width', at: [[0, 'sm'], [768, 'md'], [1024, 'lg']] });
+ * const state = Boundary.evaluate(bp, 800);
+ * // state === 'md'
+ * ```
+ */
+function _evaluate(boundary, value) {
+    const { thresholds, states } = boundary;
+    const len = thresholds.length;
+    // Fast path: unrolled if-chain for small threshold arrays (≤4).
+    // Avoids loop overhead and branch prediction misses of binary search.
+    // Check from highest threshold downward; first match wins.
+    if (len <= 4) {
+        if (len === 1) {
+            return states[0];
+        }
+        if (len === 2) {
+            if (value >= thresholds[1])
+                return states[1];
+            return states[0];
+        }
+        if (len === 3) {
+            if (value >= thresholds[2])
+                return states[2];
+            if (value >= thresholds[1])
+                return states[1];
+            return states[0];
+        }
+        // len === 4
+        if (value >= thresholds[3])
+            return states[3];
+        if (value >= thresholds[2])
+            return states[2];
+        if (value >= thresholds[1])
+            return states[1];
+        return states[0];
+    }
+    // Binary search: find the rightmost threshold <= value
+    let lo = 0;
+    let hi = len;
+    while (lo < hi) {
+        const mid = (lo + hi) >>> 1;
+        if (thresholds[mid] <= value) {
+            lo = mid + 1;
+        }
+        else {
+            hi = mid;
+        }
+    }
+    // lo is the first threshold > value, so lo-1 is the match (or 0 if none)
+    return states[lo > 0 ? lo - 1 : 0];
+}
+/**
+ * Evaluate with hysteresis (requires previous state). Half-width dead zone algorithm.
+ *
+ * Prevents flickering at boundary edges by requiring the value to cross
+ * beyond a dead zone (half the hysteresis width) before transitioning states.
+ *
+ * @example
+ * ```ts
+ * const bp = Boundary.make({ input: 'viewport.width', at: [[0, 'sm'], [768, 'md']], hysteresis: 20 });
+ * const state1 = Boundary.evaluateWithHysteresis(bp, 770, 'sm');
+ * // state1 === 'sm' (within dead zone, stays at previous)
+ * const state2 = Boundary.evaluateWithHysteresis(bp, 780, 'sm');
+ * // state2 === 'md' (past dead zone, transitions)
+ * ```
+ */
+function _evaluateWithHysteresis(boundary, value, previousState) {
+    if (!boundary.hysteresis || boundary.hysteresis <= 0)
+        return _evaluate(boundary, value);
+    const half = boundary.hysteresis / 2;
+    const { thresholds, states } = boundary;
+    const prevIdx = states.indexOf(previousState);
+    // Unknown previous state -- fall back to raw evaluation
+    if (prevIdx === -1)
+        return _evaluate(boundary, value);
+    // Find raw state via linear scan (matching evaluate semantics)
+    let rawIdx = 0;
+    for (let i = thresholds.length - 1; i >= 0; i--) {
+        if (value >= thresholds[i]) {
+            rawIdx = i;
+            break;
+        }
+    }
+    // No crossing needed
+    if (rawIdx === prevIdx)
+        return states[rawIdx];
+    // Dead-zone suppression: when crossing a threshold, require the value to exceed the
+    // threshold by half the hysteresis width before committing. Prevents jitter when a
+    // signal oscillates near a boundary.
+    if (rawIdx > prevIdx) {
+        for (let i = prevIdx + 1; i <= rawIdx; i++) {
+            if (value < thresholds[i] + half) {
+                return states[i - 1];
+            }
+        }
+    }
+    else {
+        for (let i = prevIdx; i > rawIdx; i--) {
+            if (value > thresholds[i] - half) {
+                return states[i];
+            }
+        }
+    }
+    return states[rawIdx];
+}
+/**
+ * Boundary namespace -- the core primitive of constraint-based adaptive rendering.
+ *
+ * Create boundaries that quantize continuous signal values into discrete named
+ * states. Supports hysteresis for flicker-free transitions at threshold edges.
+ *
+ * @example
+ * ```ts
+ * import { Boundary } from '@czap/core';
+ *
+ * const bp = Boundary.make({
+ *   input: 'viewport.width',
+ *   at: [[0, 'mobile'], [768, 'tablet'], [1024, 'desktop']],
+ *   hysteresis: 20,
+ * });
+ * const state = Boundary.evaluate(bp, 900);
+ * // state === 'tablet'
+ * const stableState = Boundary.evaluateWithHysteresis(bp, 770, 'mobile');
+ * // stableState === 'mobile' (within dead zone)
+ * ```
+ */
+/**
+ * Check whether a boundary is active given its optional spec and current context.
+ * Returns true if the boundary has no spec or the spec allows evaluation.
+ */
+function _isActive(boundary, context) {
+    return _isSpecActive(boundary.spec, context);
+}
+/**
+ * Boundary — core primitive of constraint-based adaptive rendering.
+ *
+ * A boundary quantizes a continuous signal (viewport, scroll, audio, …) into
+ * a discrete set of named states. Every boundary is content-addressed via
+ * FNV-1a, supports optional hysteresis to prevent flicker at thresholds, and
+ * can be gated by a {@link BoundarySpec} for A/B or device-conditional activation.
+ *
+ * @example
+ * ```ts
+ * import { Boundary } from '@czap/core';
+ *
+ * const viewport = Boundary.make({
+ *   input: 'viewport.width',
+ *   at: [[0, 'mobile'], [640, 'tablet'], [1024, 'desktop']] as const,
+ *   hysteresis: 16,
+ * });
+ * Boundary.evaluate(viewport, 800); // 'tablet'
+ * ```
+ */
+export const Boundary = {
+    /**
+     * Create a new `BoundaryDef` from a configuration object.
+     *
+     * Thresholds must be strictly ascending. The boundary is content-addressed
+     * via FNV-1a hash of its definition.
+     *
+     * @example
+     * ```ts
+     * const bp = Boundary.make({
+     *   input: 'viewport.width',
+     *   at: [[0, 'sm'], [768, 'md'], [1024, 'lg']],
+     *   hysteresis: 10,
+     * });
+     * // bp._tag === 'BoundaryDef'
+     * // bp.id === 'fnv1a:...' (content address)
+     * // bp.states === ['sm', 'md', 'lg']
+     * ```
+     */
+    make(config) {
+        const pairs = config.at;
+        for (let i = 1; i < pairs.length; i++) {
+            if (pairs[i][0] <= pairs[i - 1][0]) {
+                throw new CzapValidationError('Boundary.make', `thresholds must be strictly ascending. Got ${pairs[i - 1][0]} before ${pairs[i][0]} at index ${i}.`);
+            }
+        }
+        const stateNames = pairs.map(([, s]) => s);
+        const seen = new Set();
+        for (const name of stateNames) {
+            if (seen.has(name)) {
+                throw new CzapValidationError('Boundary.make', `duplicate state name "${name}". Each state must have a unique name.`);
+            }
+            seen.add(name);
+        }
+        const thresholds = pairs.map(([t]) => mkThresholdValue(t));
+        // tupleMap preserves arity but fn returns `string`, not per-element S[K]; one narrow cast is unavoidable.
+        const states = pairs.map(([, s]) => s);
+        const id = deterministicId(config.input, thresholds, states, config.hysteresis, config.spec);
+        return {
+            _tag: 'BoundaryDef',
+            _version: 1,
+            id,
+            input: mkSignalInput(config.input),
+            thresholds,
+            states,
+            ...(config.hysteresis !== undefined ? { hysteresis: config.hysteresis } : {}),
+            ...(config.spec !== undefined ? { spec: config.spec } : {}),
+        };
+    },
+    evaluate: _evaluate,
+    evaluateWithHysteresis: _evaluateWithHysteresis,
+    isActive: _isActive,
+};
+/** Check if a BoundarySpec allows evaluation given current context. */
+function _isSpecActive(spec, context) {
+    if (!spec)
+        return true;
+    if (spec.deviceFilter && context?.capabilities) {
+        if (!spec.deviceFilter(context.capabilities))
+            return false;
+    }
+    if (spec.timeRange) {
+        const now = context?.nowMs ?? Date.now();
+        if (spec.timeRange.from !== undefined && now < spec.timeRange.from)
+            return false;
+        if (spec.timeRange.until !== undefined && now > spec.timeRange.until)
+            return false;
+    }
+    if (spec.experimentId && context?.activeExperiments) {
+        if (!context.activeExperiments.includes(spec.experimentId))
+            return false;
+    }
+    return true;
+}
+/** BoundarySpec namespace — helpers for working with the optional activation filter on a boundary. */
+export const BoundarySpec = {
+    /** Check whether a {@link BoundarySpec} allows evaluation in the given context. */
+    isActive: _isSpecActive,
+};
+//# sourceMappingURL=boundary.js.map

package/dist/boundary.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"boundary.js","sourceRoot":"","sources":["../src/boundary.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAE,WAAW,IAAI,aAAa,EAAE,cAAc,IAAI,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAC/F,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AACtC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AA0B5D;;;;GAIG;AACH,SAAS,eAAe,CACtB,KAAa,EACb,UAA6B,EAC7B,MAAyB,EACzB,UAAmB,EACnB,IAAmB;IAEnB,OAAO,UAAU,CACf,aAAa,CAAC,MAAM,CAAC;QACnB,IAAI,EAAE,aAAa;QACnB,QAAQ,EAAE,CAAC;QACX,KAAK;QACL,UAAU;QACV,MAAM;QACN,UAAU,EAAE,UAAU,IAAI,IAAI;QAC9B,IAAI,EAAE,IAAI,IAAI,IAAI;KACnB,CAAC,CACH,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,SAAS,CAAwB,QAAW,EAAE,KAAa;IAClE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC;IACxC,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC;IAE9B,gEAAgE;IAChE,sEAAsE;IACtE,2DAA2D;IAC3D,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;QACb,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;QACpB,CAAC;QACD,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,IAAI,KAAK,IAAK,UAAU,CAAC,CAAC,CAAY;gBAAE,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;YAC1D,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;QACpB,CAAC;QACD,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,IAAI,KAAK,IAAK,UAAU,CAAC,CAAC,CAAY;gBAAE,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;YAC1D,IAAI,KAAK,IAAK,UAAU,CAAC,CAAC,CAAY;gBAAE,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;YAC1D,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;QACpB,CAAC;QACD,YAAY;QACZ,IAAI,KAAK,IAAK,UAAU,CAAC,CAAC,CAAY;YAAE,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;QAC1D,IAAI,KAAK,IAAK,UAAU,CAAC,CAAC,CAAY;YAAE,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;QAC1D,IAAI,KAAK,IAAK,UAAU,CAAC,CAAC,CAAY;YAAE,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;QAC1D,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;IACpB,CAAC;IAED,uDAAuD;IACvD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,GAAG,CAAC;IACb,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAK,UAAU,CAAC,GAAG,CAAY,IAAI,KAAK,EAAE,CAAC;YACzC,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;QACf,CAAC;aAAM,CAAC;YACN,EAAE,GAAG,GAAG,CAAC;QACX,CAAC;IACH,CAAC;IACD,yEAAyE;IACzE,OAAO,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;AACtC,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,uBAAuB,CAC9B,QAAW,EACX,KAAa,EACb,aAAkC;IAElC,IAAI,CAAC,QAAQ,CAAC,UAAU,IAAI,QAAQ,CAAC,UAAU,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAExF,MAAM,IAAI,GAAG,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC;IACrC,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC;IACxC,MAAM,OAAO,GAAI,MAA4B,CAAC,OAAO,CAAC,aAAuB,CAAC,CAAC;IAE/E,wDAAwD;IACxD,IAAI,OAAO,KAAK,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAEtD,+DAA+D;IAC/D,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,IAAI,KAAK,IAAI,UAAU,CAAC,CAAC,CAAE,EAAE,CAAC;YAC5B,MAAM,GAAG,CAAC,CAAC;YACX,MAAM;QACR,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,IAAI,MAAM,KAAK,OAAO;QAAE,OAAO,MAAM,CAAC,MAAM,CAAE,CAAC;IAE/C,oFAAoF;IACpF,mFAAmF;IACnF,qCAAqC;IACrC,IAAI,MAAM,GAAG,OAAO,EAAE,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,KAAK,GAAG,UAAU,CAAC,CAAC,CAAE,GAAG,IAAI,EAAE,CAAC;gBAClC,OAAO,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,KAAK,GAAG,UAAU,CAAC,CAAC,CAAE,GAAG,IAAI,EAAE,CAAC;gBAClC,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAE,CAAC;AACzB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH;;;GAGG;AACH,SAAS,SAAS,CAChB,QAAW,EACX,OAIC;IAED,OAAO,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AAC/C,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,CAAC,MAAM,QAAQ,GAIjB;IACF;;;;;;;;;;;;;;;;;OAiBG;IACH,IAAI,CAAmE,MAKtE;QACC,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrC,MAAM,IAAI,mBAAmB,CAC3B,eAAe,EACf,8CAA8C,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CACvG,CAAC;YACJ,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnB,MAAM,IAAI,mBAAmB,CAC3B,eAAe,EACf,yBAAyB,IAAI,wCAAwC,CACtE,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;QACD,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,0GAA0G;QAC1G,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAiB,CAAC;QACvD,MAAM,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QAE7F,OAAO;YACL,IAAI,EAAE,aAAa;YACnB,QAAQ,EAAE,CAAC;YACX,EAAE;YACF,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC;YAClC,UAAU;YACV,MAAM;YACN,GAAG,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7E,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC5D,CAAC;IACJ,CAAC;IACD,QAAQ,EAAE,SAAS;IACnB,sBAAsB,EAAE,uBAAuB;IAC/C,QAAQ,EAAE,SAAS;CACpB,CAAC;AAoBF,uEAAuE;AACvE,SAAS,aAAa,CACpB,IAA8B,EAC9B,OAIC;IAED,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,IAAI,IAAI,CAAC,YAAY,IAAI,OAAO,EAAE,YAAY,EAAE,CAAC;QAC/C,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC;YAAE,OAAO,KAAK,CAAC;IAC7D,CAAC;IACD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,OAAO,EAAE,KAAK,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,SAAS,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QACjF,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,KAAK,SAAS,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC;IACrF,CAAC;IACD,IAAI,IAAI,CAAC,YAAY,IAAI,OAAO,EAAE,iBAAiB,EAAE,CAAC;QACpD,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC;YAAE,OAAO,KAAK,CAAC;IAC3E,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,sGAAsG;AACtG,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,mFAAmF;IACnF,QAAQ,EAAE,aAAa;CACxB,CAAC"}