@quoreadmin/ui 1.10.14 → 1.10.16

package/dist/index321.js

@@ -1,248 +1,24 @@
-import P from "./index383.js";
-import { Mapping as k } from "./index301.js";
-import { Plugin as H, PluginKey as O } from "./index285.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);
+import C from "./index293.js";
+import { openBlock as r, createElementBlock as t, mergeProps as o, createElementVNode as n } from "vue";
+var l = {
+  name: "SearchIcon",
+  extends: C
+}, i = /* @__PURE__ */ n("path", {
+  "fill-rule": "evenodd",
+  "clip-rule": "evenodd",
+  d: "M2.67602 11.0265C3.6661 11.688 4.83011 12.0411 6.02086 12.0411C6.81149 12.0411 7.59438 11.8854 8.32483 11.5828C8.87005 11.357 9.37808 11.0526 9.83317 10.6803L12.9769 13.8241C13.0323 13.8801 13.0983 13.9245 13.171 13.9548C13.2438 13.985 13.3219 14.0003 13.4007 14C13.4795 14.0003 13.5575 13.985 13.6303 13.9548C13.7031 13.9245 13.7691 13.8801 13.8244 13.8241C13.9367 13.7116 13.9998 13.5592 13.9998 13.4003C13.9998 13.2414 13.9367 13.089 13.8244 12.9765L10.6807 9.8328C11.053 9.37773 11.3573 8.86972 11.5831 8.32452C11.8857 7.59408 12.0414 6.81119 12.0414 6.02056C12.0414 4.8298 11.6883 3.66579 11.0268 2.67572C10.3652 1.68564 9.42494 0.913972 8.32483 0.45829C7.22472 0.00260857 6.01418 -0.116618 4.84631 0.115686C3.67844 0.34799 2.60568 0.921393 1.76369 1.76338C0.921698 2.60537 0.348296 3.67813 0.115991 4.84601C-0.116313 6.01388 0.00291375 7.22441 0.458595 8.32452C0.914277 9.42464 1.68595 10.3649 2.67602 11.0265ZM3.35565 2.0158C4.14456 1.48867 5.07206 1.20731 6.02086 1.20731C7.29317 1.20731 8.51338 1.71274 9.41304 2.6124C10.3127 3.51206 10.8181 4.73226 10.8181 6.00457C10.8181 6.95337 10.5368 7.88088 10.0096 8.66978C9.48251 9.45868 8.73328 10.0736 7.85669 10.4367C6.98011 10.7997 6.01554 10.8947 5.08496 10.7096C4.15439 10.5245 3.2996 10.0676 2.62869 9.39674C1.95778 8.72583 1.50089 7.87104 1.31579 6.94046C1.13068 6.00989 1.22568 5.04532 1.58878 4.16874C1.95187 3.29215 2.56675 2.54292 3.35565 2.0158Z",
+  fill: "currentColor"
+}, null, -1), p = [i];
+function d(e, a, c, s, h, m) {
+  return r(), t("svg", o({
+    width: "14",
+    height: "14",
+    viewBox: "0 0 14 14",
+    fill: "none",
+    xmlns: "http://www.w3.org/2000/svg"
+  }, e.pti()), p, 16);
+}
+l.render = d;
 export {
-  W as history,
-  U as redo,
-  A as undo
+  l as default
 };

package/dist/index322.js

@@ -1,17 +1,65 @@
-var t = (e, n) => {
-  if (e === "slot")
-    return 0;
-  if (e instanceof Function)
-    return e(n);
-  const { children: r, ...s } = n ?? {};
-  if (e === "svg")
-    throw new Error("SVG elements are not supported in the JSX syntax, use the array syntax instead");
-  return [e, s, r];
-};
+import a from "./index288.js";
+var l = {
+  root: function(e) {
+    var p = e.instance, n = e.props, o = e.state;
+    return ["p-dropdown p-component p-inputwrapper", {
+      "p-disabled": n.disabled,
+      "p-invalid": n.invalid,
+      "p-variant-filled": n.variant ? n.variant === "filled" : p.$primevue.config.inputStyle === "filled",
+      "p-dropdown-clearable": n.showClear,
+      "p-focus": o.focused,
+      "p-inputwrapper-filled": p.hasSelectedOption,
+      "p-inputwrapper-focus": o.focused || o.overlayVisible,
+      "p-overlay-open": o.overlayVisible
+    }];
+  },
+  input: function(e) {
+    var p, n = e.instance, o = e.props;
+    return ["p-dropdown-label p-inputtext", {
+      "p-placeholder": !o.editable && n.label === o.placeholder,
+      "p-dropdown-label-empty": !o.editable && !n.$slots.value && (n.label === "p-emptylabel" || ((p = n.label) === null || p === void 0 ? void 0 : p.length) === 0)
+    }];
+  },
+  clearIcon: "p-dropdown-clear-icon",
+  trigger: "p-dropdown-trigger",
+  loadingicon: "p-dropdown-trigger-icon",
+  dropdownIcon: "p-dropdown-trigger-icon",
+  panel: function(e) {
+    e.props;
+    var p = e.instance;
+    return ["p-dropdown-panel p-component", {
+      "p-ripple-disabled": p.$primevue.config.ripple === !1
+    }];
+  },
+  header: "p-dropdown-header",
+  filterContainer: "p-dropdown-filter-container",
+  filterInput: function(e) {
+    var p = e.props, n = e.instance;
+    return ["p-dropdown-filter p-inputtext p-component", {
+      "p-variant-filled": p.variant ? p.variant === "filled" : n.$primevue.config.inputStyle === "filled"
+    }];
+  },
+  filterIcon: "p-dropdown-filter-icon",
+  wrapper: "p-dropdown-items-wrapper",
+  list: "p-dropdown-items",
+  itemGroup: "p-dropdown-item-group",
+  itemGroupLabel: "p-dropdown-item-group-label",
+  item: function(e) {
+    var p = e.instance, n = e.props, o = e.state, t = e.option, r = e.focusedOption;
+    return ["p-dropdown-item", {
+      "p-highlight": p.isSelected(t) && n.highlightOnSelect,
+      "p-focus": o.focusedOptionIndex === r,
+      "p-disabled": p.isOptionDisabled(t)
+    }];
+  },
+  itemLabel: "p-dropdown-item-label",
+  checkIcon: "p-dropdown-check-icon",
+  blankIcon: "p-dropdown-blank-icon",
+  emptyMessage: "p-dropdown-empty-message"
+}, s = a.extend({
+  name: "dropdown",
+  classes: l
+});
 export {
-  t as createElement,
-  t as h,
-  t as jsx,
-  t as jsxDEV,
-  t as jsxs
+  s as default
 };

