@cavelang/cli 0.27.14 → 0.29.1

package/dist/internal/shape/index.d.ts

@@ -0,0 +1,27 @@
+/**
+ * `@cavelang/cli/shape` — shape expectations, knowledge health (spec §20) and
+ * alias discovery (spec §27).
+ *
+ * ```ts
+ * import { check, gatedIngest, suggestAliases } from '@cavelang/cli/shape'
+ *
+ * store.ingest('service EXPECTS owner\napi-gateway IS service')
+ * check(store).violations
+ * // → [{ entity: 'api-gateway', via: 'service', expectation: { …, name: 'owner' } }]
+ *
+ * gatedIngest(store, 'cache IS service', { source: 'cli' })
+ * // → { ok: false, violations: […] } — rolled back, nothing appended
+ *
+ * suggestAliases(store).map(suggestion => suggestion.line)
+ * // → ['maria ALIAS grandma-maria #suggested @ 35% ; segments of maria within grandma-maria']
+ * ```
+ */
+export { check, defaultStaleDays, evaluate, expectations } from './check.ts';
+export type { Coverage, Disagreement, Evaluation, Expectation, Options, Report, Stale, Violation } from './check.ts';
+export { gatedIngest, violationKey } from './gate.ts';
+export type { GateResult } from './gate.ts';
+export { clientFormatVersion, generateClient } from './client.ts';
+export type { ClientField, ClientGeneration, ClientGenerationFailure, GeneratedClient } from './client.ts';
+export { defaultMinScore, judgePrompt, parseJudgeReply, suggestAliases, suggestSource, suggestTag, writeSuggestions } from './suggest.ts';
+export type { Signal, Suggestion, Options as SuggestOptions } from './suggest.ts';
+//# sourceMappingURL=index.d.ts.map

package/dist/internal/shape/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAC5E,YAAY,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAA;AACpH,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,WAAW,CAAA;AACrD,YAAY,EAAE,UAAU,EAAE,MAAM,WAAW,CAAA;AAC3C,OAAO,EAAE,mBAAmB,EAAE,cAAc,EAAE,MAAM,aAAa,CAAA;AACjE,YAAY,EAAE,WAAW,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,eAAe,EAAE,MAAM,aAAa,CAAA;AAC1G,OAAO,EACL,eAAe,EAAE,WAAW,EAAE,eAAe,EAAE,cAAc,EAAE,aAAa,EAAE,UAAU,EAAE,gBAAgB,EAC3G,MAAM,cAAc,CAAA;AACrB,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,IAAI,cAAc,EAAE,MAAM,cAAc,CAAA"}

package/dist/internal/shape/index.js

@@ -0,0 +1,23 @@
+/**
+ * `@cavelang/cli/shape` — shape expectations, knowledge health (spec §20) and
+ * alias discovery (spec §27).
+ *
+ * ```ts
+ * import { check, gatedIngest, suggestAliases } from '@cavelang/cli/shape'
+ *
+ * store.ingest('service EXPECTS owner\napi-gateway IS service')
+ * check(store).violations
+ * // → [{ entity: 'api-gateway', via: 'service', expectation: { …, name: 'owner' } }]
+ *
+ * gatedIngest(store, 'cache IS service', { source: 'cli' })
+ * // → { ok: false, violations: […] } — rolled back, nothing appended
+ *
+ * suggestAliases(store).map(suggestion => suggestion.line)
+ * // → ['maria ALIAS grandma-maria #suggested @ 35% ; segments of maria within grandma-maria']
+ * ```
+ */
+export { check, defaultStaleDays, evaluate, expectations } from "./check.js";
+export { gatedIngest, violationKey } from "./gate.js";
+export { clientFormatVersion, generateClient } from "./client.js";
+export { defaultMinScore, judgePrompt, parseJudgeReply, suggestAliases, suggestSource, suggestTag, writeSuggestions } from "./suggest.js";
+//# sourceMappingURL=index.js.map

package/dist/internal/shape/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAE5E,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,WAAW,CAAA;AAErD,OAAO,EAAE,mBAAmB,EAAE,cAAc,EAAE,MAAM,aAAa,CAAA;AAEjE,OAAO,EACL,eAAe,EAAE,WAAW,EAAE,eAAe,EAAE,cAAc,EAAE,aAAa,EAAE,UAAU,EAAE,gBAAgB,EAC3G,MAAM,cAAc,CAAA"}

package/dist/internal/shape/suggest.d.ts

