@fewangsit/wangsvue 1.5.219-alpha.0 → 1.5.219-alpha.2

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

@@ -1,95 +1,154 @@
-import { R as b } from "../../rope-sequence/dist/index.es.js";
-import { M as k } from "../../prosemirror-transform/dist/index.es.js";
-import { P as H, a as O } from "../../prosemirror-state/dist/index.es.js";
-const D = 500;
-class c {
-  constructor(t, e) {
-    this.items = t, this.eventCount = e;
+import { R as RopeSequence } from "../../rope-sequence/dist/index.es.js";
+import { M as Mapping } from "../../prosemirror-transform/dist/index.es.js";
+import { P as Plugin, a as PluginKey } from "../../prosemirror-state/dist/index.es.js";
+const max_empty_items = 500;
+class Branch {
+  constructor(items, eventCount) {
+    this.items = items;
+    this.eventCount = eventCount;
   }
   // Pop the latest event off the branch's history and apply it
   // to a document transform.
-  popEvent(t, e) {
+  popEvent(state, preserveItems) {
     if (this.eventCount == 0)
       return null;
-    let i = this.items.length;
-    for (; ; i--)
-      if (this.items.get(i - 1).selection) {
-        --i;
+    let end = this.items.length;
+    for (; ; end--) {
+      let next = this.items.get(end - 1);
+      if (next.selection) {
+        --end;
         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);
+    }
+    let remap, mapFrom;
+    if (preserveItems) {
+      remap = this.remapping(end, this.items.length);
+      mapFrom = remap.maps.length;
+    }
+    let transform = state.tr;
+    let selection, remaining;
+    let addAfter = [], addBefore = [];
+    this.items.forEach((item, i) => {
+      if (!item.step) {
+        if (!remap) {
+          remap = this.remapping(end, i + 1);
+          mapFrom = remap.maps.length;
+        }
+        mapFrom--;
+        addBefore.push(item);
         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 };
+      if (remap) {
+        addBefore.push(new Item(item.map));
+        let step = item.step.map(remap.slice(mapFrom)), map;
+        if (step && transform.maybeStep(step).doc) {
+          map = transform.mapping.maps[transform.mapping.maps.length - 1];
+          addAfter.push(new Item(map, void 0, void 0, addAfter.length + addBefore.length));
+        }
+        mapFrom--;
+        if (map)
+          remap.appendMap(map, mapFrom);
+      } else {
+        transform.maybeStep(item.step);
+      }
+      if (item.selection) {
+        selection = remap ? item.selection.map(remap.slice(mapFrom)) : item.selection;
+        remaining = new Branch(this.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this.eventCount - 1);
+        return false;
+      }
+    }, this.items.length, 0);
+    return { remaining, transform, selection };
   }
   // 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);
+  addTransform(transform, selection, histOptions, preserveItems) {
+    let newItems = [], eventCount = this.eventCount;
+    let oldItems = this.items, lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null;
+    for (let i = 0; i < transform.steps.length; i++) {
+      let step = transform.steps[i].invert(transform.docs[i]);
+      let item = new Item(transform.mapping.maps[i], step, selection), merged;
+      if (merged = lastItem && lastItem.merge(item)) {
+        item = merged;
+        if (i)
+          newItems.pop();
+        else
+          oldItems = oldItems.slice(0, oldItems.length - 1);
+      }
+      newItems.push(item);
+      if (selection) {
+        eventCount++;
+        selection = void 0;
+      }
+      if (!preserveItems)
+        lastItem = item;
+    }
+    let overflow = eventCount - histOptions.depth;
+    if (overflow > DEPTH_OVERFLOW) {
+      oldItems = cutOffEvents(oldItems, overflow);
+      eventCount -= overflow;
     }
-    let u = l - i.depth;
-    return u > y && (r = x(r, u), l -= u), new c(r.append(p), l);
+    return new Branch(oldItems.append(newItems), eventCount);
   }
-  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;
+  remapping(from, to) {
+    let maps = new Mapping();
+    this.items.forEach((item, i) => {
+      let mirrorPos = item.mirrorOffset != null && i - item.mirrorOffset >= from ? maps.maps.length - item.mirrorOffset : void 0;
+      maps.appendMap(item.map, mirrorPos);
+    }, from, to);
+    return maps;
   }
-  addMaps(t) {
-    return this.eventCount == 0 ? this : new c(this.items.append(t.map((e) => new g(e))), this.eventCount);
+  addMaps(array) {
+    if (this.eventCount == 0)
+      return this;
+    return new Branch(this.items.append(array.map((map) => new Item(map))), 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) {
+  rebased(rebasedTransform, rebasedCount) {
     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)
+    let rebasedItems = [], start = Math.max(0, this.items.length - rebasedCount);
+    let mapping = rebasedTransform.mapping;
+    let newUntil = rebasedTransform.steps.length;
+    let eventCount = this.eventCount;
+    this.items.forEach((item) => {
+      if (item.selection)
+        eventCount--;
+    }, start);
+    let iRebased = rebasedCount;
+    this.items.forEach((item) => {
+      let pos = mapping.getMirror(--iRebased);
+      if (pos == 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;
+      newUntil = Math.min(newUntil, pos);
+      let map = mapping.maps[pos];
+      if (item.step) {
+        let step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos]);
+        let selection = item.selection && item.selection.map(mapping.slice(iRebased + 1, pos));
+        if (selection)
+          eventCount++;
+        rebasedItems.push(new Item(map, step, selection));
+      } else {
+        rebasedItems.push(new Item(map));
+      }
+    }, start);
+    let newMaps = [];
+    for (let i = rebasedCount; i < newUntil; i++)
+      newMaps.push(new Item(mapping.maps[i]));
+    let items = this.items.slice(0, start).append(newMaps).append(rebasedItems);
+    let branch = new Branch(items, eventCount);
+    if (branch.emptyItemCount() > max_empty_items)
+      branch = branch.compress(this.items.length - rebasedItems.length);
+    return branch;
   }
   emptyItemCount() {
-    let t = 0;
-    return this.items.forEach((e) => {
-      e.step || t++;
-    }), t;
+    let count = 0;
+    this.items.forEach((item) => {
+      if (!item.step)
+        count++;
+    });
+    return count;
   }
   // Compressing a branch means rewriting it to push the air (map-only
   // items) out. During collaboration, these naturally accumulate
@@ -97,152 +156,201 @@ class c {
   // 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);
+  compress(upto = this.items.length) {
+    let remap = this.remapping(0, upto), mapFrom = remap.maps.length;
+    let items = [], events = 0;
+    this.items.forEach((item, i) => {
+      if (i >= upto) {
+        items.push(item);
+        if (item.selection)
+          events++;
+      } else if (item.step) {
+        let step = item.step.map(remap.slice(mapFrom)), map = step && step.getMap();
+        mapFrom--;
+        if (map)
+          remap.appendMap(map, mapFrom);
+        if (step) {
+          let selection = item.selection && item.selection.map(remap.slice(mapFrom));
+          if (selection)
+            events++;
+          let newItem = new Item(map.invert(), step, selection), merged, last = items.length - 1;
+          if (merged = items.length && items[last].merge(newItem))
+            items[last] = merged;
+          else
+            items.push(newItem);
         }
-      } else l.map && i--;
-    }, this.items.length, 0), new c(b.from(s.reverse()), p);
+      } else if (item.map) {
+        mapFrom--;
+      }
+    }, this.items.length, 0);
+    return new Branch(RopeSequence.from(items.reverse()), events);
   }
 }
-c.empty = new c(b.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);
+Branch.empty = new Branch(RopeSequence.empty, 0);
+function cutOffEvents(items, n) {
+  let cutPoint;
+  items.forEach((item, i) => {
+    if (item.selection && n-- == 0) {
+      cutPoint = i;
+      return false;
+    }
+  });
+  return items.slice(cutPoint);
 }
-class g {
-  constructor(t, e, i, s) {
-    this.map = t, this.step = e, this.selection = i, this.mirrorOffset = s;
+class Item {
+  constructor(map, step, selection, mirrorOffset) {
+    this.map = map;
+    this.step = step;
+    this.selection = selection;
+    this.mirrorOffset = mirrorOffset;
   }
-  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);
+  merge(other) {
+    if (this.step && other.step && !other.selection) {
+      let step = other.step.merge(this.step);
+      if (step)
+        return new Item(step.getMap().invert(), step, this.selection);
     }
   }
 }
-class h {
-  constructor(t, e, i, s, p) {
-    this.done = t, this.undone = e, this.prevRanges = i, this.prevTime = s, this.prevComposition = p;
+class HistoryState {
+  constructor(done, undone, prevRanges, prevTime, prevComposition) {
+    this.done = done;
+    this.undone = undone;
+    this.prevRanges = prevRanges;
+    this.prevTime = prevTime;
+    this.prevComposition = prevComposition;
   }
 }
-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);
+const DEPTH_OVERFLOW = 20;
+function applyTransaction(history2, state, tr, options) {
+  let historyTr = tr.getMeta(historyKey), rebased;
+  if (historyTr)
+    return historyTr.historyState;
+  if (tr.getMeta(closeHistoryKey))
+    history2 = new HistoryState(history2.done, history2.undone, null, 0, -1);
+  let appended = tr.getMeta("appendedTransaction");
+  if (tr.steps.length == 0) {
+    return history2;
+  } else if (appended && appended.getMeta(historyKey)) {
+    if (appended.getMeta(historyKey).redo)
+      return new HistoryState(history2.done.addTransform(tr, void 0, options, mustPreserveItems(state)), history2.undone, rangesFor(tr.mapping.maps), history2.prevTime, history2.prevComposition);
+    else
+      return new HistoryState(history2.done, history2.undone.addTransform(tr, void 0, options, mustPreserveItems(state)), null, history2.prevTime, history2.prevComposition);
+  } else if (tr.getMeta("addToHistory") !== false && !(appended && appended.getMeta("addToHistory") === false)) {
+    let composition = tr.getMeta("composition");
+    let newGroup = history2.prevTime == 0 || !appended && history2.prevComposition != composition && (history2.prevTime < (tr.time || 0) - options.newGroupDelay || !isAdjacentTo(tr, history2.prevRanges));
+    let prevRanges = appended ? mapRanges(history2.prevRanges, tr.mapping) : rangesFor(tr.mapping.maps);
+    return new HistoryState(history2.done.addTransform(tr, newGroup ? state.selection.getBookmark() : void 0, options, mustPreserveItems(state)), Branch.empty, prevRanges, tr.time, composition == null ? history2.prevComposition : composition);
+  } else if (rebased = tr.getMeta("rebased")) {
+    return new HistoryState(history2.done.rebased(tr, rebased), history2.undone.rebased(tr, rebased), mapRanges(history2.prevRanges, tr.mapping), history2.prevTime, history2.prevComposition);
+  } else {
+    return new HistoryState(history2.done.addMaps(tr.mapping.maps), history2.undone.addMaps(tr.mapping.maps), mapRanges(history2.prevRanges, tr.mapping), history2.prevTime, history2.prevComposition);
+  }
 }
-function G(n, t) {
-  if (!t)
-    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 isAdjacentTo(transform, prevRanges) {
+  if (!prevRanges)
+    return false;
+  if (!transform.docChanged)
+    return true;
+  let adjacent = false;
+  transform.mapping.maps[0].forEach((start, end) => {
+    for (let i = 0; i < prevRanges.length; i += 2)
+      if (start <= prevRanges[i + 1] && end >= prevRanges[i])
+        adjacent = true;
+  });
+  return adjacent;
 }
-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 rangesFor(maps) {
+  let result = [];
+  for (let i = maps.length - 1; i >= 0 && result.length == 0; i--)
+    maps[i].forEach((_from, _to, from, to) => result.push(from, to));
+  return result;
 }
-function C(n, t) {
-  if (!n)
+function mapRanges(ranges, mapping) {
+  if (!ranges)
     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);
+  let result = [];
+  for (let i = 0; i < ranges.length; i += 2) {
+    let from = mapping.map(ranges[i], 1), to = mapping.map(ranges[i + 1], -1);
+    if (from <= to)
+      result.push(from, to);
   }
-  return e;
+  return result;
 }
-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)
+function histTransaction(history2, state, redo2) {
+  let preserveItems = mustPreserveItems(state);
+  let histOptions = historyKey.get(state).spec.config;
+  let pop = (redo2 ? history2.undone : history2.done).popEvent(state, preserveItems);
+  if (!pop)
     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 });
+  let selection = pop.selection.resolve(pop.transform.doc);
+  let added = (redo2 ? history2.done : history2.undone).addTransform(pop.transform, state.selection.getBookmark(), histOptions, preserveItems);
+  let newHist = new HistoryState(redo2 ? added : pop.remaining, redo2 ? pop.remaining : added, null, 0, -1);
+  return pop.transform.setSelection(selection).setMeta(historyKey, { redo: redo2, historyState: newHist });
 }
-let T = !1, P = null;
-function M(n) {
-  let t = n.plugins;
-  if (P != t) {
-    T = !1, P = t;
-    for (let e = 0; e < t.length; e++)
-      if (t[e].spec.historyPreserveItems) {
-        T = !0;
+let cachedPreserveItems = false, cachedPreserveItemsPlugins = null;
+function mustPreserveItems(state) {
+  let plugins = state.plugins;
+  if (cachedPreserveItemsPlugins != plugins) {
+    cachedPreserveItems = false;
+    cachedPreserveItemsPlugins = plugins;
+    for (let i = 0; i < plugins.length; i++)
+      if (plugins[i].spec.historyPreserveItems) {
+        cachedPreserveItems = true;
         break;
       }
   }
-  return T;
+  return cachedPreserveItems;
 }
-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,
+const historyKey = new PluginKey("history");
+const closeHistoryKey = new PluginKey("closeHistory");
+function history(config = {}) {
+  config = {
+    depth: config.depth || 100,
+    newGroupDelay: config.newGroupDelay || 500
+  };
+  return new Plugin({
+    key: historyKey,
     state: {
       init() {
-        return new h(c.empty, c.empty, null, 0, -1);
+        return new HistoryState(Branch.empty, Branch.empty, null, 0, -1);
       },
-      apply(t, e, i) {
-        return F(e, i, t, n);
+      apply(tr, hist, state) {
+        return applyTransaction(hist, state, tr, config);
       }
     },
-    config: n,
+    config,
     props: {
       handleDOMEvents: {
-        beforeinput(t, e) {
-          let i = e.inputType, s = i == "historyUndo" ? A : i == "historyRedo" ? U : null;
-          return s ? (e.preventDefault(), s(t.state, t.dispatch)) : !1;
+        beforeinput(view, e) {
+          let inputType = e.inputType;
+          let command = inputType == "historyUndo" ? undo : inputType == "historyRedo" ? redo : null;
+          if (!command)
+            return false;
+          e.preventDefault();
+          return command(view.state, view.dispatch);
         }
       }
     }
   });
 }
-function R(n, t) {
-  return (e, i) => {
-    let s = w.getState(e);
-    if (!s || (n ? s.undone : s.done).eventCount == 0)
-      return !1;
-    if (i) {
-      let p = K(s, e, n);
-      p && i(t ? p.scrollIntoView() : p);
+function buildCommand(redo2, scroll) {
+  return (state, dispatch) => {
+    let hist = historyKey.getState(state);
+    if (!hist || (redo2 ? hist.undone : hist.done).eventCount == 0)
+      return false;
+    if (dispatch) {
+      let tr = histTransaction(hist, state, redo2);
+      if (tr)
+        dispatch(scroll ? tr.scrollIntoView() : tr);
     }
-    return !0;
+    return true;
   };
 }
-const A = R(!1, !0), U = R(!0, !0);
+const undo = buildCommand(false, true);
+const redo = buildCommand(true, true);
 export {
-  W as h,
-  U as r,
-  A as u
+  history as h,
+  redo as r,
+  undo as u
 };