@quoreadmin/ui 1.7.9 → 1.7.11

package/dist/index381.js

@@ -1,63 +1,30 @@
-const f = function* (e, t) {
-  let n = e.byteLength;
-  if (n < t) {
-    yield e;
-    return;
-  }
-  let a = 0, r;
-  for (; a < n; )
-    r = a + t, yield e.slice(a, r), a = r;
-}, w = async function* (e, t) {
-  for await (const n of b(e))
-    yield* f(n, t);
-}, b = async function* (e) {
-  if (e[Symbol.asyncIterator]) {
-    yield* e;
-    return;
-  }
-  const t = e.getReader();
-  try {
-    for (; ; ) {
-      const { done: n, value: a } = await t.read();
-      if (n)
-        break;
-      yield a;
-    }
-  } finally {
-    await t.cancel();
-  }
-}, h = (e, t, n, a) => {
-  const r = w(e, t);
-  let d = 0, o, c = (l) => {
-    o || (o = !0, a && a(l));
-  };
-  return new ReadableStream({
-    async pull(l) {
-      try {
-        const { done: i, value: y } = await r.next();
-        if (i) {
-          c(), l.close();
-          return;
-        }
-        let s = y.byteLength;
-        if (n) {
-          let u = d += s;
-          n(u);
-        }
-        l.enqueue(new Uint8Array(y));
-      } catch (i) {
-        throw c(i), i;
+import a from "./index303.js";
+import s from "./index308.js";
+import m from "./index297.js";
+const h = (e, t) => {
+  const { length: l } = e = e ? e.filter(Boolean) : [];
+  if (t || l) {
+    let u = new AbortController(), f;
+    const n = function(r) {
+      if (!f) {
+        f = !0, i();
+        const o = r instanceof Error ? r : this.reason;
+        u.abort(o instanceof s ? o : new a(o instanceof Error ? o.message : o));
       }
-    },
-    cancel(l) {
-      return c(l), r.return();
-    }
-  }, {
-    highWaterMark: 2
-  });
+    };
+    let c = t && setTimeout(() => {
+      c = null, n(new s(`timeout ${t} of ms exceeded`, s.ETIMEDOUT));
+    }, t);
+    const i = () => {
+      e && (c && clearTimeout(c), c = null, e.forEach((r) => {
+        r.unsubscribe ? r.unsubscribe(n) : r.removeEventListener("abort", n);
+      }), e = null);
+    };
+    e.forEach((r) => r.addEventListener("abort", n));
+    const { signal: b } = u;
+    return b.unsubscribe = () => m.asap(i), b;
+  }
 };
 export {
-  w as readBytes,
-  f as streamChunk,
-  h as trackStream
+  h as default
 };

package/dist/index382.js

@@ -1,103 +1,63 @@
-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;
+const f = function* (e, t) {
+  let n = e.byteLength;
+  if (n < t) {
+    yield e;
+    return;
   }
-};
-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);
+  let a = 0, r;
+  for (; a < n; )
+    r = a + t, yield e.slice(a, r), a = r;
+}, w = async function* (e, t) {
+  for await (const n of b(e))
+    yield* f(n, t);
+}, b = async function* (e) {
+  if (e[Symbol.asyncIterator]) {
+    yield* e;
+    return;
+  }
+  const t = e.getReader();
+  try {
+    for (; ; ) {
+      const { done: n, value: a } = await t.read();
+      if (n)
+        break;
+      yield a;
+    }
+  } finally {
+    await t.cancel();
+  }
+}, h = (e, t, n, a) => {
+  const r = w(e, t);
+  let d = 0, o, c = (l) => {
+    o || (o = !0, a && a(l));
+  };
+  return new ReadableStream({
+    async pull(l) {
+      try {
+        const { done: i, value: y } = await r.next();
+        if (i) {
+          c(), l.close();
+          return;
+        }
+        let s = y.byteLength;
+        if (n) {
+          let u = d += s;
+          n(u);
+        }
+        l.enqueue(new Uint8Array(y));
+      } catch (i) {
+        throw c(i), i;
+      }
+    },
+    cancel(l) {
+      return c(l), r.return();
+    }
+  }, {
+    highWaterMark: 2
+  });
 };
 export {
-  e as default
+  w as readBytes,
+  f as streamChunk,
+  h as trackStream
 };

package/dist/index383.js

@@ -1,93 +1,100 @@
-var t = {
-  8: "Backspace",
-  9: "Tab",
-  10: "Enter",
-  12: "NumLock",
-  13: "Enter",
-  16: "Shift",
-  17: "Control",
-  18: "Alt",
-  20: "CapsLock",
-  27: "Escape",
-  32: " ",
-  33: "PageUp",
-  34: "PageDown",
-  35: "End",
-  36: "Home",
-  37: "ArrowLeft",
-  38: "ArrowUp",
-  39: "ArrowRight",
-  40: "ArrowDown",
-  44: "PrintScreen",
-  45: "Insert",
-  46: "Delete",
-  59: ";",
-  61: "=",
-  91: "Meta",
-  92: "Meta",
-  106: "*",
-  107: "+",
-  108: ",",
-  109: "-",
-  110: ".",
-  111: "/",
-  144: "NumLock",
-  145: "ScrollLock",
-  160: "Shift",
-  161: "Shift",
-  162: "Control",
-  163: "Control",
-  164: "Alt",
-  165: "Alt",
-  173: "-",
-  186: ";",
-  187: "=",
-  188: ",",
-  189: "-",
-  190: ".",
-  191: "/",
-  192: "`",
-  219: "[",
-  220: "\\",
-  221: "]",
-  222: "'"
-}, a = {
-  48: ")",
-  49: "!",
-  50: "@",
-  51: "#",
-  52: "$",
-  53: "%",
-  54: "^",
-  55: "&",
-  56: "*",
-  57: "(",
-  59: ":",
-  61: "+",
-  173: "_",
-  186: ":",
-  187: "+",
-  188: "<",
-  189: "_",
-  190: ">",
-  191: "?",
-  192: "~",
-  219: "{",
-  220: "|",
-  221: "}",
-  222: '"'
-}, n = typeof navigator < "u" && /Mac/.test(navigator.platform), y = typeof navigator < "u" && /MSIE \d|Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(navigator.userAgent);
-for (var r = 0; r < 10; r++) t[48 + r] = t[96 + r] = String(r);
-for (var r = 1; r <= 24; r++) t[r + 111] = "F" + r;
-for (var r = 65; r <= 90; r++)
-  t[r] = String.fromCharCode(r + 32), a[r] = String.fromCharCode(r);
-for (var i in t) a.hasOwnProperty(i) || (a[i] = t[i]);
-function g(o) {
-  var f = n && o.metaKey && o.shiftKey && !o.ctrlKey && !o.altKey || y && o.shiftKey && o.key && o.key.length == 1 || o.key == "Unidentified", e = !f && o.key || (o.shiftKey ? a : t)[o.keyCode] || o.key || "Unidentified";
-  return e == "Esc" && (e = "Escape"), e == "Del" && (e = "Delete"), e == "Left" && (e = "ArrowLeft"), e == "Up" && (e = "ArrowUp"), e == "Right" && (e = "ArrowRight"), e == "Down" && (e = "ArrowDown"), e;
-}
+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 {
-  t as base,
-  g as keyName,
-  a as shift
+  p as default
 };

package/dist/index384.js

@@ -1,19 +1,103 @@
-import n from "./index278.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
 };