@doxi/core 0.11.0

package/dist/model/node.js

@@ -0,0 +1,192 @@
+import { Fragment } from './fragment.js';
+import { sameSet } from './mark.js';
+export class DxNode {
+    type;
+    attrs;
+    content;
+    marks;
+    text;
+    nodeSize;
+    constructor(type, attrs, content, marks, text) {
+        this.type = type;
+        this.attrs = attrs;
+        this.content = content;
+        this.marks = marks;
+        this.text = text;
+        if (type.isText) {
+            if (text === undefined || text.length === 0) {
+                throw new RangeError(`DxNode.text: text leaves must have non-empty text`);
+            }
+            this.nodeSize = text.length;
+        }
+        else if (type.isAtom) {
+            this.nodeSize = 1;
+        }
+        else {
+            this.nodeSize = 2 + content.size;
+        }
+    }
+    // ---- accessors ----
+    get isText() { return this.type.isText; }
+    get isInline() { return this.type.isInline; }
+    get isBlock() { return this.type.isBlock; }
+    get isLeaf() { return this.type.isLeaf; }
+    get isAtom() { return this.type.isAtom; }
+    // ---- constructors ----
+    static text(type, text, marks = []) {
+        if (!type.isText)
+            throw new TypeError(`DxNode.text: type ${type.name} is not a text type`);
+        return new DxNode(type, {}, Fragment.empty, marks, text);
+    }
+    // ---- structural ops ----
+    copy(content = this.content) {
+        if (this.isText) {
+            throw new TypeError('DxNode.copy: cannot copy a text leaf with new content');
+        }
+        return new DxNode(this.type, this.attrs, content, this.marks);
+    }
+    mark(marks) {
+        if (sameSet(marks, this.marks))
+            return this;
+        if (this.isText)
+            return new DxNode(this.type, this.attrs, this.content, marks, this.text);
+        return new DxNode(this.type, this.attrs, this.content, marks);
+    }
+    /** Returns the slice of this node's content between [from, to). */
+    cut(from = 0, to = this.nodeSize) {
+        if (this.isText) {
+            const t = this.text;
+            const a = Math.max(0, Math.min(t.length, from));
+            const b = Math.max(a, Math.min(t.length, to));
+            if (a === 0 && b === t.length)
+                return this;
+            return new DxNode(this.type, this.attrs, this.content, this.marks, t.slice(a, b));
+        }
+        if (this.isAtom)
+            return this;
+        // For non-leaf nodes, [from, to) is in *content* coordinates if from/to are within content.size.
+        // We require: 0 <= from <= to <= content.size  (callers strip the +2 for open/close).
+        const contentSize = this.content.size;
+        const a = Math.max(0, Math.min(contentSize, from));
+        const b = Math.max(a, Math.min(contentSize, to));
+        if (a === 0 && b === contentSize)
+            return this;
+        return this.copy(cutFragment(this.content, a, b));
+    }
+    eq(other) {
+        if (this === other)
+            return true;
+        if (this.type !== other.type)
+            return false;
+        if (!attrsEq(this.attrs, other.attrs))
+            return false;
+        if (!sameSet(this.marks, other.marks))
+            return false;
+        if (this.isText)
+            return this.text === other.text;
+        return fragmentEq(this.content, other.content);
+    }
+    // ---- serialization ----
+    toJSON() {
+        const json = { type: this.type.name };
+        if (Object.keys(this.attrs).length > 0)
+            json.attrs = { ...this.attrs };
+        if (this.isText)
+            json.text = this.text;
+        else if (this.content.size > 0) {
+            json.content = this.content.children.map((c) => c.toJSON());
+        }
+        if (this.marks.length > 0)
+            json.marks = this.marks.map((m) => m.toJSON());
+        return json;
+    }
+    static fromJSON(types, json) {
+        const type = types[json.type];
+        if (!type)
+            throw new Error(`DxNode.fromJSON: unknown node type '${json.type}'`);
+        const attrs = applyNodeDefaults(type.spec.attrs ?? {}, json.attrs ?? {});
+        if (type.isText) {
+            if (typeof json.text !== 'string')
+                throw new Error(`DxNode.fromJSON: text node missing text`);
+            return new DxNode(type, attrs, Fragment.empty, [], json.text);
+        }
+        const children = (json.content ?? []).map((c) => DxNode.fromJSON(types, c));
+        return new DxNode(type, attrs, Fragment.from(children), []);
+    }
+}
+function attrsEq(a, b) {
+    const ak = Object.keys(a), bk = Object.keys(b);
+    if (ak.length !== bk.length)
+        return false;
+    for (const k of ak) {
+        if (!(k in b))
+            return false;
+        if (!Object.is(a[k], b[k]))
+            return false;
+    }
+    return true;
+}
+function fragmentEq(a, b) {
+    if (a === b)
+        return true;
+    if (a.childCount !== b.childCount)
+        return false;
+    for (let i = 0; i < a.childCount; i++) {
+        if (!a.child(i).eq(b.child(i)))
+            return false;
+    }
+    return true;
+}
+function applyNodeDefaults(specs, given) {
+    const out = {};
+    for (const name of Object.keys(specs)) {
+        if (name in given)
+            out[name] = given[name];
+        else if ('default' in specs[name])
+            out[name] = specs[name].default;
+    }
+    for (const name of Object.keys(given)) {
+        if (!(name in specs))
+            out[name] = given[name];
+    }
+    return Object.freeze(out);
+}
+/**
+ * Cut a fragment to its content-coordinate sub-range [from, to).
+ * Walks children and trims text leaves at the boundary.
+ */
+function cutFragment(frag, from, to) {
+    if (from === 0 && to === frag.size)
+        return frag;
+    if (from === to)
+        return Fragment.empty;
+    const result = [];
+    let offset = 0;
+    for (let i = 0; i < frag.childCount; i++) {
+        const child = frag.child(i);
+        const childSize = child.nodeSize;
+        const childEnd = offset + childSize;
+        if (childEnd <= from) {
+            offset = childEnd;
+            continue;
+        }
+        if (offset >= to)
+            break;
+        const localFrom = Math.max(0, from - offset);
+        const localTo = Math.min(childSize, to - offset);
+        if (localFrom === 0 && localTo === childSize) {
+            result.push(child);
+        }
+        else if (child.isText) {
+            result.push(child.cut(localFrom, localTo));
+        }
+        else {
+            // Non-text inline atom: take whole-or-nothing per spec.
+            // (Non-leaf block cuts strip the open/close offsets via -1.)
+            result.push(child.cut(localFrom - 1, localTo - 1));
+        }
+        offset = childEnd;
+    }
+    return Fragment.from(result);
+}
+//# sourceMappingURL=node.js.map

