@fewangsit/wangsvue-fats 1.0.1-rc.8 → 2.0.0-alpha.0

package/vendor/prosemirror-model/dist/index.es.js

@@ -226,18 +226,18 @@ class c {
   position in this fragment. The result object will be reused
   (overwritten) the next time the function is called. @internal
   */
-  findIndex(t, e = -1) {
+  findIndex(t) {
     if (t == 0)
       return O(0, t);
     if (t == this.size)
       return O(this.content.length, t);
     if (t > this.size || t < 0)
       throw new RangeError(`Position ${t} outside of fragment (${this})`);
-    for (let n = 0, i = 0; ; n++) {
-      let r = this.child(n), s = i + r.nodeSize;
-      if (s >= t)
-        return s == t || e > 0 ? O(n + 1, s) : O(n, i);
-      i = s;
+    for (let e = 0, n = 0; ; e++) {
+      let i = this.child(e), r = n + i.nodeSize;
+      if (r >= t)
+        return r == t ? O(e + 1, r) : O(e, n);
+      n = r;
     }
   }
   /**
@@ -301,9 +301,9 @@ class c {
   }
 }
 c.empty = new c([], 0);
-const v = { index: 0, offset: 0 };
+const R = { index: 0, offset: 0 };
 function O(l, t) {
-  return v.index = l, v.offset = t, v;
+  return R.index = l, R.offset = t, R;
 }
 function M(l, t) {
   if (l === t)
@@ -532,8 +532,8 @@ function _(l, t, e) {
 function $(l, t, e, n) {
   let { index: i, offset: r } = l.findIndex(t), s = l.maybeChild(i);
   if (r == t || s.isText)
-    return l.cut(0, t).append(e).append(l.cut(t));
-  let o = $(s.content, t - r - 1, e);
+    return n && !n.canReplace(i, i, e) ? null : l.cut(0, t).append(e).append(l.cut(t));
+  let o = $(s.content, t - r - 1, e, s);
   return o && l.replaceChild(i, s.copy(o));
 }
 function dt(l, t, e) {
@@ -553,7 +553,7 @@ function tt(l, t, e, n) {
       let s = l.parent, o = s.content;
       return m(s, o.cut(0, l.parentOffset).append(e.content).append(o.cut(t.parentOffset)));
     } else {
-      let { start: s, end: o } = gt(e, l);
+      let { start: s, end: o } = yt(e, l);
       return m(r, nt(l, s, o, t, n));
     }
   else return m(r, A(l, t, n));
@@ -592,7 +592,7 @@ function A(l, t, e) {
   }
   return k(t, null, e, n), new c(n);
 }
-function gt(l, t) {
+function yt(l, t) {
   let e = t.depth - l.openStart, i = t.node(e).copy(l.content);
   for (let r = e - 1; r >= 0; r--)
     i = t.node(r).copy(c.from(i));
@@ -601,7 +601,7 @@ function gt(l, t) {
     end: i.resolveNoCache(i.content.size - l.openEnd - e)
   };
 }
-class S {
+class E {
   /**
   @internal
   */
@@ -829,7 +829,7 @@ class S {
         break;
       r = a - 1, i += h + 1;
     }
-    return new S(e, n, r);
+    return new E(e, n, r);
   }
   /**
   @internal
@@ -843,12 +843,12 @@ class S {
           return s;
       }
     else
-      L.set(t, n = new yt());
-    let i = n.elts[n.i] = S.resolve(t, e);
+      L.set(t, n = new gt());
+    let i = n.elts[n.i] = E.resolve(t, e);
     return n.i = (n.i + 1) % xt, i;
   }
 }
-class yt {
+class gt {
   constructor() {
     this.elts = [], this.i = 0;
   }
@@ -895,7 +895,7 @@ class mt {
   }
 }
 const wt = /* @__PURE__ */ Object.create(null);
-class y {
+class g {
   /**
   @internal
   */
@@ -976,7 +976,7 @@ class y {
   `blockSeparator` is given, it will be inserted to separate text
   from different block nodes. If `leafText` is given, it'll be
   inserted for every non-text leaf node encountered, otherwise
-  [`leafText`](https://prosemirror.net/docs/ref/#model.NodeSpec^leafText) will be used.
+  [`leafText`](https://prosemirror.net/docs/ref/#model.NodeSpec.leafText) will be used.
   */
   textBetween(t, e, n, i) {
     return this.content.textBetween(t, e, n, i);
@@ -1020,14 +1020,14 @@ class y {
   the given content (or empty, if no content is given).
   */
   copy(t = null) {
-    return t == this.content ? this : new y(this.type, this.attrs, t, this.marks);
+    return t == this.content ? this : new g(this.type, this.attrs, t, this.marks);
   }
   /**
   Create a copy of this node, with the given set of marks instead
   of the node's own marks.
   */
   mark(t) {
-    return t == this.marks ? this : new y(this.type, this.attrs, this.content, t);
+    return t == this.marks ? this : new g(this.type, this.attrs, this.content, t);
   }
   /**
   Create a copy of this node with only the content between the
@@ -1099,13 +1099,13 @@ class y {
   [object](https://prosemirror.net/docs/ref/#model.ResolvedPos) with information about its context.
   */
   resolve(t) {
-    return S.resolveCached(this, t);
+    return E.resolveCached(this, t);
   }
   /**
   @internal
   */
   resolveNoCache(t) {
-    return S.resolve(this, t);
+    return E.resolve(this, t);
   }
   /**
   Test whether a given mark or mark type occurs in this document
@@ -1264,8 +1264,8 @@ class y {
     return r.type.checkAttrs(r.attrs), r;
   }
 }
-y.prototype.text = void 0;
-class N extends y {
+g.prototype.text = void 0;
+class z extends g {
   /**
   @internal
   */
@@ -1287,10 +1287,10 @@ class N extends y {
     return this.text.length;
   }
   mark(t) {
-    return t == this.marks ? this : new N(this.type, this.attrs, this.text, t);
+    return t == this.marks ? this : new z(this.type, this.attrs, this.text, t);
   }
   withText(t) {
-    return t == this.text ? this : new N(this.type, this.attrs, t, this.marks);
+    return t == this.text ? this : new z(this.type, this.attrs, t, this.marks);
   }
   cut(t = 0, e = this.text.length) {
     return t == 0 && e == this.text.length ? this : this.withText(this.text.slice(t, e));
@@ -1393,9 +1393,9 @@ class w {
         let { type: f, next: p } = s.next[a];
         if (!(f.isText || f.hasRequiredAttrs()) && i.indexOf(p) == -1) {
           i.push(p);
-          let g = r(p, o.concat(f));
-          if (g)
-            return g;
+          let y = r(p, o.concat(f));
+          if (y)
+            return y;
         }
       }
       return null;
@@ -1509,7 +1509,7 @@ function Et(l) {
     else if (l.eat("?"))
       t = { type: "opt", expr: t };
     else if (l.eat("{"))
-      t = Ot(l, t);
+      t = Ct(l, t);
     else
       break;
   return t;
@@ -1519,11 +1519,11 @@ function W(l) {
   let t = Number(l.next);
   return l.pos++, t;
 }
-function Ot(l, t) {
+function Ct(l, t) {
   let e = W(l), n = e;
   return l.eat(",") && (l.next != "}" ? n = W(l) : n = -1), l.eat("}") || l.err("Unclosed braced range"), { type: "range", min: e, max: n, expr: t };
 }
-function Ct(l, t) {
+function Ot(l, t) {
   let e = l.nodeTypes, n = e[t];
   if (n)
     return [n];
@@ -1541,7 +1541,7 @@ function bt(l) {
   } else if (/\W/.test(l.next))
     l.err("Unexpected token '" + l.next + "'");
   else {
-    let t = Ct(l, l.next).map((e) => (l.inline == null ? l.inline = e.isInline : l.inline != e.isInline && l.err("Mixing inline and block content"), { type: "name", value: e }));
+    let t = Ot(l, l.next).map((e) => (l.inline == null ? l.inline = e.isInline : l.inline != e.isInline && l.err("Mixing inline and block content"), { type: "name", value: e }));
     return l.pos++, t.length == 1 ? t[0] : { type: "choice", exprs: t };
   }
 }
@@ -1689,10 +1689,10 @@ function at(l, t) {
   let e = /* @__PURE__ */ Object.create(null);
   if (t)
     for (let n in t)
-      e[n] = new zt(l, n, t[n]);
+      e[n] = new Nt(l, n, t[n]);
   return e;
 }
-class z {
+class N {
   /**
   @internal
   */
@@ -1771,7 +1771,7 @@ class z {
   create(t = null, e, n) {
     if (this.isText)
       throw new Error("NodeType.create can't construct text nodes");
-    return new y(this, this.computeAttrs(t), c.from(e), u.setFrom(n));
+    return new g(this, this.computeAttrs(t), c.from(e), u.setFrom(n));
   }
   /**
   Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but check the given content
@@ -1779,7 +1779,7 @@ class z {
   if it doesn't match.
   */
   createChecked(t = null, e, n) {
-    return e = c.from(e), this.checkContent(e), new y(this, this.computeAttrs(t), e, u.setFrom(n));
+    return e = c.from(e), this.checkContent(e), new g(this, this.computeAttrs(t), e, u.setFrom(n));
   }
   /**
   Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but see if it is
@@ -1797,7 +1797,7 @@ class z {
       e = s.append(e);
     }
     let i = this.contentMatch.matchFragment(e), r = i && i.fillBefore(c.empty, !0);
-    return r ? new y(this, t, e.append(r), u.setFrom(n)) : null;
+    return r ? new g(this, t, e.append(r), u.setFrom(n)) : null;
   }
   /**
   Returns true if the given fragment is valid content for this node
@@ -1860,7 +1860,7 @@ class z {
   */
   static compile(t, e) {
     let n = /* @__PURE__ */ Object.create(null);
-    t.forEach((r, s) => n[r] = new z(r, e, s));
+    t.forEach((r, s) => n[r] = new N(r, e, s));
     let i = e.spec.topNode || "doc";
     if (!n[i])
       throw new RangeError("Schema is missing its top node type ('" + i + "')");
@@ -1871,7 +1871,7 @@ class z {
     return n;
   }
 }
-function Nt(l, t, e) {
+function zt(l, t, e) {
   let n = e.split("|");
   return (i) => {
     let r = i === null ? "null" : typeof i;
@@ -1879,9 +1879,9 @@ function Nt(l, t, e) {
       throw new RangeError(`Expected value of type ${n} for attribute ${t} on type ${l}, got ${r}`);
   };
 }
-class zt {
+class Nt {
   constructor(t, e, n) {
-    this.hasDefault = Object.prototype.hasOwnProperty.call(n, "default"), this.default = n.default, this.validate = typeof n.validate == "string" ? Nt(t, e, n.validate) : n.validate;
+    this.hasDefault = Object.prototype.hasOwnProperty.call(n, "default"), this.default = n.default, this.validate = typeof n.validate == "string" ? zt(t, e, n.validate) : n.validate;
   }
   get isRequired() {
     return !this.hasDefault;
@@ -1951,7 +1951,7 @@ class qt {
     let e = this.spec = {};
     for (let i in t)
       e[i] = t[i];
-    e.nodes = q.from(t.nodes), e.marks = q.from(t.marks || {}), this.nodes = z.compile(this.spec.nodes, this), this.marks = F.compile(this.spec.marks, this);
+    e.nodes = q.from(t.nodes), e.marks = q.from(t.marks || {}), this.nodes = N.compile(this.spec.nodes, this), this.marks = F.compile(this.spec.marks, this);
     let n = /* @__PURE__ */ Object.create(null);
     for (let i in this.nodes) {
       if (i in this.marks)
@@ -1970,7 +1970,7 @@ class qt {
       let r = this.marks[i], s = r.spec.excludes;
       r.excluded = s == null ? [r] : s == "" ? [] : U(this, s.split(" "));
     }
-    this.nodeFromJSON = this.nodeFromJSON.bind(this), this.markFromJSON = this.markFromJSON.bind(this), this.topNodeType = this.nodes[this.spec.topNode || "doc"], this.cached.wrappings = /* @__PURE__ */ Object.create(null);
+    this.nodeFromJSON = (i) => g.fromJSON(this, i), this.markFromJSON = (i) => u.fromJSON(this, i), this.topNodeType = this.nodes[this.spec.topNode || "doc"], this.cached.wrappings = /* @__PURE__ */ Object.create(null);
   }
   /**
   Create a node in this schema. The `type` may be a string or a
@@ -1981,7 +1981,7 @@ class qt {
   node(t, e = null, n, i) {
     if (typeof t == "string")
       t = this.nodeType(t);
-    else if (t instanceof z) {
+    else if (t instanceof N) {
       if (t.schema != this)
         throw new RangeError("Node type from different schema used (" + t.name + ")");
     } else throw new RangeError("Invalid node type: " + t);
@@ -1993,7 +1993,7 @@ class qt {
   */
   text(t, e) {
     let n = this.nodes.text;
-    return new N(n, n.defaultAttrs, t, u.setFrom(e));
+    return new z(n, n.defaultAttrs, t, u.setFrom(e));
   }
   /**
   Create a mark with the given type and attributes.
@@ -2002,20 +2002,6 @@ class qt {
     return typeof t == "string" && (t = this.marks[t]), t.create(e);
   }
   /**
-  Deserialize a node from its JSON representation. This method is
-  bound.
-  */
-  nodeFromJSON(t) {
-    return y.fromJSON(this, t);
-  }
-  /**
-  Deserialize a mark from its JSON representation. This method is
-  bound.
-  */
-  markFromJSON(t) {
-    return u.fromJSON(this, t);
-  }
-  /**
   @internal
   */
   nodeType(t) {
@@ -2041,10 +2027,10 @@ function U(l, t) {
   }
   return e;
 }
-function vt(l) {
+function Rt(l) {
   return l.tag != null;
 }
-function Rt(l) {
+function vt(l) {
   return l.style != null;
 }
 class P {
@@ -2056,9 +2042,9 @@ class P {
     this.schema = t, this.rules = e, this.tags = [], this.styles = [];
     let n = this.matchedStyles = [];
     e.forEach((i) => {
-      if (vt(i))
+      if (Rt(i))
         this.tags.push(i);
-      else if (Rt(i)) {
+      else if (vt(i)) {
         let r = /[^=]*/.exec(i.style)[0];
         n.indexOf(r) < 0 && n.push(r), this.styles.push(i);
       }
@@ -2156,7 +2142,7 @@ class P {
   /**
   Construct a DOM parser using the parsing rules listed in a
   schema's [node specs](https://prosemirror.net/docs/ref/#model.NodeSpec.parseDOM), reordered by
-  [priority](https://prosemirror.net/docs/ref/#model.ParseRule.priority).
+  [priority](https://prosemirror.net/docs/ref/#model.GenericParseRule.priority).
   */
   static fromSchema(t) {
     return t.cached.domParser || (t.cached.domParser = new P(t, P.schemaRules(t)));
@@ -2202,13 +2188,13 @@ const ft = {
   script: !0,
   style: !0,
   title: !0
-}, ct = { ol: !0, ul: !0 }, E = 1, B = 2, b = 4;
+}, ct = { ol: !0, ul: !0 }, C = 1, B = 2, S = 4;
 function V(l, t, e) {
-  return t != null ? (t ? E : 0) | (t === "full" ? B : 0) : l && l.whitespace == "pre" ? E | B : e & -5;
+  return t != null ? (t ? C : 0) | (t === "full" ? B : 0) : l && l.whitespace == "pre" ? C | B : e & ~S;
 }
-class C {
+class b {
   constructor(t, e, n, i, r, s) {
-    this.type = t, this.attrs = e, this.marks = n, this.solid = i, this.options = s, this.content = [], this.activeMarks = u.none, this.match = r || (s & b ? null : t.contentMatch);
+    this.type = t, this.attrs = e, this.marks = n, this.solid = i, this.options = s, this.content = [], this.activeMarks = u.none, this.match = r || (s & S ? null : t.contentMatch);
   }
   findWrapping(t) {
     if (!this.match) {
@@ -2225,7 +2211,7 @@ class C {
     return this.match.findWrapping(t.type);
   }
   finish(t) {
-    if (!(this.options & E)) {
+    if (!(this.options & C)) {
       let n = this.content[this.content.length - 1], i;
       if (n && n.isText && (i = /[ \t\r\n\u000c]+$/.exec(n.text))) {
         let r = n;
@@ -2242,8 +2228,8 @@ class C {
 class G {
   constructor(t, e, n) {
     this.parser = t, this.options = e, this.isOpen = n, this.open = 0, this.localPreserveWS = !1;
-    let i = e.topNode, r, s = V(null, e.preserveWhitespace, 0) | (n ? b : 0);
-    i ? r = new C(i.type, i.attrs, u.none, !0, e.topMatch || i.type.contentMatch, s) : n ? r = new C(null, null, u.none, !0, null, s) : r = new C(t.schema.topNodeType, null, u.none, !0, null, s), this.nodes = [r], this.find = e.findPositions, this.needsBlock = !1;
+    let i = e.topNode, r, s = V(null, e.preserveWhitespace, 0) | (n ? S : 0);
+    i ? r = new b(i.type, i.attrs, u.none, !0, e.topMatch || i.type.contentMatch, s) : n ? r = new b(null, null, u.none, !0, null, s) : r = new b(t.schema.topNodeType, null, u.none, !0, null, s), this.nodes = [r], this.find = e.findPositions, this.needsBlock = !1;
   }
   get top() {
     return this.nodes[this.open];
@@ -2255,16 +2241,24 @@ class G {
     t.nodeType == 3 ? this.addTextNode(t, e) : t.nodeType == 1 && this.addElement(t, e);
   }
   addTextNode(t, e) {
-    let n = t.nodeValue, i = this.top, r = i.options & B ? "full" : this.localPreserveWS || (i.options & E) > 0;
+    let n = t.nodeValue, i = this.top, r = i.options & B ? "full" : this.localPreserveWS || (i.options & C) > 0, { schema: s } = this.parser;
     if (r === "full" || i.inlineContext(t) || /[^ \t\r\n\u000c]/.test(n)) {
       if (r)
-        r !== "full" ? n = n.replace(/\r?\n|\r/g, " ") : n = n.replace(/\r\n?/g, `
+        if (r === "full")
+          n = n.replace(/\r\n?/g, `
 `);
+        else if (s.linebreakReplacement && /[\r\n]/.test(n) && this.top.findWrapping(s.linebreakReplacement.create())) {
+          let o = n.split(/\r?\n|\r/);
+          for (let h = 0; h < o.length; h++)
+            h && this.insertNode(s.linebreakReplacement.create(), e, !0), o[h] && this.insertNode(s.text(o[h]), e, !/\S/.test(o[h]));
+          n = "";
+        } else
+          n = n.replace(/\r?\n|\r/g, " ");
       else if (n = n.replace(/[ \t\r\n\u000c]+/g, " "), /^[ \t\r\n\u000c]/.test(n) && this.open == this.nodes.length - 1) {
-        let s = i.content[i.content.length - 1], o = t.previousSibling;
-        (!s || o && o.nodeName == "BR" || s.isText && /[ \t\r\n\u000c]$/.test(s.text)) && (n = n.slice(1));
+        let o = i.content[i.content.length - 1], h = t.previousSibling;
+        (!o || h && h.nodeName == "BR" || o.isText && /[ \t\r\n\u000c]$/.test(o.text)) && (n = n.slice(1));
       }
-      n && this.insertNode(this.parser.schema.text(n), e, !/\S/.test(n)), this.findInText(t);
+      n && this.insertNode(s.text(n), e, !/\S/.test(n)), this.findInText(t);
     } else
       this.findInside(t);
   }
@@ -2417,9 +2411,9 @@ class G {
     let s = this.top;
     s.match = s.match && s.match.matchType(t);
     let o = V(t, r, s.options);
-    s.options & b && s.content.length == 0 && (o |= b);
+    s.options & S && s.content.length == 0 && (o |= S);
     let h = u.none;
-    return n = n.filter((a) => (s.type ? s.type.allowsMarkType(a.type) : K(a.type, t)) ? (h = a.addToSet(h), !1) : !0), this.nodes.push(new C(t, e, h, i, null, o)), this.open++, n;
+    return n = n.filter((a) => (s.type ? s.type.allowsMarkType(a.type) : K(a.type, t)) ? (h = a.addToSet(h), !1) : !0), this.nodes.push(new b(t, e, h, i, null, o)), this.open++, n;
   }
   // Make sure all nodes above this.open are finished and added to
   // their parents
@@ -2438,7 +2432,7 @@ class G {
     for (let e = this.open; e >= 0; e--) {
       if (this.nodes[e] == t)
         return this.open = e, !0;
-      this.localPreserveWS && (this.nodes[e].options |= E);
+      this.localPreserveWS && (this.nodes[e].options |= C);
     }
     return !1;
   }
@@ -2566,7 +2560,7 @@ class ut {
   nodes.
   */
   serializeFragment(t, e = {}, n) {
-    n || (n = R(e).createDocumentFragment());
+    n || (n = v(e).createDocumentFragment());
     let i = n, r = [];
     return t.forEach((s) => {
       if (r.length || s.marks.length) {
@@ -2595,7 +2589,7 @@ class ut {
   @internal
   */
   serializeNodeInner(t, e) {
-    let { dom: n, contentDOM: i } = T(R(e), this.nodes[t.type.name](t), null, t.attrs);
+    let { dom: n, contentDOM: i } = T(v(e), this.nodes[t.type.name](t), null, t.attrs);
     if (i) {
       if (t.isLeaf)
         throw new RangeError("Content hole not allowed in a leaf node spec");
@@ -2623,7 +2617,7 @@ class ut {
   */
   serializeMark(t, e, n = {}) {
     let i = this.marks[t.type.name];
-    return i && T(R(n), i(t, e), null, t.attrs);
+    return i && T(v(n), i(t, e), null, t.attrs);
   }
   static renderSpec(t, e, n = null, i) {
     return T(t, e, n, i);
@@ -2658,7 +2652,7 @@ function Q(l) {
   }
   return t;
 }
-function R(l) {
+function v(l) {
   return l.document || window.document;
 }
 const X = /* @__PURE__ */ new WeakMap();
@@ -2701,18 +2695,18 @@ function T(l, t, e, n) {
     f = 2;
     for (let p in a)
       if (a[p] != null) {
-        let g = p.indexOf(" ");
-        g > 0 ? h.setAttributeNS(p.slice(0, g), p.slice(g + 1), a[p]) : h.setAttribute(p, a[p]);
+        let y = p.indexOf(" ");
+        y > 0 ? h.setAttributeNS(p.slice(0, y), p.slice(y + 1), a[p]) : p == "style" && h.style ? h.style.cssText = a[p] : h.setAttribute(p, a[p]);
       }
   }
   for (let p = f; p < t.length; p++) {
-    let g = t[p];
-    if (g === 0) {
+    let y = t[p];
+    if (y === 0) {
       if (p < t.length - 1 || p > f)
         throw new RangeError("Content hole must be the only child of its parent node");
       return { dom: h, contentDOM: h };
     } else {
-      let { dom: pt, contentDOM: J } = T(l, g, e, n);
+      let { dom: pt, contentDOM: J } = T(l, y, e, n);
       if (h.appendChild(pt), J) {
         if (o)
           throw new RangeError("Multiple content holes");
@@ -2726,11 +2720,12 @@ export {
   ut as D,
   c as F,
   u as M,
-  y as N,
+  g as N,
   I as R,
-  qt as S,
-  P as a,
-  d as b,
+  d as S,
+  F as a,
+  P as b,
   mt as c,
-  F as d
+  qt as d
 };
+//# sourceMappingURL=index.es.js.map