@quoreadmin/ui 1.7.3 → 1.7.4

package/dist/index299.js

@@ -1,25 +1,248 @@
-import r from "./index277.js";
-import { ObjectUtils as t } from "./index169.js";
-var n = {
-  root: function(a) {
-    var e = a.props, s = a.instance;
-    return ["p-badge p-component", {
-      "p-badge-no-gutter": t.isNotEmpty(e.value) && String(e.value).length === 1,
-      "p-badge-dot": t.isEmpty(e.value) && !s.$slots.default,
-      "p-badge-lg": e.size === "large",
-      "p-badge-xl": e.size === "xlarge",
-      "p-badge-info": e.severity === "info",
-      "p-badge-success": e.severity === "success",
-      "p-badge-warning": e.severity === "warning",
-      "p-badge-danger": e.severity === "danger",
-      "p-badge-secondary": e.severity === "secondary",
-      "p-badge-contrast": e.severity === "contrast"
-    }];
-  }
-}, d = r.extend({
-  name: "badge",
-  classes: n
-});
+import P from "./index371.js";
+import { Mapping as k } from "./index290.js";
+import { Plugin as H, PluginKey as O } from "./index253.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);
+}
+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);
+    }
+  }
+}
+class h {
+  constructor(t, e, i, s, p) {
+    this.done = t, this.undone = e, this.prevRanges = i, this.prevTime = s, this.prevComposition = p;
+  }
+}
+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 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 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 });
+}
+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 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);
+    }
+    return !0;
+  };
+}
+const A = R(!1, !0), U = R(!0, !0);
 export {
-  d as default
+  W as history,
+  U as redo,
+  A as undo
 };

package/dist/index300.js