@@ -0,0 +1,82 @@
+/**
+ * Alias discovery (spec §27) — propose same-entity candidates for review.
+ *
+ * §13.6 made merge and unmerge cheap; under LLM extraction the bottleneck
+ * is *noticing* that `maria` and `grandma-maria` drifted apart. Everything
+ * here is a read: candidates are scored by deterministic, explainable
+ * string and graph signals, and the output is *suggested* `ALIAS` claims
+ * at low confidence (0.3–0.5 — the §20.2 review band), tagged `#suggested`,
+ * for a human to confirm or reject by ordinary appends. Discovery never
+ * merges; a pair with any recorded `ALIAS` history is never re-suggested,
+ * so review decisions stick. The optional LLM judge stays out-of-band
+ * (§19.5): a prompt/reply contract, injected by the caller.
+ */
+import type { Store } from '@cavelang/store';
+/** One piece of evidence behind a suggestion (spec §27.2). */
+export type Signal = {
+    /** `equal`/`tokens`/`prefix`/`edit` are string signals, `value`/`neighbor` graph signals. */
+    readonly kind: 'equal' | 'tokens' | 'prefix' | 'edit' | 'value' | 'neighbor';
+    readonly score: number;
+    /** Human-readable evidence, also emitted as the suggested line's comment. */
+    readonly detail: string;
+};
+/** One proposed same-entity pair (spec §27), strongest first in results. */
+export type Suggestion = {
+    /** The less-established name — subject of the suggested claim. */
+    readonly entity: string;
+    /** The more-established name — object of the suggested claim. */
+    readonly canonical: string;
+    /** Combined evidence score in 0..1 (spec §27.2). */
+    readonly score: number;
+    /** `score / 2`, clamped to 0.3..0.5 — the §20.2 review band. */
+    readonly confidence: number;
+    readonly signals: readonly Signal[];
+    /** The suggested claim as CAVE text: `entity ALIAS canonical #suggested @ N% ; evidence`. */
+    readonly line: string;
+};
+export type Options = {
+    /** Minimum evidence score (spec §27.2), default {@link defaultMinScore}. */
+    readonly minScore?: number;
+    /** At most this many suggestions, strongest first. */
+    readonly limit?: number;
+};
+export declare const defaultMinScore = 0.6;
+/** Actor stamped on written suggestions (spec §9.5, §27.3). */
+export declare const suggestSource = "suggest/alias";
+/** Tag carried by every suggested claim, so review can find them (§13.5). */
+export declare const suggestTag = "suggested";
+/**
+ * Proposes same-entity candidates over current beliefs (spec §27),
+ * strongest first. Deterministic: string similarity and shared rare
+ * attribute values generate candidates, shared relation neighbors boost
+ * them, and every excluded pair stays excluded — recorded `ALIAS` history
+ * in either direction (merged, rejected or unmerged), membership in one
+ * §13.6 closure group, a direct claim relating the two (related entities
+ * are distinct entities), or a scope-parent name (`auth` names a scope of
+ * `auth/middleware`, not an alias).
+ */
+export declare const suggestAliases: (store: Store, options?: Options) => Suggestion[];
+/**
+ * Appends suggestions as claims, stamped `@src:suggest/alias` (spec §9.5,
+ * §27.3). Once written, a pair has `ALIAS` history and is never suggested
+ * again — re-runs are naturally idempotent. Note the §13.6 consequence: a
+ * positive claim at any confidence links the alias closure; belief is
+ * graded, and review (confirm or retract) is the follow-up.
+ */
+export declare const writeSuggestions: (store: Store, suggestions: readonly Suggestion[]) => {
+    appended: number;
+};
+/**
+ * The judge prompt (spec §27.4): every suggestion with its evidence and
+ * each side's current claims. The reply contract is one JSON array of the
+ * suggestion numbers that really are the same entity.
+ */
+export declare const judgePrompt: (store: Store, suggestions: readonly Suggestion[]) => string;
+/**
+ * Parses the judge's reply into validated 0-based suggestion indices. The
+ * *last* well-formed JSON array wins (agents often think aloud before
+ * answering); non-integer, out-of-range and duplicate entries are dropped
+ * rather than failing the run.
+ */
+export declare const parseJudgeReply: (output: string, count: number) => number[];
+//# sourceMappingURL=suggest.d.ts.map

package/dist/internal/shape/suggest.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"suggest.d.ts","sourceRoot":"","sources":["../../src/suggest.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,OAAO,KAAK,EAAO,KAAK,EAAE,MAAM,iBAAiB,CAAA;AAIjD,8DAA8D;AAC9D,MAAM,MAAM,MAAM,GAAG;IACnB,6FAA6F;IAC7F,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,QAAQ,GAAG,QAAQ,GAAG,MAAM,GAAG,OAAO,GAAG,UAAU,CAAA;IAC5E,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CACxB,CAAA;AAED,4EAA4E;AAC5E,MAAM,MAAM,UAAU,GAAG;IACvB,kEAAkE;IAClE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,iEAAiE;IACjE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,oDAAoD;IACpD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,gEAAgE;IAChE,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAA;IACnC,6FAA6F;IAC7F,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CACtB,CAAA;AAED,MAAM,MAAM,OAAO,GAAG;IACpB,4EAA4E;IAC5E,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;IAC1B,sDAAsD;IACtD,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CACxB,CAAA;AAED,eAAO,MAAM,eAAe,MAAM,CAAA;AAElC,+DAA+D;AAC/D,eAAO,MAAM,aAAa,kBAAkB,CAAA;AAE5C,6EAA6E;AAC7E,eAAO,MAAM,UAAU,cAAc,CAAA;AAiOrC;;;;;;;;;GASG;AACH,eAAO,MAAM,cAAc,GAAI,OAAO,KAAK,EAAE,UAAS,OAAY,KAAG,UAAU,EAuF9E,CAAA;AAED;;;;;;GAMG;AACH,eAAO,MAAM,gBAAgB,GAAI,OAAO,KAAK,EAAE,aAAa,SAAS,UAAU,EAAE,KAAG;IAAE,QAAQ,EAAE,MAAM,CAAA;CAQjG,CAAA;AAUL;;;;GAIG;AACH,eAAO,MAAM,WAAW,GAAI,OAAO,KAAK,EAAE,aAAa,SAAS,UAAU,EAAE,KAAG,MAoBnE,CAAA;AAEZ;;;;;GAKG;AACH,eAAO,MAAM,eAAe,GAAI,QAAQ,MAAM,EAAE,OAAO,MAAM,KAAG,MAAM,EAyBrE,CAAA"}

