@quoreadmin/ui 1.7.17 → 1.7.18

package/dist/index328.js

@@ -1,204 +1,5 @@
-import { keydownHandler as v } from "./index313.js";
-import { Plugin as w, TextSelection as m, NodeSelection as x, Selection as u } from "./index275.js";
-import { Fragment as h, Slice as g } from "./index310.js";
-import { DecorationSet as S, Decoration as A } from "./index312.js";
-class i extends u {
-  /**
-  Create a gap cursor.
-  */
-  constructor(e) {
-    super(e, e);
-  }
-  map(e, t) {
-    let o = e.resolve(t.map(this.head));
-    return i.valid(o) ? new i(o) : u.near(o);
-  }
-  content() {
-    return g.empty;
-  }
-  eq(e) {
-    return e instanceof i && e.head == this.head;
-  }
-  toJSON() {
-    return { type: "gapcursor", pos: this.head };
-  }
-  /**
-  @internal
-  */
-  static fromJSON(e, t) {
-    if (typeof t.pos != "number")
-      throw new RangeError("Invalid input for GapCursor.fromJSON");
-    return new i(e.resolve(t.pos));
-  }
-  /**
-  @internal
-  */
-  getBookmark() {
-    return new d(this.anchor);
-  }
-  /**
-  @internal
-  */
-  static valid(e) {
-    let t = e.parent;
-    if (t.isTextblock || !b(e) || !y(e))
-      return !1;
-    let o = t.type.spec.allowGapCursor;
-    if (o != null)
-      return o;
-    let r = t.contentMatchAt(e.index()).defaultType;
-    return r && r.isTextblock;
-  }
-  /**
-  @internal
-  */
-  static findGapCursorFrom(e, t, o = !1) {
-    e: for (; ; ) {
-      if (!o && i.valid(e))
-        return e;
-      let r = e.pos, s = null;
-      for (let l = e.depth; ; l--) {
-        let a = e.node(l);
-        if (t > 0 ? e.indexAfter(l) < a.childCount : e.index(l) > 0) {
-          s = a.child(t > 0 ? e.indexAfter(l) : e.index(l) - 1);
-          break;
-        } else if (l == 0)
-          return null;
-        r += t;
-        let f = e.doc.resolve(r);
-        if (i.valid(f))
-          return f;
-      }
-      for (; ; ) {
-        let l = t > 0 ? s.firstChild : s.lastChild;
-        if (!l) {
-          if (s.isAtom && !s.isText && !x.isSelectable(s)) {
-            e = e.doc.resolve(r + s.nodeSize * t), o = !1;
-            continue e;
-          }
-          break;
-        }
-        s = l, r += t;
-        let a = e.doc.resolve(r);
-        if (i.valid(a))
-          return a;
-      }
-      return null;
-    }
-  }
-}
-i.prototype.visible = !1;
-i.findFrom = i.findGapCursorFrom;
-u.jsonID("gapcursor", i);
-class d {
-  constructor(e) {
-    this.pos = e;
-  }
-  map(e) {
-    return new d(e.map(this.pos));
-  }
-  resolve(e) {
-    let t = e.resolve(this.pos);
-    return i.valid(t) ? new i(t) : u.near(t);
-  }
-}
-function C(n) {
-  return n.isAtom || n.spec.isolating || n.spec.createGapCursor;
-}
-function b(n) {
-  for (let e = n.depth; e >= 0; e--) {
-    let t = n.index(e), o = n.node(e);
-    if (t == 0) {
-      if (o.type.spec.isolating)
-        return !0;
-      continue;
-    }
-    for (let r = o.child(t - 1); ; r = r.lastChild) {
-      if (r.childCount == 0 && !r.inlineContent || C(r.type))
-        return !0;
-      if (r.inlineContent)
-        return !1;
-    }
-  }
-  return !0;
-}
-function y(n) {
-  for (let e = n.depth; e >= 0; e--) {
-    let t = n.indexAfter(e), o = n.node(e);
-    if (t == o.childCount) {
-      if (o.type.spec.isolating)
-        return !0;
-      continue;
-    }
-    for (let r = o.child(t); ; r = r.firstChild) {
-      if (r.childCount == 0 && !r.inlineContent || C(r.type))
-        return !0;
-      if (r.inlineContent)
-        return !1;
-    }
-  }
-  return !0;
-}
-function B() {
-  return new w({
-    props: {
-      decorations: F,
-      createSelectionBetween(n, e, t) {
-        return e.pos == t.pos && i.valid(t) ? new i(t) : null;
-      },
-      handleClick: T,
-      handleKeyDown: k,
-      handleDOMEvents: { beforeinput: D }
-    }
-  });
-}
-const k = v({
-  ArrowLeft: c("horiz", -1),
-  ArrowRight: c("horiz", 1),
-  ArrowUp: c("vert", -1),
-  ArrowDown: c("vert", 1)
-});
-function c(n, e) {
-  const t = n == "vert" ? e > 0 ? "down" : "up" : e > 0 ? "right" : "left";
-  return function(o, r, s) {
-    let l = o.selection, a = e > 0 ? l.$to : l.$from, f = l.empty;
-    if (l instanceof m) {
-      if (!s.endOfTextblock(t) || a.depth == 0)
-        return !1;
-      f = !1, a = o.doc.resolve(e > 0 ? a.after() : a.before());
-    }
-    let p = i.findGapCursorFrom(a, e, f);
-    return p ? (r && r(o.tr.setSelection(new i(p))), !0) : !1;
-  };
-}
-function T(n, e, t) {
-  if (!n || !n.editable)
-    return !1;
-  let o = n.state.doc.resolve(e);
-  if (!i.valid(o))
-    return !1;
-  let r = n.posAtCoords({ left: t.clientX, top: t.clientY });
-  return r && r.inside > -1 && x.isSelectable(n.state.doc.nodeAt(r.inside)) ? !1 : (n.dispatch(n.state.tr.setSelection(new i(o))), !0);
-}
-function D(n, e) {
-  if (e.inputType != "insertCompositionText" || !(n.state.selection instanceof i))
-    return !1;
-  let { $from: t } = n.state.selection, o = t.parent.contentMatchAt(t.index()).findWrapping(n.state.schema.nodes.text);
-  if (!o)
-    return !1;
-  let r = h.empty;
-  for (let l = o.length - 1; l >= 0; l--)
-    r = h.from(o[l].createAndFill(null, r));
-  let s = n.state.tr.replace(t.pos, t.pos, new g(r, 0, 0));
-  return s.setSelection(m.near(s.doc.resolve(t.pos + 1))), n.dispatch(s), !1;
-}
-function F(n) {
-  if (!(n.selection instanceof i))
-    return null;
-  let e = document.createElement("div");
-  return e.className = "ProseMirror-gapcursor", S.create(n.doc, [A.widget(n.selection.head, e, { key: "gapcursor" })]);
-}
+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);
 export {
-  i as GapCursor,
-  B as gapCursor
+  n as defaultTimestep,
+  o as onNextFrame
 };