package/dist/model/node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"node.js","sourceRoot":"","sources":["../../src/model/node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAiB,MAAM,eAAe,CAAA;AAEvD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAGnC,MAAM,OAAO,MAAM;IAIN;IACA;IACA;IACA;IACA;IAPF,QAAQ,CAAQ;IAEzB,YACW,IAAc,EACd,KAAwC,EACxC,OAAiB,EACjB,KAA0B,EAC1B,IAAa;QAJb,SAAI,GAAJ,IAAI,CAAU;QACd,UAAK,GAAL,KAAK,CAAmC;QACxC,YAAO,GAAP,OAAO,CAAU;QACjB,UAAK,GAAL,KAAK,CAAqB;QAC1B,SAAI,GAAJ,IAAI,CAAS;QAEtB,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5C,MAAM,IAAI,UAAU,CAAC,mDAAmD,CAAC,CAAA;YAC3E,CAAC;YACD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAA;QAC7B,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAA;QACnB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,IAAI,CAAA;QAClC,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,IAAI,MAAM,KAAgB,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAA,CAAC,CAAC;IACnD,IAAI,QAAQ,KAAc,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAA,CAAC,CAAC;IACrD,IAAI,OAAO,KAAe,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAA,CAAC,CAAC;IACpD,IAAI,MAAM,KAAgB,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAA,CAAC,CAAC;IACnD,IAAI,MAAM,KAAgB,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAA,CAAC,CAAC;IAEnD,yBAAyB;IACzB,MAAM,CAAC,IAAI,CAAC,IAAc,EAAE,IAAY,EAAE,QAA6B,EAAE;QACvE,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,SAAS,CAAC,qBAAqB,IAAI,CAAC,IAAI,qBAAqB,CAAC,CAAA;QAC1F,OAAO,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAA;IAC1D,CAAC;IAED,2BAA2B;IAC3B,IAAI,CAAC,UAAoB,IAAI,CAAC,OAAO;QACnC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,IAAI,SAAS,CAAC,uDAAuD,CAAC,CAAA;QAC9E,CAAC;QACD,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;IAC/D,CAAC;IAED,IAAI,CAAC,KAA0B;QAC7B,IAAI,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;QAC3C,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QACzF,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IAC/D,CAAC;IAED,mEAAmE;IACnE,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,KAAa,IAAI,CAAC,QAAQ;QACtC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAK,CAAA;YACpB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;YAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAA;YAC7C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM;gBAAE,OAAO,IAAI,CAAA;YAC1C,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACnF,CAAC;QACD,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAA;QAC5B,iGAAiG;QACjG,sFAAsF;QACtF,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAA;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAA;QAClD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,CAAA;QAChD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,WAAW;YAAE,OAAO,IAAI,CAAA;QAC7C,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACnD,CAAC;IAED,EAAE,CAAC,KAAa;QACd,IAAI,IAAI,KAAK,KAAK;YAAE,OAAO,IAAI,CAAA;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;YAAE,OAAO,KAAK,CAAA;QAC1C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAA;QACnD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAA;QACnD,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,CAAA;QAChD,OAAO,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAA;IAChD,CAAC;IAED,0BAA0B;IAC1B,MAAM;QACJ,MAAM,IAAI,GAAa,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAA;QAC/C,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,KAAK,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAA;QACtE,IAAI,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAK,CAAA;aAClC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAY,CAAC,MAAM,EAAE,CAAC,CAAA;QACzE,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAA;QACzE,OAAO,IAAI,CAAA;IACb,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,KAA+B,EAAE,IAAc;QAC7D,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QAC/E,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAA;QACxE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAA;YAC7F,OAAO,IAAI,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAC/D,CAAC;QACD,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAA;QAC3E,OAAO,IAAI,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAA;IAC7D,CAAC;CACF;AAUD,SAAS,OAAO,CAAC,CAAoC,EAAE,CAAoC;IACzF,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAC9C,IAAI,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IACzC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;QAC3B,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;IAC1C,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,UAAU,CAAC,CAAW,EAAE,CAAW;IAC1C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACxB,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;QAAE,OAAO,KAAK,CAAA;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,CAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAY,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAW,CAAC;YAAE,OAAO,KAAK,CAAA;IACpE,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,iBAAiB,CACxB,KAAmC,EACnC,KAA8B;IAE9B,MAAM,GAAG,GAA4B,EAAE,CAAA;IACvC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,IAAI,IAAI,IAAI,KAAK;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAA;aACrC,IAAI,SAAS,IAAI,KAAK,CAAC,IAAI,CAAE;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC,OAAO,CAAA;IACtE,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,IAAI,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAA;IAC/C,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAAC,IAAc,EAAE,IAAY,EAAE,EAAU;IAC3D,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAA;IAC/C,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,QAAQ,CAAC,KAAK,CAAA;IACtC,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAW,CAAA;QACrC,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAA;QAChC,MAAM,QAAQ,GAAG,MAAM,GAAG,SAAS,CAAA;QACnC,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;YAAC,MAAM,GAAG,QAAQ,CAAC;YAAC,SAAQ;QAAC,CAAC;QACrD,IAAI,MAAM,IAAI,EAAE;YAAE,MAAK;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAA;QAC5C,MAAM,OAAO,GAAK,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,GAAG,MAAM,CAAC,CAAA;QAClD,IAAI,SAAS,KAAK,CAAC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC7C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACpB,CAAC;aAAM,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAA;QAC5C,CAAC;aAAM,CAAC;YACN,wDAAwD;YACxD,6DAA6D;YAC7D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAA;QACpD,CAAC;QACD,MAAM,GAAG,QAAQ,CAAA;IACnB,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;AAC9B,CAAC"}