package/dist/internal/shape/suggest.js

@@ -0,0 +1,374 @@
+/**
+ * Alias discovery (spec §27) — propose same-entity candidates for review.
+ *
+ * §13.6 made merge and unmerge cheap; under LLM extraction the bottleneck
+ * is *noticing* that `maria` and `grandma-maria` drifted apart. Everything
+ * here is a read: candidates are scored by deterministic, explainable
+ * string and graph signals, and the output is *suggested* `ALIAS` claims
+ * at low confidence (0.3–0.5 — the §20.2 review band), tagged `#suggested`,
+ * for a human to confirm or reject by ordinary appends. Discovery never
+ * merges; a pair with any recorded `ALIAS` history is never re-suggested,
+ * so review decisions stick. The optional LLM judge stays out-of-band
+ * (§19.5): a prompt/reply contract, injected by the caller.
+ */
+import { Verb } from '@cavelang/core';
+import { QuerySql } from '@cavelang/store';
+const currentSql = QuerySql.current();
+export const defaultMinScore = 0.6;
+/** Actor stamped on written suggestions (spec §9.5, §27.3). */
+export const suggestSource = 'suggest/alias';
+/** Tag carried by every suggested claim, so review can find them (§13.5). */
+export const suggestTag = 'suggested';
+/**
+ * System entities never suggested (spec §27.1): rules, actions, policy
+ * sources and connect records are infrastructure, and their digest-shaped
+ * names are string-similar by construction.
+ */
+const reservedPrefixes = ['rule/', 'action/', 'source/', 'connect/'];
+/** Entity test, as in §20's checks: not a verb token, not a stored literal. */
+const isEntityName = (name) => !Verb.isVerbToken(name) && !name.startsWith('"') && !name.startsWith('`');
+/** Lowercased with separators stripped — the comparison form. */
+const norm = (name) => name.toLowerCase().replaceAll(/[-_./]+/g, '');
+/** Lowercased `/-_.`-separated segments, deduplicated. */
+const tokensOf = (name) => new Set(name.toLowerCase().split(/[-_./]+/).filter(token => token !== ''));
+const stripDigits = (text) => text.replaceAll(/[0-9]+/g, '');
+/**
+ * Names differing only in digits (`api-v1` vs `api-v2`) are versions or
+ * deliberate numbering more often than drift — prefix and edit similarity
+ * ignore such pairs (spec §27.2).
+ */
+const digitOnlyDifference = (a, b) => a !== b && stripDigits(a) === stripDigits(b);
+const editDistance = (a, b) => {
+    let previous = Array.from({ length: b.length + 1 }, (_, at) => at);
+    for (let i = 1; i <= a.length; i += 1) {
+        const next = [i];
+        for (let j = 1; j <= b.length; j += 1) {
+            next.push(Math.min(previous[j] + 1, next[j - 1] + 1, previous[j - 1] + (a[i - 1] === b[j - 1] ? 0 : 1)));
+        }
+        previous = next;
+    }
+    return previous[b.length];
+};
+/**
+ * Whether the segments the names do NOT share are themselves spelling
+ * variants (edit similarity ≥ 0.75). Distinguishes drift (`grandma-mria` /
+ * `grandma-maria`) from sibling naming (`north-tower` / `south-tower`) —
+ * whole-string similarity alone cannot tell a typo from a differing word.
+ */
+const leftoverDrift = (a, b) => {
+    const [ta, tb] = [tokensOf(a), tokensOf(b)];
+    const leftA = [...ta].filter(token => !tb.has(token));
+    const leftB = [...tb].filter(token => !ta.has(token));
+    if (leftA.length === 0 || leftB.length === 0) {
+        return true;
+    }
+    const [small, large] = leftA.length <= leftB.length ? [leftA, leftB] : [leftB, leftA];
+    return small.every(token => large.some(other => 1 - editDistance(token, other) / Math.max(token.length, other.length) >= 0.75));
+};
+/**
+ * Order-free pair identity. Newline-joined: terms are single-line by
+ * construction (§3), so the join cannot collide.
+ */
+const pairKey = (a, b) => a < b ? `${a}\n${b}` : `${b}\n${a}`;
+const readGraph = (store) => {
+    const rows = store.db.prepare(`SELECT c.* FROM (${currentSql}) c WHERE c.conf > 0`).all();
+    // Entities carrying ingestion bookkeeping (`<path> HAS ingest-digest: …`)
+    // are file records, not domain entities — similar paths are not aliases.
+    const bookkeeping = new Set(rows.filter(row => row.attribute === 'ingest-digest').map(row => row.subject));
+    const isCandidate = (name) => isEntityName(name) && !bookkeeping.has(name) && norm(name) !== '' &&
+        !reservedPrefixes.some(prefix => name.startsWith(prefix));
+    const counts = new Map();
+    const count = (name) => {
+        if (isCandidate(name)) {
+            counts.set(name, (counts.get(name) ?? 0) + 1);
+        }
+    };
+    const neighbors = new Map();
+    const neighbor = (name, signature) => {
+        neighbors.set(name, (neighbors.get(name) ?? new Set()).add(signature));
+    };
+    const values = new Map();
+    const related = new Set();
+    const aliasParent = new Map();
+    const find = (name) => {
+        const up = aliasParent.get(name);
+        if (up === undefined || up === name) {
+            return name;
+        }
+        const root = find(up);
+        aliasParent.set(name, root);
+        return root;
+    };
+    for (const row of rows) {
+        count(row.subject);
+        if (row.object !== null) {
+            count(row.object);
+            related.add(pairKey(row.subject, row.object));
+            if (row.negated === 0 && row.verb === 'ALIAS') {
+                aliasParent.set(find(row.subject), find(row.object));
+            }
+            if (row.negated === 0 && row.verb !== 'ALIAS') {
+                neighbor(row.subject, `out ${row.verb} ${row.object}`);
+                neighbor(row.object, `in ${row.subject} ${row.verb}`);
+            }
+        }
+        // Only textual values long enough to be distinctive can identify —
+        // two entities measuring alike (`floors: 2`) are not one entity.
+        if (row.negated === 0 && row.attribute !== null && row.value_num === null &&
+            row.value_text !== null && row.value_text.length >= 4) {
+            const key = [row.attribute, row.value_text, row.value_unit ?? ''].join('\n');
+            values.set(key, (values.get(key) ?? new Set()).add(row.subject));
+        }
+    }
+    const decided = new Set(store.db.prepare("SELECT DISTINCT subject, object FROM cave_claim WHERE verb = 'ALIAS' AND object IS NOT NULL").all()
+        .map(row => pairKey(row.subject, row.object)));
+    const closureRoot = new Map([...counts.keys()].map(name => [name, find(name)]));
+    return { counts, neighbors, values, related, decided, closureRoot };
+};
+/** String and shared-value signals — the candidate-generating evidence (spec §27.2). */
+const primarySignals = (a, b, graph) => {
+    const signals = [];
+    const [na, nb] = [norm(a), norm(b)];
+    if (na === nb) {
+        signals.push({ kind: 'equal', score: 1, detail: 'names equal ignoring case and separators' });
+    }
+    else {
+        const [ta, tb] = [tokensOf(a), tokensOf(b)];
+        const [small, large] = ta.size <= tb.size ? [ta, tb] : [tb, ta];
+        const subset = [...small].every(token => large.has(token));
+        if (subset && ta.size === tb.size) {
+            signals.push({ kind: 'tokens', score: 0.9, detail: 'same name segments, reordered' });
+        }
+        else if (subset && Math.min(na.length, nb.length) >= 3) {
+            const [short, long] = ta.size <= tb.size ? [a, b] : [b, a];
+            signals.push({ kind: 'tokens', score: 0.7, detail: `segments of ${short} within ${long}` });
+        }
+        if (!digitOnlyDifference(na, nb)) {
+            const [short, long] = na.length <= nb.length ? [a, b] : [b, a];
+            if (Math.min(na.length, nb.length) >= 4 && (na.startsWith(nb) || nb.startsWith(na))) {
+                signals.push({
+                    kind: 'prefix',
+                    score: Math.min(na.length, nb.length) / Math.max(na.length, nb.length),
+                    detail: `${short} prefixes ${long}`
+                });
+            }
+            if (Math.min(na.length, nb.length) >= 5 && leftoverDrift(a, b)) {
+                const similarity = 1 - editDistance(na, nb) / Math.max(na.length, nb.length);
+                if (similarity >= 0.75) {
+                    signals.push({ kind: 'edit', score: similarity, detail: `spelling ${Math.round(similarity * 100)}% similar` });
+                }
+            }
+        }
+    }
+    for (const [key, names] of graph.values) {
+        // Exactly the two candidates — a value shared more widely is a common
+        // category value (`status: active`), not an identity.
+        if (names.size === 2 && names.has(a) && names.has(b)) {
+            const [attribute, value, unit] = key.split('\n');
+            const shown = value.length > 40 ? `${value.slice(0, 40)}...` : value;
+            signals.push({ kind: 'value', score: 0.8, detail: `share ${attribute}: ${shown}${unit === '' ? '' : ` ${unit}`}` });
+            if (signals.filter(signal => signal.kind === 'value').length >= 2) {
+                break;
+            }
+        }
+    }
+    return signals;
+};
+/** Shared relation neighbors — evidence that boosts, never generates (spec §27.2). */
+const neighborSignals = (a, b, graph) => {
+    const from = graph.neighbors.get(a);
+    const other = graph.neighbors.get(b);
+    if (from === undefined || other === undefined) {
+        return [];
+    }
+    const signals = [];
+    for (const signature of from) {
+        if (other.has(signature)) {
+            const [side, first, second] = signature.split(' ');
+            signals.push({
+                kind: 'neighbor',
+                score: 0.1,
+                detail: side === 'out' ? `both ${first} ${second}` : `both object of ${first} ${second}`
+            });
+            if (signals.length >= 2) {
+                break;
+            }
+        }
+    }
+    return signals;
+};
+const formatPercent = (confidence) => `${Math.round(confidence * 100)}%`;
+/**
+ * Proposes same-entity candidates over current beliefs (spec §27),
+ * strongest first. Deterministic: string similarity and shared rare
+ * attribute values generate candidates, shared relation neighbors boost
+ * them, and every excluded pair stays excluded — recorded `ALIAS` history
+ * in either direction (merged, rejected or unmerged), membership in one
+ * §13.6 closure group, a direct claim relating the two (related entities
+ * are distinct entities), or a scope-parent name (`auth` names a scope of
+ * `auth/middleware`, not an alias).
+ */
+export const suggestAliases = (store, options = {}) => {
+    const minScore = options.minScore ?? defaultMinScore;
+    const graph = readGraph(store);
+    const names = [...graph.counts.keys()].sort();
+    // Cheap blocking: a pair is worth scoring when the names share their
+    // first comparison character, a normalized suffix, a segment, or a rare
+    // value. The suffix block lets leading-character edits reach the existing
+    // edit-distance and differing-segment guards.
+    const blocks = new Map();
+    const block = (key, name) => {
+        blocks.set(key, [...blocks.get(key) ?? [], name]);
+    };
+    for (const name of names) {
+        const normalized = norm(name);
+        block(`first ${normalized[0]}`, name);
+        if (normalized.length >= 5) {
+            block(`suffix ${normalized.slice(-4)}`, name);
+        }
+        for (const token of tokensOf(name)) {
+            block(`token ${token}`, name);
+        }
+    }
+    for (const [key, carriers] of graph.values) {
+        if (carriers.size === 2) {
+            for (const name of carriers) {
+                if (graph.counts.has(name)) {
+                    block(`value ${key}`, name);
+                }
+            }
+        }
+    }
+    const excluded = (a, b) => {
+        const key = pairKey(a, b);
+        return graph.decided.has(key) || graph.related.has(key) ||
+            graph.closureRoot.get(a) === graph.closureRoot.get(b) ||
+            a.startsWith(`${b}/`) || b.startsWith(`${a}/`);
+    };
+    const seen = new Set();
+    const suggestions = [];
+    for (const bucket of blocks.values()) {
+        for (let i = 0; i < bucket.length; i += 1) {
+            for (let j = i + 1; j < bucket.length; j += 1) {
+                const [a, b] = [bucket[i], bucket[j]];
+                const key = pairKey(a, b);
+                if (seen.has(key)) {
+                    continue;
+                }
+                seen.add(key);
+                if (excluded(a, b)) {
+                    continue;
+                }
+                const primary = primarySignals(a, b, graph);
+                if (primary.length === 0) {
+                    continue;
+                }
+                const boosts = neighborSignals(a, b, graph);
+                const score = Math.min(1, Math.max(...primary.map(signal => signal.score)) +
+                    boosts.reduce((sum, signal) => sum + signal.score, 0));
+                if (score < minScore) {
+                    continue;
+                }
+                // The more-established name is canonical: more current rows, then
+                // the shorter name, then lexicographic — a convention, not a
+                // semantic (§13.6 reads ALIAS as undirected).
+                const countOf = (name) => graph.counts.get(name) ?? 0;
+                const canonicalFirst = countOf(a) !== countOf(b) ?
+                    countOf(a) > countOf(b) :
+                    a.length !== b.length ? a.length < b.length : a < b;
+                const [entity, canonical] = canonicalFirst ? [b, a] : [a, b];
+                const signals = [...primary, ...boosts];
+                const confidence = Math.min(0.5, Math.max(0.3, Math.round(score * 50) / 100));
+                suggestions.push({
+                    entity,
+                    canonical,
+                    score,
+                    confidence,
+                    signals,
+                    line: `${entity} ALIAS ${canonical} #${suggestTag} @ ${formatPercent(confidence)}` +
+                        ` ; ${signals.map(signal => signal.detail).join('; ')}`
+                });
+            }
+        }
+    }
+    suggestions.sort((a, b) => b.score - a.score || a.entity.localeCompare(b.entity) || a.canonical.localeCompare(b.canonical));
+    return options.limit === undefined ? suggestions : suggestions.slice(0, options.limit);
+};
+/**
+ * Appends suggestions as claims, stamped `@src:suggest/alias` (spec §9.5,
+ * §27.3). Once written, a pair has `ALIAS` history and is never suggested
+ * again — re-runs are naturally idempotent. Note the §13.6 consequence: a
+ * positive claim at any confidence links the alias closure; belief is
+ * graded, and review (confirm or retract) is the follow-up.
+ */
+export const writeSuggestions = (store, suggestions) => suggestions.length === 0 ?
+    { appended: 0 } :
+    {
+        appended: store.ingest(suggestions.map(suggestion => suggestion.line).join('\n'), { source: suggestSource, strict: true }).ids.length
+    };
+/** Current claims naming the entity, newest first — the judge's evidence. */
+const evidenceOf = (store, entity, limit) => store.db.prepare(`
+    SELECT c.raw_line AS line FROM (${currentSql}) c
+    WHERE c.conf > 0 AND (c.subject = ? OR c.object = ?)
+    ORDER BY c.tx DESC LIMIT ?
+  `).all(entity, entity, limit).map(row => row.line);
+/**
+ * The judge prompt (spec §27.4): every suggestion with its evidence and
+ * each side's current claims. The reply contract is one JSON array of the
+ * suggestion numbers that really are the same entity.
+ */
+export const judgePrompt = (store, suggestions) => [
+    'You are reviewing entity-alias suggestions for a CAVE knowledge store — one atomic claim',
+    'per line: subject VERB object, or subject HAS attribute: value, with optional @context,',
+    '#tag and @ N% confidence.',
+    '',
+    'Each numbered suggestion proposes that two names denote the SAME real-world entity.',
+    'Below each suggestion are the current claims about either name. Confirm a suggestion ONLY',
+    'when the claims are consistent with one entity — tolerate spelling, casing and phrasing',
+    'drift, but never confirm names whose claims describe different things (different types,',
+    'contradicting values, distinct roles in the same relation). Judge conservatively: when',
+    'unsure, do not confirm.',
+    '',
+    ...suggestions.flatMap((suggestion, index) => [
+        `S${index + 1}: ${suggestion.line}`,
+        ...evidenceOf(store, suggestion.entity, 8).map(line => `  ${line}`),
+        ...evidenceOf(store, suggestion.canonical, 8).map(line => `  ${line}`),
+        ''
+    ]),
+    'Reply with ONLY a JSON array of the suggestion numbers that ARE the same entity,',
+    'e.g. [1, 3]. Reply [] when none are.'
+].join('\n');
+/**
+ * Parses the judge's reply into validated 0-based suggestion indices. The
+ * *last* well-formed JSON array wins (agents often think aloud before
+ * answering); non-integer, out-of-range and duplicate entries are dropped
+ * rather than failing the run.
+ */
+export const parseJudgeReply = (output, count) => {
+    let parsed;
+    let at = output.indexOf('[');
+    while (at !== -1) {
+        const end = output.indexOf(']', at);
+        if (end === -1) {
+            break;
+        }
+        try {
+            parsed = JSON.parse(output.slice(at, end + 1));
+            at = output.indexOf('[', end + 1);
+        }
+        catch {
+            at = output.indexOf('[', at + 1);
+        }
+    }
+    if (!Array.isArray(parsed)) {
+        return [];
+    }
+    const kept = new Set();
+    for (const entry of parsed) {
+        if (typeof entry === 'number' && Number.isInteger(entry) && entry >= 1 && entry <= count) {
+            kept.add(entry - 1);
+        }
+    }
+    return [...kept].sort((a, b) => a - b);
+};
+//# sourceMappingURL=suggest.js.map

