@vortex-os/memory-extended 0.5.1

package/dist/vector/backend-brute.d.ts

@@ -0,0 +1,38 @@
+import Database from "better-sqlite3";
+import type { VectorBackend, VectorRow, VectorSearchHit, VectorSearchOptions, VectorSource } from "./types.js";
+/**
+ * Default {@link VectorBackend} (operator decision 2 / 2026-05-29):
+ * in-process brute-force cosine over vectors persisted in a plain SQLite
+ * table. No `sqlite-vec`, no native extension to load — which is exactly
+ * why it is the default at this corpus size (tens to low hundreds of
+ * memories). A full scan of a few hundred unit vectors is sub-millisecond;
+ * the operational simplicity (zero extra deps, identical behavior on every
+ * platform) outweighs ANN indexing until the corpus reaches ~10k vectors.
+ *
+ * Swap in a `SqliteVecBackend` / `QdrantBackend` (same interface) when that
+ * day comes; `MemoryVectorStore` does not need to change.
+ *
+ * Storage detail: vectors are stored L2-normalized (the store normalizes
+ * before calling `upsert`), so the cosine similarity of two stored vectors
+ * is just their dot product. The query vector is normalized the same way,
+ * keeping {@link search} to one dot product per row.
+ */
+export declare class BruteForceBackend implements VectorBackend {
+    readonly dbPath: string;
+    private db;
+    /**
+     * Open against a DB path (shares the file with `MemorySqliteStore` by
+     * design) or an already-open Database handle (lets the caller reuse a
+     * single connection). When given a handle, `close()` is a no-op — the
+     * owner closes it.
+     */
+    constructor(db: string | Database.Database);
+    private readonly ownsHandle;
+    upsert(row: VectorRow): void;
+    delete(id: string, source?: VectorSource): boolean;
+    search(query: Float32Array, options?: VectorSearchOptions): readonly VectorSearchHit[];
+    listIds(source?: VectorSource): readonly string[];
+    count(source?: VectorSource): number;
+    close(): void;
+}
+//# sourceMappingURL=backend-brute.d.ts.map

package/dist/vector/backend-brute.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"backend-brute.d.ts","sourceRoot":"","sources":["../../src/vector/backend-brute.ts"],"names":[],"mappings":"AAEA,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AAGtC,OAAO,KAAK,EACV,aAAa,EACb,SAAS,EACT,eAAe,EACf,mBAAmB,EACnB,YAAY,EACb,MAAM,YAAY,CAAC;AAEpB;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,iBAAkB,YAAW,aAAa;IACrD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,OAAO,CAAC,EAAE,CAAoB;IAE9B;;;;;OAKG;gBACS,EAAE,EAAE,MAAM,GAAG,QAAQ,CAAC,QAAQ;IAe1C,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAU;IAErC,MAAM,CAAC,GAAG,EAAE,SAAS,GAAG,IAAI;IAe5B,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,YAAY,GAAG,OAAO;IAOlD,MAAM,CAAC,KAAK,EAAE,YAAY,EAAE,OAAO,CAAC,EAAE,mBAAmB,GAAG,SAAS,eAAe,EAAE;IAqBtF,OAAO,CAAC,MAAM,CAAC,EAAE,YAAY,GAAG,SAAS,MAAM,EAAE;IAOjD,KAAK,CAAC,MAAM,CAAC,EAAE,YAAY,GAAG,MAAM;IAOpC,KAAK,IAAI,IAAI;CAGd"}

package/dist/vector/backend-brute.js