package/dist/model/position.d.ts

@@ -0,0 +1,66 @@
+import type { DxNode } from './node.js';
+/**
+ * ResolvedPos is the path-aware view of a flat integer position.
+ *
+ * Walks from doc root to the closest ancestor whose content contains pos
+ * (sticky-left: positions on a block boundary belong to the parent).
+ *
+ * Internal arrays:
+ *   ancestors[0] is the root; ancestors[depth] is the closest ancestor.
+ *   indices[d] is the index inside ancestors[d-1] of ancestors[d]; indices[0] is unused.
+ *   bases[d] is the absolute position of the start of ancestors[d]'s content.
+ */
+export declare class ResolvedPos {
+    readonly pos: number;
+    private readonly ancestors;
+    private readonly indices;
+    private readonly bases;
+    constructor(pos: number, ancestors: ReadonlyArray<DxNode>, indices: ReadonlyArray<number>, bases: ReadonlyArray<number>);
+    /** Depth of the closest ancestor whose content contains pos. */
+    get depth(): number;
+    node(depth?: number): DxNode;
+    get parent(): DxNode;
+    /**
+     * For depth 0, returns 0 (root has no parent index).
+     * For depth > 0, returns the index of ancestors[depth] inside ancestors[depth-1].
+     */
+    index(depth?: number): number;
+    /** Offset of pos inside the parent's content. */
+    get parentOffset(): number;
+    /** Position right before the ancestor at depth d (its [open] boundary). */
+    before(depth: number): number;
+    /** Position right after the ancestor at depth d (its [close] boundary). */
+    after(depth: number): number;
+    /** First in-content position of the ancestor at depth d. */
+    start(depth?: number): number;
+    /** Last in-content position of the ancestor at depth d. */
+    end(depth?: number): number;
+    private checkDepth;
+}
+/**
+ * Return the depth at which the "top-level block" — the block sitting
+ * directly inside the doc root or inside a table_cell — lives. The returned
+ * depth `d` is such that `rp.node(d)` is that block and `rp.node(d - 1)`
+ * is its block container.
+ *
+ *   - doc > paragraph (depth 1): returns 1.
+ *   - doc > table > table_row > table_cell > paragraph (depth 4): returns 4
+ *     (the paragraph is the cell's top-level block).
+ *   - doc > list > list_item > paragraph (depth 3): returns 1 (the list is
+ *     the top-level block; list_item is a structural wrapper).
+ *   - doc > blockquote > paragraph (depth 2): returns 1 (blockquote is the
+ *     top-level block, matching the depth-1-only semantics v0.3a commands
+ *     had inside blockquotes).
+ *
+ * Heuristic: a node is treated as a "cell-like block container" only if its
+ * spec carries `isolating: true` (today: table_cell). The doc root always
+ * qualifies. This keeps blockquote (a block in its own right) as a top
+ * block — commands operate ON the blockquote, not on its inner paragraph —
+ * which preserves the v0.3a semantics every existing test relies on.
+ *
+ * Returns 0 only when `rp.depth === 0` (cursor sits between root children
+ * with no resolvable ancestor block) — callers must treat that as a no-op.
+ */
+export declare function findTopBlockDepth(rp: ResolvedPos): number;
+export declare function resolve(root: DxNode, pos: number): ResolvedPos;
+//# sourceMappingURL=position.d.ts.map