package/dist/index366.js

@@ -1,5 +1,5 @@
 import i from "./index228.js";
-import r from "./index381.js";
+import r from "./index383.js";
 import { openBlock as a, createElementBlock as u, mergeProps as o } from "vue";
 var d = {
   name: "BaseInputText",

package/dist/index380.js

@@ -1,103 +1,100 @@
-function e(t) {
-  this.content = t;
-}
-e.prototype = {
-  constructor: e,
-  find: function(t) {
-    for (var n = 0; n < this.content.length; n += 2)
-      if (this.content[n] === t) return n;
-    return -1;
-  },
-  // :: (string) → ?any
-  // Retrieve the value stored under `key`, or return undefined when
-  // no such key exists.
-  get: function(t) {
-    var n = this.find(t);
-    return n == -1 ? void 0 : this.content[n + 1];
-  },
-  // :: (string, any, ?string) → OrderedMap
-  // Create a new map by replacing the value of `key` with a new
-  // value, or adding a binding to the end of the map. If `newKey` is
-  // given, the key of the binding will be replaced with that key.
-  update: function(t, n, r) {
-    var i = r && r != t ? this.remove(r) : this, o = i.find(t), c = i.content.slice();
-    return o == -1 ? c.push(r || t, n) : (c[o + 1] = n, r && (c[o] = r)), new e(c);
-  },
-  // :: (string) → OrderedMap
-  // Return a map with the given key removed, if it existed.
-  remove: function(t) {
-    var n = this.find(t);
-    if (n == -1) return this;
-    var r = this.content.slice();
-    return r.splice(n, 2), new e(r);
-  },
-  // :: (string, any) → OrderedMap
-  // Add a new key to the start of the map.
-  addToStart: function(t, n) {
-    return new e([t, n].concat(this.remove(t).content));
-  },
-  // :: (string, any) → OrderedMap
-  // Add a new key to the end of the map.
-  addToEnd: function(t, n) {
-    var r = this.remove(t).content.slice();
-    return r.push(t, n), new e(r);
-  },
-  // :: (string, string, any) → OrderedMap
-  // Add a key after the given key. If `place` is not found, the new
-  // key is added to the end.
-  addBefore: function(t, n, r) {
-    var i = this.remove(n), o = i.content.slice(), c = i.find(t);
-    return o.splice(c == -1 ? o.length : c, 0, n, r), new e(o);
-  },
-  // :: ((key: string, value: any))
-  // Call the given function for each key/value pair in the map, in
-  // order.
-  forEach: function(t) {
-    for (var n = 0; n < this.content.length; n += 2)
-      t(this.content[n], this.content[n + 1]);
-  },
-  // :: (union<Object, OrderedMap>) → OrderedMap
-  // Create a new map by prepending the keys in this map that don't
-  // appear in `map` before the keys in `map`.
-  prepend: function(t) {
-    return t = e.from(t), t.size ? new e(t.content.concat(this.subtract(t).content)) : this;
-  },
-  // :: (union<Object, OrderedMap>) → OrderedMap
-  // Create a new map by appending the keys in this map that don't
-  // appear in `map` after the keys in `map`.
-  append: function(t) {
-    return t = e.from(t), t.size ? new e(this.subtract(t).content.concat(t.content)) : this;
-  },
-  // :: (union<Object, OrderedMap>) → OrderedMap
-  // Create a map containing all the keys in this map that don't
-  // appear in `map`.
-  subtract: function(t) {
-    var n = this;
-    t = e.from(t);
-    for (var r = 0; r < t.content.length; r += 2)
-      n = n.remove(t.content[r]);
-    return n;
-  },
-  // :: () → Object
-  // Turn ordered map into a plain object.
-  toObject: function() {
-    var t = {};
-    return this.forEach(function(n, r) {
-      t[n] = r;
-    }), t;
-  },
-  // :: number
-  // The amount of keys in this map.
-  get size() {
-    return this.content.length >> 1;
-  }
+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));
 };