@@ -0,0 +1,112 @@
+import { mkdirSync } from "node:fs";
+import { dirname } from "node:path";
+import Database from "better-sqlite3";
+import { VECTOR_SCHEMA } from "./schema.js";
+import { dot } from "./math.js";
+/**
+ * Default {@link VectorBackend} (operator decision 2 / 2026-05-29):
+ * in-process brute-force cosine over vectors persisted in a plain SQLite
+ * table. No `sqlite-vec`, no native extension to load — which is exactly
+ * why it is the default at this corpus size (tens to low hundreds of
+ * memories). A full scan of a few hundred unit vectors is sub-millisecond;
+ * the operational simplicity (zero extra deps, identical behavior on every
+ * platform) outweighs ANN indexing until the corpus reaches ~10k vectors.
+ *
+ * Swap in a `SqliteVecBackend` / `QdrantBackend` (same interface) when that
+ * day comes; `MemoryVectorStore` does not need to change.
+ *
+ * Storage detail: vectors are stored L2-normalized (the store normalizes
+ * before calling `upsert`), so the cosine similarity of two stored vectors
+ * is just their dot product. The query vector is normalized the same way,
+ * keeping {@link search} to one dot product per row.
+ */
+export class BruteForceBackend {
+    dbPath;
+    db;
+    /**
+     * Open against a DB path (shares the file with `MemorySqliteStore` by
+     * design) or an already-open Database handle (lets the caller reuse a
+     * single connection). When given a handle, `close()` is a no-op — the
+     * owner closes it.
+     */
+    constructor(db) {
+        if (typeof db === "string") {
+            mkdirSync(dirname(db), { recursive: true });
+            this.dbPath = db;
+            this.db = new Database(db);
+            this.db.pragma("journal_mode = WAL");
+            this.ownsHandle = true;
+        }
+        else {
+            this.dbPath = db.name;
+            this.db = db;
+            this.ownsHandle = false;
+        }
+        this.db.exec(VECTOR_SCHEMA);
+    }
+    ownsHandle;
+    upsert(row) {
+        this.db
+            .prepare(`INSERT OR REPLACE INTO memory_vectors (id, source, dim, vector)
+         VALUES (@id, @source, @dim, @vector)`)
+            .run({
+            id: row.id,
+            source: row.source,
+            dim: row.dim,
+            // Float32Array → Buffer view over the same bytes (no copy of values).
+            vector: Buffer.from(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength),
+        });
+    }
+    delete(id, source) {
+        const res = source
+            ? this.db.prepare(`DELETE FROM memory_vectors WHERE id = ? AND source = ?`).run(id, source)
+            : this.db.prepare(`DELETE FROM memory_vectors WHERE id = ?`).run(id);
+        return res.changes > 0;
+    }
+    search(query, options) {
+        const k = options?.k ?? 10;
+        const idFilter = options?.ids;
+        const sql = options?.source
+            ? `SELECT id, source, dim, vector FROM memory_vectors WHERE source = ?`
+            : `SELECT id, source, dim, vector FROM memory_vectors`;
+        const rows = (options?.source
+            ? this.db.prepare(sql).all(options.source)
+            : this.db.prepare(sql).all());
+        const hits = [];
+        for (const r of rows) {
+            if (idFilter && !idFilter.has(r.id))
+                continue;
+            if (r.dim !== query.length)
+                continue; // dimension mismatch → skip (model changed)
+            const vec = bufferToFloat32(r.vector);
+            hits.push({ id: r.id, source: r.source, score: dot(query, vec) });
+        }
+        hits.sort((a, b) => b.score - a.score);
+        return hits.slice(0, k);
+    }
+    listIds(source) {
+        const rows = (source
+            ? this.db.prepare(`SELECT id FROM memory_vectors WHERE source = ? ORDER BY id`).all(source)
+            : this.db.prepare(`SELECT id FROM memory_vectors ORDER BY id`).all());
+        return rows.map((r) => r.id);
+    }
+    count(source) {
+        const row = (source
+            ? this.db.prepare(`SELECT COUNT(*) AS n FROM memory_vectors WHERE source = ?`).get(source)
+            : this.db.prepare(`SELECT COUNT(*) AS n FROM memory_vectors`).get());
+        return row.n;
+    }
+    close() {
+        if (this.ownsHandle)
+            this.db.close();
+    }
+}
+/** Reinterpret a stored BLOB as Float32Array (copying to guarantee alignment). */
+function bufferToFloat32(buf) {
+    // Copy into a fresh ArrayBuffer — a Buffer's underlying pool may be offset
+    // such that a zero-copy Float32Array view would be mis-aligned.
+    const copy = new Uint8Array(buf.byteLength);
+    copy.set(buf);
+    return new Float32Array(copy.buffer, 0, buf.byteLength / 4);
+}
+//# sourceMappingURL=backend-brute.js.map