package/dist/internal/shape/suggest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"suggest.js","sourceRoot":"","sources":["../../src/suggest.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAA;AACrC,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAA;AAG1C,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAA;AAiCrC,MAAM,CAAC,MAAM,eAAe,GAAG,GAAG,CAAA;AAElC,+DAA+D;AAC/D,MAAM,CAAC,MAAM,aAAa,GAAG,eAAe,CAAA;AAE5C,6EAA6E;AAC7E,MAAM,CAAC,MAAM,UAAU,GAAG,WAAW,CAAA;AAErC;;;;GAIG;AACH,MAAM,gBAAgB,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAA;AAEpE,+EAA+E;AAC/E,MAAM,YAAY,GAAG,CAAC,IAAY,EAAW,EAAE,CAC7C,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;AAE3E,iEAAiE;AACjE,MAAM,IAAI,GAAG,CAAC,IAAY,EAAU,EAAE,CACpC,IAAI,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,CAAC,CAAA;AAE/C,0DAA0D;AAC1D,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAe,EAAE,CAC7C,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC,CAAA;AAE5E,MAAM,WAAW,GAAG,CAAC,IAAY,EAAU,EAAE,CAC3C,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC,CAAA;AAEhC;;;;GAIG;AACH,MAAM,mBAAmB,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE,CAC5D,CAAC,KAAK,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,CAAA;AAE9C,MAAM,YAAY,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IACpD,IAAI,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAA;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAChB,QAAQ,CAAC,CAAC,CAAE,GAAG,CAAC,EAChB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,EAChB,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACnD,CAAC,CAAA;QACJ,CAAC;QACD,QAAQ,GAAG,IAAI,CAAA;IACjB,CAAC;IACD,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAE,CAAA;AAC5B,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE;IACtD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3C,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;IACrD,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;IACrD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7C,OAAO,IAAI,CAAA;IACb,CAAC;IACD,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;IACrF,OAAO,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CACzB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAA;AACvG,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAC/C,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAA;AAkBrC,MAAM,SAAS,GAAG,CAAC,KAAY,EAAS,EAAE;IACxC,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,oBAAoB,UAAU,sBAAsB,CAAC,CAAC,GAAG,EAAwB,CAAA;IAC/G,0EAA0E;IAC1E,yEAAyE;IACzE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,KAAK,eAAe,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAA;IAC1G,MAAM,WAAW,GAAG,CAAC,IAAY,EAAW,EAAE,CAC5C,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;QACjE,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAA;IAC3D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IACxC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAQ,EAAE;QACnC,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/C,CAAC;IACH,CAAC,CAAA;IACD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAA;IAChD,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,SAAiB,EAAQ,EAAE;QACzD,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAA;IACxE,CAAC,CAAA;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC7C,MAAM,IAAI,GAAG,CAAC,IAAY,EAAU,EAAE;QACpC,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAChC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YACpC,OAAO,IAAI,CAAA;QACb,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAA;QACrB,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAC3B,OAAO,IAAI,CAAA;IACb,CAAC,CAAA;IACD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAClB,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACxB,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YACjB,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;YAC7C,IAAI,GAAG,CAAC,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC9C,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;YACtD,CAAC;YACD,IAAI,GAAG,CAAC,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC9C,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC,CAAA;gBACtD,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,CAAA;YACvD,CAAC;QACH,CAAC;QACD,mEAAmE;QACnE,iEAAiE;QACjE,IAAI,GAAG,CAAC,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI;YACrE,GAAG,CAAC,UAAU,KAAK,IAAI,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1D,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC5E,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAA;QAClE,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,CACpB,KAAK,CAAC,EAAE,CAAC,OAAO,CACf,6FAA6F,CAC9F,CAAC,GAAG,EAA4C;SAC9C,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAChD,CAAA;IACD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAC/E,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,CAAA;AACrE,CAAC,CAAA;AAED,wFAAwF;AACxF,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,KAAY,EAAY,EAAE;IACtE,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IACnC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,0CAA0C,EAAE,CAAC,CAAA;IAC/F,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3C,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QAC/D,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;QAC1D,IAAI,MAAM,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;YAClC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,+BAA+B,EAAE,CAAC,CAAA;QACvF,CAAC;aAAM,IAAI,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACzD,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC1D,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,eAAe,KAAK,WAAW,IAAI,EAAE,EAAE,CAAC,CAAA;QAC7F,CAAC;QACD,IAAI,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;YACjC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC9D,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACpF,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,QAAQ;oBACd,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC;oBACtE,MAAM,EAAE,GAAG,KAAK,aAAa,IAAI,EAAE;iBACpC,CAAC,CAAA;YACJ,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC/D,MAAM,UAAU,GAAG,CAAC,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAA;gBAC5E,IAAI,UAAU,IAAI,IAAI,EAAE,CAAC;oBACvB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC,CAAA;gBAChH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACxC,sEAAsE;QACtE,sDAAsD;QACtD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACrD,MAAM,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAA6B,CAAA;YAC5E,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAA;YACpE,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,SAAS,KAAK,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,EAAE,CAAC,CAAA;YACnH,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAClE,MAAK;YACP,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC,CAAA;AAED,sFAAsF;AACtF,MAAM,eAAe,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,KAAY,EAAY,EAAE;IACvE,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACnC,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACpC,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QAC9C,OAAO,EAAE,CAAA;IACX,CAAC;IACD,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,KAAK,MAAM,SAAS,IAAI,IAAI,EAAE,CAAC;QAC7B,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YACzB,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAA6B,CAAA;YAC9E,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,UAAU;gBAChB,KAAK,EAAE,GAAG;gBACV,MAAM,EAAE,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,MAAM,EAAE,CAAC,CAAC,CAAC,kBAAkB,KAAK,IAAI,MAAM,EAAE;aACzF,CAAC,CAAA;YACF,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACxB,MAAK;YACP,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC,CAAA;AAED,MAAM,aAAa,GAAG,CAAC,UAAkB,EAAU,EAAE,CACnD,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,CAAA;AAEpC;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,KAAY,EAAE,UAAmB,EAAE,EAAgB,EAAE;IAClF,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,eAAe,CAAA;IACpD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;IAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA;IAC7C,qEAAqE;IACrE,wEAAwE;IACxE,0EAA0E;IAC1E,8CAA8C;IAC9C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC1C,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,IAAY,EAAQ,EAAE;QAChD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC,CAAA;IACnD,CAAC,CAAA;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;QAC7B,KAAK,CAAC,SAAS,UAAU,CAAC,CAAC,CAAE,EAAE,EAAE,IAAI,CAAC,CAAA;QACtC,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC3B,KAAK,CAAC,UAAU,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QAC/C,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,KAAK,CAAC,SAAS,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3C,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACxB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC3B,KAAK,CAAC,SAAS,GAAG,EAAE,EAAE,IAAI,CAAC,CAAA;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE;QACjD,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACzB,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YACrD,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;YACrD,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAClD,CAAC,CAAA;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,WAAW,GAAiB,EAAE,CAAA;IACpC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC,CAAE,CAAC,CAAA;gBACvC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBACzB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAClB,SAAQ;gBACV,CAAC;gBACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACb,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACnB,SAAQ;gBACV,CAAC;gBACD,MAAM,OAAO,GAAG,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;gBAC3C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACzB,SAAQ;gBACV,CAAC;gBACD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;gBAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EACtB,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBAChD,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAA;gBACxD,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACrB,SAAQ;gBACV,CAAC;gBACD,kEAAkE;gBAClE,6DAA6D;gBAC7D,8CAA8C;gBAC9C,MAAM,OAAO,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACrE,MAAM,cAAc,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChD,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzB,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;gBACrD,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBAC5D,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,EAAE,GAAG,MAAM,CAAC,CAAA;gBACvC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;gBAC7E,WAAW,CAAC,IAAI,CAAC;oBACf,MAAM;oBACN,SAAS;oBACT,KAAK;oBACL,UAAU;oBACV,OAAO;oBACP,IAAI,EAAE,GAAG,MAAM,UAAU,SAAS,KAAK,UAAU,MAAM,aAAa,CAAC,UAAU,CAAC,EAAE;wBAChF,MAAM,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;iBAC1D,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IACD,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACxB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAA;IAClG,OAAO,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,CAAA;AACxF,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,KAAY,EAAE,WAAkC,EAAwB,EAAE,CACzG,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IACxB,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;IACjB;QACE,QAAQ,EAAE,KAAK,CAAC,MAAM,CACpB,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EACzD,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,IAAI,EAAE,CACxC,CAAC,GAAG,CAAC,MAAM;KACb,CAAA;AAEL,6EAA6E;AAC7E,MAAM,UAAU,GAAG,CAAC,KAAY,EAAE,MAAc,EAAE,KAAa,EAAY,EAAE,CAC1E,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC;sCACkB,UAAU;;;GAG7C,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAwB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;AAE3E;;;;GAIG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAY,EAAE,WAAkC,EAAU,EAAE,CAAC;IACvF,0FAA0F;IAC1F,yFAAyF;IACzF,2BAA2B;IAC3B,EAAE;IACF,qFAAqF;IACrF,2FAA2F;IAC3F,yFAAyF;IACzF,yFAAyF;IACzF,wFAAwF;IACxF,yBAAyB;IACzB,EAAE;IACF,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC;QAC5C,IAAI,KAAK,GAAG,CAAC,KAAK,UAAU,CAAC,IAAI,EAAE;QACnC,GAAG,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC;QACnE,GAAG,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC;QACtE,EAAE;KACH,CAAC;IACF,kFAAkF;IAClF,sCAAsC;CACvC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAEZ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,MAAc,EAAE,KAAa,EAAY,EAAE;IACzE,IAAI,MAAe,CAAA;IACnB,IAAI,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC5B,OAAO,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAA;QACnC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,MAAK;QACP,CAAC;QACD,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;YAC9C,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAA;QACnC,CAAC;QAAC,MAAM,CAAC;YACP,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC,CAAA;QAClC,CAAC;IACH,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAA;IACX,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACzF,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QACrB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;AACxC,CAAC,CAAA"}

