@gsc-basic/components 1.1.7 → 1.1.8

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

@@ -7,8 +7,95 @@ You shall not disclose such Confidential Information and shall use it only in
 accordance with the terms of the license agreement.
 
 --- Build Info ---
-Version: 1.1.6
-Build Time: 2026/3/4 16:49:40
-Build Commit: 63f88fe7a59965e471017742b570179ac37f5591
+Version: 1.1.7
+Build Time: 2026/3/13 18:25:06
+Build Commit: 0b162dea954baa715e67b70f80401a571205058a
 */
-import{ReplaceAroundStep as e,liftTarget as t,canJoin as n,findWrapping as r,canSplit as o}from"../../prosemirror-transform/dist/index.js";import{Fragment as l,Slice as d,NodeRange as p}from"../../prosemirror-model/dist/index.js";function i(e,t=null){return function(n,r){let{$from:o,$to:l}=n.selection,d=o.blockRange(l);if(!d)return!1;let p=r?n.tr:null;return!!f(p,d,e,t)&&(r&&r(p.scrollIntoView()),!0)}}function f(t,n,i,f=null){let c=!1,s=n,u=n.$from.doc;if(n.depth>=2&&n.$from.node(n.depth-1).type.compatibleContent(i)&&0==n.startIndex){if(0==n.$from.index(n.depth-1))return!1;let e=u.resolve(n.start-2);s=new p(e,e,n.depth),n.endIndex<n.parent.childCount&&(n=new p(n.$from,u.resolve(n.$to.end(n.depth)),n.depth)),c=!0}let a=r(s,i,f,n);return!!a&&(t&&function(t,n,r,p,i){let f=l.empty;for(let e=r.length-1;e>=0;e--)f=l.from(r[e].type.create(r[e].attrs,f));t.step(new e(n.start-(p?2:0),n.end,n.start,n.end,new d(f,0,0),r.length,!0));let c=0;for(let e=0;e<r.length;e++)r[e].type==i&&(c=e+1);let s=r.length-c,u=n.start+r.length-(p?2:0),a=n.parent;for(let e=n.startIndex,l=n.endIndex,d=!0;e<l;e++,d=!1)!d&&o(t.doc,u,s)&&(t.split(u,s),u+=2*s),u+=a.child(e).nodeSize}(t,n,a,c,i),!0)}function c(r){return function(o,i){let{$from:f,$to:c}=o.selection,s=f.blockRange(c,e=>e.childCount>0&&e.firstChild.type==r);return!!s&&(!i||(f.node(s.depth-1).type==r?function(r,o,i,f){let c=r.tr,s=f.end,u=f.$to.end(f.depth);s<u&&(c.step(new e(s-1,u,s,u,new d(l.from(i.create(null,f.parent.copy())),1,0),1,!0)),f=new p(c.doc.resolve(f.$from.pos),c.doc.resolve(u),f.depth));const a=t(f);if(null==a)return!1;c.lift(f,a);let m=c.doc.resolve(c.mapping.map(s,-1)-1);n(c.doc,m.pos)&&m.nodeBefore.type==m.nodeAfter.type&&c.join(m.pos);return o(c.scrollIntoView()),!0}(o,i,r,s):function(t,n,r){let o=t.tr,p=r.parent;for(let e=r.end,l=r.endIndex-1,d=r.startIndex;l>d;l--)e-=p.child(l).nodeSize,o.delete(e-1,e+1);let i=o.doc.resolve(r.start),f=i.nodeAfter;if(o.mapping.map(r.end)!=r.start+i.nodeAfter.nodeSize)return!1;let c=0==r.startIndex,s=r.endIndex==p.childCount,u=i.node(-1),a=i.index(-1);if(!u.canReplace(a+(c?0:1),a+1,f.content.append(s?l.empty:l.from(p))))return!1;let m=i.pos,h=m+f.nodeSize;return o.step(new e(m-(c?1:0),h+(s?1:0),m+1,h-1,new d((c?l.empty:l.from(p.copy(l.empty))).append(s?l.empty:l.from(p.copy(l.empty))),c?0:1,s?0:1),c?0:1)),n(o.scrollIntoView()),!0}(o,i,s)))}}function s(t){return function(n,r){let{$from:o,$to:p}=n.selection,i=o.blockRange(p,e=>e.childCount>0&&e.firstChild.type==t);if(!i)return!1;let f=i.startIndex;if(0==f)return!1;let c=i.parent,s=c.child(f-1);if(s.type!=t)return!1;if(r){let o=s.lastChild&&s.lastChild.type==c.type,p=l.from(o?t.create():null),f=new d(l.from(t.create(null,l.from(c.type.create(null,p)))),o?3:1,0),u=i.start,a=i.end;r(n.tr.step(new e(u-(o?3:1),a,u,a,f,1,!0)).scrollIntoView())}return!0}}export{c as liftListItem,s as sinkListItem,i as wrapInList,f as wrapRangeInList};
+import { ReplaceAroundStep as h, liftTarget as w, canJoin as C, findWrapping as L, canSplit as R } from "../../prosemirror-transform/dist/index.js";
+import { Fragment as s, Slice as I, NodeRange as x } from "../../prosemirror-model/dist/index.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;
+  };
+}
+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;
+}
+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;
+}
+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 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;
+  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;
+}
+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 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, 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;
+  };
+}
+export {
+  V as liftListItem,
+  B as sinkListItem,
+  O as wrapInList,
+  S as wrapRangeInList
+};