package/dist/vector/backend-brute.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"backend-brute.js","sourceRoot":"","sources":["../../src/vector/backend-brute.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACpC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAShC;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,OAAO,iBAAiB;IACnB,MAAM,CAAS;IAChB,EAAE,CAAoB;IAE9B;;;;;OAKG;IACH,YAAY,EAA8B;QACxC,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;YAC3B,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC5C,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;YACjB,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC3B,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC;YACtB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QAC1B,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC9B,CAAC;IAEgB,UAAU,CAAU;IAErC,MAAM,CAAC,GAAc;QACnB,IAAI,CAAC,EAAE;aACJ,OAAO,CACN;8CACsC,CACvC;aACA,GAAG,CAAC;YACH,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,GAAG,EAAE,GAAG,CAAC,GAAG;YACZ,sEAAsE;YACtE,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC;SACrF,CAAC,CAAC;IACP,CAAC;IAED,MAAM,CAAC,EAAU,EAAE,MAAqB;QACtC,MAAM,GAAG,GAAG,MAAM;YAChB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wDAAwD,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC;YAC3F,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvE,OAAO,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,CAAC,KAAmB,EAAE,OAA6B;QACvD,MAAM,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,OAAO,EAAE,GAAG,CAAC;QAC9B,MAAM,GAAG,GAAG,OAAO,EAAE,MAAM;YACzB,CAAC,CAAC,qEAAqE;YACvE,CAAC,CAAC,oDAAoD,CAAC;QACzD,MAAM,IAAI,GAAG,CAAC,OAAO,EAAE,MAAM;YAC3B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC;YAC1C,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAgC,CAAC;QAE/D,MAAM,IAAI,GAAsB,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC9C,IAAI,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,MAAM;gBAAE,SAAS,CAAC,4CAA4C;YAClF,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAsB,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QACpF,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC;IAED,OAAO,CAAC,MAAqB;QAC3B,MAAM,IAAI,GAAG,CAAC,MAAM;YAClB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,4DAA4D,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;YAC3F,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC,GAAG,EAAE,CAAkC,CAAC;QACzG,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,MAAqB;QACzB,MAAM,GAAG,GAAG,CAAC,MAAM;YACjB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2DAA2D,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;YAC1F,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC,GAAG,EAAE,CAAkB,CAAC;QACxF,OAAO,GAAG,CAAC,CAAC,CAAC;IACf,CAAC;IAED,KAAK;QACH,IAAI,IAAI,CAAC,UAAU;YAAE,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IACvC,CAAC;CACF;AASD,kFAAkF;AAClF,SAAS,eAAe,CAAC,GAAW;IAClC,2EAA2E;IAC3E,gEAAgE;IAChE,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC5C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACd,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;AAC9D,CAAC"}

package/dist/vector/embedder.d.ts

@@ -0,0 +1,59 @@
+import type { EmbedFn } from "./types.js";
+/**
+ * Default local embedder (operator decision 1 / 2026-05-29).
+ *
+ * Ships with `@vortex-os/memory-extended` so installing the package gives
+ * you a working embedder with no separate manual step. The embedding
+ * *library* (`@huggingface/transformers`) is a declared dependency and
+ * installs with the package; the embedding *model weights* download once on
+ * first call and are cached by the library thereafter. Nothing the operator
+ * has to fetch by hand.
+ *
+ * The heavy library is loaded lazily — and via a runtime-resolved
+ * specifier so the TypeScript build does not require its types to be
+ * present. Hosts that prefer an API embedder (OpenAI / Voyage) simply pass
+ * their own `EmbedFn` and never trigger this code path.
+ *
+ * Default model: `Xenova/multilingual-e5-small` — 384-dim, 50+ languages
+ * (incl. Korean), 512-token input, runs locally on CPU, no API key. Same
+ * weight class as the older MiniLM default (~118M, ~470 MB) but it is a
+ * *retrieval-trained* model (better at query↔document matching than a
+ * paraphrase model) and accepts 512 tokens vs MiniLM's 128, easing the
+ * within-chunk truncation that hurt session recall.
+ *
+ * **e5 prefixes (asymmetric):** e5 expects `"query: "` before a search query
+ * and `"passage: "` before an indexed document. This embedder applies them
+ * automatically from `kind` (passed by the store: indexing → passage,
+ * recall → query). If you override `model` to a *symmetric* model
+ * (MiniLM, all-MiniLM-L6-v2) pass `prefixes: null` to disable them.
+ *
+ * NOTE: vectors are model-specific. Changing the model requires rebuilding
+ * the vector index (`npx rebuild-memory-vector`); even when the dimension
+ * matches, the embedding *spaces* differ, so stale vectors would produce
+ * meaningless similarities until rebuilt.
+ */
+export interface LocalEmbedderOptions {
+    /** HF model id. Default `Xenova/multilingual-e5-small`. */
+    readonly model?: string;
+    /**
+     * Pooling strategy passed to the feature-extraction pipeline. e5 and
+     * MiniLM both use mean pooling; leave as default unless using another model.
+     */
+    readonly pooling?: "mean" | "cls";
+    /**
+     * Instruction prefixes for asymmetric retrieval models. Default = e5's
+     * `query:` / `passage:`. Pass `null` for symmetric models (no prefix).
+     */
+    readonly prefixes?: {
+        readonly query: string;
+        readonly passage: string;
+    } | null;
+}
+/**
+ * Build an {@link EmbedFn} backed by a local transformers pipeline. The
+ * pipeline is created on first invocation and reused for the lifetime of
+ * the returned function (so a `rebuild` over N memories loads the model
+ * once, not N times).
+ */
+export declare function createLocalEmbedder(options?: LocalEmbedderOptions): EmbedFn;
+//# sourceMappingURL=embedder.d.ts.map