package/dist/internal/sync/index.d.ts

@@ -0,0 +1,22 @@
+/**
+ * `@cavelang/cli/sync` — store merge (spec §28).
+ *
+ * Merge append-only CAVE stores by row identity: rows absent by id copy
+ * verbatim, present ids skip — idempotent, transitive, conflict-free by
+ * construction (§9.4 coexistence). Sources are store files (`syncDb`) or
+ * §28.4 transaction-annotated canonical text (`syncText`,
+ * `cave export --tx`); effective merges append a `SYNCED-INTO` record
+ * claim, and merged transaction ids feed the §28.2 receive rule.
+ *
+ * ```ts
+ * import { open } from '@cavelang/store'
+ * import { syncDb } from '@cavelang/cli/sync'
+ *
+ * const store = open('main.db')
+ * syncDb(store, 'laptop.db', { from: 'laptop', into: 'main' })
+ * // → { merged: 42, skipped: 108, edges: 17, record: 'store/laptop SYNCED-INTO store/main ; …' }
+ * ```
+ */
+export { isStoreFile, labelOf, sanitizeLabel, syncDb, syncFile, syncText } from './sync.ts';
+export type { SyncOptions, SyncProblem, SyncReport } from './sync.ts';
+//# sourceMappingURL=index.d.ts.map

