@quoreadmin/ui 1.7.11 → 1.7.13

package/dist/index311.js

@@ -1,181 +1,88 @@
-import i from "./index297.js";
-import S from "./index366.js";
-const h = /* @__PURE__ */ Symbol("internals");
-function y(r) {
-  return r && String(r).trim().toLowerCase();
-}
-function m(r) {
-  return r === !1 || r == null ? r : i.isArray(r) ? r.map(m) : String(r);
+import { ReplaceAroundStep as h, liftTarget as w, canJoin as C, findWrapping as L, canSplit as R } from "./index308.js";
+import { Fragment as s, Slice as I, NodeRange as x } from "./index310.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 A(r) {
-  const t = /* @__PURE__ */ Object.create(null), e = /([^\s,;=]+)\s*(?:=\s*([^,;]+))?/g;
-  let s;
-  for (; s = e.exec(r); )
-    t[s[1]] = s[2];
-  return t;
+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;
 }
-const k = (r) => /^[-_a-zA-Z0-9^`|~,!#$%&'*+.]+$/.test(r.trim());
-function g(r, t, e, s, n) {
-  if (i.isFunction(s))
-    return s.call(this, t, e);
-  if (n && (t = e), !!i.isString(t)) {
-    if (i.isString(s))
-      return t.indexOf(s) !== -1;
-    if (i.isRegExp(s))
-      return s.test(t);
-  }
+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 E(r) {
-  return r.trim().toLowerCase().replace(/([a-z\d])(\w*)/g, (t, e, s) => e.toUpperCase() + s);
+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 j(r, t) {
-  const e = i.toCamelCase(" " + t);
-  ["get", "set", "has"].forEach((s) => {
-    Object.defineProperty(r, s + e, {
-      value: function(n, o, f) {
-        return this[s].call(this, t, n, o, f);
-      },
-      configurable: !0
-    });
-  });
+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;
 }
-class b {
-  constructor(t) {
-    t && this.set(t);
-  }
-  set(t, e, s) {
-    const n = this;
-    function o(c, l, a) {
-      const u = y(l);
-      if (!u)
-        throw new Error("header name must be a non-empty string");
-      const p = i.findKey(n, u);
-      (!p || n[p] === void 0 || a === !0 || a === void 0 && n[p] !== !1) && (n[p || l] = m(c));
-    }
-    const f = (c, l) => i.forEach(c, (a, u) => o(a, u, l));
-    if (i.isPlainObject(t) || t instanceof this.constructor)
-      f(t, e);
-    else if (i.isString(t) && (t = t.trim()) && !k(t))
-      f(S(t), e);
-    else if (i.isObject(t) && i.isIterable(t)) {
-      let c = {}, l, a;
-      for (const u of t) {
-        if (!i.isArray(u))
-          throw TypeError("Object iterator must return a key-value pair");
-        c[a = u[0]] = (l = c[a]) ? i.isArray(l) ? [...l, u[1]] : [l, u[1]] : u[1];
-      }
-      f(c, e);
-    } else
-      t != null && o(e, t, s);
-    return this;
-  }
-  get(t, e) {
-    if (t = y(t), t) {
-      const s = i.findKey(this, t);
-      if (s) {
-        const n = this[s];
-        if (!e)
-          return n;
-        if (e === !0)
-          return A(n);
-        if (i.isFunction(e))
-          return e.call(this, n, s);
-        if (i.isRegExp(e))
-          return e.exec(n);
-        throw new TypeError("parser must be boolean|regexp|function");
-      }
-    }
-  }
-  has(t, e) {
-    if (t = y(t), t) {
-      const s = i.findKey(this, t);
-      return !!(s && this[s] !== void 0 && (!e || g(this, this[s], s, e)));
-    }
+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;
-  }
-  delete(t, e) {
-    const s = this;
-    let n = !1;
-    function o(f) {
-      if (f = y(f), f) {
-        const c = i.findKey(s, f);
-        c && (!e || g(s, s[c], c, e)) && (delete s[c], n = !0);
-      }
-    }
-    return i.isArray(t) ? t.forEach(o) : o(t), n;
-  }
-  clear(t) {
-    const e = Object.keys(this);
-    let s = e.length, n = !1;
-    for (; s--; ) {
-      const o = e[s];
-      (!t || g(this, this[o], o, t, !0)) && (delete this[o], n = !0);
-    }
-    return n;
-  }
-  normalize(t) {
-    const e = this, s = {};
-    return i.forEach(this, (n, o) => {
-      const f = i.findKey(s, o);
-      if (f) {
-        e[f] = m(n), delete e[o];
-        return;
-      }
-      const c = t ? E(o) : String(o).trim();
-      c !== o && delete e[o], e[c] = m(n), s[c] = !0;
-    }), this;
-  }
-  concat(...t) {
-    return this.constructor.concat(this, ...t);
-  }
-  toJSON(t) {
-    const e = /* @__PURE__ */ Object.create(null);
-    return i.forEach(this, (s, n) => {
-      s != null && s !== !1 && (e[n] = t && i.isArray(s) ? s.join(", ") : s);
-    }), e;
-  }
-  [Symbol.iterator]() {
-    return Object.entries(this.toJSON())[Symbol.iterator]();
-  }
-  toString() {
-    return Object.entries(this.toJSON()).map(([t, e]) => t + ": " + e).join(`
-`);
-  }
-  getSetCookie() {
-    return this.get("set-cookie") || [];
-  }
-  get [Symbol.toStringTag]() {
-    return "AxiosHeaders";
-  }
-  static from(t) {
-    return t instanceof this ? t : new this(t);
-  }
-  static concat(t, ...e) {
-    const s = new this(t);
-    return e.forEach((n) => s.set(n)), s;
-  }
-  static accessor(t) {
-    const s = (this[h] = this[h] = {
-      accessors: {}
-    }).accessors, n = this.prototype;
-    function o(f) {
-      const c = y(f);
-      s[c] || (j(n, f), s[c] = !0);
-    }
-    return i.isArray(t) ? t.forEach(o) : o(t), this;
-  }
+  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;
 }
-b.accessor(["Content-Type", "Content-Length", "Accept", "Accept-Encoding", "User-Agent", "Authorization"]);
-i.reduceDescriptors(b.prototype, ({ value: r }, t) => {
-  let e = t[0].toUpperCase() + t.slice(1);
-  return {
-    get: () => r,
-    set(s) {
-      this[e] = s;
+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;
   };
-});
-i.freezeMethods(b);
+}
 export {
-  b as default
+  V as liftListItem,
+  B as sinkListItem,
+  O as wrapInList,
+  S as wrapRangeInList
 };