package/dist/vector/embedder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedder.d.ts","sourceRoot":"","sources":["../../src/vector/embedder.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAa,MAAM,YAAY,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,WAAW,oBAAoB;IACnC,2DAA2D;IAC3D,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC;IAClC;;;OAGG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE;QAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;CACjF;AAKD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,CAAC,EAAE,oBAAoB,GAAG,OAAO,CA2C3E"}

package/dist/vector/embedder.js

@@ -0,0 +1,47 @@
+const DEFAULT_MODEL = "Xenova/multilingual-e5-small";
+const E5_PREFIXES = { query: "query: ", passage: "passage: " };
+/**
+ * Build an {@link EmbedFn} backed by a local transformers pipeline. The
+ * pipeline is created on first invocation and reused for the lifetime of
+ * the returned function (so a `rebuild` over N memories loads the model
+ * once, not N times).
+ */
+export function createLocalEmbedder(options) {
+    const model = options?.model ?? DEFAULT_MODEL;
+    const pooling = options?.pooling ?? "mean";
+    // undefined → e5 defaults; null → disabled (symmetric models).
+    const prefixes = options?.prefixes === undefined ? E5_PREFIXES : options.prefixes;
+    // Lazily-created, memoized pipeline promise. Typed loosely because the
+    // dependency is optional-at-build-time and resolved at runtime.
+    let pipePromise = null;
+    async function getPipe() {
+        if (pipePromise)
+            return pipePromise;
+        pipePromise = (async () => {
+            // Runtime-resolved specifier: keeps tsc from requiring the module's
+            // types at build time. The package is a runtime dependency.
+            const specifier = "@huggingface/transformers";
+            let mod;
+            try {
+                mod = (await import(specifier));
+            }
+            catch (e) {
+                throw new Error(`createLocalEmbedder: failed to load "@huggingface/transformers". ` +
+                    `It ships as a dependency of @vortex-os/memory-extended; if it is missing, ` +
+                    `run \`npm install\`, or pass your own EmbedFn (e.g. an OpenAI adapter) ` +
+                    `to avoid the local model entirely. Original error: ${e.message}`);
+            }
+            const pipeline = mod.pipeline;
+            const extractor = (await pipeline("feature-extraction", model));
+            return extractor;
+        })();
+        return pipePromise;
+    }
+    return async (text, kind) => {
+        const extractor = await getPipe();
+        const prefix = prefixes ? (kind === "query" ? prefixes.query : prefixes.passage) : "";
+        const output = await extractor(prefix + text, { pooling, normalize: true });
+        return Float32Array.from(output.data);
+    };
+}
+//# sourceMappingURL=embedder.js.map

package/dist/vector/embedder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedder.js","sourceRoot":"","sources":["../../src/vector/embedder.ts"],"names":[],"mappings":"AAkDA,MAAM,aAAa,GAAG,8BAA8B,CAAC;AACrD,MAAM,WAAW,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW,EAAW,CAAC;AAExE;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAA8B;IAChE,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,aAAa,CAAC;IAC9C,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,IAAI,MAAM,CAAC;IAC3C,+DAA+D;IAC/D,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IAElF,uEAAuE;IACvE,gEAAgE;IAChE,IAAI,WAAW,GAA0F,IAAI,CAAC;IAE9G,KAAK,UAAU,OAAO;QACpB,IAAI,WAAW;YAAE,OAAO,WAAW,CAAC;QACpC,WAAW,GAAG,CAAC,KAAK,IAAI,EAAE;YACxB,oEAAoE;YACpE,4DAA4D;YAC5D,MAAM,SAAS,GAAG,2BAA2B,CAAC;YAC9C,IAAI,GAAoE,CAAC;YACzE,IAAI,CAAC;gBACH,GAAG,GAAG,CAAC,MAAM,MAAM,CAAC,SAAS,CAAC,CAAe,CAAC;YAChD,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,MAAM,IAAI,KAAK,CACb,mEAAmE;oBACjE,4EAA4E;oBAC5E,yEAAyE;oBACzE,sDAAuD,CAAW,CAAC,OAAO,EAAE,CAC/E,CAAC;YACJ,CAAC;YACD,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;YAC9B,MAAM,SAAS,GAAG,CAAC,MAAM,QAAQ,CAAC,oBAAoB,EAAE,KAAK,CAAC,CAGrB,CAAC;YAC1C,OAAO,SAAS,CAAC;QACnB,CAAC,CAAC,EAAE,CAAC;QACL,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,OAAO,KAAK,EAAE,IAAY,EAAE,IAAgB,EAAE,EAAE;QAC9C,MAAM,SAAS,GAAG,MAAM,OAAO,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,MAAM,GAAG,IAAI,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5E,OAAO,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC;AACJ,CAAC"}