-e.from = function(t) {
-  if (t instanceof e) return t;
+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 = [];
-  if (t) for (var r in t) n.push(r, t[r]);
-  return new e(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 {
-  e as default
+  p as default
 };

package/dist/index381.js

@@ -1,19 +1,103 @@
-import n from "./index288.js";
-var l = {
-  root: function(e) {
-    var i = e.instance, t = e.props;
-    return ["p-inputtext p-component", {
-      "p-filled": i.filled,
-      "p-inputtext-sm": t.size === "small",
-      "p-inputtext-lg": t.size === "large",
-      "p-invalid": t.invalid,
-      "p-variant-filled": t.variant ? t.variant === "filled" : i.$primevue.config.inputStyle === "filled"
-    }];
+function e(t) {
+  this.content = t;
+}
+e.prototype = {
+  constructor: e,
+  find: function(t) {
+    for (var n = 0; n < this.content.length; n += 2)
+      if (this.content[n] === t) return n;
+    return -1;
+  },
+  // :: (string) → ?any
+  // Retrieve the value stored under `key`, or return undefined when
+  // no such key exists.
+  get: function(t) {
+    var n = this.find(t);
+    return n == -1 ? void 0 : this.content[n + 1];
+  },
+  // :: (string, any, ?string) → OrderedMap
+  // Create a new map by replacing the value of `key` with a new
+  // value, or adding a binding to the end of the map. If `newKey` is
+  // given, the key of the binding will be replaced with that key.
+  update: function(t, n, r) {
+    var i = r && r != t ? this.remove(r) : this, o = i.find(t), c = i.content.slice();
+    return o == -1 ? c.push(r || t, n) : (c[o + 1] = n, r && (c[o] = r)), new e(c);
+  },
+  // :: (string) → OrderedMap
+  // Return a map with the given key removed, if it existed.
+  remove: function(t) {
+    var n = this.find(t);
+    if (n == -1) return this;
+    var r = this.content.slice();
+    return r.splice(n, 2), new e(r);
+  },
+  // :: (string, any) → OrderedMap
+  // Add a new key to the start of the map.
+  addToStart: function(t, n) {
+    return new e([t, n].concat(this.remove(t).content));
+  },
+  // :: (string, any) → OrderedMap
+  // Add a new key to the end of the map.
+  addToEnd: function(t, n) {
+    var r = this.remove(t).content.slice();
+    return r.push(t, n), new e(r);
+  },
+  // :: (string, string, any) → OrderedMap
+  // Add a key after the given key. If `place` is not found, the new
+  // key is added to the end.
+  addBefore: function(t, n, r) {
+    var i = this.remove(n), o = i.content.slice(), c = i.find(t);
+    return o.splice(c == -1 ? o.length : c, 0, n, r), new e(o);
+  },
+  // :: ((key: string, value: any))
+  // Call the given function for each key/value pair in the map, in
+  // order.
+  forEach: function(t) {
+    for (var n = 0; n < this.content.length; n += 2)
+      t(this.content[n], this.content[n + 1]);
+  },
+  // :: (union<Object, OrderedMap>) → OrderedMap
+  // Create a new map by prepending the keys in this map that don't
+  // appear in `map` before the keys in `map`.
+  prepend: function(t) {
+    return t = e.from(t), t.size ? new e(t.content.concat(this.subtract(t).content)) : this;
+  },
+  // :: (union<Object, OrderedMap>) → OrderedMap
+  // Create a new map by appending the keys in this map that don't
+  // appear in `map` after the keys in `map`.
+  append: function(t) {
+    return t = e.from(t), t.size ? new e(this.subtract(t).content.concat(t.content)) : this;
+  },
+  // :: (union<Object, OrderedMap>) → OrderedMap
+  // Create a map containing all the keys in this map that don't
+  // appear in `map`.
+  subtract: function(t) {
+    var n = this;
+    t = e.from(t);
+    for (var r = 0; r < t.content.length; r += 2)
+      n = n.remove(t.content[r]);
+    return n;
+  },
+  // :: () → Object
+  // Turn ordered map into a plain object.
+  toObject: function() {
+    var t = {};
+    return this.forEach(function(n, r) {
+      t[n] = r;
+    }), t;
+  },
+  // :: number
+  // The amount of keys in this map.
+  get size() {
+    return this.content.length >> 1;
   }
-}, r = n.extend({
-  name: "inputtext",
-  classes: l
-});
+};
+e.from = function(t) {
+  if (t instanceof e) return t;
+  var n = [];
+  if (t) for (var r in t) n.push(r, t[r]);
+  return new e(n);
+};
 export {
-  r as default
+  e as default
 };