@kgdiff/core 0.0.0-stage → 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 iiwish and kgdiff contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -1,3 +1,70 @@
-# Temporary Holding Version
+# @kgdiff/core
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+The semantic diff engine behind [kgdiff](../../README.md). It matches nodes across two versions
+of a knowledge graph, classifies what changed (rename, rekey, merge, split, hierarchy move,
+retarget, …), groups the changes into reviewable hunks and emits an invertible delta.
+Deterministic, zero dependencies, and it runs unchanged in browsers, Node, Deno, Bun and workers.
+
+## Install
+
+```sh
+pnpm add @kgdiff/core
+```
+
+ESM only. Node.js ≥ 22 or any evergreen browser.
+
+## Quick start
+
+```ts
+import { applyDelta, diff, formatHunk, hashGraph, invertDelta } from '@kgdiff/core';
+
+const v1 = {
+  nodes: [
+    { id: 'org', label: 'Organization' },
+    { id: 'company', label: 'Company' },
+    { id: 'ngo', label: 'NGO' },
+  ],
+  edges: [
+    { source: 'company', target: 'org', predicate: 'subClassOf' },
+    { source: 'ngo', target: 'org', predicate: 'subClassOf' },
+  ],
+};
+const v2 = {
+  nodes: [
+    { id: 'org', label: 'Organisation' },
+    { id: 'company', label: 'Company' },
+    { id: 'startup', label: 'Startup' },
+  ],
+  edges: [
+    { source: 'company', target: 'org', predicate: 'subClassOf' },
+    { source: 'startup', target: 'company', predicate: 'subClassOf' },
+  ],
+};
+
+const result = diff(v1, v2);
+for (const hunk of result.hunks) console.log(formatHunk(hunk, result).title);
+// Removed “NGO” and 1 relation
+// Renamed “Organization” → “Organisation”
+// Added “Startup” and 1 relation
+
+result.stats.nodes; // { added: 1, removed: 1, modified: 1, unchanged: 1 }
+
+// The delta is invertible: undoing it gives the first version back.
+const undone = applyDelta(result.after, invertDelta(result.delta));
+hashGraph(undone) === hashGraph(result.before); // true
+```
+
+- Graph files (RDF, OBO, JSON graph formats): parse them with [`@kgdiff/formats`](../formats).
+- Ids that mean nothing across versions, such as two LLM extraction runs: match by label and
+  neighbourhood with `diff(a, b, { match: { strategy: 'similarity' } })`.
+- `formatHunk(hunk, result, 'zh-CN')` gives Chinese titles.
+
+## Learn more
+
+- [Algorithms](../../docs/algorithms.md): normalization, matching, classification, hunks, delta.
+- [Delta format](../../docs/delta-format.md): the JSON patch format and its guarantees.
+- [Architecture](../../docs/architecture.md): how the kgdiff packages fit together.
+
+## License
+
+[MIT](../../LICENSE)

package/dist/canonical.d.ts