package/dist/model/position.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"position.d.ts","sourceRoot":"","sources":["../../src/model/position.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,WAAW,CAAA;AAEvC;;;;;;;;;;GAUG;AACH,qBAAa,WAAW;IAEpB,QAAQ,CAAC,GAAG,EAAE,MAAM;IACpB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,KAAK;gBAHb,GAAG,EAAE,MAAM,EACH,SAAS,EAAE,aAAa,CAAC,MAAM,CAAC,EAChC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,EAC9B,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC;IAG/C,gEAAgE;IAChE,IAAI,KAAK,IAAI,MAAM,CAElB;IAED,IAAI,CAAC,KAAK,GAAE,MAAmB,GAAG,MAAM;IAKxC,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED;;;OAGG;IACH,KAAK,CAAC,KAAK,GAAE,MAAmB,GAAG,MAAM;IAMzC,iDAAiD;IACjD,IAAI,YAAY,IAAI,MAAM,CAEzB;IAED,2EAA2E;IAC3E,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAQ7B,2EAA2E;IAC3E,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAQ5B,4DAA4D;IAC5D,KAAK,CAAC,KAAK,GAAE,MAAmB,GAAG,MAAM;IAKzC,2DAA2D;IAC3D,GAAG,CAAC,KAAK,GAAE,MAAmB,GAAG,MAAM;IAKvC,OAAO,CAAC,UAAU;CAKnB;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,WAAW,GAAG,MAAM,CAazD;AAED,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,WAAW,CAuC9D"}

package/dist/model/position.js