package/dist/vector/index.d.ts

@@ -0,0 +1,24 @@
+/**
+ * `vector` namespace — semantic similarity over markdown memories
+ * (Phase 11c, 2026-05-29).
+ *
+ * Default stack: host-injected `EmbedFn` (with a bundled local embedder),
+ * brute-force cosine backend, vectors persisted in the shared
+ * `memory.sqlite`. See `./types.ts` for the operator decisions behind each
+ * default and `docs/memory-extended-design.md` §vector for rationale.
+ *
+ * Consumers feature-check `MemoryVectorStore` to confirm the namespace is
+ * present in the installed version.
+ */
+export type { EmbedFn, EmbedKind, EmbedVector, VectorBackend, VectorRebuildResult, VectorRow, VectorSearchHit, VectorSearchOptions, VectorSource, } from "./types.js";
+export { MemoryVectorStore } from "./store.js";
+export type { MemoryVectorStoreOptions } from "./store.js";
+export { BruteForceBackend } from "./backend-brute.js";
+export { createLocalEmbedder } from "./embedder.js";
+export type { LocalEmbedderOptions } from "./embedder.js";
+export { normalize, toFloat32, dot, l2norm } from "./math.js";
+export { segmentByEmbedding } from "./segment.js";
+export type { Segment, SegmentUnit, SegmentOptions } from "./segment.js";
+export { SessionChunkStore, rebuildSessionVectors, buildTurnUnits, sessionChunkId, SESSION_CHUNK_SCHEMA, } from "./session.js";
+export type { SessionChunkRow, SessionRebuildOptions, SessionRebuildResult, } from "./session.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/vector/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/vector/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,YAAY,EACV,OAAO,EACP,SAAS,EACT,WAAW,EACX,aAAa,EACb,mBAAmB,EACnB,SAAS,EACT,eAAe,EACf,mBAAmB,EACnB,YAAY,GACb,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAC/C,YAAY,EAAE,wBAAwB,EAAE,MAAM,YAAY,CAAC;AAC3D,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC;AACpD,YAAY,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AAC1D,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAC9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAClD,YAAY,EAAE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AACzE,OAAO,EACL,iBAAiB,EACjB,qBAAqB,EACrB,cAAc,EACd,cAAc,EACd,oBAAoB,GACrB,MAAM,cAAc,CAAC;AACtB,YAAY,EACV,eAAe,EACf,qBAAqB,EACrB,oBAAoB,GACrB,MAAM,cAAc,CAAC"}

package/dist/vector/index.js

@@ -0,0 +1,7 @@
+export { MemoryVectorStore } from "./store.js";
+export { BruteForceBackend } from "./backend-brute.js";
+export { createLocalEmbedder } from "./embedder.js";
+export { normalize, toFloat32, dot, l2norm } from "./math.js";
+export { segmentByEmbedding } from "./segment.js";
+export { SessionChunkStore, rebuildSessionVectors, buildTurnUnits, sessionChunkId, SESSION_CHUNK_SCHEMA, } from "./session.js";
+//# sourceMappingURL=index.js.map

package/dist/vector/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/vector/index.ts"],"names":[],"mappings":"AAuBA,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAE/C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC;AAEpD,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAC9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAElD,OAAO,EACL,iBAAiB,EACjB,qBAAqB,EACrB,cAAc,EACd,cAAc,EACd,oBAAoB,GACrB,MAAM,cAAc,CAAC"}

package/dist/vector/math.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Vector math helpers — kept dependency-free and tiny.
+ *
+ * Vectors are L2-normalized at store time and at query time, so cosine
+ * similarity reduces to a dot product. Normalizing once on write keeps the
+ * hot search loop to a single multiply-accumulate per dimension.
+ */
+import type { EmbedVector } from "./types.js";
+/** Coerce any accepted embedding form to a Float32Array (copying if needed). */
+export declare function toFloat32(v: EmbedVector): Float32Array;
+/** L2 norm of a vector. */
+export declare function l2norm(v: Float32Array): number;
+/**
+ * Return a unit-length copy. A zero vector is returned unchanged (norm 0
+ * would divide by zero); such a vector scores 0 against everything, which
+ * is the correct "no signal" behavior.
+ */
+export declare function normalize(v: EmbedVector): Float32Array;
+/** Dot product. Assumes equal length (caller guarantees via dim check). */
+export declare function dot(a: Float32Array, b: Float32Array): number;
+//# sourceMappingURL=math.d.ts.map