@@ -0,0 +1,73 @@
+/**
+ * Canonical values: key-order-insensitive equality, canonical JSON, structural edge
+ * keys and the cyrb53 hash. Everything here is allocation-conscious because it sits
+ * on the hot path of `normalize` and `diff`.
+ */
+import type { Attrs, AttrValue } from './types.js';
+/** `JSON.stringify(s)` for a string, with a fast path for the common case. */
+export declare function jsonString(s: string): string;
+/**
+ * Structural edge key: exactly `JSON.stringify([source, predicate, target])`
+ * (docs/algorithms.md §1), built without the intermediate array.
+ */
+export declare function tripleKey(source: string, predicate: string, target: string): string;
+/** True when a structural key carries a parallel-edge suffix (`#2`, `#3`…). */
+export declare function hasParallelSuffix(key: string): boolean;
+/**
+ * Splits a structural key into its triple part and its parallel-edge suffix (`#2`, `#3`…).
+ * Structural keys always end with `]` before the suffix, so the last `#` after the last
+ * `]` starts the suffix.
+ */
+export declare function splitStructuralKey(key: string): {
+    readonly base: string;
+    readonly suffix: string;
+};
+/** Deep, key-order-insensitive equality of JSON values (canonical JSON equality). */
+export declare function attrValueEquals(a: AttrValue | undefined, b: AttrValue | undefined): boolean;
+/** A new, empty attribute map. Write it with `setAttr`. */
+export declare function emptyAttrMap(): Record<string, AttrValue>;
+/** Sets an own data property — also for the key `__proto__`, which `=` would not create. */
+export declare function setAttr(attrs: Record<string, AttrValue>, key: string, value: AttrValue): void;
+/** The own value of `key`, or undefined — never an inherited member such as `constructor`. */
+export declare function ownAttr(attrs: Attrs, key: string): AttrValue | undefined;
+/**
+ * Equality of two attribute maps, ignoring key order, keys whose value is `undefined`
+ * and the keys in `ignore`.
+ */
+export declare function attrsEqual(a: Attrs, b: Attrs, ignore?: ReadonlySet<string>): boolean;
+/** Sorted own keys of an attribute map whose value is defined. */
+export declare function attrKeys(attrs: Attrs): string[];
+/** True when the map has no defined value. */
+export declare function isEmptyAttrs(attrs: Attrs): boolean;
+/** Deep copy with object keys sorted and `undefined` members dropped. */
+export declare function canonicalize(value: AttrValue): AttrValue;
+/** `canonicalize` for an attribute map (`__proto__` stays an own key). */
+export declare function canonicalAttrs(attrs: Attrs): Attrs;
+/** Canonical JSON of a JSON value: object keys sorted, arrays in order. */
+export declare function canonicalJSON(value: AttrValue): string;
+/**
+ * Streaming cyrb53 (bryc, public domain): a fast, well-mixed, non-cryptographic 53-bit
+ * hash over UTF-16 code units. Feeding strings one after another hashes their
+ * concatenation, so nothing has to be built in memory.
+ */
+export declare class Cyrb53 {
+    private readonly seed;
+    private h1;
+    private h2;
+    constructor(seed?: number);
+    reset(): this;
+    /** Feeds one UTF-16 code unit (used for unambiguous framing such as lengths and tags). */
+    code(unit: number): this;
+    update(text: string): this;
+    /** Length-prefixed string: makes a sequence of strings injective. */
+    string(text: string): this;
+    /** Tagged, length-prefixed, key-sorted encoding of a JSON value. */
+    value(value: AttrValue | undefined): this;
+    /** Both finalized 32-bit halves (64 bits of state) without resetting. */
+    digestPair(): [number, number];
+    /** The 53-bit cyrb53 digest. */
+    digest(): number;
+}
+/** One-shot cyrb53 of a string. */
+export declare function cyrb53(text: string, seed?: number): number;
+//# sourceMappingURL=canonical.d.ts.map

package/dist/canonical.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonical.d.ts","sourceRoot":"","sources":["../src/canonical.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAanD,8EAA8E;AAC9E,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAE5C;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAEnF;AAED,+EAA+E;AAC/E,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAEtD;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG;IAC/C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB,CAIA;AAQD,qFAAqF;AACrF,wBAAgB,eAAe,CAAC,CAAC,EAAE,SAAS,GAAG,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,OAAO,CAa3F;AAOD,2DAA2D;AAC3D,wBAAgB,YAAY,IAAI,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAExD;AAED,4FAA4F;AAC5F,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,GAAG,IAAI,CAW7F;AAED,8FAA8F;AAC9F,wBAAgB,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAExE;AAOD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,OAAO,CAcpF;AAED,kEAAkE;AAClE,wBAAgB,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,CAE/C;AAED,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAGlD;AAED,yEAAyE;AACzE,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS,CAIxD;AAED,0EAA0E;AAC1E,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAIlD;AAED,2EAA2E;AAC3E,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CAEtD;AAID;;;;GAIG;AACH,qBAAa,MAAM;IAIL,OAAO,CAAC,QAAQ,CAAC,IAAI;IAHjC,OAAO,CAAC,EAAE,CAAK;IACf,OAAO,CAAC,EAAE,CAAK;IAEf,YAA6B,IAAI,SAAI,EAEpC;IAED,KAAK,IAAI,IAAI,CAIZ;IAED,0FAA0F;IAC1F,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAIvB;IAED,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAWzB;IAED,qEAAqE;IACrE,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAIzB;IAED,oEAAoE;IACpE,KAAK,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS,GAAG,IAAI,CAgCxC;IAED,yEAAyE;IACzE,UAAU,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAQ7B;IAED,gCAAgC;IAChC,MAAM,IAAI,MAAM,CAGf;CACF;AAED,mCAAmC;AACnC,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,SAAI,GAAG,MAAM,CAErD"}

