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

package/vendor/prosemirror-schema-list/dist/index.es.js

@@ -1,87 +1,129 @@
-import { b as h, f as y, l as C, c as L, a as R } from "../../prosemirror-transform/dist/index.es.js";
-import { F as u, b as I, c as x } from "../../prosemirror-model/dist/index.es.js";
-function V(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;
+import { b as ReplaceAroundStep, f as findWrapping, l as liftTarget, c as canJoin, a as canSplit } from "../../prosemirror-transform/dist/index.es.js";
+import { F as Fragment, b as Slice, c as NodeRange } from "../../prosemirror-model/dist/index.es.js";
+function wrapInList(listType, attrs = null) {
+  return function(state, dispatch) {
+    let { $from, $to } = state.selection;
+    let range = $from.blockRange($to);
+    if (!range)
+      return false;
+    let tr = dispatch ? state.tr : null;
+    if (!wrapRangeInList(tr, range, listType, attrs))
+      return false;
+    if (dispatch)
+      dispatch(tr.scrollIntoView());
+    return true;
   };
 }
-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;
+function wrapRangeInList(tr, range, listType, attrs = null) {
+  let doJoin = false, outerRange = range, doc = range.$from.doc;
+  if (range.depth >= 2 && range.$from.node(range.depth - 1).type.compatibleContent(listType) && range.startIndex == 0) {
+    if (range.$from.index(range.depth - 1) == 0)
+      return false;
+    let $insert = doc.resolve(range.start - 2);
+    outerRange = new NodeRange($insert, $insert, range.depth);
+    if (range.endIndex < range.parent.childCount)
+      range = new NodeRange(range.$from, doc.resolve(range.$to.end(range.depth)), range.depth);
+    doJoin = true;
   }
-  let i = y(n, e, l, t);
-  return i ? (r && b(r, t, i, o, e), !0) : !1;
+  let wrap = findWrapping(outerRange, listType, attrs, range);
+  if (!wrap)
+    return false;
+  if (tr)
+    doWrapInList(tr, range, wrap, doJoin, listType);
+  return true;
 }
-function b(r, t, e, l, o) {
-  let n = u.empty;
-  for (let s = e.length - 1; s >= 0; s--)
-    n = u.from(e[s].type.create(e[s].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 s = 0; s < e.length; s++)
-    e[s].type == o && (f = s + 1);
-  let i = e.length - f, d = t.start + e.length - (l ? 2 : 0), c = t.parent;
-  for (let s = t.startIndex, a = t.endIndex, p = !0; s < a; s++, p = !1)
-    !p && R(r.doc, d, i) && (r.split(d, i), d += 2 * i), d += c.child(s).nodeSize;
-  return r;
+function doWrapInList(tr, range, wrappers, joinBefore, listType) {
+  let content = Fragment.empty;
+  for (let i = wrappers.length - 1; i >= 0; i--)
+    content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));
+  tr.step(new ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end, new Slice(content, 0, 0), wrappers.length, true));
+  let found = 0;
+  for (let i = 0; i < wrappers.length; i++)
+    if (wrappers[i].type == listType)
+      found = i + 1;
+  let splitDepth = wrappers.length - found;
+  let splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent;
+  for (let i = range.startIndex, e = range.endIndex, first = true; i < e; i++, first = false) {
+    if (!first && canSplit(tr.doc, splitPos, splitDepth)) {
+      tr.split(splitPos, splitDepth);
+      splitPos += 2 * splitDepth;
+    }
+    splitPos += parent.child(i).nodeSize;
+  }
+  return tr;
 }