package/dist/vector/math.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.d.ts","sourceRoot":"","sources":["../../src/vector/math.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,gFAAgF;AAChF,wBAAgB,SAAS,CAAC,CAAC,EAAE,WAAW,GAAG,YAAY,CAEtD;AAED,2BAA2B;AAC3B,wBAAgB,MAAM,CAAC,CAAC,EAAE,YAAY,GAAG,MAAM,CAI9C;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,WAAW,GAAG,YAAY,CAOtD;AAED,2EAA2E;AAC3E,wBAAgB,GAAG,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAI5D"}

package/dist/vector/math.js

@@ -0,0 +1,34 @@
+/** Coerce any accepted embedding form to a Float32Array (copying if needed). */
+export function toFloat32(v) {
+    return v instanceof Float32Array ? v : Float32Array.from(v);
+}
+/** L2 norm of a vector. */
+export function l2norm(v) {
+    let sum = 0;
+    for (let i = 0; i < v.length; i++)
+        sum += v[i] * v[i];
+    return Math.sqrt(sum);
+}
+/**
+ * Return a unit-length copy. A zero vector is returned unchanged (norm 0
+ * would divide by zero); such a vector scores 0 against everything, which
+ * is the correct "no signal" behavior.
+ */
+export function normalize(v) {
+    const f = toFloat32(v);
+    const n = l2norm(f);
+    if (n === 0)
+        return f;
+    const out = new Float32Array(f.length);
+    for (let i = 0; i < f.length; i++)
+        out[i] = f[i] / n;
+    return out;
+}
+/** Dot product. Assumes equal length (caller guarantees via dim check). */
+export function dot(a, b) {
+    let sum = 0;
+    for (let i = 0; i < a.length; i++)
+        sum += a[i] * b[i];
+    return sum;
+}
+//# sourceMappingURL=math.js.map

package/dist/vector/math.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.js","sourceRoot":"","sources":["../../src/vector/math.ts"],"names":[],"mappings":"AASA,gFAAgF;AAChF,MAAM,UAAU,SAAS,CAAC,CAAc;IACtC,OAAO,CAAC,YAAY,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,2BAA2B;AAC3B,MAAM,UAAU,MAAM,CAAC,CAAe;IACpC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACxD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,CAAc;IACtC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC;IACtD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,GAAG,CAAC,CAAe,EAAE,CAAe;IAClD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACxD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/vector/schema.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Vector table — lives in the *same* `memory.sqlite` as the `sqlite`
+ * namespace (operator decision 3 / 2026-05-29). No `sqlite-vec` extension:
+ * the vector is stored as a raw Float32 BLOB and similarity is computed in
+ * JS by {@link BruteForceBackend}. Keeping it in one DB means one rebuild
+ * path and one file to delete when regenerating derived indexes.
+ *
+ * Composite primary key `(id, source)` lets the same id exist once per
+ * corpus — a memory and a session-archive entry can both key on the same
+ * stem without colliding. `dim` is stored so a search can refuse to
+ * compare vectors produced by a different embedding model.
+ */
+export declare const VECTOR_SCHEMA = "\nCREATE TABLE IF NOT EXISTS memory_vectors (\n  id TEXT NOT NULL,\n  source TEXT NOT NULL DEFAULT 'memory',\n  dim INTEGER NOT NULL,\n  vector BLOB NOT NULL,\n  PRIMARY KEY (id, source)\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_vectors_source ON memory_vectors(source);\n";
+//# sourceMappingURL=schema.d.ts.map

package/dist/vector/schema.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../../src/vector/schema.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,aAAa,wRAUzB,CAAC"}

package/dist/vector/schema.js

@@ -0,0 +1,24 @@
+/**
+ * Vector table — lives in the *same* `memory.sqlite` as the `sqlite`
+ * namespace (operator decision 3 / 2026-05-29). No `sqlite-vec` extension:
+ * the vector is stored as a raw Float32 BLOB and similarity is computed in
+ * JS by {@link BruteForceBackend}. Keeping it in one DB means one rebuild
+ * path and one file to delete when regenerating derived indexes.
+ *
+ * Composite primary key `(id, source)` lets the same id exist once per
+ * corpus — a memory and a session-archive entry can both key on the same
+ * stem without colliding. `dim` is stored so a search can refuse to
+ * compare vectors produced by a different embedding model.
+ */
+export const VECTOR_SCHEMA = `
+CREATE TABLE IF NOT EXISTS memory_vectors (
+  id TEXT NOT NULL,
+  source TEXT NOT NULL DEFAULT 'memory',
+  dim INTEGER NOT NULL,
+  vector BLOB NOT NULL,
+  PRIMARY KEY (id, source)
+);
+
+CREATE INDEX IF NOT EXISTS idx_memory_vectors_source ON memory_vectors(source);
+`;
+//# sourceMappingURL=schema.js.map