package/dist/canonical.js

@@ -0,0 +1,246 @@
+// ─── JSON strings and structural keys ────────────────────────────────────────
+/** True when `JSON.stringify(s)` would escape something (quotes, backslash, control, surrogates). */
+function needsEscape(s) {
+    for (let i = 0; i < s.length; i++) {
+        const c = s.charCodeAt(i);
+        if (c < 0x20 || c === 0x22 || c === 0x5c || (c >= 0xd800 && c <= 0xdfff))
+            return true;
+    }
+    return false;
+}
+/** `JSON.stringify(s)` for a string, with a fast path for the common case. */
+export function jsonString(s) {
+    return needsEscape(s) ? JSON.stringify(s) : `"${s}"`;
+}
+/**
+ * Structural edge key: exactly `JSON.stringify([source, predicate, target])`
+ * (docs/algorithms.md §1), built without the intermediate array.
+ */
+export function tripleKey(source, predicate, target) {
+    return `[${jsonString(source)},${jsonString(predicate)},${jsonString(target)}]`;
+}
+/** True when a structural key carries a parallel-edge suffix (`#2`, `#3`…). */
+export function hasParallelSuffix(key) {
+    return key.charCodeAt(key.length - 1) !== 0x5d;
+}
+/**
+ * Splits a structural key into its triple part and its parallel-edge suffix (`#2`, `#3`…).
+ * Structural keys always end with `]` before the suffix, so the last `#` after the last
+ * `]` starts the suffix.
+ */
+export function splitStructuralKey(key) {
+    if (key.charCodeAt(key.length - 1) === 0x5d)
+        return { base: key, suffix: '' };
+    const at = key.lastIndexOf('#');
+    return at < 0 ? { base: key, suffix: '' } : { base: key.slice(0, at), suffix: key.slice(at) };
+}
+// ─── Attribute values ────────────────────────────────────────────────────────
+function isArrayValue(value) {
+    return Array.isArray(value);
+}
+/** Deep, key-order-insensitive equality of JSON values (canonical JSON equality). */
+export function attrValueEquals(a, b) {
+    if (a === b)
+        return true;
+    if (a === undefined || b === undefined || a === null || b === null)
+        return false;
+    if (typeof a !== 'object' || typeof b !== 'object') {
+        return typeof a === 'number' && typeof b === 'number' && Number.isNaN(a) && Number.isNaN(b);
+    }
+    if (isArrayValue(a)) {
+        if (!isArrayValue(b) || a.length !== b.length)
+            return false;
+        for (let i = 0; i < a.length; i++)
+            if (!attrValueEquals(a[i], b[i]))
+                return false;
+        return true;
+    }
+    if (isArrayValue(b))
+        return false;
+    return attrsEqual(a, b);
+}
+// Attribute maps come from user data: keys such as `__proto__` or `constructor` are ordinary
+// data. Maps are written through `setAttr` (so `__proto__` becomes an own key, never the
+// prototype) and every read goes through `ownAttr` (so inherited members are never mistaken
+// for data). Plain objects are kept rather than null-prototype ones, which V8 stores slowly.
+/** A new, empty attribute map. Write it with `setAttr`. */
+export function emptyAttrMap() {
+    return {};
+}
+/** Sets an own data property — also for the key `__proto__`, which `=` would not create. */
+export function setAttr(attrs, key, value) {
+    if (key === '__proto__') {
+        Object.defineProperty(attrs, key, {
+            value,
+            enumerable: true,
+            writable: true,
+            configurable: true,
+        });
+    }
+    else {
+        attrs[key] = value;
+    }
+}
+/** The own value of `key`, or undefined — never an inherited member such as `constructor`. */
+export function ownAttr(attrs, key) {
+    return Object.hasOwn(attrs, key) ? attrs[key] : undefined;
+}
+/** Own keys whose value is defined. */
+function definedKeys(attrs) {
+    return Object.keys(attrs).filter((key) => attrs[key] !== undefined);
+}
+/**
+ * Equality of two attribute maps, ignoring key order, keys whose value is `undefined`
+ * and the keys in `ignore`.
+ */
+export function attrsEqual(a, b, ignore) {
+    if (a === b)
+        return true;
+    let countA = 0;
+    for (const key of Object.keys(a)) {
+        const value = a[key];
+        if (value === undefined || ignore?.has(key))
+            continue;
+        countA++;
+        if (!attrValueEquals(value, ownAttr(b, key)))
+            return false;
+    }
+    let countB = 0;
+    for (const key of Object.keys(b)) {
+        if (b[key] !== undefined && !ignore?.has(key))
+            countB++;
+    }
+    return countA === countB;
+}
+/** Sorted own keys of an attribute map whose value is defined. */
+export function attrKeys(attrs) {
+    return definedKeys(attrs).sort();
+}
+/** True when the map has no defined value. */
+export function isEmptyAttrs(attrs) {
+    for (const key of Object.keys(attrs))
+        if (attrs[key] !== undefined)
+            return false;
+    return true;
+}
+/** Deep copy with object keys sorted and `undefined` members dropped. */
+export function canonicalize(value) {
+    if (value === null || typeof value !== 'object')
+        return value;
+    if (isArrayValue(value))
+        return value.map(canonicalize);
+    return canonicalAttrs(value);
+}
+/** `canonicalize` for an attribute map (`__proto__` stays an own key). */
+export function canonicalAttrs(attrs) {
+    const out = emptyAttrMap();
+    for (const key of attrKeys(attrs))
+        setAttr(out, key, canonicalize(attrs[key]));
+    return out;
+}
+/** Canonical JSON of a JSON value: object keys sorted, arrays in order. */
+export function canonicalJSON(value) {
+    return JSON.stringify(canonicalize(value));
+}
+// ─── cyrb53 ──────────────────────────────────────────────────────────────────
+/**
+ * Streaming cyrb53 (bryc, public domain): a fast, well-mixed, non-cryptographic 53-bit
+ * hash over UTF-16 code units. Feeding strings one after another hashes their
+ * concatenation, so nothing has to be built in memory.
+ */
+export class Cyrb53 {
+    seed;
+    h1 = 0;
+    h2 = 0;
+    constructor(seed = 0) {
+        this.seed = seed;
+        this.reset();
+    }
+    reset() {
+        this.h1 = 0xdeadbeef ^ this.seed;
+        this.h2 = 0x41c6ce57 ^ this.seed;
+        return this;
+    }
+    /** Feeds one UTF-16 code unit (used for unambiguous framing such as lengths and tags). */
+    code(unit) {
+        this.h1 = Math.imul(this.h1 ^ unit, 2654435761);
+        this.h2 = Math.imul(this.h2 ^ unit, 1597334677);
+        return this;
+    }
+    update(text) {
+        let h1 = this.h1;
+        let h2 = this.h2;
+        for (let i = 0; i < text.length; i++) {
+            const unit = text.charCodeAt(i);
+            h1 = Math.imul(h1 ^ unit, 2654435761);
+            h2 = Math.imul(h2 ^ unit, 1597334677);
+        }
+        this.h1 = h1;
+        this.h2 = h2;
+        return this;
+    }
+    /** Length-prefixed string: makes a sequence of strings injective. */
+    string(text) {
+        return this.code(text.length & 0xffff)
+            .code(text.length >>> 16)
+            .update(text);
+    }
+    /** Tagged, length-prefixed, key-sorted encoding of a JSON value. */
+    value(value) {
+        if (value === undefined)
+            return this.code(0x75); // u
+        if (value === null)
+            return this.code(0x6e); // n
+        switch (typeof value) {
+            case 'boolean':
+                return this.code(value ? 0x74 : 0x66); // t / f
+            case 'number':
+                return this.code(0x64).string(String(value)); // d
+            case 'string':
+                return this.code(0x73).string(value); // s
+            default:
+                break;
+        }
+        if (isArrayValue(value)) {
+            this.code(0x61)
+                .code(value.length & 0xffff)
+                .code(value.length >>> 16); // a
+            for (const item of value)
+                this.value(item);
+            return this;
+        }
+        const own = Object.keys(value);
+        // Common cases first: no attributes, or one — no filtering or sorting needed.
+        if (own.length === 0)
+            return this.code(0x6f).code(0).code(0);
+        const keys = own.length === 1 && value[own[0]] !== undefined
+            ? own
+            : attrKeys(value);
+        this.code(0x6f)
+            .code(keys.length & 0xffff)
+            .code(keys.length >>> 16); // o
+        for (const key of keys)
+            this.string(key).value(value[key]);
+        return this;
+    }
+    /** Both finalized 32-bit halves (64 bits of state) without resetting. */
+    digestPair() {
+        let h1 = this.h1;
+        let h2 = this.h2;
+        h1 = Math.imul(h1 ^ (h1 >>> 16), 2246822507);
+        h1 ^= Math.imul(h2 ^ (h2 >>> 13), 3266489909);
+        h2 = Math.imul(h2 ^ (h2 >>> 16), 2246822507);
+        h2 ^= Math.imul(h1 ^ (h1 >>> 13), 3266489909);
+        return [h1 >>> 0, h2 >>> 0];
+    }
+    /** The 53-bit cyrb53 digest. */
+    digest() {
+        const [h1, h2] = this.digestPair();
+        return 4294967296 * (2097151 & h2) + h1;
+    }
+}
+/** One-shot cyrb53 of a string. */
+export function cyrb53(text, seed = 0) {
+    return new Cyrb53(seed).update(text).digest();
+}
+//# sourceMappingURL=canonical.js.map

