@quoreadmin/ui 1.8.8 → 1.8.9

package/dist/index319.js

@@ -1,248 +1,29 @@
-import P from "./index386.js";
-import { Mapping as k } from "./index310.js";
-import { Plugin as H, PluginKey as O } from "./index277.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);
+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 (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);
+      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());
         }
-      } 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);
+      f = !1, o && (o = !1, u.process(e));
     }
-    return !0;
   };
+  return u;
 }
-const A = R(!1, !0), U = R(!0, !0);
 export {
-  W as history,
-  U as redo,
-  A as undo
+  p as createRenderStep
 };

package/dist/index322.js

@@ -1,9 +1,9 @@
-import j from "./index230.js";
+import j from "./index250.js";
 import _ from "./index368.js";
 import G from "./index369.js";
 import W from "./index370.js";
 import { DomHandler as C, ObjectUtils as k } from "./index172.js";
-import H from "./index206.js";
+import H from "./index221.js";
 import q from "./index371.js";
 import { resolveComponent as O, openBlock as m, createElementBlock as U, mergeProps as p, createVNode as $, toHandlers as w, withCtx as x, renderSlot as S, createBlock as I, resolveDynamicComponent as v, createCommentVNode as V } from "vue";
 var z = {

package/dist/index333.js

@@ -1,5 +1,5 @@
-import a from "./index291.js";
-import f from "./index380.js";
+import a from "./index294.js";
+import f from "./index374.js";
 function d(e) {
   return encodeURIComponent(e).replace(/%3A/gi, ":").replace(/%24/g, "$").replace(/%2C/gi, ",").replace(/%20/g, "+");
 }

package/dist/index334.js

@@ -1,4 +1,4 @@
-import n from "./index291.js";
+import n from "./index294.js";
 class a {
   constructor() {
     this.handlers = [];

package/dist/index335.js

@@ -1,9 +1,9 @@
-import r from "./index381.js";
-import p from "./index299.js";
-import l from "./index295.js";
-import m from "./index297.js";
-import a from "./index305.js";
-import o from "./index306.js";
+import r from "./index375.js";
+import p from "./index302.js";
+import l from "./index298.js";
+import m from "./index300.js";
+import a from "./index308.js";
+import o from "./index309.js";
 function d(e) {
   if (e.cancelToken && e.cancelToken.throwIfRequested(), e.signal && e.signal.aborted)
     throw new m(null, e);

package/dist/index336.js

@@ -1,5 +1,5 @@
-import r from "./index382.js";
-import f from "./index383.js";
+import r from "./index376.js";
+import f from "./index377.js";
 function u(l, i, t) {
   let o = !r(i);
   return l && (o || t == !1) ? f(l, i) : i;

package/dist/index337.js

@@ -1,5 +1,5 @@
-import { VERSION as w } from "./index300.js";
-import s from "./index302.js";
+import { VERSION as w } from "./index303.js";
+import s from "./index305.js";
 const l = {};
 ["object", "boolean", "number", "function", "string", "symbol"].forEach((n, t) => {
   l[n] = function(o) {

package/dist/index339.js

@@ -1,5 +1,5 @@
-import s from "./index291.js";
-import f from "./index301.js";
+import s from "./index294.js";
+import f from "./index304.js";
 import r from "./index340.js";
 function d(o, i) {
   return f(o, new r.classes.URLSearchParams(), {

package/dist/index340.js

@@ -1,5 +1,5 @@
-import o from "./index372.js";
-import * as t from "./index373.js";
+import o from "./index378.js";
+import * as t from "./index379.js";
 const m = {
   ...t,
   ...o

package/dist/index341.js

@@ -1,4 +1,4 @@
-import n from "./index291.js";
+import n from "./index294.js";
 const a = n.toObjectSet([
   "age",
   "authorization",

package/dist/index343.js

@@ -1,13 +1,13 @@
-import H from "./index291.js";
-import D from "./index374.js";
+import H from "./index294.js";
+import D from "./index380.js";
 import L from "./index338.js";
-import n from "./index302.js";
-import y from "./index297.js";
-import O from "./index375.js";
+import n from "./index305.js";
+import y from "./index300.js";
+import O from "./index381.js";
 import U from "./index340.js";
-import q from "./index305.js";
-import { progressEventReducer as A } from "./index376.js";
-import v from "./index377.js";
+import q from "./index308.js";
+import { progressEventReducer as A } from "./index382.js";
+import v from "./index383.js";
 const N = typeof XMLHttpRequest < "u", Q = N && function(s) {
   return new Promise(function(C, i) {
     const t = v(s);

package/dist/index344.js

@@ -1,12 +1,12 @@
 import K from "./index340.js";
-import t from "./index291.js";
-import b from "./index302.js";
-import ee from "./index378.js";
-import { trackStream as z } from "./index379.js";
-import te from "./index305.js";
-import { progressEventDecorator as I, progressEventReducer as M, asyncDecorator as j } from "./index376.js";
-import se from "./index377.js";
-import re from "./index374.js";
+import t from "./index294.js";
+import b from "./index305.js";
+import ee from "./index384.js";
+import { trackStream as z } from "./index385.js";
+import te from "./index308.js";
+import { progressEventDecorator as I, progressEventReducer as M, asyncDecorator as j } from "./index382.js";
+import se from "./index383.js";
+import re from "./index380.js";
 const J = 64 * 1024, { isFunction: P } = t, ne = (({ Request: n, Response: o }) => ({
   Request: n,
   Response: o

package/dist/index347.js

@@ -5,7 +5,7 @@ import { mixComplex as g, mixArray as h, mixObject as y } from "./index357.js";
 import { clamp as p } from "./index353.js";
 import { pipe as b } from "./index358.js";
 import { invariant as l } from "./index359.js";
-import { color as d } from "./index219.js";
+import { color as d } from "./index216.js";
 const A = (r, e) => (i) => a(r, e, i);
 function u(r) {
   if (typeof r == "number")

package/dist/index352.js

@@ -1,5 +1,5 @@
 import { interpolate as f } from "./index347.js";
-import { easeInOut as p } from "./index221.js";
+import { easeInOut as p } from "./index218.js";
 function m(e, t) {
   return e.map(() => t || p).splice(0, e.length - 1);
 }

package/dist/index357.js

@@ -3,8 +3,8 @@ import { mixColor as f } from "./index356.js";
 import { isNum as i } from "./index364.js";
 import { pipe as p } from "./index358.js";
 import { warning as d } from "./index359.js";
-import { complex as a } from "./index212.js";
-import { color as b } from "./index219.js";
+import { complex as a } from "./index209.js";
+import { color as b } from "./index216.js";
 function l(n, e) {
   return i(n) ? (r) => c(n, e, r) : b.test(n) ? f(n, e) : h(n, e);
 }

package/dist/index361.js

@@ -1,5 +1,5 @@
-import { alpha as n } from "./index216.js";
-import { percent as t } from "./index218.js";
+import { alpha as n } from "./index213.js";
+import { percent as t } from "./index215.js";
 import { sanitize as r } from "./index366.js";
 import { splitColor as i, isColorString as e } from "./index367.js";
 const u = {

package/dist/index362.js

@@ -1,4 +1,4 @@
-import { alpha as s, number as m } from "./index216.js";
+import { alpha as s, number as m } from "./index213.js";
 import { sanitize as e, clamp as i } from "./index366.js";
 import { splitColor as p, isColorString as b } from "./index367.js";
 const f = i(0, 255), t = Object.assign(Object.assign({}, m), { transform: (r) => Math.round(f(r)) }), d = {

package/dist/index370.js

@@ -1,4 +1,4 @@
-import i from "./index206.js";
+import i from "./index221.js";
 import r from "./index387.js";
 import { openBlock as a, createElementBlock as u, mergeProps as o } from "vue";
 var d = {

package/dist/index372.js

@@ -1,15 +1,100 @@
-import o from "./index388.js";
-import r from "./index389.js";
-import t from "./index390.js";
-const l = {
-  isBrowser: !0,
-  classes: {
-    URLSearchParams: o,
-    FormData: r,
-    Blob: t
-  },
-  protocols: ["http", "https", "file", "blob", "url", "data"]
+var l = 200, p = function() {
 };
+p.prototype.append = function(t) {
+  return t.length ? (t = p.from(t), !this.length && t || t.length < l && this.leafAppend(t) || this.length < l && t.leafPrepend(this) || this.appendInner(t)) : this;
+};
+p.prototype.prepend = function(t) {
+  return t.length ? p.from(t).append(this) : this;
+};
+p.prototype.appendInner = function(t) {
+  return new u(this, t);
+};
+p.prototype.slice = function(t, r) {
+  return t === void 0 && (t = 0), r === void 0 && (r = this.length), t >= r ? p.empty : this.sliceInner(Math.max(0, t), Math.min(this.length, r));
+};
+p.prototype.get = function(t) {
+  if (!(t < 0 || t >= this.length))
+    return this.getInner(t);
+};
+p.prototype.forEach = function(t, r, e) {
+  r === void 0 && (r = 0), e === void 0 && (e = this.length), r <= e ? this.forEachInner(t, r, e, 0) : this.forEachInvertedInner(t, r, e, 0);
+};
+p.prototype.map = function(t, r, e) {
+  r === void 0 && (r = 0), e === void 0 && (e = this.length);
+  var n = [];
+  return this.forEach(function(i, s) {
+    return n.push(t(i, s));
+  }, r, e), n;
+};
+p.from = function(t) {
+  return t instanceof p ? t : t && t.length ? new o(t) : p.empty;
+};
+var o = /* @__PURE__ */ (function(h) {
+  function t(e) {
+    h.call(this), this.values = e;
+  }
+  h && (t.__proto__ = h), t.prototype = Object.create(h && h.prototype), t.prototype.constructor = t;
+  var r = { length: { configurable: !0 }, depth: { configurable: !0 } };
+  return t.prototype.flatten = function() {
+    return this.values;
+  }, t.prototype.sliceInner = function(n, i) {
+    return n == 0 && i == this.length ? this : new t(this.values.slice(n, i));
+  }, t.prototype.getInner = function(n) {
+    return this.values[n];
+  }, t.prototype.forEachInner = function(n, i, s, f) {
+    for (var a = i; a < s; a++)
+      if (n(this.values[a], f + a) === !1)
+        return !1;
+  }, t.prototype.forEachInvertedInner = function(n, i, s, f) {
+    for (var a = i - 1; a >= s; a--)
+      if (n(this.values[a], f + a) === !1)
+        return !1;
+  }, t.prototype.leafAppend = function(n) {
+    if (this.length + n.length <= l)
+      return new t(this.values.concat(n.flatten()));
+  }, t.prototype.leafPrepend = function(n) {
+    if (this.length + n.length <= l)
+      return new t(n.flatten().concat(this.values));
+  }, r.length.get = function() {
+    return this.values.length;
+  }, r.depth.get = function() {
+    return 0;
+  }, Object.defineProperties(t.prototype, r), t;
+})(p);
+p.empty = new o([]);
+var u = /* @__PURE__ */ (function(h) {
+  function t(r, e) {
+    h.call(this), this.left = r, this.right = e, this.length = r.length + e.length, this.depth = Math.max(r.depth, e.depth) + 1;
+  }
+  return h && (t.__proto__ = h), t.prototype = Object.create(h && h.prototype), t.prototype.constructor = t, t.prototype.flatten = function() {
+    return this.left.flatten().concat(this.right.flatten());
+  }, t.prototype.getInner = function(e) {
+    return e < this.left.length ? this.left.get(e) : this.right.get(e - this.left.length);
+  }, t.prototype.forEachInner = function(e, n, i, s) {
+    var f = this.left.length;
+    if (n < f && this.left.forEachInner(e, n, Math.min(i, f), s) === !1 || i > f && this.right.forEachInner(e, Math.max(n - f, 0), Math.min(this.length, i) - f, s + f) === !1)
+      return !1;
+  }, t.prototype.forEachInvertedInner = function(e, n, i, s) {
+    var f = this.left.length;
+    if (n > f && this.right.forEachInvertedInner(e, n - f, Math.max(i, f) - f, s + f) === !1 || i < f && this.left.forEachInvertedInner(e, Math.min(n, f), i, s) === !1)
+      return !1;
+  }, t.prototype.sliceInner = function(e, n) {
+    if (e == 0 && n == this.length)
+      return this;
+    var i = this.left.length;
+    return n <= i ? this.left.slice(e, n) : e >= i ? this.right.slice(e - i, n - i) : this.left.slice(e, i).append(this.right.slice(0, n - i));
+  }, t.prototype.leafAppend = function(e) {
+    var n = this.right.leafAppend(e);
+    if (n)
+      return new t(this.left, n);
+  }, t.prototype.leafPrepend = function(e) {
+    var n = this.left.leafPrepend(e);
+    if (n)
+      return new t(n, this.right);
+  }, t.prototype.appendInner = function(e) {
+    return this.left.depth >= Math.max(this.right.depth, e.depth) + 1 ? new t(this.left, new t(this.right, e)) : new t(this, e);
+  }, t;
+})(p);
 export {
-  l as default
+  p as default
 };