@czap/core 0.1.0

package/dist/plan.js

@@ -0,0 +1,211 @@
+/**
+ * Plan -- plan IR builder for universal execution DAG.
+ *
+ * @module
+ */
+class PlanBuilderImpl {
+    planName;
+    steps = [];
+    edges = [];
+    constructor(planName) {
+        this.planName = planName;
+    }
+    step(name, opType, metadata) {
+        const id = `step-${this.steps.length + 1}`;
+        this.steps.push({ id, name, opType, metadata });
+        return this;
+    }
+    seq(fromId, toId) {
+        this.edges.push({ from: fromId, to: toId, type: 'seq' });
+        return this;
+    }
+    par(fromId, toId) {
+        this.edges.push({ from: fromId, to: toId, type: 'par' });
+        return this;
+    }
+    choice(fromId, thenId, elseId) {
+        this.edges.push({ from: fromId, to: thenId, type: 'choice_then' });
+        this.edges.push({ from: fromId, to: elseId, type: 'choice_else' });
+        return this;
+    }
+    build() {
+        return {
+            name: this.planName,
+            steps: [...this.steps],
+            edges: [...this.edges],
+        };
+    }
+}
+/**
+ * Create a new PlanBuilder with the given plan name.
+ *
+ * Returns a fluent builder that supports chaining `.step()`, `.seq()`,
+ * `.par()`, and `.choice()` calls. Call `.build()` to produce the PlanIR.
+ *
+ * @example
+ * ```ts
+ * const plan = Plan.make('my-pipeline')
+ *   .step('fetch', { type: 'effect' })
+ *   .step('transform', { type: 'pure' })
+ *   .seq('step-1', 'step-2')
+ *   .build();
+ * // plan.name === 'my-pipeline'
+ * // plan.steps.length === 2
+ * // plan.edges.length === 1
+ * ```
+ */
+function _make(name) {
+    return new PlanBuilderImpl(name);
+}
+function hasCycle(planIR) {
+    const visited = new Set();
+    const recStack = new Set();
+    const adjList = new Map();
+    for (const step of planIR.steps) {
+        adjList.set(step.id, []);
+    }
+    for (const edge of planIR.edges) {
+        adjList.get(edge.from)?.push(edge.to);
+    }
+    function dfs(node) {
+        visited.add(node);
+        recStack.add(node);
+        for (const neighbor of adjList.get(node) ?? []) {
+            if (!visited.has(neighbor)) {
+                if (dfs(neighbor))
+                    return true;
+            }
+            else if (recStack.has(neighbor)) {
+                return true;
+            }
+        }
+        recStack.delete(node);
+        return false;
+    }
+    for (const step of planIR.steps) {
+        if (!visited.has(step.id) && dfs(step.id))
+            return true;
+    }
+    return false;
+}
+/**
+ * Validate a PlanIR for structural correctness.
+ *
+ * Checks that all edges reference existing steps and that the graph is acyclic.
+ * Returns `{ ok: true, plan }` on success or `{ ok: false, errors }` with
+ * detailed validation errors.
+ *
+ * @example
+ * ```ts
+ * const plan = Plan.make('test').step('a', { type: 'noop' }).build();
+ * const result = Plan.validate(plan);
+ * // result.ok === true
+ * // result.plan === plan
+ * ```
+ */
+function _validate(planIR) {
+    const errors = [];
+    const stepIds = new Set(planIR.steps.map((s) => s.id));
+    for (const edge of planIR.edges) {
+        if (!stepIds.has(edge.from)) {
+            errors.push({
+                type: 'missing_step',
+                message: `Edge references unknown step: ${edge.from}`,
+                stepIds: [edge.from],
+            });
+        }
+        if (!stepIds.has(edge.to)) {
+            errors.push({
+                type: 'missing_step',
+                message: `Edge references unknown step: ${edge.to}`,
+                stepIds: [edge.to],
+            });
+        }
+    }
+    if (hasCycle(planIR)) {
+        errors.push({ type: 'cycle', message: 'Plan contains a cycle' });
+    }
+    return errors.length === 0 ? { ok: true, plan: planIR } : { ok: false, errors };
+}
+/**
+ * Topologically sort the steps of a PlanIR using Kahn's algorithm.
+ *
+ * Returns `{ sorted }` on success. If a cycle exists, returns
+ * `{ sorted, cycle }` where `cycle` lists the step IDs involved.
+ *
+ * @example
+ * ```ts
+ * const plan = Plan.make('pipeline')
+ *   .step('a', { type: 'pure' })
+ *   .step('b', { type: 'pure' })
+ *   .seq('step-1', 'step-2')
+ *   .build();
+ * const result = Plan.topoSort(plan);
+ * // result.sorted === ['step-1', 'step-2']
+ * ```
+ */
+function _topoSort(planIR) {
+    const adjList = new Map();
+    const inDegree = new Map();
+    for (const step of planIR.steps) {
+        adjList.set(step.id, []);
+        inDegree.set(step.id, 0);
+    }
+    for (const edge of planIR.edges) {
+        adjList.get(edge.from)?.push(edge.to);
+        inDegree.set(edge.to, (inDegree.get(edge.to) ?? 0) + 1);
+    }
+    const queue = [];
+    const result = [];
+    for (const [id, degree] of inDegree) {
+        if (degree === 0)
+            queue.push(id);
+    }
+    while (queue.length > 0) {
+        const current = queue.shift();
+        result.push(current);
+        for (const neighbor of adjList.get(current) ?? []) {
+            const newDegree = inDegree.get(neighbor) - 1;
+            inDegree.set(neighbor, newDegree);
+            if (newDegree === 0)
+                queue.push(neighbor);
+        }
+    }
+    if (result.length !== planIR.steps.length) {
+        const resultSet = new Set(result);
+        const cycleNodes = planIR.steps.filter((s) => !resultSet.has(s.id)).map((s) => s.id);
+        return { sorted: result, cycle: cycleNodes };
+    }
+    return { sorted: result };
+}
+/**
+ * Plan namespace -- plan IR builder for universal execution DAG.
+ *
+ * Build, validate, and topologically sort execution plans. Plans model
+ * computation graphs with sequential, parallel, and conditional edges.
+ *
+ * @example
+ * ```ts
+ * import { Plan } from '@czap/core';
+ *
+ * const plan = Plan.make('render-pipeline')
+ *   .step('load', { type: 'effect' })
+ *   .step('compile', { type: 'pure' })
+ *   .step('emit', { type: 'effect' })
+ *   .seq('step-1', 'step-2')
+ *   .seq('step-2', 'step-3')
+ *   .build();
+ * const valid = Plan.validate(plan);
+ * const order = Plan.topoSort(plan);
+ * // order.sorted === ['step-1', 'step-2', 'step-3']
+ * ```
+ */
+export const Plan = {
+    /** Start a new fluent {@link Plan.Builder} with the given display name. */
+    make: _make,
+    /** Check that every edge references a known step and that the graph is acyclic. */
+    validate: _validate,
+    /** Kahn's-algorithm topological sort; surfaces cycle participants if the plan is not a DAG. */
+    topoSort: _topoSort,
+};
+//# sourceMappingURL=plan.js.map