package/dist/index329.js

@@ -1,248 +1,29 @@
-import P from "./index385.js";
-import { Mapping as k } from "./index308.js";
-import { Plugin as H, PluginKey as O } from "./index275.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/index330.js

@@ -1,11 +1,39 @@
-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;
+import n from "./index278.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 {
-  f as __rest
+  i as default
 };

package/dist/index331.js

@@ -1,15 +1,21 @@
-import { spring as a } from "./index335.js";
-import { keyframes as s } from "./index337.js";
-import { decay as i } from "./index334.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 a from "./index288.js";
+import f from "./index370.js";
+function d(e) {
+  return encodeURIComponent(e).replace(/%3A/gi, ":").replace(/%24/g, "$").replace(/%2C/gi, ",").replace(/%20/g, "+");
+}
+function m(e, i, n) {
+  if (!i)
+    return e;
+  const s = n && n.encode || d, c = a.isFunction(n) ? {
+    serialize: n
+  } : n, r = c && c.serialize;
+  let t;
+  if (r ? t = r(i, c) : t = a.isURLSearchParams(i) ? i.toString() : new f(i, c).toString(s), t) {
+    const o = e.indexOf("#");
+    o !== -1 && (e = e.slice(0, o)), e += (e.indexOf("?") === -1 ? "?" : "&") + t;
+  }
+  return e;
 }
 export {
-  p as detectAnimationFromOptions
+  m as default
 };

package/dist/index332.js

@@ -1,57 +1,59 @@
-import { progress as c } from "./index339.js";
-import { mix as a } from "./index340.js";
-import { mixColor as x } from "./index341.js";
-import { mixComplex as g, mixArray as h, mixObject as y } from "./index342.js";
-import { clamp as p } from "./index338.js";
-import { pipe as b } from "./index343.js";
-import { invariant as l } from "./index344.js";
-import { color as d } from "./index211.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);
+import n from "./index288.js";
+class a {
+  constructor() {
+    this.handlers = [];
+  }
+  /**
+   * Add a new interceptor to the stack
+   *
+   * @param {Function} fulfilled The function to handle `then` for a `Promise`
+   * @param {Function} rejected The function to handle `reject` for a `Promise`
+   * @param {Object} options The options for the interceptor, synchronous and runWhen
+   *
+   * @return {Number} An ID used to remove interceptor later
+   */
+  use(s, h, r) {
+    return this.handlers.push({
+      fulfilled: s,
+      rejected: h,
+      synchronous: r ? r.synchronous : !1,
+      runWhen: r ? r.runWhen : null
+    }), this.handlers.length - 1;
+  }
+  /**
+   * Remove an interceptor from the stack
+   *
+   * @param {Number} id The ID that was returned by `use`
+   *
+   * @returns {void}
+   */
+  eject(s) {
+    this.handlers[s] && (this.handlers[s] = null);
+  }
+  /**
+   * Clear all interceptors from the stack
+   *
+   * @returns {void}
+   */
+  clear() {
+    this.handlers && (this.handlers = []);
+  }
+  /**
+   * Iterate over all the registered interceptors
+   *
+   * This method is particularly useful for skipping over any
+   * interceptors that may have become `null` calling `eject`.
+   *
+   * @param {Function} fn The function to call for each interceptor
+   *
+   * @returns {void}
+   */
+  forEach(s) {
+    n.forEach(this.handlers, function(r) {
+      r !== null && s(r);
+    });
   }
-  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 interpolate
+  a as default
 };