@oml/owl 0.19.3 → 0.20.1

package/out/owl/owl-store-lean.js

@@ -0,0 +1,445 @@
+// Copyright (c) 2026 Modelware. All rights reserved.
+// Memory-lean reasoning store (the default OwlStore implementation).
+//
+// Rationale: the n3 Store builds full S/P/O/G index Maps + Quad/Term object wrappers over every
+// quad (~1.3 KB/quad → ~1 GB on mass-props). The reasoners don't need general SPARQL indexing of
+// the canonical store (oxigraph owns querying via the mirror); they need per-graph scans, bound
+// pattern lookups over small graphs (TBox/SHACL), membership, and add/remove. LeanQuadStore stores
+// quads as interned uint32 term-id columns with per-graph + per-predicate id lists (~130 B/quad),
+// and exposes the n3-Store API subset the code actually calls — so it's a drop-in for the store
+// behind ReasoningStore, ~8–9x smaller and faster on those ops (benchmarked).
+//
+// There are no per-model Quad arrays: the ABox chainer reads scope facts via forEachAssertedFact/
+// forEachEntailedFact, which yield shared interned Term instances + a per-row cached key straight
+// from the columns — so a model's facts are re-read across dependents (~21x) without materializing
+// or retaining Quad objects, and without a separate factOf memo.
+import { DataFactory } from 'n3';
+const { namedNode, blankNode, literal, quad, defaultGraph } = DataFactory;
+const XSD_STRING = 'http://www.w3.org/2001/XMLSchema#string';
+// --- LeanQuadStore: interned-column quad store exposing the n3-Store API subset we use ----------
+const NULL_ID = -1; // wildcard (term not bound in a query)
+const ABSENT_ID = -2; // bound term that was never interned -> matches nothing
+class LeanQuadStore {
+    constructor() {
+        this.termToId = new Map();
+        this.idToKey = [];
+        // Packed term-id columns; row index === quad id.
+        this.cs = [];
+        this.cp = [];
+        this.co = [];
+        this.cg = [];
+        this.graphRows = new Map();
+        this.predRows = new Map();
+        this.dead = new Set();
+        // Caches for the chainer's scope-fact path: one shared Term instance per term id, and the dedup
+        // key (`${s.id}|${p.id}|${o.id}`) per row — computed once, reused across the ~21x re-reads.
+        this.idToTerm = [];
+        this.rowKey = [];
+    }
+    keyOfTerm(t) {
+        switch (t.termType) {
+            case 'NamedNode': return 'N\x00' + t.value;
+            case 'BlankNode': return 'B\x00' + t.value;
+            case 'DefaultGraph': return 'D';
+            default: {
+                const lit = t;
+                const dt = lit.datatype ? lit.datatype.value : XSD_STRING;
+                return 'L\x00' + lit.value + '\x00' + dt + '\x00' + (lit.language || '');
+            }
+        }
+    }
+    intern(key) {
+        let id = this.termToId.get(key);
+        if (id === undefined) {
+            id = this.idToKey.length;
+            this.termToId.set(key, id);
+            this.idToKey.push(key);
+        }
+        return id;
+    }
+    // -1 for null/undefined (wildcard); -2 for a bound term that isn't interned (matches nothing).
+    idOf(t) {
+        if (t === null || t === undefined) {
+            return NULL_ID;
+        }
+        const id = this.termToId.get(this.keyOfTerm(t));
+        return id === undefined ? ABSENT_ID : id;
+    }
+    termAt(id) {
+        const k = this.idToKey[id];
+        const kind = k.charCodeAt(0);
+        if (kind === 78 /* N */)
+            return namedNode(k.slice(2));
+        if (kind === 66 /* B */)
+            return blankNode(k.slice(2));
+        if (kind === 68 /* D */)
+            return defaultGraph();
+        const parts = k.slice(2).split('\x00');
+        const value = parts[0], dt = parts[1], lang = parts[2];
+        if (lang)
+            return literal(value, lang);
+        if (dt && dt !== XSD_STRING)
+            return literal(value, namedNode(dt));
+        return literal(value);
+    }
+    materialize(row) {
+        // Casts are safe: subjects are NamedNode/BlankNode, predicates NamedNode, objects any term,
+        // graphs NamedNode/DefaultGraph — guaranteed by how quads are inserted.
+        return quad(this.termAt(this.cs[row]), this.termAt(this.cp[row]), this.termAt(this.co[row]), this.termAt(this.cg[row]));
+    }
+    addRow(si, pi, oi, gi) {
+        const row = this.cs.length;
+        this.cs.push(si);
+        this.cp.push(pi);
+        this.co.push(oi);
+        this.cg.push(gi);
+        let gl = this.graphRows.get(gi);
+        if (!gl) {
+            gl = [];
+            this.graphRows.set(gi, gl);
+        }
+        gl.push(row);
+        let pl = this.predRows.get(pi);
+        if (!pl) {
+            pl = [];
+            this.predRows.set(pi, pl);
+        }
+        pl.push(row);
+        return row;
+    }
+    sharedTermAt(id) {
+        let t = this.idToTerm[id];
+        if (!t) {
+            t = this.termAt(id);
+            this.idToTerm[id] = t;
+        }
+        return t;
+    }
+    keyAt(row) {
+        let k = this.rowKey[row];
+        if (k === undefined) {
+            k = `${this.sharedTermAt(this.cs[row]).id}|${this.sharedTermAt(this.cp[row]).id}|${this.sharedTermAt(this.co[row]).id}`;
+            this.rowKey[row] = k;
+        }
+        return k;
+    }
+    isDead(row) {
+        return this.dead.has(row);
+    }
+    visitFact(row, visit) {
+        visit(this.sharedTermAt(this.cs[row]), this.sharedTermAt(this.cp[row]), this.sharedTermAt(this.co[row]), this.keyAt(row));
+    }
+    // Scope-fact iteration for the ABox chainer: shared terms + cached keys, no Quad materialization.
+    forEachFactInGraph(graph, visit) {
+        const gid = this.idOf(graph);
+        if (gid < 0)
+            return;
+        const rows = this.graphRows.get(gid);
+        if (!rows)
+            return;
+        for (const r of rows) {
+            if (!this.dead.has(r))
+                this.visitFact(r, visit);
+        }
+    }
+    forEachFactInRows(rows, visit) {
+        for (const r of rows) {
+            if (!this.dead.has(r))
+                this.visitFact(r, visit);
+        }
+    }
+    // Iterate rows matching the (possibly wildcard) pattern, skipping tombstoned rows.
+    forEachMatch(si, pi, oi, gi, visit) {
+        if (si === ABSENT_ID || pi === ABSENT_ID || oi === ABSENT_ID || gi === ABSENT_ID) {
+            return;
+        }
+        // Pick the most selective available index.
+        let candidates;
+        if (gi !== NULL_ID)
+            candidates = this.graphRows.get(gi);
+        else if (pi !== NULL_ID)
+            candidates = this.predRows.get(pi);
+        if (candidates) {
+            for (let i = 0; i < candidates.length; i++) {
+                const r = candidates[i];
+                if (this.dead.has(r))
+                    continue;
+                if (si !== NULL_ID && this.cs[r] !== si)
+                    continue;
+                if (pi !== NULL_ID && this.cp[r] !== pi)
+                    continue;
+                if (oi !== NULL_ID && this.co[r] !== oi)
+                    continue;
+                if (gi !== NULL_ID && this.cg[r] !== gi)
+                    continue;
+                visit(r);
+            }
+            return;
+        }
+        // Full scan (no graph or predicate bound).
+        const n = this.cs.length;
+        for (let r = 0; r < n; r++) {
+            if (this.dead.has(r))
+                continue;
+            if (si !== NULL_ID && this.cs[r] !== si)
+                continue;
+            if (pi !== NULL_ID && this.cp[r] !== pi)
+                continue;
+            if (oi !== NULL_ID && this.co[r] !== oi)
+                continue;
+            visit(r);
+        }
+    }
+    // --- n3-Store-compatible API (the subset used across the codebase) -----------------------
+    // Returns the new row id (used by LeanReasoningStore to track per-model entailment rows).
+    addQuad(subjectOrQuad, predicate, object, graph) {
+        let s, p, o, g;
+        if (predicate === undefined) {
+            const q = subjectOrQuad;
+            s = q.subject;
+            p = q.predicate;
+            o = q.object;
+            g = q.graph;
+        }
+        else {
+            s = subjectOrQuad;
+            p = predicate;
+            o = object;
+            g = (graph ?? defaultGraph());
+        }
+        return this.addRow(this.intern(this.keyOfTerm(s)), this.intern(this.keyOfTerm(p)), this.intern(this.keyOfTerm(o)), this.intern(this.keyOfTerm(g)));
+    }
+    addQuads(quads) {
+        for (const q of quads)
+            this.addQuad(q.subject, q.predicate, q.object, q.graph);
+    }
+    removeQuad(subjectOrQuad, predicate, object, graph) {
+        let s, p, o, g;
+        if (predicate === undefined) {
+            const q = subjectOrQuad;
+            s = q.subject;
+            p = q.predicate;
+            o = q.object;
+            g = q.graph;
+        }
+        else {
+            s = subjectOrQuad;
+            p = predicate;
+            o = object;
+            g = (graph ?? defaultGraph());
+        }
+        const si = this.idOf(s), pi = this.idOf(p), oi = this.idOf(o), gi = this.idOf(g);
+        this.forEachMatch(si, pi, oi, gi, (row) => { this.tombstone(row, gi); });
+    }
+    removeQuads(quads) {
+        for (const q of quads)
+            this.removeQuad(q.subject, q.predicate, q.object, q.graph);
+    }
+    tombstone(row, gi) {
+        if (this.dead.has(row))
+            return;
+        this.dead.add(row);
+        // Keep the graph list compact (graph removal is the common bulk case); predRows is filtered lazily via `dead`.
+        const gl = this.graphRows.get(gi >= 0 ? gi : this.cg[row]);
+        if (gl) {
+            const idx = gl.indexOf(row);
+            if (idx >= 0)
+                gl.splice(idx, 1);
+        }
+    }
+    getQuads(subject, predicate, object, graph) {
+        const out = [];
+        this.forEachMatch(this.idOf(subject), this.idOf(predicate), this.idOf(object), this.idOf(graph), (row) => {
+            out.push(this.materialize(row));
+        });
+        return out;
+    }
+    countQuads(subject, predicate, object, graph) {
+        let count = 0;
+        this.forEachMatch(this.idOf(subject), this.idOf(predicate), this.idOf(object), this.idOf(graph), () => { count += 1; });
+        return count;
+    }
+    has(subjectOrQuad, predicate, object, graph) {
+        let s, p, o, g;
+        if (predicate === undefined) {
+            const q = subjectOrQuad;
+            s = q.subject;
+            p = q.predicate;
+            o = q.object;
+            g = q.graph;
+        }
+        else {
+            s = subjectOrQuad;
+            p = predicate;
+            o = object;
+            g = (graph ?? defaultGraph());
+        }
+        let found = false;
+        this.forEachMatch(this.idOf(s), this.idOf(p), this.idOf(o), this.idOf(g), () => { found = true; });
+        return found;
+    }
+}
+// --- LeanReasoningStore: OwlStore over LeanQuadStore (mirrors ReasoningStore exactly) -----------
+export class LeanReasoningStore {
+    constructor() {
+        this.store = new LeanQuadStore();
+        this.modelGraphs = new Map();
+        // Asserted facts live in the model's own graph (read straight from the store's columns, no
+        // per-model array). Entailed facts written via addEntailment/loadEntailments are tracked here
+        // by row id so forEachEntailedFact returns ONLY them (not TBox quads that the
+        // TBox chainer writes directly into the entailments graph via getStore().addQuads).
+        this.entailedRows = new Map();
+        this.modelDataGen = new Map();
+    }
+    bumpDataGen(modelUri) {
+        this.modelDataGen.set(modelUri, (this.modelDataGen.get(modelUri) ?? 0) + 1);
+    }
+    getModelDataGen(modelUri) {
+        return this.modelDataGen.get(modelUri) ?? 0;
+    }
+    loadModel(modelUri, quads) {
+        const existingGraphs = this.modelGraphs.get(modelUri);
+        const graphs = existingGraphs ?? this.graphsFromModelUri(modelUri);
+        if (existingGraphs) {
+            this.retractModel(modelUri);
+        }
+        this.modelGraphs.set(modelUri, graphs);
+        this.entailedRows.delete(modelUri);
+        for (const q of quads) {
+            this.store.addQuad(q.subject, q.predicate, q.object, graphs.own);
+        }
+        this.bumpDataGen(modelUri);
+    }
+    loadEntailments(modelUri, quads) {
+        const graphs = this.requireGraphs(modelUri);
+        this.removeGraph(graphs.entailments);
+        this.bumpDataGen(modelUri);
+        if (quads.length === 0) {
+            this.entailedRows.set(modelUri, []);
+            return;
+        }
+        const rows = [];
+        for (const q of quads) {
+            rows.push(this.store.addQuad(q.subject, q.predicate, q.object, graphs.entailments));
+        }
+        this.entailedRows.set(modelUri, rows);
+    }
+    addEntailment(modelUri, q) {
+        const graphs = this.requireGraphs(modelUri);
+        const row = this.store.addQuad(q.subject, q.predicate, q.object, graphs.entailments);
+        const rows = this.entailedRows.get(modelUri) ?? [];
+        rows.push(row);
+        this.entailedRows.set(modelUri, rows);
+        this.bumpDataGen(modelUri);
+    }
+    removeEntailment(modelUri, q) {
+        const graphs = this.requireGraphs(modelUri);
+        this.store.removeQuad(quad(q.subject, q.predicate, q.object, graphs.entailments));
+        const rows = this.entailedRows.get(modelUri);
+        if (rows) {
+            this.entailedRows.set(modelUri, rows.filter((r) => !this.store.isDead(r)));
+        }
+        this.bumpDataGen(modelUri);
+    }
+    applyModelDelta(modelUri, quads, retracted, asserted) {
+        const graphs = this.resolveGraphs(modelUri);
+        this.modelGraphs.set(modelUri, graphs);
+        if (retracted.length > 0) {
+            this.store.removeQuads(retracted.map((q) => this.withGraph(q, graphs.own)));
+        }
+        if (asserted.length > 0) {
+            for (const q of asserted) {
+                this.store.addQuad(q.subject, q.predicate, q.object, graphs.own);
+            }
+        }
+        this.bumpDataGen(modelUri);
+    }
+    retractModel(modelUri) {
+        const graphs = this.modelGraphs.get(modelUri);
+        if (!graphs)
+            return;
+        this.removeGraph(graphs.own);
+        this.removeGraph(graphs.entailments);
+        this.removeGraph(graphs.shaclRules);
+        this.modelGraphs.delete(modelUri);
+        this.entailedRows.delete(modelUri);
+        this.bumpDataGen(modelUri);
+    }
+    diffModel(modelUri, newQuads) {
+        const graphs = this.resolveGraphs(modelUri);
+        const existing = this.store.getQuads(null, null, null, graphs.own);
+        const next = newQuads.map((q) => this.withGraph(q, graphs.own));
+        const existingByKey = new Map(existing.map((q) => [this.quadKey(q), q]));
+        const nextByKey = new Map(next.map((q) => [this.quadKey(q), q]));
+        const retracted = [...existingByKey.entries()]
+            .filter(([key]) => !nextByKey.has(key))
+            .map(([, value]) => value)
+            .sort((a, b) => this.quadKey(a).localeCompare(this.quadKey(b)));
+        const asserted = [...nextByKey.entries()]
+            .filter(([key]) => !existingByKey.has(key))
+            .map(([, value]) => value)
+            .sort((a, b) => this.quadKey(a).localeCompare(this.quadKey(b)));
+        return {
+            isEmpty: retracted.length === 0 && asserted.length === 0,
+            retracted,
+            asserted,
+        };
+    }
+    clearEntailments(modelUri) {
+        const graphs = this.requireGraphs(modelUri);
+        this.removeGraph(graphs.entailments);
+        this.entailedRows.set(modelUri, []);
+        this.bumpDataGen(modelUri);
+    }
+    graphs(modelUri) {
+        return this.requireGraphs(modelUri);
+    }
+    getStore() {
+        return this.store;
+    }
+    forEachAssertedFact(modelUri, visit) {
+        const graphs = this.modelGraphs.get(modelUri);
+        if (!graphs)
+            return;
+        this.store.forEachFactInGraph(graphs.own, visit);
+    }
+    forEachEntailedFact(modelUri, visit) {
+        const rows = this.entailedRows.get(modelUri);
+        if (!rows)
+            return;
+        this.store.forEachFactInRows(rows, visit);
+    }
+    resolveGraphs(modelUri) {
+        const existing = this.modelGraphs.get(modelUri);
+        if (existing) {
+            return existing;
+        }
+        const graphs = this.graphsFromModelUri(modelUri);
+        this.modelGraphs.set(modelUri, graphs);
+        return graphs;
+    }
+    graphsFromModelUri(modelUri) {
+        return {
+            own: namedNode(modelUri),
+            entailments: namedNode(`${modelUri}__entailments`),
+            shaclRules: namedNode(`${modelUri}__shacl_rules`),
+        };
+    }
+    requireGraphs(modelUri) {
+        const graphs = this.modelGraphs.get(modelUri);
+        if (!graphs) {
+            throw new Error(`Unknown model '${modelUri}'. Load the model first.`);
+        }
+        return graphs;
+    }
+    withGraph(q, graph) {
+        return quad(q.subject, q.predicate, q.object, graph);
+    }
+    removeGraph(graph) {
+        this.store.removeQuads(this.store.getQuads(null, null, null, graph));
+    }
+    quadKey(q) {
+        return `${q.subject.id}|${q.predicate.id}|${q.object.id}|${q.graph.id}`;
+    }
+}
+//# sourceMappingURL=owl-store-lean.js.map