package/dist/canonical.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonical.js","sourceRoot":"","sources":["../src/canonical.ts"],"names":[],"mappings":"AAOA,gFAAgF;AAEhF,qGAAqG;AACrG,SAAS,WAAW,CAAC,CAAS;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;IACxF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,UAAU,CAAC,CAAS;IAClC,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;AACvD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,MAAc,EAAE,SAAiB,EAAE,MAAc;IACzE,OAAO,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC;AAClF,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,iBAAiB,CAAC,GAAW;IAC3C,OAAO,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC;AACjD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAW;IAI5C,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI;QAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAC9E,MAAM,EAAE,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAChC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;AAChG,CAAC;AAED,gFAAgF;AAEhF,SAAS,YAAY,CAAC,KAAgB;IACpC,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,eAAe,CAAC,CAAwB,EAAE,CAAwB;IAChF,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IACjF,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QACnD,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACpB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAClF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,YAAY,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IAClC,OAAO,UAAU,CAAC,CAAU,EAAE,CAAU,CAAC,CAAC;AAC5C,CAAC;AAED,6FAA6F;AAC7F,yFAAyF;AACzF,4FAA4F;AAC5F,6FAA6F;AAE7F,2DAA2D;AAC3D,MAAM,UAAU,YAAY;IAC1B,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,OAAO,CAAC,KAAgC,EAAE,GAAW,EAAE,KAAgB;IACrF,IAAI,GAAG,KAAK,WAAW,EAAE,CAAC;QACxB,MAAM,CAAC,cAAc,CAAC,KAAK,EAAE,GAAG,EAAE;YAChC,KAAK;YACL,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,IAAI;YACd,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACrB,CAAC;AACH,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,OAAO,CAAC,KAAY,EAAE,GAAW;IAC/C,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5D,CAAC;AAED,uCAAuC;AACvC,SAAS,WAAW,CAAC,KAAY;IAC/B,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC;AACtE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,CAAQ,EAAE,CAAQ,EAAE,MAA4B;IACzE,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACrB,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACtD,MAAM,EAAE,CAAC;QACT,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC7D,CAAC;IACD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC;YAAE,MAAM,EAAE,CAAC;IAC1D,CAAC;IACD,OAAO,MAAM,KAAK,MAAM,CAAC;AAC3B,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,QAAQ,CAAC,KAAY;IACnC,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;AACnC,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,YAAY,CAAC,KAAY;IACvC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACjF,OAAO,IAAI,CAAC;AACd,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,YAAY,CAAC,KAAgB;IAC3C,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,IAAI,YAAY,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IACxD,OAAO,cAAc,CAAC,KAAc,CAAC,CAAC;AACxC,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,cAAc,CAAC,KAAY;IACzC,MAAM,GAAG,GAAG,YAAY,EAAE,CAAC;IAC3B,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,YAAY,CAAC,KAAK,CAAC,GAAG,CAAc,CAAC,CAAC,CAAC;IAC5F,OAAO,GAAG,CAAC;AACb,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,aAAa,CAAC,KAAgB;IAC5C,OAAO,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED,gFAAgF;AAEhF;;;;GAIG;AACH,MAAM,OAAO,MAAM;IAIY,IAAI;IAHzB,EAAE,GAAG,CAAC,CAAC;IACP,EAAE,GAAG,CAAC,CAAC;IAEf,YAA6B,IAAI,GAAG,CAAC;oBAAR,IAAI;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,KAAK;QACH,IAAI,CAAC,EAAE,GAAG,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC;QACjC,IAAI,CAAC,EAAE,GAAG,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,0FAA0F;IAC1F,IAAI,CAAC,IAAY;QACf,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,IAAY;QACjB,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC;YACtC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC;QACxC,CAAC;QACD,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IAED,qEAAqE;IACrE,MAAM,CAAC,IAAY;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;aACnC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC;aACxB,MAAM,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IAED,oEAAoE;IACpE,KAAK,CAAC,KAA4B;QAChC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;QACrD,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;QAChD,QAAQ,OAAO,KAAK,EAAE,CAAC;YACrB,KAAK,SAAS;gBACZ,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ;YACjD,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI;YACpD,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI;YAC5C;gBACE,MAAM;QACV,CAAC;QACD,IAAI,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;iBACZ,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;iBAC3B,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI;YAClC,KAAK,MAAM,IAAI,IAAI,KAAK;gBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,8EAA8E;QAC9E,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,IAAI,GACR,GAAG,CAAC,MAAM,KAAK,CAAC,IAAK,KAAe,CAAC,GAAG,CAAC,CAAC,CAAW,CAAC,KAAK,SAAS;YAClE,CAAC,CAAC,GAAG;YACL,CAAC,CAAC,QAAQ,CAAC,KAAc,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;aACZ,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;aAC1B,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI;QACjC,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAE,KAAe,CAAC,GAAG,CAAC,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yEAAyE;IACzE,UAAU;QACR,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QAC7C,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QAC9C,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QAC7C,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QAC9C,OAAO,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,gCAAgC;IAChC,MAAM;QACJ,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QACnC,OAAO,UAAU,GAAG,CAAC,OAAO,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IAC1C,CAAC;CACF;AAED,mCAAmC;AACnC,MAAM,UAAU,MAAM,CAAC,IAAY,EAAE,IAAI,GAAG,CAAC;IAC3C,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;AAChD,CAAC"}