@@ -0,0 +1,158 @@
+/**
+ * ResolvedPos is the path-aware view of a flat integer position.
+ *
+ * Walks from doc root to the closest ancestor whose content contains pos
+ * (sticky-left: positions on a block boundary belong to the parent).
+ *
+ * Internal arrays:
+ *   ancestors[0] is the root; ancestors[depth] is the closest ancestor.
+ *   indices[d] is the index inside ancestors[d-1] of ancestors[d]; indices[0] is unused.
+ *   bases[d] is the absolute position of the start of ancestors[d]'s content.
+ */
+export class ResolvedPos {
+    pos;
+    ancestors;
+    indices;
+    bases;
+    constructor(pos, ancestors, indices, bases) {
+        this.pos = pos;
+        this.ancestors = ancestors;
+        this.indices = indices;
+        this.bases = bases;
+    }
+    /** Depth of the closest ancestor whose content contains pos. */
+    get depth() {
+        return this.ancestors.length - 1;
+    }
+    node(depth = this.depth) {
+        this.checkDepth(depth);
+        return this.ancestors[depth];
+    }
+    get parent() {
+        return this.node(this.depth);
+    }
+    /**
+     * For depth 0, returns 0 (root has no parent index).
+     * For depth > 0, returns the index of ancestors[depth] inside ancestors[depth-1].
+     */
+    index(depth = this.depth) {
+        this.checkDepth(depth);
+        if (depth === 0)
+            return 0;
+        return this.indices[depth];
+    }
+    /** Offset of pos inside the parent's content. */
+    get parentOffset() {
+        return this.pos - this.bases[this.depth];
+    }
+    /** Position right before the ancestor at depth d (its [open] boundary). */
+    before(depth) {
+        this.checkDepth(depth);
+        if (depth === 0) {
+            throw new RangeError('ResolvedPos.before: cannot take before(0) (root has no boundary)');
+        }
+        return this.bases[depth] - 1;
+    }
+    /** Position right after the ancestor at depth d (its [close] boundary). */
+    after(depth) {
+        this.checkDepth(depth);
+        if (depth === 0) {
+            throw new RangeError('ResolvedPos.after: cannot take after(0) (root has no boundary)');
+        }
+        return this.bases[depth] + this.ancestors[depth].content.size + 1;
+    }
+    /** First in-content position of the ancestor at depth d. */
+    start(depth = this.depth) {
+        this.checkDepth(depth);
+        return depth === 0 ? 0 : this.bases[depth];
+    }
+    /** Last in-content position of the ancestor at depth d. */
+    end(depth = this.depth) {
+        this.checkDepth(depth);
+        return this.start(depth) + this.ancestors[depth].content.size;
+    }
+    checkDepth(d) {
+        if (d < 0 || d > this.depth) {
+            throw new RangeError(`ResolvedPos: depth ${d} out of range [0, ${this.depth}]`);
+        }
+    }
+}
+/**
+ * Return the depth at which the "top-level block" — the block sitting
+ * directly inside the doc root or inside a table_cell — lives. The returned
+ * depth `d` is such that `rp.node(d)` is that block and `rp.node(d - 1)`
+ * is its block container.
+ *
+ *   - doc > paragraph (depth 1): returns 1.
+ *   - doc > table > table_row > table_cell > paragraph (depth 4): returns 4
+ *     (the paragraph is the cell's top-level block).
+ *   - doc > list > list_item > paragraph (depth 3): returns 1 (the list is
+ *     the top-level block; list_item is a structural wrapper).
+ *   - doc > blockquote > paragraph (depth 2): returns 1 (blockquote is the
+ *     top-level block, matching the depth-1-only semantics v0.3a commands
+ *     had inside blockquotes).
+ *
+ * Heuristic: a node is treated as a "cell-like block container" only if its
+ * spec carries `isolating: true` (today: table_cell). The doc root always
+ * qualifies. This keeps blockquote (a block in its own right) as a top
+ * block — commands operate ON the blockquote, not on its inner paragraph —
+ * which preserves the v0.3a semantics every existing test relies on.
+ *
+ * Returns 0 only when `rp.depth === 0` (cursor sits between root children
+ * with no resolvable ancestor block) — callers must treat that as a no-op.
+ */
+export function findTopBlockDepth(rp) {
+    // Walk from the deepest ancestor outward, returning the first depth whose
+    // parent is a "cell-like" container — the doc root (always) or any node
+    // whose spec sets `isolating: true` (today: table_cell). That's the
+    // innermost place where a block "lives at the top level of its container".
+    for (let d = rp.depth; d >= 1; d--) {
+        const parent = rp.node(d - 1);
+        const parentSpec = parent.type.spec;
+        if (parent.type.name === 'doc' || parentSpec.isolating === true) {
+            return d;
+        }
+    }
+    return rp.depth >= 1 ? 1 : 0;
+}
+export function resolve(root, pos) {
+    if (pos < 0 || pos > root.content.size) {
+        throw new RangeError(`resolve: position ${pos} out of range [0, ${root.content.size}]`);
+    }
+    const ancestors = [root];
+    const indices = [0];
+    const bases = [0];
+    let node = root;
+    let base = 0;
+    outer: while (!node.isLeaf) {
+        const localPos = pos - base;
+        let offset = 0;
+        for (let i = 0; i < node.content.childCount; i++) {
+            const child = node.content.child(i);
+            const childSize = child.nodeSize;
+            if (localPos < offset + 1) {
+                // Position is on the boundary before this child; current node stays as parent (sticky-left).
+                break outer;
+            }
+            const insideStart = offset + 1;
+            const insideEnd = insideStart + child.content.size;
+            if (localPos < insideEnd + 1) {
+                if (child.isLeaf) {
+                    // Treat leaf as terminal; parent stays as current node.
+                    break outer;
+                }
+                const childBase = base + insideStart;
+                ancestors.push(child);
+                indices.push(i);
+                bases.push(childBase);
+                node = child;
+                base = childBase;
+                continue outer;
+            }
+            offset += childSize;
+        }
+        break;
+    }
+    return new ResolvedPos(pos, ancestors, indices, bases);
+}
+//# sourceMappingURL=position.js.map