package/dist/vector/schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../../src/vector/schema.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG;;;;;;;;;;CAU5B,CAAC"}

package/dist/vector/segment.d.ts

@@ -0,0 +1,65 @@
+import type { EmbedFn } from "./types.js";
+/**
+ * Embedding-similarity topic segmentation (Phase 11c follow-up, 2026-05-29).
+ *
+ * Splits an ordered list of turns into topic-coherent chunks by watching
+ * where the conversation's *meaning* shifts. Each turn is embedded once; a
+ * running centroid tracks "the current topic so far"; when a new turn's
+ * cosine similarity to that centroid drops below `threshold` (and the chunk
+ * already has at least `minUnits` turns), a boundary is cut. Min/max guards
+ * keep chunks from being a single "응" or growing unbounded.
+ *
+ * Boundary detection uses the per-turn embeddings (running centroid). The
+ * stored chunk vector, however, is a fresh embedding of the chunk's *joined
+ * text*, not the mean of its turn vectors: averaging turn vectors dilutes a
+ * chunk that spans two related sub-topics (a query for one sub-topic then
+ * loses to the averaged direction — observed in a 2026-05-29 smoke). One
+ * extra embedding per chunk; chunks are few. This is offline indexing work,
+ * not per-query.
+ *
+ * Why similarity, not time gaps: continuous multi-topic sessions (the
+ * operator's pattern — module A → module B back-to-back with no pause) have
+ * no time gap at the topic seam; only the meaning shifts. Time-gap
+ * heuristics miss those; embedding similarity catches them.
+ */
+/** One input turn to segment. */
+export interface SegmentUnit {
+    /** Text of the turn (user + assistant concatenated, tool noise stripped). */
+    readonly text: string;
+    /** Timestamp of the turn, if known (for chunk start/end bookkeeping). */
+    readonly at: string | null;
+}
+/** One output chunk. */
+export interface Segment {
+    /** Index of the first unit (inclusive) in the input array. */
+    readonly unitStart: number;
+    /** Index of the last unit (inclusive). */
+    readonly unitEnd: number;
+    /** Concatenated text of the chunk's turns. */
+    readonly text: string;
+    /** Chunk vector — normalized mean of the member turns' vectors. */
+    readonly vector: Float32Array;
+    readonly startedAt: string | null;
+    readonly endedAt: string | null;
+}
+export interface SegmentOptions {
+    /**
+     * Cosine-to-centroid below which a new turn is treated as a topic shift.
+     * Lower = fewer, larger chunks; higher = more, smaller chunks. Default
+     * 0.45 — a starting point to tune against real data.
+     */
+    readonly threshold?: number;
+    /** Minimum turns before a boundary may be cut. Default 2. */
+    readonly minUnits?: number;
+    /** Hard cap on turns per chunk (forces a cut regardless of similarity). Default 12. */
+    readonly maxUnits?: number;
+    /** Hard cap on characters per chunk. Default 4000. */
+    readonly maxChars?: number;
+}
+/**
+ * Segment `units` into topic chunks. Empty-text units are dropped first.
+ * Returns at least one chunk when any non-empty unit exists; an empty input
+ * yields an empty array.
+ */
+export declare function segmentByEmbedding(units: readonly SegmentUnit[], embed: EmbedFn, options?: SegmentOptions): Promise<readonly Segment[]>;
+//# sourceMappingURL=segment.d.ts.map

package/dist/vector/segment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"segment.d.ts","sourceRoot":"","sources":["../../src/vector/segment.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAE1C;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,iCAAiC;AACjC,MAAM,WAAW,WAAW;IAC1B,6EAA6E;IAC7E,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,yEAAyE;IACzE,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;CAC5B;AAED,wBAAwB;AACxB,MAAM,WAAW,OAAO;IACtB,8DAA8D;IAC9D,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,0CAA0C;IAC1C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,8CAA8C;IAC9C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mEAAmE;IACnE,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;CACjC;AAED,MAAM,WAAW,cAAc;IAC7B;;;;OAIG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,6DAA6D;IAC7D,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,uFAAuF;IACvF,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,sDAAsD;IACtD,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAID;;;;GAIG;AACH,wBAAsB,kBAAkB,CACtC,KAAK,EAAE,SAAS,WAAW,EAAE,EAC7B,KAAK,EAAE,OAAO,EACd,OAAO,CAAC,EAAE,cAAc,GACvB,OAAO,CAAC,SAAS,OAAO,EAAE,CAAC,CAsE7B"}

package/dist/vector/segment.js