package/dist/plan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"plan.js","sourceRoot":"","sources":["../src/plan.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAyEH,MAAM,eAAe;IAIU;IAHrB,KAAK,GAAe,EAAE,CAAC;IACvB,KAAK,GAAe,EAAE,CAAC;IAE/B,YAA6B,QAAgB;QAAhB,aAAQ,GAAR,QAAQ,CAAQ;IAAG,CAAC;IAEjD,IAAI,CAAC,IAAY,EAAE,MAAc,EAAE,QAAkC;QACnE,MAAM,EAAE,GAAG,QAAQ,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,GAAG,CAAC,MAAc,EAAE,IAAY;QAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QACzD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,GAAG,CAAC,MAAc,EAAE,IAAY;QAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QACzD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,MAAc,EAAE,MAAc,EAAE,MAAc;QACnD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;QACnE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;QACnE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK;QACH,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;SACvB,CAAC;IACJ,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAS,KAAK,CAAC,IAAY;IACzB,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,QAAQ,CAAC,MAAc;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE5C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,SAAS,GAAG,CAAC,IAAY;QACvB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,IAAI,GAAG,CAAC,QAAQ,CAAC;oBAAE,OAAO,IAAI,CAAC;YACjC,CAAC;iBAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAClC,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,OAAO,IAAI,CAAC;IACzD,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,SAAS,CAAC,MAAc;IAC/B,MAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEvD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,cAAc;gBACpB,OAAO,EAAE,iCAAiC,IAAI,CAAC,IAAI,EAAE;gBACrD,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;aACrB,CAAC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,cAAc;gBACpB,OAAO,EAAE,iCAAiC,IAAI,CAAC,EAAE,EAAE;gBACnD,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;aACnB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,uBAAuB,EAAE,CAAC,CAAC;IACnE,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AAClF,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,SAAS,CAAC,MAAc;IAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACpC,IAAI,MAAM,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrB,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAClD,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAE,GAAG,CAAC,CAAC;YAC9C,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAClC,IAAI,SAAS,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAC/C,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG;IAClB,2EAA2E;IAC3E,IAAI,EAAE,KAAK;IACX,mFAAmF;IACnF,QAAQ,EAAE,SAAS;IACnB,+FAA+F;IAC/F,QAAQ,EAAE,SAAS;CACpB,CAAC"}

