@quoreadmin/ui 1.10.0 → 1.10.2

package/dist/index338.js

@@ -1,248 +1,65 @@
-import P from "./index394.js";
-import { Mapping as k } from "./index317.js";
-import { Plugin as H, PluginKey as O } from "./index284.js";
-const D = 500;
-class c {
-  constructor(t, e) {
-    this.items = t, this.eventCount = e;
+import s from "./index323.js";
+import m from "./index377.js";
+import u from "./index378.js";
+import { getFetch as b } from "./index379.js";
+import d from "./index334.js";
+const c = {
+  http: m,
+  xhr: u,
+  fetch: {
+    get: b
   }
-  // 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);
+};
+s.forEach(c, (e, o) => {
+  if (e) {
+    try {
+      Object.defineProperty(e, "name", { value: o });
+    } catch {
     }
-    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);
+    Object.defineProperty(e, "adapterName", { value: o });
   }
-  // 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;
+});
+const f = (e) => `- ${e}`, g = (e) => s.isFunction(e) || e === null || e === !1;
+function w(e, o) {
+  e = s.isArray(e) ? e : [e];
+  const { length: a } = e;
+  let i, t;
+  const p = {};
+  for (let r = 0; r < a; r++) {
+    i = e[r];
+    let n;
+    if (t = i, !g(i) && (t = c[(n = String(i)).toLowerCase()], t === void 0))
+      throw new d(`Unknown adapter '${n}'`);
+    if (t && (s.isFunction(t) || (t = t.get(o))))
+      break;
+    p[n || "#" + r] = t;
   }
-  emptyItemCount() {
-    let t = 0;
-    return this.items.forEach((e) => {
-      e.step || t++;
-    }), t;
+  if (!t) {
+    const r = Object.entries(p).map(
+      ([l, h]) => `adapter ${l} ` + (h === !1 ? "is not supported by the environment" : "is not available in the build")
+    );
+    let n = a ? r.length > 1 ? `since :
+` + r.map(f).join(`
+`) : " " + f(r[0]) : "as no adapter specified";
+    throw new d(
+      "There is no suitable adapter to dispatch the request " + n,
+      "ERR_NOT_SUPPORT"
+    );
   }
-  // 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);
+const x = {
+  /**
+   * Resolve an adapter from a list of adapter names or functions.
+   * @type {Function}
+   */
+  getAdapter: w,
+  /**
+   * Exposes all known adapters
+   * @type {Object<string, Function|Object>}
+   */
+  adapters: c
+};
 export {
-  W as history,
-  U as redo,
-  A as undo
+  x as default
 };

package/dist/index339.js

@@ -1,11 +1,77 @@
-function f(e, n) {
-  var o = {};
-  for (var t in e) Object.prototype.hasOwnProperty.call(e, t) && n.indexOf(t) < 0 && (o[t] = e[t]);
-  if (e != null && typeof Object.getOwnPropertySymbols == "function")
-    for (var r = 0, t = Object.getOwnPropertySymbols(e); r < t.length; r++)
-      n.indexOf(t[r]) < 0 && Object.prototype.propertyIsEnumerable.call(e, t[r]) && (o[t[r]] = e[t[r]]);
-  return o;
-}
+const e = {
+  Continue: 100,
+  SwitchingProtocols: 101,
+  Processing: 102,
+  EarlyHints: 103,
+  Ok: 200,
+  Created: 201,
+  Accepted: 202,
+  NonAuthoritativeInformation: 203,
+  NoContent: 204,
+  ResetContent: 205,
+  PartialContent: 206,
+  MultiStatus: 207,
+  AlreadyReported: 208,
+  ImUsed: 226,
+  MultipleChoices: 300,
+  MovedPermanently: 301,
+  Found: 302,
+  SeeOther: 303,
+  NotModified: 304,
+  UseProxy: 305,
+  Unused: 306,
+  TemporaryRedirect: 307,
+  PermanentRedirect: 308,
+  BadRequest: 400,
+  Unauthorized: 401,
+  PaymentRequired: 402,
+  Forbidden: 403,
+  NotFound: 404,
+  MethodNotAllowed: 405,
+  NotAcceptable: 406,
+  ProxyAuthenticationRequired: 407,
+  RequestTimeout: 408,
+  Conflict: 409,
+  Gone: 410,
+  LengthRequired: 411,
+  PreconditionFailed: 412,
+  PayloadTooLarge: 413,
+  UriTooLong: 414,
+  UnsupportedMediaType: 415,
+  RangeNotSatisfiable: 416,
+  ExpectationFailed: 417,
+  ImATeapot: 418,
+  MisdirectedRequest: 421,
+  UnprocessableEntity: 422,
+  Locked: 423,
+  FailedDependency: 424,
+  TooEarly: 425,
+  UpgradeRequired: 426,
+  PreconditionRequired: 428,
+  TooManyRequests: 429,
+  RequestHeaderFieldsTooLarge: 431,
+  UnavailableForLegalReasons: 451,
+  InternalServerError: 500,
+  NotImplemented: 501,
+  BadGateway: 502,
+  ServiceUnavailable: 503,
+  GatewayTimeout: 504,
+  HttpVersionNotSupported: 505,
+  VariantAlsoNegotiates: 506,
+  InsufficientStorage: 507,
+  LoopDetected: 508,
+  NotExtended: 510,
+  NetworkAuthenticationRequired: 511,
+  WebServerIsDown: 521,
+  ConnectionTimedOut: 522,
+  OriginIsUnreachable: 523,
+  TimeoutOccurred: 524,
+  SslHandshakeFailed: 525,
+  InvalidSslCertificate: 526
+};
+Object.entries(e).forEach(([t, o]) => {
+  e[o] = t;
+});
 export {
-  f as __rest
+  e as default
 };

package/dist/index340.js

@@ -1,15 +1,39 @@
-import { spring as a } from "./index344.js";
-import { keyframes as s } from "./index346.js";
-import { decay as i } from "./index343.js";
-const r = { keyframes: s, spring: a, decay: i };
-function p(t) {
-  if (Array.isArray(t.to))
-    return s;
-  if (r[t.type])
-    return r[t.type];
-  const e = new Set(Object.keys(t));
-  return e.has("ease") || e.has("duration") && !e.has("dampingRatio") ? s : e.has("dampingRatio") || e.has("stiffness") || e.has("mass") || e.has("damping") || e.has("restSpeed") || e.has("restDelta") ? a : s;
+import n from "./index288.js";
+var e = `
+.p-icon {
+    display: inline-block;
 }
+
+.p-icon-spin {
+    -webkit-animation: p-icon-spin 2s infinite linear;
+    animation: p-icon-spin 2s infinite linear;
+}
+
+@-webkit-keyframes p-icon-spin {
+    0% {
+        -webkit-transform: rotate(0deg);
+        transform: rotate(0deg);
+    }
+    100% {
+        -webkit-transform: rotate(359deg);
+        transform: rotate(359deg);
+    }
+}
+
+@keyframes p-icon-spin {
+    0% {
+        -webkit-transform: rotate(0deg);
+        transform: rotate(0deg);
+    }
+    100% {
+        -webkit-transform: rotate(359deg);
+        transform: rotate(359deg);
+    }
+}
+`, i = n.extend({
+  name: "baseicon",
+  css: e
+});
 export {
-  p as detectAnimationFromOptions
+  i as default
 };

package/dist/index341.js

@@ -1,57 +1,11 @@
-import { progress as c } from "./index348.js";
-import { mix as a } from "./index349.js";
-import { mixColor as x } from "./index350.js";
-import { mixComplex as g, mixArray as h, mixObject as y } from "./index351.js";
-import { clamp as p } from "./index347.js";
-import { pipe as b } from "./index352.js";
-import { invariant as l } from "./index353.js";
-import { color as d } from "./index223.js";
-const A = (r, e) => (i) => a(r, e, i);
-function u(r) {
-  if (typeof r == "number")
-    return A;
-  if (typeof r == "string")
-    return d.test(r) ? x : g;
-  if (Array.isArray(r))
-    return h;
-  if (typeof r == "object")
-    return y;
-}
-function I(r, e, i) {
-  const t = [], f = i || u(r[0]), n = r.length - 1;
-  for (let o = 0; o < n; o++) {
-    let m = f(r[o], r[o + 1]);
-    if (e) {
-      const s = Array.isArray(e) ? e[o] : e;
-      m = b(s, m);
-    }
-    t.push(m);
-  }
-  return t;
-}
-function M([r, e], [i]) {
-  return (t) => i(c(r, e, t));
-}
-function F(r, e) {
-  const i = r.length, t = i - 1;
-  return (f) => {
-    let n = 0, o = !1;
-    if (f <= r[0] ? o = !0 : f >= r[t] && (n = t - 1, o = !0), !o) {
-      let s = 1;
-      for (; s < i && !(r[s] > f || s === t); s++)
-        ;
-      n = s - 1;
-    }
-    const m = c(r[n], r[n + 1], f);
-    return e[n](m);
-  };
-}
-function R(r, e, { clamp: i = !0, ease: t, mixer: f } = {}) {
-  const n = r.length;
-  l(n === e.length, "Both input and output ranges must be the same length"), l(!t || !Array.isArray(t) || t.length === n - 1, "Array of easing functions must be of length `input.length - 1`, as it applies to the transitions **between** the defined values."), r[0] > r[n - 1] && (r = [].concat(r), e = [].concat(e), r.reverse(), e.reverse());
-  const o = I(e, t, f), m = n === 2 ? M(r, o) : F(r, o);
-  return i ? (s) => m(p(r[0], r[n - 1], s)) : m;
+function f(e, n) {
+  var o = {};
+  for (var t in e) Object.prototype.hasOwnProperty.call(e, t) && n.indexOf(t) < 0 && (o[t] = e[t]);
+  if (e != null && typeof Object.getOwnPropertySymbols == "function")
+    for (var r = 0, t = Object.getOwnPropertySymbols(e); r < t.length; r++)
+      n.indexOf(t[r]) < 0 && Object.prototype.propertyIsEnumerable.call(e, t[r]) && (o[t[r]] = e[t[r]]);
+  return o;
 }
 export {
-  R as interpolate
+  f as __rest
 };

package/dist/index342.js

@@ -1,14 +1,15 @@
-function p(r, e, n = 0) {
-  return r - e - n;
-}
-function u(r, e, n = 0, t = !0) {
-  return t ? p(e + -r, e, n) : e - (r - e) + n;
-}
-function c(r, e, n, t) {
-  return t ? r >= e + n : r <= -n;
+import { spring as a } from "./index346.js";
+import { keyframes as s } from "./index348.js";
+import { decay as i } from "./index345.js";
+const r = { keyframes: s, spring: a, decay: i };
+function p(t) {
+  if (Array.isArray(t.to))
+    return s;
+  if (r[t.type])
+    return r[t.type];
+  const e = new Set(Object.keys(t));
+  return e.has("ease") || e.has("duration") && !e.has("dampingRatio") ? s : e.has("dampingRatio") || e.has("stiffness") || e.has("mass") || e.has("damping") || e.has("restSpeed") || e.has("restDelta") ? a : s;
 }
 export {
-  c as hasRepeatDelayElapsed,
-  p as loopElapsed,
-  u as reverseElapsed
+  p as detectAnimationFromOptions
 };

package/dist/index343.js

@@ -1,16 +1,57 @@
-function r({ velocity: o = 0, from: n = 0, power: i = 0.8, timeConstant: s = 350, restDelta: u = 0.5, modifyTarget: c }) {
-  const e = { done: !1, value: n };
-  let a = i * o;
-  const d = n + a, t = c === void 0 ? d : c(d);
-  return t !== d && (a = t - n), {
-    next: (p) => {
-      const l = -a * Math.exp(-p / s);
-      return e.done = !(l > u || l < -u), e.value = e.done ? t : t + l, e;
-    },
-    flipTarget: () => {
+import { progress as c } from "./index350.js";
+import { mix as a } from "./index351.js";
+import { mixColor as x } from "./index352.js";
+import { mixComplex as g, mixArray as h, mixObject as y } from "./index353.js";
+import { clamp as p } from "./index349.js";
+import { pipe as b } from "./index354.js";
+import { invariant as l } from "./index355.js";
+import { color as d } from "./index251.js";
+const A = (r, e) => (i) => a(r, e, i);
+function u(r) {
+  if (typeof r == "number")
+    return A;
+  if (typeof r == "string")
+    return d.test(r) ? x : g;
+  if (Array.isArray(r))
+    return h;
+  if (typeof r == "object")
+    return y;
+}
+function I(r, e, i) {
+  const t = [], f = i || u(r[0]), n = r.length - 1;
+  for (let o = 0; o < n; o++) {
+    let m = f(r[o], r[o + 1]);
+    if (e) {
+      const s = Array.isArray(e) ? e[o] : e;
+      m = b(s, m);
     }
+    t.push(m);
+  }
+  return t;
+}
+function M([r, e], [i]) {
+  return (t) => i(c(r, e, t));
+}
+function F(r, e) {
+  const i = r.length, t = i - 1;
+  return (f) => {
+    let n = 0, o = !1;
+    if (f <= r[0] ? o = !0 : f >= r[t] && (n = t - 1, o = !0), !o) {
+      let s = 1;
+      for (; s < i && !(r[s] > f || s === t); s++)
+        ;
+      n = s - 1;
+    }
+    const m = c(r[n], r[n + 1], f);
+    return e[n](m);
   };
 }
+function R(r, e, { clamp: i = !0, ease: t, mixer: f } = {}) {
+  const n = r.length;
+  l(n === e.length, "Both input and output ranges must be the same length"), l(!t || !Array.isArray(t) || t.length === n - 1, "Array of easing functions must be of length `input.length - 1`, as it applies to the transitions **between** the defined values."), r[0] > r[n - 1] && (r = [].concat(r), e = [].concat(e), r.reverse(), e.reverse());
+  const o = I(e, t, f), m = n === 2 ? M(r, o) : F(r, o);
+  return i ? (s) => m(p(r[0], r[n - 1], s)) : m;
+}
 export {
-  r as decay
+  R as interpolate
 };