package/dist/classify.d.ts

@@ -0,0 +1,19 @@
+import type { NodeRecord, PipelineContext, RestructureIndex } from './model.js';
+import type { AttrChange, Attrs, Id, KGraph, UnionId } from './types.js';
+/**
+ * Union ids of before-version nodes that differ from their own id: matched nodes take the
+ * after id; unmatched nodes keep their id unless an after node already uses it, in which case
+ * `@before` is appended (repeatedly, in the pathological case that the result is taken too).
+ */
+export declare function assignUnionIds(before: KGraph, after: KGraph, beforeToAfter: ReadonlyMap<Id, Id>): Map<Id, UnionId>;
+/** Attribute changes sorted by key, `ignore`d keys skipped, values canonicalized. */
+export declare function attrChanges(before: Attrs, after: Attrs, ignore: ReadonlySet<string>): AttrChange[];
+/**
+ * Builds one record per union node, sorted by union id, plus the restructure index the
+ * edge stage needs. A matched node is `modified` exactly when it has a facet.
+ */
+export declare function classifyNodes(ctx: PipelineContext): {
+    readonly nodes: NodeRecord[];
+    readonly index: RestructureIndex;
+};
+//# sourceMappingURL=classify.d.ts.map

package/dist/classify.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classify.d.ts","sourceRoot":"","sources":["../src/classify.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,UAAU,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAEhF,OAAO,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,EAAE,EAAU,MAAM,EAAa,OAAO,EAAE,MAAM,YAAY,CAAC;AAG5F;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,aAAa,EAAE,WAAW,CAAC,EAAE,EAAE,EAAE,CAAC,GACjC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAsBlB;AAED,qFAAqF;AACrF,wBAAgB,WAAW,CACzB,MAAM,EAAE,KAAK,EACb,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,GAC1B,UAAU,EAAE,CAcd;AA8ID;;;GAGG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,eAAe,GAAG;IACnD,QAAQ,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC;IAC7B,QAAQ,CAAC,KAAK,EAAE,gBAAgB,CAAC;CAClC,CAkEA"}