package/dist/internal/sync/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC3F,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,WAAW,CAAA"}

package/dist/internal/sync/index.js

@@ -0,0 +1,21 @@
+/**
+ * `@cavelang/cli/sync` — store merge (spec §28).
+ *
+ * Merge append-only CAVE stores by row identity: rows absent by id copy
+ * verbatim, present ids skip — idempotent, transitive, conflict-free by
+ * construction (§9.4 coexistence). Sources are store files (`syncDb`) or
+ * §28.4 transaction-annotated canonical text (`syncText`,
+ * `cave export --tx`); effective merges append a `SYNCED-INTO` record
+ * claim, and merged transaction ids feed the §28.2 receive rule.
+ *
+ * ```ts
+ * import { open } from '@cavelang/store'
+ * import { syncDb } from '@cavelang/cli/sync'
+ *
+ * const store = open('main.db')
+ * syncDb(store, 'laptop.db', { from: 'laptop', into: 'main' })
+ * // → { merged: 42, skipped: 108, edges: 17, record: 'store/laptop SYNCED-INTO store/main ; …' }
+ * ```
+ */
+export { isStoreFile, labelOf, sanitizeLabel, syncDb, syncFile, syncText } from "./sync.js";
+//# sourceMappingURL=index.js.map

package/dist/internal/sync/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA"}