package/dist/protocol.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Protocol types -- CellEnvelope, CellKind, CellMeta.
+ *
+ * These types form the wire-level protocol for cells in the czap system.
+ * Every cell has a kind, content address, metadata, and value.
+ *
+ * @module
+ */
+import type { ContentAddress, HLC } from './brands.js';
+/**
+ * Discriminator tagging what a {@link CellEnvelope} carries — a boundary, a
+ * discrete state, a target output (CSS/GLSL/WGSL/ARIA/AI), or one of the
+ * other reactive shapes produced along the pipeline.
+ */
+export type CellKind = 'boundary' | 'state' | 'output' | 'signal' | 'transition' | 'timeline' | 'compositor' | 'blend' | 'css' | 'glsl' | 'wgsl' | 'aria' | 'ai';
+/** Protocol metadata attached to every {@link CellEnvelope}: HLC timestamps + monotonic version counter. */
+export interface CellMeta {
+    readonly created: HLC;
+    readonly updated: HLC;
+    readonly version: number;
+}
+/**
+ * Wire-level envelope for a cell value: tagged by {@link CellKind}, identified
+ * by its content address, stamped with {@link CellMeta}, carrying the typed
+ * payload in `value`.
+ */
+export interface CellEnvelope<K extends CellKind = CellKind, T = unknown> {
+    readonly kind: K;
+    readonly id: ContentAddress;
+    readonly meta: CellMeta;
+    readonly value: T;
+}
+//# sourceMappingURL=protocol.d.ts.map

package/dist/protocol.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"protocol.d.ts","sourceRoot":"","sources":["../src/protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAEvD;;;;GAIG;AACH,MAAM,MAAM,QAAQ,GAChB,UAAU,GACV,OAAO,GACP,QAAQ,GACR,QAAQ,GACR,YAAY,GACZ,UAAU,GACV,YAAY,GACZ,OAAO,GACP,KAAK,GACL,MAAM,GACN,MAAM,GACN,MAAM,GACN,IAAI,CAAC;AAET,4GAA4G;AAC5G,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;;GAIG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAAE,CAAC,GAAG,OAAO;IACtE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACjB,QAAQ,CAAC,EAAE,EAAE,cAAc,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;CACnB"}

package/dist/protocol.js

@@ -0,0 +1,10 @@
+/**
+ * Protocol types -- CellEnvelope, CellKind, CellMeta.
+ *
+ * These types form the wire-level protocol for cells in the czap system.
+ * Every cell has a kind, content address, metadata, and value.
+ *
+ * @module
+ */
+export {};
+//# sourceMappingURL=protocol.js.map