@@ -0,0 +1,72 @@
+import { dot, normalize } from "./math.js";
+const DEFAULTS = { threshold: 0.45, minUnits: 2, maxUnits: 12, maxChars: 4000 };
+/**
+ * Segment `units` into topic chunks. Empty-text units are dropped first.
+ * Returns at least one chunk when any non-empty unit exists; an empty input
+ * yields an empty array.
+ */
+export async function segmentByEmbedding(units, embed, options) {
+    const opts = { ...DEFAULTS, ...options };
+    const live = units.filter((u) => u.text.trim().length > 0);
+    if (live.length === 0)
+        return [];
+    const vectors = [];
+    for (const u of live)
+        vectors.push(normalize(await embed(u.text)));
+    const raw = [];
+    let start = 0;
+    let centroidSum = new Float64Array(vectors[0].length);
+    let count = 0;
+    let chars = 0;
+    const addToCentroid = (v) => {
+        for (let i = 0; i < v.length; i++)
+            centroidSum[i] += v[i];
+        count++;
+    };
+    const centroidUnit = () => {
+        const mean = new Float32Array(centroidSum.length);
+        for (let i = 0; i < centroidSum.length; i++)
+            mean[i] = centroidSum[i] / count;
+        return normalize(mean);
+    };
+    const flush = (endExclusive) => {
+        const end = endExclusive - 1;
+        raw.push({
+            unitStart: start,
+            unitEnd: end,
+            text: live.slice(start, endExclusive).map((u) => u.text).join("\n\n"),
+            startedAt: live[start].at,
+            endedAt: live[end].at,
+        });
+    };
+    const reset = (from) => {
+        start = from;
+        centroidSum = new Float64Array(vectors[0].length);
+        count = 0;
+        chars = 0;
+    };
+    for (let i = 0; i < live.length; i++) {
+        const v = vectors[i];
+        const unitChars = live[i].text.length;
+        if (count > 0) {
+            const sim = dot(v, centroidUnit());
+            const topicShift = sim < opts.threshold && count >= opts.minUnits;
+            const tooBig = count >= opts.maxUnits || chars + unitChars > opts.maxChars;
+            if (topicShift || tooBig) {
+                flush(i);
+                reset(i);
+            }
+        }
+        addToCentroid(v);
+        chars += unitChars;
+    }
+    flush(live.length);
+    // Stored chunk vector = a fresh embedding of the chunk's joined text
+    // (not the diluted mean of turn vectors). One embed per chunk.
+    const segments = [];
+    for (const r of raw) {
+        segments.push({ ...r, vector: normalize(await embed(r.text)) });
+    }
+    return segments;
+}
+//# sourceMappingURL=segment.js.map

package/dist/vector/segment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"segment.js","sourceRoot":"","sources":["../../src/vector/segment.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAgE3C,MAAM,QAAQ,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAEhF;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,KAA6B,EAC7B,KAAc,EACd,OAAwB;IAExB,MAAM,IAAI,GAAG,EAAE,GAAG,QAAQ,EAAE,GAAG,OAAO,EAAE,CAAC;IACzC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEjC,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEnE,MAAM,GAAG,GAMJ,EAAE,CAAC;IACR,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,WAAW,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC;IACvD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,MAAM,aAAa,GAAG,CAAC,CAAe,EAAE,EAAE;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC;QAC3D,KAAK,EAAE,CAAC;IACV,CAAC,CAAC;IACF,MAAM,YAAY,GAAG,GAAiB,EAAE;QACtC,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC;QAC/E,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,YAAoB,EAAE,EAAE;QACrC,MAAM,GAAG,GAAG,YAAY,GAAG,CAAC,CAAC;QAC7B,GAAG,CAAC,IAAI,CAAC;YACP,SAAS,EAAE,KAAK;YAChB,OAAO,EAAE,GAAG;YACZ,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YACrE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAE,CAAC,EAAE;YAC1B,OAAO,EAAE,IAAI,CAAC,GAAG,CAAE,CAAC,EAAE;SACvB,CAAC,CAAC;IACL,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,EAAE;QAC7B,KAAK,GAAG,IAAI,CAAC;QACb,WAAW,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC;QACnD,KAAK,GAAG,CAAC,CAAC;QACV,KAAK,GAAG,CAAC,CAAC;IACZ,CAAC,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACtB,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC;QACvC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC;YACnC,MAAM,UAAU,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC;YAClE,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC3E,IAAI,UAAU,IAAI,MAAM,EAAE,CAAC;gBACzB,KAAK,CAAC,CAAC,CAAC,CAAC;gBACT,KAAK,CAAC,CAAC,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QACD,aAAa,CAAC,CAAC,CAAC,CAAC;QACjB,KAAK,IAAI,SAAS,CAAC;IACrB,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEnB,qEAAqE;IACrE,+DAA+D;IAC/D,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;IAClE,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}