package/dist/model/position.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"position.js","sourceRoot":"","sources":["../../src/model/position.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,MAAM,OAAO,WAAW;IAEX;IACQ;IACA;IACA;IAJnB,YACW,GAAW,EACH,SAAgC,EAChC,OAA8B,EAC9B,KAA4B;QAHpC,QAAG,GAAH,GAAG,CAAQ;QACH,cAAS,GAAT,SAAS,CAAuB;QAChC,YAAO,GAAP,OAAO,CAAuB;QAC9B,UAAK,GAAL,KAAK,CAAuB;IAC5C,CAAC;IAEJ,gEAAgE;IAChE,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;IAClC,CAAC;IAED,IAAI,CAAC,QAAgB,IAAI,CAAC,KAAK;QAC7B,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;QACtB,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAE,CAAA;IAC/B,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAC9B,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,QAAgB,IAAI,CAAC,KAAK;QAC9B,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;QACtB,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,CAAC,CAAA;QACzB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAE,CAAA;IAC7B,CAAC;IAED,iDAAiD;IACjD,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,CAAA;IAC3C,CAAC;IAED,2EAA2E;IAC3E,MAAM,CAAC,KAAa;QAClB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;QACtB,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAChB,MAAM,IAAI,UAAU,CAAC,kEAAkE,CAAC,CAAA;QAC1F,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAE,GAAG,CAAC,CAAA;IAC/B,CAAC;IAED,2EAA2E;IAC3E,KAAK,CAAC,KAAa;QACjB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;QACtB,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAChB,MAAM,IAAI,UAAU,CAAC,gEAAgE,CAAC,CAAA;QACxF,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAE,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAE,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAA;IACrE,CAAC;IAED,4DAA4D;IAC5D,KAAK,CAAC,QAAgB,IAAI,CAAC,KAAK;QAC9B,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;QACtB,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAE,CAAA;IAC7C,CAAC;IAED,2DAA2D;IAC3D,GAAG,CAAC,QAAgB,IAAI,CAAC,KAAK;QAC5B,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAE,CAAC,OAAO,CAAC,IAAI,CAAA;IAChE,CAAC;IAEO,UAAU,CAAC,CAAS;QAC1B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC5B,MAAM,IAAI,UAAU,CAAC,sBAAsB,CAAC,qBAAqB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACjF,CAAC;IACH,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,iBAAiB,CAAC,EAAe;IAC/C,0EAA0E;IAC1E,wEAAwE;IACxE,oEAAoE;IACpE,2EAA2E;IAC3E,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7B,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,IAA+B,CAAA;QAC9D,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,UAAU,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAChE,OAAO,CAAC,CAAA;QACV,CAAC;IACH,CAAC;IACD,OAAO,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAC9B,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,IAAY,EAAE,GAAW;IAC/C,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,IAAI,UAAU,CAAC,qBAAqB,GAAG,qBAAqB,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAA;IACzF,CAAC;IACD,MAAM,SAAS,GAAa,CAAC,IAAI,CAAC,CAAA;IAClC,MAAM,OAAO,GAAa,CAAC,CAAC,CAAC,CAAA;IAC7B,MAAM,KAAK,GAAa,CAAC,CAAC,CAAC,CAAA;IAC3B,IAAI,IAAI,GAAG,IAAI,CAAA;IACf,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,GAAG,GAAG,IAAI,CAAA;QAC3B,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAW,CAAA;YAC7C,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAA;YAChC,IAAI,QAAQ,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,6FAA6F;gBAC7F,MAAM,KAAK,CAAA;YACb,CAAC;YACD,MAAM,WAAW,GAAG,MAAM,GAAG,CAAC,CAAA;YAC9B,MAAM,SAAS,GAAG,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAA;YAClD,IAAI,QAAQ,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC;gBAC7B,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;oBACjB,wDAAwD;oBACxD,MAAM,KAAK,CAAA;gBACb,CAAC;gBACD,MAAM,SAAS,GAAG,IAAI,GAAG,WAAW,CAAA;gBACpC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACrB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACf,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;gBACrB,IAAI,GAAG,KAAK,CAAA;gBACZ,IAAI,GAAG,SAAS,CAAA;gBAChB,SAAS,KAAK,CAAA;YAChB,CAAC;YACD,MAAM,IAAI,SAAS,CAAA;QACrB,CAAC;QACD,MAAK;IACP,CAAC;IACD,OAAO,IAAI,WAAW,CAAC,GAAG,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;AACxD,CAAC"}

package/dist/model/schema.d.ts

