@quoreadmin/ui 1.11.0 → 1.11.1

package/dist/index326.js

@@ -1,248 +1,88 @@
-import P from "./index390.js";
-import { Mapping as k } from "./index317.js";
-import { Plugin as H, PluginKey as O } from "./index292.js";
-const D = 500;
-class c {
-  constructor(t, e) {
-    this.items = t, this.eventCount = e;
-  }
-  // Pop the latest event off the branch's history and apply it
-  // to a document transform.
-  popEvent(t, e) {
-    if (this.eventCount == 0)
-      return null;
-    let i = this.items.length;
-    for (; ; i--)
-      if (this.items.get(i - 1).selection) {
-        --i;
-        break;
-      }
-    let s, p;
-    e && (s = this.remapping(i, this.items.length), p = s.maps.length);
-    let l = t.tr, r, m, u = [], f = [];
-    return this.items.forEach((a, o) => {
-      if (!a.step) {
-        s || (s = this.remapping(i, o + 1), p = s.maps.length), p--, f.push(a);
-        return;
-      }
-      if (s) {
-        f.push(new g(a.map));
-        let d = a.step.map(s.slice(p)), v;
-        d && l.maybeStep(d).doc && (v = l.mapping.maps[l.mapping.maps.length - 1], u.push(new g(v, void 0, void 0, u.length + f.length))), p--, v && s.appendMap(v, p);
-      } else
-        l.maybeStep(a.step);
-      if (a.selection)
-        return r = s ? a.selection.map(s.slice(p)) : a.selection, m = new c(this.items.slice(0, i).append(f.reverse().concat(u)), this.eventCount - 1), !1;
-    }, this.items.length, 0), { remaining: m, transform: l, selection: r };
-  }
-  // Create a new branch with the given transform added.
-  addTransform(t, e, i, s) {
-    let p = [], l = this.eventCount, r = this.items, m = !s && r.length ? r.get(r.length - 1) : null;
-    for (let f = 0; f < t.steps.length; f++) {
-      let a = t.steps[f].invert(t.docs[f]), o = new g(t.mapping.maps[f], a, e), d;
-      (d = m && m.merge(o)) && (o = d, f ? p.pop() : r = r.slice(0, r.length - 1)), p.push(o), e && (l++, e = void 0), s || (m = o);
-    }
-    let u = l - i.depth;
-    return u > y && (r = x(r, u), l -= u), new c(r.append(p), l);
-  }
-  remapping(t, e) {
-    let i = new k();
-    return this.items.forEach((s, p) => {
-      let l = s.mirrorOffset != null && p - s.mirrorOffset >= t ? i.maps.length - s.mirrorOffset : void 0;
-      i.appendMap(s.map, l);
-    }, t, e), i;
-  }
-  addMaps(t) {
-    return this.eventCount == 0 ? this : new c(this.items.append(t.map((e) => new g(e))), this.eventCount);
-  }
-  // When the collab module receives remote changes, the history has
-  // to know about those, so that it can adjust the steps that were
-  // rebased on top of the remote changes, and include the position
-  // maps for the remote changes in its array of items.
-  rebased(t, e) {
-    if (!this.eventCount)
-      return this;
-    let i = [], s = Math.max(0, this.items.length - e), p = t.mapping, l = t.steps.length, r = this.eventCount;
-    this.items.forEach((o) => {
-      o.selection && r--;
-    }, s);
-    let m = e;
-    this.items.forEach((o) => {
-      let d = p.getMirror(--m);
-      if (d == null)
-        return;
-      l = Math.min(l, d);
-      let v = p.maps[d];
-      if (o.step) {
-        let S = t.steps[d].invert(t.docs[d]), E = o.selection && o.selection.map(p.slice(m + 1, d));
-        E && r++, i.push(new g(v, S, E));
-      } else
-        i.push(new g(v));
-    }, s);
-    let u = [];
-    for (let o = e; o < l; o++)
-      u.push(new g(p.maps[o]));
-    let f = this.items.slice(0, s).append(u).append(i), a = new c(f, r);
-    return a.emptyItemCount() > D && (a = a.compress(this.items.length - i.length)), a;
-  }
-  emptyItemCount() {
-    let t = 0;
-    return this.items.forEach((e) => {
-      e.step || t++;
-    }), t;
-  }
-  // Compressing a branch means rewriting it to push the air (map-only
-  // items) out. During collaboration, these naturally accumulate
-  // because each remote change adds one. The `upto` argument is used
-  // to ensure that only the items below a given level are compressed,
-  // because `rebased` relies on a clean, untouched set of items in
-  // order to associate old items with rebased steps.
-  compress(t = this.items.length) {
-    let e = this.remapping(0, t), i = e.maps.length, s = [], p = 0;
-    return this.items.forEach((l, r) => {
-      if (r >= t)
-        s.push(l), l.selection && p++;
-      else if (l.step) {
-        let m = l.step.map(e.slice(i)), u = m && m.getMap();
-        if (i--, u && e.appendMap(u, i), m) {
-          let f = l.selection && l.selection.map(e.slice(i));
-          f && p++;
-          let a = new g(u.invert(), m, f), o, d = s.length - 1;
-          (o = s.length && s[d].merge(a)) ? s[d] = o : s.push(a);
-        }
-      } else l.map && i--;
-    }, this.items.length, 0), new c(P.from(s.reverse()), p);
-  }
-}
-c.empty = new c(P.empty, 0);
-function x(n, t) {
-  let e;
-  return n.forEach((i, s) => {
-    if (i.selection && t-- == 0)
-      return e = s, !1;
-  }), n.slice(e);
+import { ReplaceAroundStep as h, liftTarget as w, canJoin as C, findWrapping as L, canSplit as R } from "./index323.js";
+import { Fragment as s, Slice as I, NodeRange as x } from "./index325.js";
+function O(r, t = null) {
+  return function(e, l) {
+    let { $from: o, $to: n } = e.selection, f = o.blockRange(n);
+    if (!f)
+      return !1;
+    let i = l ? e.tr : null;
+    return S(i, f, r, t) ? (l && l(i.scrollIntoView()), !0) : !1;
+  };
 }
-class g {
-  constructor(t, e, i, s) {
-    this.map = t, this.step = e, this.selection = i, this.mirrorOffset = s;
-  }
-  merge(t) {
-    if (this.step && t.step && !t.selection) {
-      let e = t.step.merge(this.step);
-      if (e)
-        return new g(e.getMap().invert(), e, this.selection);
-    }
+function S(r, t, e, l = null) {
+  let o = !1, n = t, f = t.$from.doc;
+  if (t.depth >= 2 && t.$from.node(t.depth - 1).type.compatibleContent(e) && t.startIndex == 0) {
+    if (t.$from.index(t.depth - 1) == 0)
+      return !1;
+    let d = f.resolve(t.start - 2);
+    n = new x(d, d, t.depth), t.endIndex < t.parent.childCount && (t = new x(t.$from, f.resolve(t.$to.end(t.depth)), t.depth)), o = !0;
   }
+  let i = L(n, e, l, t);
+  return i ? (r && v(r, t, i, o, e), !0) : !1;
 }
-class h {
-  constructor(t, e, i, s, p) {
-    this.done = t, this.undone = e, this.prevRanges = i, this.prevTime = s, this.prevComposition = p;
-  }
+function v(r, t, e, l, o) {
+  let n = s.empty;
+  for (let u = e.length - 1; u >= 0; u--)
+    n = s.from(e[u].type.create(e[u].attrs, n));
+  r.step(new h(t.start - (l ? 2 : 0), t.end, t.start, t.end, new I(n, 0, 0), e.length, !0));
+  let f = 0;
+  for (let u = 0; u < e.length; u++)
+    e[u].type == o && (f = u + 1);
+  let i = e.length - f, d = t.start + e.length - (l ? 2 : 0), c = t.parent;
+  for (let u = t.startIndex, m = t.endIndex, p = !0; u < m; u++, p = !1)
+    !p && R(r.doc, d, i) && (r.split(d, i), d += 2 * i), d += c.child(u).nodeSize;
+  return r;
 }
-const y = 20;
-function F(n, t, e, i) {
-  let s = e.getMeta(w), p;
-  if (s)
-    return s.historyState;
-  e.getMeta(j) && (n = new h(n.done, n.undone, null, 0, -1));
-  let l = e.getMeta("appendedTransaction");
-  if (e.steps.length == 0)
-    return n;
-  if (l && l.getMeta(w))
-    return l.getMeta(w).redo ? new h(n.done.addTransform(e, void 0, i, M(t)), n.undone, I(e.mapping.maps), n.prevTime, n.prevComposition) : new h(n.done, n.undone.addTransform(e, void 0, i, M(t)), null, n.prevTime, n.prevComposition);
-  if (e.getMeta("addToHistory") !== !1 && !(l && l.getMeta("addToHistory") === !1)) {
-    let r = e.getMeta("composition"), m = n.prevTime == 0 || !l && n.prevComposition != r && (n.prevTime < (e.time || 0) - i.newGroupDelay || !G(e, n.prevRanges)), u = l ? C(n.prevRanges, e.mapping) : I(e.mapping.maps);
-    return new h(n.done.addTransform(e, m ? t.selection.getBookmark() : void 0, i, M(t)), c.empty, u, e.time, r ?? n.prevComposition);
-  } else return (p = e.getMeta("rebased")) ? new h(n.done.rebased(e, p), n.undone.rebased(e, p), C(n.prevRanges, e.mapping), n.prevTime, n.prevComposition) : new h(n.done.addMaps(e.mapping.maps), n.undone.addMaps(e.mapping.maps), C(n.prevRanges, e.mapping), n.prevTime, n.prevComposition);
+function V(r) {
+  return function(t, e) {
+    let { $from: l, $to: o } = t.selection, n = l.blockRange(o, (f) => f.childCount > 0 && f.firstChild.type == r);
+    return n ? e ? l.node(n.depth - 1).type == r ? b(t, e, r, n) : k(t, e, n) : !0 : !1;
+  };
 }
-function G(n, t) {
-  if (!t)
+function b(r, t, e, l) {
+  let o = r.tr, n = l.end, f = l.$to.end(l.depth);
+  n < f && (o.step(new h(n - 1, f, n, f, new I(s.from(e.create(null, l.parent.copy())), 1, 0), 1, !0)), l = new x(o.doc.resolve(l.$from.pos), o.doc.resolve(f), l.depth));
+  const i = w(l);
+  if (i == null)
     return !1;
-  if (!n.docChanged)
-    return !0;
-  let e = !1;
-  return n.mapping.maps[0].forEach((i, s) => {
-    for (let p = 0; p < t.length; p += 2)
-      i <= t[p + 1] && s >= t[p] && (e = !0);
-  }), e;
-}
-function I(n) {
-  let t = [];
-  for (let e = n.length - 1; e >= 0 && t.length == 0; e--)
-    n[e].forEach((i, s, p, l) => t.push(p, l));
-  return t;
-}
-function C(n, t) {
-  if (!n)
-    return null;
-  let e = [];
-  for (let i = 0; i < n.length; i += 2) {
-    let s = t.map(n[i], 1), p = t.map(n[i + 1], -1);
-    s <= p && e.push(s, p);
-  }
-  return e;
-}
-function K(n, t, e) {
-  let i = M(t), s = w.get(t).spec.config, p = (e ? n.undone : n.done).popEvent(t, i);
-  if (!p)
-    return null;
-  let l = p.selection.resolve(p.transform.doc), r = (e ? n.done : n.undone).addTransform(p.transform, t.selection.getBookmark(), s, i), m = new h(e ? r : p.remaining, e ? p.remaining : r, null, 0, -1);
-  return p.transform.setSelection(l).setMeta(w, { redo: e, historyState: m });
+  o.lift(l, i);
+  let d = o.doc.resolve(o.mapping.map(n, -1) - 1);
+  return C(o.doc, d.pos) && d.nodeBefore.type == d.nodeAfter.type && o.join(d.pos), t(o.scrollIntoView()), !0;
 }
-let T = !1, b = null;
-function M(n) {
-  let t = n.plugins;
-  if (b != t) {
-    T = !1, b = t;
-    for (let e = 0; e < t.length; e++)
-      if (t[e].spec.historyPreserveItems) {
-        T = !0;
-        break;
-      }
-  }
-  return T;
-}
-const w = new O("history"), j = new O("closeHistory");
-function W(n = {}) {
-  return n = {
-    depth: n.depth || 100,
-    newGroupDelay: n.newGroupDelay || 500
-  }, new H({
-    key: w,
-    state: {
-      init() {
-        return new h(c.empty, c.empty, null, 0, -1);
-      },
-      apply(t, e, i) {
-        return F(e, i, t, n);
-      }
-    },
-    config: n,
-    props: {
-      handleDOMEvents: {
-        beforeinput(t, e) {
-          let i = e.inputType, s = i == "historyUndo" ? A : i == "historyRedo" ? U : null;
-          return !s || !t.editable ? !1 : (e.preventDefault(), s(t.state, t.dispatch));
-        }
-      }
-    }
-  });
+function k(r, t, e) {
+  let l = r.tr, o = e.parent;
+  for (let a = e.end, $ = e.endIndex - 1, y = e.startIndex; $ > y; $--)
+    a -= o.child($).nodeSize, l.delete(a - 1, a + 1);
+  let n = l.doc.resolve(e.start), f = n.nodeAfter;
+  if (l.mapping.map(e.end) != e.start + n.nodeAfter.nodeSize)
+    return !1;
+  let i = e.startIndex == 0, d = e.endIndex == o.childCount, c = n.node(-1), u = n.index(-1);
+  if (!c.canReplace(u + (i ? 0 : 1), u + 1, f.content.append(d ? s.empty : s.from(o))))
+    return !1;
+  let m = n.pos, p = m + f.nodeSize;
+  return l.step(new h(m - (i ? 1 : 0), p + (d ? 1 : 0), m + 1, p - 1, new I((i ? s.empty : s.from(o.copy(s.empty))).append(d ? s.empty : s.from(o.copy(s.empty))), i ? 0 : 1, d ? 0 : 1), i ? 0 : 1)), t(l.scrollIntoView()), !0;
 }
-function R(n, t) {
-  return (e, i) => {
-    let s = w.getState(e);
-    if (!s || (n ? s.undone : s.done).eventCount == 0)
+function B(r) {
+  return function(t, e) {
+    let { $from: l, $to: o } = t.selection, n = l.blockRange(o, (c) => c.childCount > 0 && c.firstChild.type == r);
+    if (!n)
+      return !1;
+    let f = n.startIndex;
+    if (f == 0)
+      return !1;
+    let i = n.parent, d = i.child(f - 1);
+    if (d.type != r)
       return !1;
-    if (i) {
-      let p = K(s, e, n);
-      p && i(t ? p.scrollIntoView() : p);
+    if (e) {
+      let c = d.lastChild && d.lastChild.type == i.type, u = s.from(c ? r.create() : null), m = new I(s.from(r.create(null, s.from(i.type.create(null, u)))), c ? 3 : 1, 0), p = n.start, a = n.end;
+      e(t.tr.step(new h(p - (c ? 3 : 1), a, p, a, m, 1, !0)).scrollIntoView());
     }
     return !0;
   };
 }
-const A = R(!1, !0), U = R(!0, !0);
 export {
-  W as history,
-  U as redo,
-  A as undo
+  V as liftListItem,
+  B as sinkListItem,
+  O as wrapInList,
+  S as wrapRangeInList
 };