package/dist/protocol.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"protocol.js","sourceRoot":"","sources":["../src/protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/quantizer-types.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Quantizer interface -- the base contract for quantizer implementations.
+ *
+ * The canonical implementation lives in `@czap/quantizer` (`Q.from()` builder API).
+ *
+ * @module
+ */
+import type { Effect, Stream } from 'effect';
+import type { Boundary } from './boundary.js';
+import type { StateUnion, BoundaryCrossing } from './type-utils.js';
+/**
+ * Quantizer contract — the live evaluator that binds a {@link Boundary} to a signal source.
+ *
+ * A quantizer holds a boundary definition plus the reactive machinery to observe
+ * its current state and emit crossings when the underlying signal moves between
+ * bands. The concrete implementation is produced by `@czap/quantizer`'s `Q.from()`
+ * builder; consumers interact only via this structural interface.
+ */
+export interface Quantizer<B extends Boundary.Shape = Boundary.Shape> {
+    readonly _tag: 'Quantizer';
+    readonly boundary: B;
+    readonly state: Effect.Effect<StateUnion<B>>;
+    /** Synchronous state accessor for hot paths (avoids Effect overhead). */
+    readonly stateSync?: () => StateUnion<B>;
+    readonly changes: Stream.Stream<BoundaryCrossing<StateUnion<B> & string>>;
+    evaluate(value: number): StateUnion<B>;
+}
+//# sourceMappingURL=quantizer-types.d.ts.map

package/dist/quantizer-types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quantizer-types.d.ts","sourceRoot":"","sources":["../src/quantizer-types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC7C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,KAAK,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAEpE;;;;;;;GAOG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK;IAClE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,yEAAyE;IACzE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,UAAU,CAAC,CAAC,CAAC,CAAC;IACzC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC1E,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CACxC"}

package/dist/quantizer-types.js

@@ -0,0 +1,9 @@
+/**
+ * Quantizer interface -- the base contract for quantizer implementations.
+ *
+ * The canonical implementation lives in `@czap/quantizer` (`Q.from()` builder API).
+ *
+ * @module
+ */
+export {};
+//# sourceMappingURL=quantizer-types.js.map

package/dist/quantizer-types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quantizer-types.js","sourceRoot":"","sources":["../src/quantizer-types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/dist/receipt.d.ts

@@ -0,0 +1,294 @@
+/**
+ * Receipt -- chain validation and envelope construction.
+ *
+ * Salvaged from `@kit/core`.
+ *
+ * @module
+ */
+import { Effect } from 'effect';
+import type { HLC } from './brands.js';
+import { type TypedRef } from './typed-ref.js';
+/** The logical entity a receipt describes: an effect, a run, an artifact, or an intent. */
+export interface ReceiptSubject {
+    readonly type: 'effect' | 'run' | 'artifact' | 'intent';
+    readonly id: string;
+}
+/**
+ * Single link in a receipt chain: timestamped, content-addressed, and linked
+ * to its predecessor(s). Merge envelopes carry an array of `previous` hashes;
+ * optionally MAC-signed via `Receipt.macEnvelope`.
+ */
+export interface ReceiptEnvelope {
+    readonly kind: string;
+    readonly timestamp: HLC;
+    readonly subject: ReceiptSubject;
+    readonly payload: TypedRef.Shape;
+    readonly hash: string;
+    readonly previous: string | readonly string[];
+    readonly signature?: string;
+}
+/** Structured failure returned by `Receipt.validateChainDetailed`. */
+export type ChainValidationError = {
+    readonly type: 'not_genesis';
+    readonly index: 0;
+} | {
+    readonly type: 'hash_mismatch';
+    readonly index: number;
+    readonly computed: string;
+    readonly stored: string;
+} | {
+    readonly type: 'chain_break';
+    readonly index: number;
+    readonly expected: string;
+    readonly actual: string;
+} | {
+    readonly type: 'hlc_not_increasing';
+    readonly index: number;
+};
+/** Sentinel `previous` value marking the root of a receipt chain. */
+export declare const GENESIS: string;
+/**
+ * Compute the content hash of a receipt envelope.
+ *
+ * Normalizes the `previous` field (sorts array form), canonicalizes the
+ * payload, and hashes with SHA-256 via TypedRef.
+ *
+ * @example
+ * ```ts
+ * import { Effect } from 'effect';
+ *
+ * const hash = yield* Receipt.hashEnvelope(envelope);
+ * // hash === envelope.hash (if envelope is valid)
+ * ```
+ */
+export declare const hashEnvelope: (envelope: ReceiptEnvelope) => Effect.Effect<string>;
+/**
+ * Create a new receipt envelope with an auto-computed content hash.
+ *
+ * @example
+ * ```ts
+ * const envelope = yield* Receipt.createEnvelope(
+ *   'state-change',
+ *   { type: 'effect', id: 'actor-1' },
+ *   { _tag: 'TypedRef', mediaType: 'application/json', data: { key: 'value' } },
+ *   hlcTimestamp,
+ *   Receipt.GENESIS,
+ * );
+ * // envelope.hash is the computed SHA-256 content address
+ * ```
+ */
+export declare const createEnvelope: (kind: string, subject: ReceiptSubject, payload: TypedRef.Shape, timestamp: HLC, previousHash: string | readonly string[]) => Effect.Effect<ReceiptEnvelope>;
+/**
+ * Build a linear chain of receipt envelopes from an array of entries.
+ *
+ * Each envelope's `previous` points to the prior envelope's hash,
+ * starting from GENESIS.
+ *
+ * @example
+ * ```ts
+ * const chain = yield* Receipt.buildChain([
+ *   { kind: 'init', subject: { type: 'effect', id: 'a' }, payload, timestamp: ts1 },
+ *   { kind: 'update', subject: { type: 'effect', id: 'a' }, payload, timestamp: ts2 },
+ * ]);
+ * // chain.length === 2
+ * // chain[1].previous === chain[0].hash
+ * ```
+ */
+export declare const buildChain: (entries: ReadonlyArray<{
+    kind: string;
+    subject: ReceiptSubject;
+    payload: TypedRef.Shape;
+    timestamp: HLC;
+}>) => Effect.Effect<ReceiptEnvelope[]>;
+/**
+ * Validate a receipt chain: genesis link, hash integrity, chain continuity, HLC ordering.
+ *
+ * Returns true on success or fails with an Error describing the violation.
+ *
+ * @example
+ * ```ts
+ * const chain = yield* Receipt.buildChain(entries);
+ * const valid = yield* Receipt.validateChain(chain);
+ * // valid === true
+ * ```
+ */
+export declare const validateChain: (chain: ReadonlyArray<ReceiptEnvelope>) => Effect.Effect<boolean, Error>;
+/**
+ * Validate a receipt chain with detailed, structured error reporting.
+ *
+ * Returns `true` on success or fails with a typed `ChainValidationError`
+ * discriminated union (not_genesis | hash_mismatch | chain_break | hlc_not_increasing).
+ *
+ * @example
+ * ```ts
+ * import { Effect } from 'effect';
+ *
+ * const result = yield* Effect.either(Receipt.validateChainDetailed(chain));
+ * // result._tag === 'Right' on success
+ * // result._tag === 'Left' with .left.type on failure
+ * ```
+ */
+export declare const validateChainDetailed: (chain: ReadonlyArray<ReceiptEnvelope>) => Effect.Effect<true, ChainValidationError>;
+/**
+ * Check whether a receipt envelope is a genesis (root) envelope.
+ *
+ * @example
+ * ```ts
+ * const chain = yield* Receipt.buildChain(entries);
+ * Receipt.isGenesis(chain[0]); // true
+ * Receipt.isGenesis(chain[1]); // false
+ * ```
+ */
+export declare const isGenesis: (receipt: ReceiptEnvelope) => boolean;
+/**
+ * Get the last (most recent) envelope in a chain.
+ *
+ * @example
+ * ```ts
+ * const latest = Receipt.head(chain);
+ * // latest === chain[chain.length - 1]
+ * ```
+ */
+export declare const head: (chain: ReadonlyArray<ReceiptEnvelope>) => ReceiptEnvelope | undefined;
+/**
+ * Get the first (genesis) envelope in a chain.
+ *
+ * @example
+ * ```ts
+ * const first = Receipt.tail(chain);
+ * // first === chain[0]
+ * ```
+ */
+export declare const tail: (chain: ReadonlyArray<ReceiptEnvelope>) => ReceiptEnvelope | undefined;
+/**
+ * Append a new entry to an existing chain, auto-linking to the previous hash.
+ *
+ * Optionally accepts explicit previous hashes for merge envelopes.
+ *
+ * @example
+ * ```ts
+ * const chain = yield* Receipt.buildChain([entry1]);
+ * const extended = yield* Receipt.append(chain, {
+ *   kind: 'update', subject: { type: 'effect', id: 'a' }, payload, timestamp: ts2,
+ * });
+ * // extended.length === 2
+ * ```
+ */
+export declare const append: (chain: ReadonlyArray<ReceiptEnvelope>, entry: {
+    kind: string;
+    subject: ReceiptSubject;
+    payload: TypedRef.Shape;
+    timestamp: HLC;
+}, previousHashes?: readonly string[]) => Effect.Effect<ReceiptEnvelope[]>;
+/**
+ * Find an envelope in a chain by its content hash.
+ *
+ * @example
+ * ```ts
+ * const found = Receipt.findByHash(chain, targetHash);
+ * // found?.hash === targetHash
+ * ```
+ */
+export declare const findByHash: (chain: ReadonlyArray<ReceiptEnvelope>, hash: string) => ReceiptEnvelope | undefined;
+/**
+ * Find all envelopes in a chain matching a given kind.
+ *
+ * @example
+ * ```ts
+ * const updates = Receipt.findByKind(chain, 'update');
+ * // updates contains all envelopes with kind === 'update'
+ * ```
+ */
+export declare const findByKind: (chain: ReadonlyArray<ReceiptEnvelope>, kind: string) => ReceiptEnvelope[];
+/**
+ * Generate an HMAC-SHA-256 key for signing receipt envelopes.
+ *
+ * @example
+ * ```ts
+ * const key = yield* Receipt.generateMACKey();
+ * const signed = yield* Receipt.macEnvelope(envelope, key);
+ * // signed.signature is a hex string
+ * ```
+ */
+export declare const generateMACKey: () => Effect.Effect<CryptoKey, Error>;
+/**
+ * Sign a receipt envelope with an HMAC key, adding a `signature` field.
+ *
+ * @example
+ * ```ts
+ * const key = yield* Receipt.generateMACKey();
+ * const signed = yield* Receipt.macEnvelope(envelope, key);
+ * // signed.signature !== undefined
+ * ```
+ */
+export declare const macEnvelope: (envelope: ReceiptEnvelope, key: CryptoKey) => Effect.Effect<ReceiptEnvelope, Error>;
+/**
+ * Verify an envelope's HMAC signature against a key.
+ *
+ * Returns false if the envelope has no signature.
+ *
+ * @example
+ * ```ts
+ * const valid = yield* Receipt.verifyMAC(signedEnvelope, key);
+ * // valid === true if signature matches
+ * ```
+ */
+export declare const verifyMAC: (envelope: ReceiptEnvelope, key: CryptoKey) => Effect.Effect<boolean, Error>;
+/**
+ * Receipt namespace -- chain validation and envelope construction.
+ *
+ * Build, validate, append, query, and sign linear receipt chains.
+ * Each envelope is content-addressed and linked to its predecessor.
+ * Supports HMAC signing/verification for tamper detection.
+ *
+ * @example
+ * ```ts
+ * import { Effect } from 'effect';
+ * import { Receipt, HLC } from '@czap/core';
+ *
+ * const program = Effect.gen(function* () {
+ *   const ts = HLC.increment(HLC.create('node-1'), Date.now());
+ *   const chain = yield* Receipt.buildChain([
+ *     { kind: 'init', subject: { type: 'effect', id: 'a' }, payload, timestamp: ts },
+ *   ]);
+ *   const valid = yield* Receipt.validateChain(chain);
+ *   const latest = Receipt.head(chain);
+ * });
+ * ```
+ */
+export declare const Receipt: {
+    GENESIS: string;
+    createEnvelope: (kind: string, subject: ReceiptSubject, payload: TypedRef.Shape, timestamp: HLC, previousHash: string | readonly string[]) => Effect.Effect<ReceiptEnvelope>;
+    buildChain: (entries: ReadonlyArray<{
+        kind: string;
+        subject: ReceiptSubject;
+        payload: TypedRef.Shape;
+        timestamp: HLC;
+    }>) => Effect.Effect<ReceiptEnvelope[]>;
+    validateChain: (chain: ReadonlyArray<ReceiptEnvelope>) => Effect.Effect<boolean, Error>;
+    validateChainDetailed: (chain: ReadonlyArray<ReceiptEnvelope>) => Effect.Effect<true, ChainValidationError>;
+    hashEnvelope: (envelope: ReceiptEnvelope) => Effect.Effect<string>;
+    isGenesis: (receipt: ReceiptEnvelope) => boolean;
+    head: (chain: ReadonlyArray<ReceiptEnvelope>) => ReceiptEnvelope | undefined;
+    tail: (chain: ReadonlyArray<ReceiptEnvelope>) => ReceiptEnvelope | undefined;
+    append: (chain: ReadonlyArray<ReceiptEnvelope>, entry: {
+        kind: string;
+        subject: ReceiptSubject;
+        payload: TypedRef.Shape;
+        timestamp: HLC;
+    }, previousHashes?: readonly string[]) => Effect.Effect<ReceiptEnvelope[]>;
+    findByHash: (chain: ReadonlyArray<ReceiptEnvelope>, hash: string) => ReceiptEnvelope | undefined;
+    findByKind: (chain: ReadonlyArray<ReceiptEnvelope>, kind: string) => ReceiptEnvelope[];
+    generateMACKey: () => Effect.Effect<CryptoKey, Error>;
+    macEnvelope: (envelope: ReceiptEnvelope, key: CryptoKey) => Effect.Effect<ReceiptEnvelope, Error>;
+    verifyMAC: (envelope: ReceiptEnvelope, key: CryptoKey) => Effect.Effect<boolean, Error>;
+};
+export declare namespace Receipt {
+    /** Alias for {@link ReceiptSubject}. */
+    type Subject = ReceiptSubject;
+    /** Alias for {@link ReceiptEnvelope}. */
+    type Envelope = ReceiptEnvelope;
+    /** Alias for {@link ChainValidationError}. */
+    type ChainError = ChainValidationError;
+}
+//# sourceMappingURL=receipt.d.ts.map

package/dist/receipt.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"receipt.d.ts","sourceRoot":"","sources":["../src/receipt.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAChC,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAA8B,KAAK,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG3E,2FAA2F;AAC3F,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,KAAK,GAAG,UAAU,GAAG,QAAQ,CAAC;IACxD,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB;AAED;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,cAAc,CAAC;IACjC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC;IACjC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAAC;IAC9C,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,sEAAsE;AACtE,MAAM,MAAM,oBAAoB,GAC5B;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAAE,GACnD;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAC9G;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAC5G;IAAE,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAEpE,qEAAqE;AACrE,eAAO,MAAM,OAAO,EAAE,MAAkB,CAAC;AAEzC;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,YAAY,GAAI,UAAU,eAAe,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAY5E,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,cAAc,GACzB,MAAM,MAAM,EACZ,SAAS,cAAc,EACvB,SAAS,QAAQ,CAAC,KAAK,EACvB,WAAW,GAAG,EACd,cAAc,MAAM,GAAG,SAAS,MAAM,EAAE,KACvC,MAAM,CAAC,MAAM,CAAC,eAAe,CAQ5B,CAAC;AAEL;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,UAAU,GACrB,SAAS,aAAa,CAAC;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,cAAc,CAAC;IACxB,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC;IACxB,SAAS,EAAE,GAAG,CAAC;CAChB,CAAC,KACD,MAAM,CAAC,MAAM,CAAC,eAAe,EAAE,CAU9B,CAAC;AAEL;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,aAAa,GAAI,OAAO,aAAa,CAAC,eAAe,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAyB9F,CAAC;AAEL;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,qBAAqB,GAChC,OAAO,aAAa,CAAC,eAAe,CAAC,KACpC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,oBAAoB,CA4CvC,CAAC;AAEL;;;;;;;;;GASG;AACH,eAAO,MAAM,SAAS,GAAI,SAAS,eAAe,KAAG,OAE2C,CAAC;AAEjG;;;;;;;;GAQG;AACH,eAAO,MAAM,IAAI,GAAI,OAAO,aAAa,CAAC,eAAe,CAAC,KAAG,eAAe,GAAG,SACvB,CAAC;AAEzD;;;;;;;;GAQG;AACH,eAAO,MAAM,IAAI,GAAI,OAAO,aAAa,CAAC,eAAe,CAAC,KAAG,eAAe,GAAG,SACtC,CAAC;AAE1C;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,MAAM,GACjB,OAAO,aAAa,CAAC,eAAe,CAAC,EACrC,OAAO;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC;IAAC,SAAS,EAAE,GAAG,CAAA;CAAE,EACzF,iBAAiB,SAAS,MAAM,EAAE,KACjC,MAAM,CAAC,MAAM,CAAC,eAAe,EAAE,CAS9B,CAAC;AAEL;;;;;;;;GAQG;AACH,eAAO,MAAM,UAAU,GAAI,OAAO,aAAa,CAAC,eAAe,CAAC,EAAE,MAAM,MAAM,KAAG,eAAe,GAAG,SAC/D,CAAC;AAErC;;;;;;;;GAQG;AACH,eAAO,MAAM,UAAU,GAAI,OAAO,aAAa,CAAC,eAAe,CAAC,EAAE,MAAM,MAAM,KAAG,eAAe,EAC1D,CAAC;AAEvC;;;;;;;;;GASG;AACH,eAAO,MAAM,cAAc,QAAO,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,CAI5D,CAAC;AAEL;;;;;;;;;GASG;AACH,eAAO,MAAM,WAAW,GAAI,UAAU,eAAe,EAAE,KAAK,SAAS,KAAG,MAAM,CAAC,MAAM,CAAC,eAAe,EAAE,KAAK,CAUxG,CAAC;AAEL;;;;;;;;;;GAUG;AACH,eAAO,MAAM,SAAS,GAAI,UAAU,eAAe,EAAE,KAAK,SAAS,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAc9F,CAAC;AAEL;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,eAAO,MAAM,OAAO;;2BA1UZ,MAAM,WACH,cAAc,WACd,QAAQ,CAAC,KAAK,aACZ,GAAG,gBACA,MAAM,GAAG,SAAS,MAAM,EAAE,KACvC,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC;0BA2BtB,aAAa,CAAC;QACrB,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,cAAc,CAAC;QACxB,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC;QACxB,SAAS,EAAE,GAAG,CAAC;KAChB,CAAC,KACD,MAAM,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;2BAwBE,aAAa,CAAC,eAAe,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC;mCA2C1F,aAAa,CAAC,eAAe,CAAC,KACpC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,oBAAoB,CAAC;6BAxIL,eAAe,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;yBAgM3C,eAAe,KAAG,OAAO;kBAahC,aAAa,CAAC,eAAe,CAAC,KAAG,eAAe,GAAG,SAAS;kBAY5D,aAAa,CAAC,eAAe,CAAC,KAAG,eAAe,GAAG,SAAS;oBAkB/E,aAAa,CAAC,eAAe,CAAC,SAC9B;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,cAAc,CAAC;QAAC,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC;QAAC,SAAS,EAAE,GAAG,CAAA;KAAE,mBACxE,SAAS,MAAM,EAAE,KACjC,MAAM,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;wBAoBD,aAAa,CAAC,eAAe,CAAC,QAAQ,MAAM,KAAG,eAAe,GAAG,SAAS;wBAY1E,aAAa,CAAC,eAAe,CAAC,QAAQ,MAAM,KAAG,eAAe,EAAE;0BAahE,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC;4BAgB3B,eAAe,OAAO,SAAS,KAAG,MAAM,CAAC,MAAM,CAAC,eAAe,EAAE,KAAK,CAAC;0BAuBzE,eAAe,OAAO,SAAS,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC;CAsDlG,CAAC;AAEF,MAAM,CAAC,OAAO,WAAW,OAAO,CAAC;IAC/B,wCAAwC;IACxC,KAAY,OAAO,GAAG,cAAc,CAAC;IACrC,yCAAyC;IACzC,KAAY,QAAQ,GAAG,eAAe,CAAC;IACvC,8CAA8C;IAC9C,KAAY,UAAU,GAAG,oBAAoB,CAAC;CAC/C"}