@@ -1,5 +1,237 @@
-const n = 16.666666666666668, t = typeof performance < "u" ? () => performance.now() : () => Date.now(), o = typeof window < "u" ? (e) => window.requestAnimationFrame(e) : (e) => setTimeout(() => e(t()), n);
+import R from "./index301.js";
+const { toString: T } = Object.prototype, { getPrototypeOf: A } = Object, { iterator: g, toStringTag: S } = Symbol, F = /* @__PURE__ */ ((e) => (t) => {
+  const n = T.call(t);
+  return e[n] || (e[n] = n.slice(8, -1).toLowerCase());
+})(/* @__PURE__ */ Object.create(null)), f = (e) => (e = e.toLowerCase(), (t) => F(t) === e), O = (e) => (t) => typeof t === e, { isArray: p } = Array, a = O("undefined");
+function d(e) {
+  return e !== null && !a(e) && e.constructor !== null && !a(e.constructor) && c(e.constructor.isBuffer) && e.constructor.isBuffer(e);
+}
+const B = f("ArrayBuffer");
+function M(e) {
+  let t;
+  return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? t = ArrayBuffer.isView(e) : t = e && e.buffer && B(e.buffer), t;
+}
+const k = O("string"), c = O("function"), E = O("number"), y = (e) => e !== null && typeof e == "object", N = (e) => e === !0 || e === !1, w = (e) => {
+  if (F(e) !== "object")
+    return !1;
+  const t = A(e);
+  return (t === null || t === Object.prototype || Object.getPrototypeOf(t) === null) && !(S in e) && !(g in e);
+}, U = (e) => {
+  if (!y(e) || d(e))
+    return !1;
+  try {
+    return Object.keys(e).length === 0 && Object.getPrototypeOf(e) === Object.prototype;
+  } catch {
+    return !1;
+  }
+}, I = f("Date"), V = f("File"), _ = f("Blob"), q = f("FileList"), H = (e) => y(e) && c(e.pipe), z = (e) => {
+  let t;
+  return e && (typeof FormData == "function" && e instanceof FormData || c(e.append) && ((t = F(e)) === "formdata" || // detect form-data instance
+  t === "object" && c(e.toString) && e.toString() === "[object FormData]"));
+}, J = f("URLSearchParams"), [K, $, W, G] = ["ReadableStream", "Request", "Response", "Headers"].map(f), Q = (e) => e.trim ? e.trim() : e.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
+function m(e, t, { allOwnKeys: n = !1 } = {}) {
+  if (e === null || typeof e > "u")
+    return;
+  let r, s;
+  if (typeof e != "object" && (e = [e]), p(e))
+    for (r = 0, s = e.length; r < s; r++)
+      t.call(null, e[r], r, e);
+  else {
+    if (d(e))
+      return;
+    const o = n ? Object.getOwnPropertyNames(e) : Object.keys(e), i = o.length;
+    let l;
+    for (r = 0; r < i; r++)
+      l = o[r], t.call(null, e[l], l, e);
+  }
+}
+function P(e, t) {
+  if (d(e))
+    return null;
+  t = t.toLowerCase();
+  const n = Object.keys(e);
+  let r = n.length, s;
+  for (; r-- > 0; )
+    if (s = n[r], t === s.toLowerCase())
+      return s;
+  return null;
+}
+const u = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : global, L = (e) => !a(e) && e !== u;
+function h() {
+  const { caseless: e, skipUndefined: t } = L(this) && this || {}, n = {}, r = (s, o) => {
+    const i = e && P(n, o) || o;
+    w(n[i]) && w(s) ? n[i] = h(n[i], s) : w(s) ? n[i] = h({}, s) : p(s) ? n[i] = s.slice() : (!t || !a(s)) && (n[i] = s);
+  };
+  for (let s = 0, o = arguments.length; s < o; s++)
+    arguments[s] && m(arguments[s], r);
+  return n;
+}
+const X = (e, t, n, { allOwnKeys: r } = {}) => (m(t, (s, o) => {
+  n && c(s) ? e[o] = R(s, n) : e[o] = s;
+}, { allOwnKeys: r }), e), Y = (e) => (e.charCodeAt(0) === 65279 && (e = e.slice(1)), e), Z = (e, t, n, r) => {
+  e.prototype = Object.create(t.prototype, r), e.prototype.constructor = e, Object.defineProperty(e, "super", {
+    value: t.prototype
+  }), n && Object.assign(e.prototype, n);
+}, j = (e, t, n, r) => {
+  let s, o, i;
+  const l = {};
+  if (t = t || {}, e == null) return t;
+  do {
+    for (s = Object.getOwnPropertyNames(e), o = s.length; o-- > 0; )
+      i = s[o], (!r || r(i, e, t)) && !l[i] && (t[i] = e[i], l[i] = !0);
+    e = n !== !1 && A(e);
+  } while (e && (!n || n(e, t)) && e !== Object.prototype);
+  return t;
+}, v = (e, t, n) => {
+  e = String(e), (n === void 0 || n > e.length) && (n = e.length), n -= t.length;
+  const r = e.indexOf(t, n);
+  return r !== -1 && r === n;
+}, ee = (e) => {
+  if (!e) return null;
+  if (p(e)) return e;
+  let t = e.length;
+  if (!E(t)) return null;
+  const n = new Array(t);
+  for (; t-- > 0; )
+    n[t] = e[t];
+  return n;
+}, te = /* @__PURE__ */ ((e) => (t) => e && t instanceof e)(typeof Uint8Array < "u" && A(Uint8Array)), ne = (e, t) => {
+  const r = (e && e[g]).call(e);
+  let s;
+  for (; (s = r.next()) && !s.done; ) {
+    const o = s.value;
+    t.call(e, o[0], o[1]);
+  }
+}, re = (e, t) => {
+  let n;
+  const r = [];
+  for (; (n = e.exec(t)) !== null; )
+    r.push(n);
+  return r;
+}, se = f("HTMLFormElement"), oe = (e) => e.toLowerCase().replace(
+  /[-_\s]([a-z\d])(\w*)/g,
+  function(n, r, s) {
+    return r.toUpperCase() + s;
+  }
+), x = (({ hasOwnProperty: e }) => (t, n) => e.call(t, n))(Object.prototype), ie = f("RegExp"), C = (e, t) => {
+  const n = Object.getOwnPropertyDescriptors(e), r = {};
+  m(n, (s, o) => {
+    let i;
+    (i = t(s, o, e)) !== !1 && (r[o] = i || s);
+  }), Object.defineProperties(e, r);
+}, ce = (e) => {
+  C(e, (t, n) => {
+    if (c(e) && ["arguments", "caller", "callee"].indexOf(n) !== -1)
+      return !1;
+    const r = e[n];
+    if (c(r)) {
+      if (t.enumerable = !1, "writable" in t) {
+        t.writable = !1;
+        return;
+      }
+      t.set || (t.set = () => {
+        throw Error("Can not rewrite read-only method '" + n + "'");
+      });
+    }
+  });
+}, fe = (e, t) => {
+  const n = {}, r = (s) => {
+    s.forEach((o) => {
+      n[o] = !0;
+    });
+  };
+  return p(e) ? r(e) : r(String(e).split(t)), n;
+}, le = () => {
+}, ue = (e, t) => e != null && Number.isFinite(e = +e) ? e : t;
+function ae(e) {
+  return !!(e && c(e.append) && e[S] === "FormData" && e[g]);
+}
+const pe = (e) => {
+  const t = new Array(10), n = (r, s) => {
+    if (y(r)) {
+      if (t.indexOf(r) >= 0)
+        return;
+      if (d(r))
+        return r;
+      if (!("toJSON" in r)) {
+        t[s] = r;
+        const o = p(r) ? [] : {};
+        return m(r, (i, l) => {
+          const b = n(i, s + 1);
+          !a(b) && (o[l] = b);
+        }), t[s] = void 0, o;
+      }
+    }
+    return r;
+  };
+  return n(e, 0);
+}, de = f("AsyncFunction"), ye = (e) => e && (y(e) || c(e)) && c(e.then) && c(e.catch), D = ((e, t) => e ? setImmediate : t ? ((n, r) => (u.addEventListener("message", ({ source: s, data: o }) => {
+  s === u && o === n && r.length && r.shift()();
+}, !1), (s) => {
+  r.push(s), u.postMessage(n, "*");
+}))(`axios@${Math.random()}`, []) : (n) => setTimeout(n))(
+  typeof setImmediate == "function",
+  c(u.postMessage)
+), me = typeof queueMicrotask < "u" ? queueMicrotask.bind(u) : typeof process < "u" && process.nextTick || D, we = (e) => e != null && c(e[g]), Fe = {
+  isArray: p,
+  isArrayBuffer: B,
+  isBuffer: d,
+  isFormData: z,
+  isArrayBufferView: M,
+  isString: k,
+  isNumber: E,
+  isBoolean: N,
+  isObject: y,
+  isPlainObject: w,
+  isEmptyObject: U,
+  isReadableStream: K,
+  isRequest: $,
+  isResponse: W,
+  isHeaders: G,
+  isUndefined: a,
+  isDate: I,
+  isFile: V,
+  isBlob: _,
+  isRegExp: ie,
+  isFunction: c,
+  isStream: H,
+  isURLSearchParams: J,
+  isTypedArray: te,
+  isFileList: q,
+  forEach: m,
+  merge: h,
+  extend: X,
+  trim: Q,
+  stripBOM: Y,
+  inherits: Z,
+  toFlatObject: j,
+  kindOf: F,
+  kindOfTest: f,
+  endsWith: v,
+  toArray: ee,
+  forEachEntry: ne,
+  matchAll: re,
+  isHTMLForm: se,
+  hasOwnProperty: x,
+  hasOwnProp: x,
+  // an alias to avoid ESLint no-prototype-builtins detection
+  reduceDescriptors: C,
+  freezeMethods: ce,
+  toObjectSet: fe,
+  toCamelCase: oe,
+  noop: le,
+  toFiniteNumber: ue,
+  findKey: P,
+  global: u,
+  isContextDefined: L,
+  isSpecCompliantForm: ae,
+  toJSONObject: pe,
+  isAsyncFn: de,
+  isThenable: ye,
+  setImmediate: D,
+  asap: me,
+  isIterable: we
+};
 export {
-  n as defaultTimestep,
-  o as onNextFrame
+  Fe as default
 };

package/dist/index301.js

@@ -1,29 +1,8 @@
-function p(h) {
-  let n = [], s = [], i = 0, f = !1, o = !1;
-  const l = /* @__PURE__ */ new WeakSet(), u = {
-    schedule: (e, t = !1, r = !1) => {
-      const d = r && f, c = d ? n : s;
-      return t && l.add(e), c.indexOf(e) === -1 && (c.push(e), d && f && (i = n.length)), e;
-    },
-    cancel: (e) => {
-      const t = s.indexOf(e);
-      t !== -1 && s.splice(t, 1), l.delete(e);
-    },
-    process: (e) => {
-      if (f) {
-        o = !0;
-        return;
-      }
-      if (f = !0, [n, s] = [s, n], s.length = 0, i = n.length, i)
-        for (let t = 0; t < i; t++) {
-          const r = n[t];
-          r(e), l.has(r) && (u.schedule(r), h());
-        }
-      f = !1, o && (o = !1, u.process(e));
-    }
+function u(n, r) {
+  return function() {
+    return n.apply(r, arguments);
   };
-  return u;
 }
 export {
-  p as createRenderStep
+  u as default
 };