@@ -0,0 +1,28 @@
+import { Fragment } from './fragment.js';
+import type { Mark } from './mark.js';
+import { MarkType, type MarkSpec } from './mark.js';
+import { DxNode } from './node.js';
+import { NodeType, type NodeSpec } from './node-type.js';
+export interface SchemaSpec<N extends Record<string, NodeSpec> = Record<string, NodeSpec>, M extends Record<string, MarkSpec> = Record<string, MarkSpec>> {
+    nodes: N;
+    marks: M;
+}
+type NodeTypeMap<N extends Record<string, NodeSpec>> = {
+    readonly [K in keyof N]: NodeType;
+};
+type MarkTypeMap<M extends Record<string, MarkSpec>> = {
+    readonly [K in keyof M]: MarkType;
+};
+export declare class Schema<N extends Record<string, NodeSpec> = Record<string, NodeSpec>, M extends Record<string, MarkSpec> = Record<string, MarkSpec>> {
+    readonly nodes: NodeTypeMap<N>;
+    readonly marks: MarkTypeMap<M>;
+    private readonly compiled;
+    constructor(spec: SchemaSpec<N, M>);
+    text(text: string, marks?: ReadonlyArray<Mark>): DxNode;
+    node(name: keyof N | string, attrs: Record<string, unknown> | null, content?: ReadonlyArray<DxNode> | Fragment | null, marks?: ReadonlyArray<Mark>): DxNode;
+    /** Validates the content of a node (and recursively). Throws on mismatch. */
+    validateNode(node: DxNode): void;
+    private findTextType;
+}
+export {};
+//# sourceMappingURL=schema.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../../src/model/schema.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAiB,MAAM,eAAe,CAAA;AACvD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACrC,OAAO,EAAE,QAAQ,EAAE,KAAK,QAAQ,EAAE,MAAM,WAAW,CAAA;AACnD,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAA;AAClC,OAAO,EAAE,QAAQ,EAAE,KAAK,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AAExD,MAAM,WAAW,UAAU,CACzB,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,EAC7D,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC;IAE7D,KAAK,EAAE,CAAC,CAAA;IACR,KAAK,EAAE,CAAC,CAAA;CACT;AAED,KAAK,WAAW,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI;IAAE,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,QAAQ;CAAE,CAAA;AAC5F,KAAK,WAAW,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI;IAAE,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,QAAQ;CAAE,CAAA;AAS5F,qBAAa,MAAM,CACjB,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,EAC7D,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC;IAE7D,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAA;IAC9B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAA;IAE9B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA+B;gBAE5C,IAAI,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;IA2ClC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,GAAE,aAAa,CAAC,IAAI,CAAM,GAAG,MAAM;IAK3D,IAAI,CACF,IAAI,EAAE,MAAM,CAAC,GAAG,MAAM,EACtB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,EACrC,OAAO,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,QAAQ,GAAG,IAAI,EACjD,KAAK,GAAE,aAAa,CAAC,IAAI,CAAM,GAC9B,MAAM;IAWT,6EAA6E;IAC7E,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAahC,OAAO,CAAC,YAAY;CAOrB"}

package/dist/model/schema.js