package/out/owl/owl-store-lean.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"owl-store-lean.js","sourceRoot":"","sources":["../../src/owl/owl-store-lean.ts"],"names":[],"mappings":"AAAA,qDAAqD;AAErD,qEAAqE;AACrE,EAAE;AACF,gGAAgG;AAChG,iGAAiG;AACjG,gGAAgG;AAChG,mGAAmG;AACnG,kGAAkG;AAClG,gGAAgG;AAChG,8EAA8E;AAC9E,EAAE;AACF,kGAAkG;AAClG,kGAAkG;AAClG,mGAAmG;AACnG,iEAAiE;AAEjE,OAAO,EAAE,WAAW,EAAE,MAAM,IAAI,CAAC;AAKjC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,WAAW,CAAC;AAC1E,MAAM,UAAU,GAAG,yCAAyC,CAAC;AAE7D,mGAAmG;AAEnG,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC,CAAQ,uCAAuC;AAClE,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,CAAM,wDAAwD;AAEnF,MAAM,aAAa;IAAnB;QACqB,aAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,YAAO,GAAa,EAAE,CAAC;QACxC,iDAAiD;QAChC,OAAE,GAAa,EAAE,CAAC;QAClB,OAAE,GAAa,EAAE,CAAC;QAClB,OAAE,GAAa,EAAE,CAAC;QAClB,OAAE,GAAa,EAAE,CAAC;QAClB,cAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;QACxC,aAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;QACvC,SAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,gGAAgG;QAChG,4FAA4F;QAC3E,aAAQ,GAAyB,EAAE,CAAC;QACpC,WAAM,GAA2B,EAAE,CAAC;IAiNzD,CAAC;IA/MW,SAAS,CAAC,CAAO;QACrB,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;YACjB,KAAK,WAAW,CAAC,CAAC,OAAO,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC;YAC3C,KAAK,WAAW,CAAC,CAAC,OAAO,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC;YAC3C,KAAK,cAAc,CAAC,CAAC,OAAO,GAAG,CAAC;YAChC,OAAO,CAAC,CAAC,CAAC;gBACN,MAAM,GAAG,GAAG,CAAuE,CAAC;gBACpF,MAAM,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC;gBAC1D,OAAO,OAAO,GAAG,GAAG,CAAC,KAAK,GAAG,MAAM,GAAG,EAAE,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;YAC7E,CAAC;QACL,CAAC;IACL,CAAC;IAEO,MAAM,CAAC,GAAW;QACtB,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACnB,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;YACzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,EAAE,CAAC;IACd,CAAC;IAED,+FAA+F;IACvF,IAAI,CAAC,CAA0B;QACnC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YAChC,OAAO,OAAO,CAAC;QACnB,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,OAAO,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7C,CAAC;IAEO,MAAM,CAAC,EAAU;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,EAAE,CAAC,OAAO;YAAE,OAAO,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,IAAI,KAAK,EAAE,CAAC,OAAO;YAAE,OAAO,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,IAAI,KAAK,EAAE,CAAC,OAAO;YAAE,OAAO,YAAY,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvD,IAAI,IAAI;YAAE,OAAO,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACtC,IAAI,EAAE,IAAI,EAAE,KAAK,UAAU;YAAE,OAAO,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAEO,WAAW,CAAC,GAAW;QAC3B,4FAA4F;QAC5F,wEAAwE;QACxE,OAAO,IAAI,CACP,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAoB,EAC5C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAsB,EAC9C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAmB,EAC3C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAkB,CAC7C,CAAC;IACN,CAAC;IAEO,MAAM,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU;QACzD,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvE,IAAI,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YAAC,EAAE,GAAG,EAAE,CAAC;YAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAAC,CAAC;QAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChG,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YAAC,EAAE,GAAG,EAAE,CAAC;YAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAAC,CAAC;QAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9F,OAAO,GAAG,CAAC;IACf,CAAC;IAEO,YAAY,CAAC,EAAU;QAC3B,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,CAAC,CAAC,EAAE,CAAC;YAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAAC,CAAC;QACvD,OAAO,CAAC,CAAC;IACb,CAAC;IAEO,KAAK,CAAC,GAAW;QACrB,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YAClB,CAAC,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACxH,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,CAAC,CAAC;IACb,CAAC;IAED,MAAM,CAAC,GAAW;QACd,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAEO,SAAS,CAAC,GAAW,EAAE,KAA4D;QACvF,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAc,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3I,CAAC;IAED,kGAAkG;IAClG,kBAAkB,CAAC,KAAW,EAAE,KAA4D;QACxF,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,GAAG,GAAG,CAAC;YAAE,OAAO;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACpD,CAAC;IACL,CAAC;IAED,iBAAiB,CAAC,IAAsB,EAAE,KAA4D;QAClG,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACpD,CAAC;IACL,CAAC;IAED,mFAAmF;IAC3E,YAAY,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,KAA4B;QAC7F,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YAC/E,OAAO;QACX,CAAC;QACD,2CAA2C;QAC3C,IAAI,UAAgC,CAAC;QACrC,IAAI,EAAE,KAAK,OAAO;YAAE,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACnD,IAAI,EAAE,KAAK,OAAO;YAAE,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5D,IAAI,UAAU,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC/B,IAAI,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBAAE,SAAS;gBAClD,IAAI,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBAAE,SAAS;gBAClD,IAAI,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBAAE,SAAS;gBAClD,IAAI,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBAAE,SAAS;gBAClD,KAAK,CAAC,CAAC,CAAC,CAAC;YACb,CAAC;YACD,OAAO;QACX,CAAC;QACD,2CAA2C;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC/B,IAAI,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;gBAAE,SAAS;YAClD,IAAI,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;gBAAE,SAAS;YAClD,IAAI,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;gBAAE,SAAS;YAClD,KAAK,CAAC,CAAC,CAAC,CAAC;QACb,CAAC;IACL,CAAC;IAED,4FAA4F;IAE5F,0FAA0F;IAC1F,OAAO,CAAC,aAA0B,EAAE,SAAgB,EAAE,MAAa,EAAE,KAAY;QAC7E,IAAI,CAAO,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,CAAC;QACvC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,aAAqB,CAAC;YAChC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;QAC9D,CAAC;aAAM,CAAC;YACJ,CAAC,GAAG,aAAqB,CAAC;YAAC,CAAC,GAAG,SAAS,CAAC;YAAC,CAAC,GAAG,MAAc,CAAC;YAAC,CAAC,GAAG,CAAC,KAAK,IAAI,YAAY,EAAE,CAAS,CAAC;QACxG,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvJ,CAAC;IAED,QAAQ,CAAC,KAAa;QAClB,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACnF,CAAC;IAED,UAAU,CAAC,aAA0B,EAAE,SAAgB,EAAE,MAAa,EAAE,KAAY;QAChF,IAAI,CAAO,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,CAAC;QACvC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,aAAqB,CAAC;YAChC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;QAC9D,CAAC;aAAM,CAAC;YACJ,CAAC,GAAG,aAAqB,CAAC;YAAC,CAAC,GAAG,SAAS,CAAC;YAAC,CAAC,GAAG,MAAc,CAAC;YAAC,CAAC,GAAG,CAAC,KAAK,IAAI,YAAY,EAAE,CAAS,CAAC;QACxG,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjF,IAAI,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,CAAC;IAED,WAAW,CAAC,KAAa;QACrB,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACtF,CAAC;IAEO,SAAS,CAAC,GAAW,EAAE,EAAU;QACrC,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO;QAC/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,+GAA+G;QAC/G,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3D,IAAI,EAAE,EAAE,CAAC;YACL,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,GAAG,IAAI,CAAC;gBAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACpC,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,OAAoB,EAAE,SAAsB,EAAE,MAAmB,EAAE,KAAkB;QAC1F,MAAM,GAAG,GAAW,EAAE,CAAC;QACvB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;YACrG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC;IACf,CAAC;IAED,UAAU,CAAC,OAAoB,EAAE,SAAsB,EAAE,MAAmB,EAAE,KAAkB;QAC5F,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxH,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,GAAG,CAAC,aAA0B,EAAE,SAAgB,EAAE,MAAa,EAAE,KAAY;QACzE,IAAI,CAAO,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,CAAC;QACvC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,aAAqB,CAAC;YAChC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;QAC9D,CAAC;aAAM,CAAC;YACJ,CAAC,GAAG,aAAqB,CAAC;YAAC,CAAC,GAAG,SAAS,CAAC;YAAC,CAAC,GAAG,MAAc,CAAC;YAAC,CAAC,GAAG,CAAC,KAAK,IAAI,YAAY,EAAE,CAAS,CAAC;QACxG,CAAC;QACD,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACnG,OAAO,KAAK,CAAC;IACjB,CAAC;CACJ;AAED,mGAAmG;AAEnG,MAAM,OAAO,kBAAkB;IAA/B;QACqB,UAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAC5B,gBAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC9D,2FAA2F;QAC3F,8FAA8F;QAC9F,8EAA8E;QAC9E,oFAAoF;QACnE,iBAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC3C,iBAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IA4K9D,CAAC;IA1KW,WAAW,CAAC,QAAgB;QAChC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChF,CAAC;IAED,eAAe,CAAC,QAAgB;QAC5B,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC;IAED,SAAS,CAAC,QAAgB,EAAE,KAAa;QACrC,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtD,MAAM,MAAM,GAAG,cAAc,IAAI,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QACnE,IAAI,cAAc,EAAE,CAAC;YACjB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QACrE,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED,eAAe,CAAC,QAAgB,EAAE,KAAa;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACrC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC3B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YACpC,OAAO;QACX,CAAC;QACD,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;QACxF,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED,aAAa,CAAC,QAAgB,EAAE,CAAO;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;QACrF,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACnD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED,gBAAgB,CAAC,QAAgB,EAAE,CAAO;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;QAClF,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,IAAI,EAAE,CAAC;YACP,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED,eAAe,CAAC,QAAgB,EAAE,KAAa,EAAE,SAAiB,EAAE,QAAgB;QAChF,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChF,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACvB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;YACrE,CAAC;QACL,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED,YAAY,CAAC,QAAgB;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM;YAAE,OAAO;QACpB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACrC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACpC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAClC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED,SAAS,CAAC,QAAgB,EAAE,QAAgB;QACxC,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QACnE,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QAEhE,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEjE,MAAM,SAAS,GAAG,CAAC,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC;aACzC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aACtC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC;aACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpE,MAAM,QAAQ,GAAG,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;aACpC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC;aACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpE,OAAO;YACH,OAAO,EAAE,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YACxD,SAAS;YACT,QAAQ;SACX,CAAC;IACN,CAAC;IAED,gBAAgB,CAAC,QAAgB;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACrC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,CAAC,QAAgB;QACnB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED,QAAQ;QACJ,OAAO,IAAI,CAAC,KAAyB,CAAC;IAC1C,CAAC;IAED,mBAAmB,CAAC,QAAgB,EAAE,KAAuB;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM;YAAE,OAAO;QACpB,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACrD,CAAC;IAED,mBAAmB,CAAC,QAAgB,EAAE,KAAuB;QACzD,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC9C,CAAC;IAEO,aAAa,CAAC,QAAgB;QAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,QAAQ,EAAE,CAAC;YACX,OAAO,QAAQ,CAAC;QACpB,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvC,OAAO,MAAM,CAAC;IAClB,CAAC;IAEO,kBAAkB,CAAC,QAAgB;QACvC,OAAO;YACH,GAAG,EAAE,SAAS,CAAC,QAAQ,CAAC;YACxB,WAAW,EAAE,SAAS,CAAC,GAAG,QAAQ,eAAe,CAAC;YAClD,UAAU,EAAE,SAAS,CAAC,GAAG,QAAQ,eAAe,CAAC;SACpD,CAAC;IACN,CAAC;IAEO,aAAa,CAAC,QAAgB;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,kBAAkB,QAAQ,0BAA0B,CAAC,CAAC;QAC1E,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAEO,SAAS,CAAC,CAAO,EAAE,KAAgB;QACvC,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACzD,CAAC;IAEO,WAAW,CAAC,KAAgB;QAChC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IACzE,CAAC;IAEO,OAAO,CAAC,CAAO;QACnB,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;IAC5E,CAAC;CACJ"}