-function A(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 ? v(t, e, r, n) : k(t, e, n) : !0 : !1;
+function liftListItem(itemType) {
+  return function(state, dispatch) {
+    let { $from, $to } = state.selection;
+    let range = $from.blockRange($to, (node) => node.childCount > 0 && node.firstChild.type == itemType);
+    if (!range)
+      return false;
+    if (!dispatch)
+      return true;
+    if ($from.node(range.depth - 1).type == itemType)
+      return liftToOuterList(state, dispatch, itemType, range);
+    else
+      return liftOutOfList(state, dispatch, range);
   };
 }
-function v(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(u.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 = C(l);
-  if (i == null)
-    return !1;
-  o.lift(l, i);
-  let d = o.mapping.map(n, -1) - 1;
-  return L(o.doc, d) && o.join(d), t(o.scrollIntoView()), !0;
+function liftToOuterList(state, dispatch, itemType, range) {
+  let tr = state.tr, end = range.end, endOfList = range.$to.end(range.depth);
+  if (end < endOfList) {
+    tr.step(new ReplaceAroundStep(end - 1, endOfList, end, endOfList, new Slice(Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));
+    range = new NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);
+  }
+  const target = liftTarget(range);
+  if (target == null)
+    return false;
+  tr.lift(range, target);
+  let after = tr.mapping.map(end, -1) - 1;
+  if (canJoin(tr.doc, after))
+    tr.join(after);
+  dispatch(tr.scrollIntoView());
+  return true;
 }
-function k(r, t, e) {
-  let l = r.tr, o = e.parent;
-  for (let m = e.end, $ = e.endIndex - 1, w = e.startIndex; $ > w; $--)
-    m -= o.child($).nodeSize, l.delete(m - 1, m + 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), s = n.index(-1);
-  if (!c.canReplace(s + (i ? 0 : 1), s + 1, f.content.append(d ? u.empty : u.from(o))))
-    return !1;
-  let a = n.pos, p = a + f.nodeSize;
-  return l.step(new h(a - (i ? 1 : 0), p + (d ? 1 : 0), a + 1, p - 1, new I((i ? u.empty : u.from(o.copy(u.empty))).append(d ? u.empty : u.from(o.copy(u.empty))), i ? 0 : 1, d ? 0 : 1), i ? 0 : 1)), t(l.scrollIntoView()), !0;
+function liftOutOfList(state, dispatch, range) {
+  let tr = state.tr, list = range.parent;
+  for (let pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {
+    pos -= list.child(i).nodeSize;
+    tr.delete(pos - 1, pos + 1);
+  }
+  let $start = tr.doc.resolve(range.start), item = $start.nodeAfter;
+  if (tr.mapping.map(range.end) != range.start + $start.nodeAfter.nodeSize)
+    return false;
+  let atStart = range.startIndex == 0, atEnd = range.endIndex == list.childCount;
+  let parent = $start.node(-1), indexBefore = $start.index(-1);
+  if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1, item.content.append(atEnd ? Fragment.empty : Fragment.from(list))))
+    return false;
+  let start = $start.pos, end = start + item.nodeSize;
+  tr.step(new ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1, new Slice((atStart ? Fragment.empty : Fragment.from(list.copy(Fragment.empty))).append(atEnd ? Fragment.empty : Fragment.from(list.copy(Fragment.empty))), atStart ? 0 : 1, atEnd ? 0 : 1), atStart ? 0 : 1));
+  dispatch(tr.scrollIntoView());
+  return true;
 }
-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 (e) {
-      let c = d.lastChild && d.lastChild.type == i.type, s = u.from(c ? r.create() : null), a = new I(u.from(r.create(null, u.from(i.type.create(null, s)))), c ? 3 : 1, 0), p = n.start, m = n.end;
-      e(t.tr.step(new h(p - (c ? 3 : 1), m, p, m, a, 1, !0)).scrollIntoView());
+function sinkListItem(itemType) {
+  return function(state, dispatch) {
+    let { $from, $to } = state.selection;
+    let range = $from.blockRange($to, (node) => node.childCount > 0 && node.firstChild.type == itemType);
+    if (!range)
+      return false;
+    let startIndex = range.startIndex;
+    if (startIndex == 0)
+      return false;
+    let parent = range.parent, nodeBefore = parent.child(startIndex - 1);
+    if (nodeBefore.type != itemType)
+      return false;
+    if (dispatch) {
+      let nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;
+      let inner = Fragment.from(nestedBefore ? itemType.create() : null);
+      let slice = new Slice(Fragment.from(itemType.create(null, Fragment.from(parent.type.create(null, inner)))), nestedBefore ? 3 : 1, 0);
+      let before = range.start, after = range.end;
+      dispatch(state.tr.step(new ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after, before, after, slice, 1, true)).scrollIntoView());
     }
-    return !0;
+    return true;
   };
 }
 export {
-  A as l,
-  B as s,
-  V as w
+  liftListItem as l,
+  sinkListItem as s,
+  wrapInList as w
 };