@@ -0,0 +1,195 @@
+import { parseContentExpr } from './content-expr.js';
+import { Fragment } from './fragment.js';
+import { MarkType } from './mark.js';
+import { DxNode } from './node.js';
+import { NodeType } from './node-type.js';
+export class Schema {
+    nodes;
+    marks;
+    compiled;
+    constructor(spec) {
+        const nodeTypes = {};
+        for (const name of Object.keys(spec.nodes)) {
+            nodeTypes[name] = new NodeType(name, spec.nodes[name]);
+        }
+        const groups = new Map();
+        for (const name of Object.keys(nodeTypes)) {
+            const groupSpec = nodeTypes[name].spec.group;
+            if (!groupSpec)
+                continue;
+            for (const g of groupSpec.split(/\s+/)) {
+                if (!g)
+                    continue;
+                if (!groups.has(g))
+                    groups.set(g, []);
+                groups.get(g).push(nodeTypes[name]);
+            }
+        }
+        const compiled = new Map();
+        for (const name of Object.keys(nodeTypes)) {
+            const type = nodeTypes[name];
+            const source = type.spec.content ?? '';
+            const expr = parseContentExpr(source);
+            validateExprReferences(expr, nodeTypes, groups);
+            const resolveName = (n) => {
+                if (n in nodeTypes)
+                    return [nodeTypes[n]];
+                const g = groups.get(n);
+                return g ? g.slice() : undefined;
+            };
+            compiled.set(name, { type, contentExpr: expr, resolveName });
+        }
+        const marks = {};
+        const markNames = Object.keys(spec.marks);
+        for (let i = 0; i < markNames.length; i++) {
+            const n = markNames[i];
+            marks[n] = new MarkType(n, i, spec.marks[n]);
+        }
+        this.nodes = nodeTypes;
+        this.marks = marks;
+        this.compiled = compiled;
+    }
+    text(text, marks = []) {
+        const t = this.findTextType();
+        return DxNode.text(t, text, marks);
+    }
+    node(name, attrs, content, marks = []) {
+        const type = this.nodes[name];
+        if (!type)
+            throw new Error(`Schema.node: unknown node type '${String(name)}'`);
+        const finalAttrs = buildAttrs(type, attrs ?? {});
+        const finalContent = content instanceof Fragment
+            ? content
+            : Fragment.from(content ?? null);
+        return new DxNode(type, finalAttrs, finalContent, marks);
+    }
+    /** Validates the content of a node (and recursively). Throws on mismatch. */
+    validateNode(node) {
+        if (node.isText || node.isAtom)
+            return;
+        const compiled = this.compiled.get(node.type.name);
+        if (!compiled)
+            throw new Error(`Schema.validateNode: unknown node type '${node.type.name}'`);
+        const ok = matchExpr(compiled.contentExpr, node.content.children, 0, compiled.resolveName);
+        if (ok !== node.content.childCount) {
+            throw new Error(`Schema.validateNode: content does not match expression for '${node.type.name}'`);
+        }
+        for (const c of node.content.children)
+            this.validateNode(c);
+    }
+    findTextType() {
+        for (const name of Object.keys(this.nodes)) {
+            const t = this.nodes[name];
+            if (t.isText)
+                return t;
+        }
+        throw new Error('Schema: no text node type declared');
+    }
+}
+function buildAttrs(type, given) {
+    const specs = type.spec.attrs ?? {};
+    const out = {};
+    for (const name of Object.keys(specs)) {
+        if (name in given)
+            out[name] = given[name];
+        else if ('default' in specs[name])
+            out[name] = specs[name].default;
+        else
+            throw new Error(`Schema.node('${type.name}'): missing attribute '${name}'`);
+    }
+    for (const name of Object.keys(given)) {
+        if (!(name in specs))
+            out[name] = given[name];
+    }
+    return Object.freeze(out);
+}
+function validateExprReferences(expr, types, groups) {
+    switch (expr.kind) {
+        case 'empty': return;
+        case 'name':
+            if (!(expr.name in types) && !groups.has(expr.name)) {
+                throw new Error(`Schema: unknown content reference '${expr.name}'`);
+            }
+            return;
+        case 'seq':
+            for (const i of expr.items)
+                validateExprReferences(i, types, groups);
+            return;
+        case 'choice':
+            for (const o of expr.options)
+                validateExprReferences(o, types, groups);
+            return;
+        case 'star':
+        case 'plus':
+        case 'opt':
+            validateExprReferences(expr.inner, types, groups);
+            return;
+    }
+}
+/**
+ * Greedy match. Returns the number of children consumed if the expression matched at index, else -1.
+ * For v0.1 we use a greedy recursive-descent matcher: sufficient for unambiguous schemas.
+ * A proper DFA is a Track-B follow-up; current schemas (only the default schema for v0.1) are unambiguous.
+ */
+function matchExpr(expr, children, start, resolve) {
+    switch (expr.kind) {
+        case 'empty':
+            return start === children.length ? start : start;
+        case 'name': {
+            const accepts = resolve(expr.name);
+            if (!accepts)
+                return -1;
+            const c = children[start];
+            if (!c)
+                return -1;
+            return accepts.includes(c.type) ? start + 1 : -1;
+        }
+        case 'seq': {
+            let pos = start;
+            for (const item of expr.items) {
+                const next = matchExpr(item, children, pos, resolve);
+                if (next < 0)
+                    return -1;
+                pos = next;
+            }
+            return pos;
+        }
+        case 'choice': {
+            let best = -1;
+            for (const opt of expr.options) {
+                const r = matchExpr(opt, children, start, resolve);
+                if (r > best)
+                    best = r;
+            }
+            return best;
+        }
+        case 'star': {
+            let pos = start;
+            while (pos < children.length) {
+                const r = matchExpr(expr.inner, children, pos, resolve);
+                if (r < 0 || r === pos)
+                    break;
+                pos = r;
+            }
+            return pos;
+        }
+        case 'plus': {
+            const first = matchExpr(expr.inner, children, start, resolve);
+            if (first < 0)
+                return -1;
+            let pos = first;
+            while (pos < children.length) {
+                const r = matchExpr(expr.inner, children, pos, resolve);
+                if (r < 0 || r === pos)
+                    break;
+                pos = r;
+            }
+            return pos;
+        }
+        case 'opt': {
+            const r = matchExpr(expr.inner, children, start, resolve);
+            return r < 0 ? start : r;
+        }
+    }
+}
+//# sourceMappingURL=schema.js.map