package/out/owl/owl-store.d.ts

@@ -1,5 +1,5 @@
 import { Store } from 'n3';
-import type { NamedNode, Quad } from 'n3';
+import type { NamedNode, Quad, Term } from 'n3';
 export interface ModelDiff {
     isEmpty: boolean;
     retracted: Quad[];
@@ -8,18 +8,28 @@ export interface ModelDiff {
 export interface ModelGraphs {
     own: NamedNode;
     entailments: NamedNode;
+    shaclRules: NamedNode;
 }
 export declare class ReasoningStore {
     private readonly store;
     private readonly modelGraphs;
+    private readonly assertedQuadsByModel;
+    private readonly entailedQuadsByModel;
+    private readonly modelDataGen;
+    private bumpDataGen;
+    getModelDataGen(modelUri: string): number;
     loadModel(modelUri: string, quads: Quad[]): void;
     loadEntailments(modelUri: string, quads: Quad[]): void;
+    addEntailment(modelUri: string, q: Quad): void;
+    removeEntailment(modelUri: string, q: Quad): void;
     applyModelDelta(modelUri: string, quads: Quad[], retracted: Quad[], asserted: Quad[]): void;
     retractModel(modelUri: string): void;
     diffModel(modelUri: string, newQuads: Quad[]): ModelDiff;
     clearEntailments(modelUri: string): void;
     graphs(modelUri: string): ModelGraphs;
     getStore(): Store;
+    forEachAssertedFact(modelUri: string, visit: (subject: Term, predicate: NamedNode, object: Term, key: string) => void): void;
+    forEachEntailedFact(modelUri: string, visit: (subject: Term, predicate: NamedNode, object: Term, key: string) => void): void;
     private resolveGraphs;
     private graphsFromModelUri;
     private requireGraphs;

package/out/owl/owl-store.js

@@ -5,33 +5,84 @@ export class ReasoningStore {
     constructor() {
         this.store = new Store();
         this.modelGraphs = new Map();
+        this.assertedQuadsByModel = new Map();
+        this.entailedQuadsByModel = new Map();
+        // Monotonic per-model data version, bumped on every mutation of a model's asserted or entailed
+        // quads. Consumers (e.g. the Oxigraph mirror) compare it to detect exactly which models changed,
+        // without re-reading the data — so an edit re-syncs only the models that actually changed.
+        this.modelDataGen = new Map();
+    }
+    bumpDataGen(modelUri) {
+        this.modelDataGen.set(modelUri, (this.modelDataGen.get(modelUri) ?? 0) + 1);
+    }
+    getModelDataGen(modelUri) {
+        return this.modelDataGen.get(modelUri) ?? 0;
     }
     // Load a model's quads into its named graph.
     // Retracts any existing quads for that model first.
     // Graph IRI is derived from the model URI to keep model snapshots isolated.
     loadModel(modelUri, quads) {
-        const graphs = this.resolveGraphs(modelUri);
-        this.retractModel(modelUri);
+        const existingGraphs = this.modelGraphs.get(modelUri);
+        const graphs = existingGraphs ?? this.graphsFromModelUri(modelUri);
+        if (existingGraphs) {
+            this.retractModel(modelUri);
+        }
         this.modelGraphs.set(modelUri, graphs);
-        this.store.addQuads(quads.map((q) => this.withGraph(q, graphs.own)));
+        this.assertedQuadsByModel.set(modelUri, [...quads]);
+        this.entailedQuadsByModel.delete(modelUri);
+        for (const q of quads) {
+            this.store.addQuad(q.subject, q.predicate, q.object, graphs.own);
+        }
+        this.bumpDataGen(modelUri);
     }
     loadEntailments(modelUri, quads) {
         const graphs = this.requireGraphs(modelUri);
         this.removeGraph(graphs.entailments);
+        this.bumpDataGen(modelUri);
         if (quads.length === 0) {
+            this.entailedQuadsByModel.set(modelUri, []);
             return;
         }
-        this.store.addQuads(quads.map((q) => this.withGraph(q, graphs.entailments)));
+        const entailed = [];
+        for (const q of quads) {
+            const entailedQuad = quad(q.subject, q.predicate, q.object, graphs.entailments);
+            entailed.push(entailedQuad);
+            this.store.addQuad(entailedQuad);
+        }
+        this.entailedQuadsByModel.set(modelUri, entailed);
+    }
+    addEntailment(modelUri, q) {
+        const graphs = this.requireGraphs(modelUri);
+        const entailedQuad = quad(q.subject, q.predicate, q.object, graphs.entailments);
+        const entailed = this.entailedQuadsByModel.get(modelUri) ?? [];
+        entailed.push(entailedQuad);
+        this.entailedQuadsByModel.set(modelUri, entailed);
+        this.store.addQuad(entailedQuad);
+        this.bumpDataGen(modelUri);
+    }
+    removeEntailment(modelUri, q) {
+        const graphs = this.requireGraphs(modelUri);
+        const entailedQuad = quad(q.subject, q.predicate, q.object, graphs.entailments);
+        const key = this.quadKey(entailedQuad);
+        const entailed = this.entailedQuadsByModel.get(modelUri) ?? [];
+        const next = entailed.filter((entry) => this.quadKey(entry) !== key);
+        this.entailedQuadsByModel.set(modelUri, next);
+        this.store.removeQuad(entailedQuad);
+        this.bumpDataGen(modelUri);
     }
     applyModelDelta(modelUri, quads, retracted, asserted) {
         const graphs = this.resolveGraphs(modelUri);
         this.modelGraphs.set(modelUri, graphs);
+        this.assertedQuadsByModel.set(modelUri, [...quads]);
         if (retracted.length > 0) {
             this.store.removeQuads(retracted.map((q) => this.withGraph(q, graphs.own)));
         }
         if (asserted.length > 0) {
-            this.store.addQuads(asserted.map((q) => this.withGraph(q, graphs.own)));
+            for (const q of asserted) {
+                this.store.addQuad(q.subject, q.predicate, q.object, graphs.own);
+            }
         }
+        this.bumpDataGen(modelUri);
     }
     // Retract all quads in all named graphs for a model
     // (own quads + entailment quads)
@@ -41,7 +92,11 @@ export class ReasoningStore {
             return;
         this.removeGraph(graphs.own);
         this.removeGraph(graphs.entailments);
+        this.removeGraph(graphs.shaclRules);
         this.modelGraphs.delete(modelUri);
+        this.assertedQuadsByModel.delete(modelUri);
+        this.entailedQuadsByModel.delete(modelUri);
+        this.bumpDataGen(modelUri);
     }
     // Compare newly mapped quads against what is currently in the store.
     // Returns the semantic difference — what was added and what was removed.
@@ -71,6 +126,8 @@ export class ReasoningStore {
     clearEntailments(modelUri) {
         const graphs = this.requireGraphs(modelUri);
         this.removeGraph(graphs.entailments);
+        this.entailedQuadsByModel.set(modelUri, []);
+        this.bumpDataGen(modelUri);
     }
     // Returns the named graph IRIs for a model.
     // Used by TBoxChainer, ABoxChainer, and SparqlService
@@ -83,6 +140,22 @@ export class ReasoningStore {
     getStore() {
         return this.store;
     }
+    forEachAssertedFact(modelUri, visit) {
+        const quads = this.assertedQuadsByModel.get(modelUri);
+        if (!quads)
+            return;
+        for (const q of quads) {
+            visit(q.subject, q.predicate, q.object, `${q.subject.id}|${q.predicate.id}|${q.object.id}`);
+        }
+    }
+    forEachEntailedFact(modelUri, visit) {
+        const quads = this.entailedQuadsByModel.get(modelUri);
+        if (!quads)
+            return;
+        for (const q of quads) {
+            visit(q.subject, q.predicate, q.object, `${q.subject.id}|${q.predicate.id}|${q.object.id}`);
+        }
+    }
     resolveGraphs(modelUri) {
         const existing = this.modelGraphs.get(modelUri);
         if (existing) {
@@ -95,7 +168,8 @@ export class ReasoningStore {
     graphsFromModelUri(modelUri) {
         return {
             own: namedNode(modelUri),
-            entailments: namedNode(`${modelUri}__entailments`)
+            entailments: namedNode(`${modelUri}__entailments`),
+            shaclRules: namedNode(`${modelUri}__shacl_rules`),
         };
     }
     requireGraphs(modelUri) {