@rpcbase/ui 0.159.0 → 0.160.0

package/dist/index99.js

@@ -1,323 +1,173 @@
-import k from "./index92.js";
-import x from "./index91.js";
-import { DIRECTION as r } from "./index215.js";
-import y from "./index93.js";
-import T, { normalizeOpts as b } from "./index32.js";
-import m from "./index218.js";
-import I from "./index219.js";
-import C from "./index220.js";
-import _ from "./index100.js";
-import "./index103.js";
-class h extends y {
-  /** */
-  /** */
-  /** Single char for empty input */
-  /** Single char for filled input */
-  /** Show placeholder only when needed */
-  /** Enable characters overwriting */
-  /** */
-  /** */
-  /** */
-  constructor(e) {
-    super({
-      ...h.DEFAULTS,
-      ...e,
-      definitions: Object.assign({}, _.DEFAULT_DEFINITIONS, e?.definitions)
-    });
-  }
-  updateOptions(e) {
-    super.updateOptions(e);
-  }
-  _update(e) {
-    e.definitions = Object.assign({}, this.definitions, e.definitions), super._update(e), this._rebuildMask();
-  }
-  _rebuildMask() {
-    const e = this.definitions;
-    this._blocks = [], this.exposeBlock = void 0, this._stops = [], this._maskedBlocks = {};
-    const s = this.mask;
-    if (!s || !e) return;
-    let t = !1, l = !1;
-    for (let i = 0; i < s.length; ++i) {
-      if (this.blocks) {
-        const p = s.slice(i), g = Object.keys(this.blocks).filter((u) => p.indexOf(u) === 0);
-        g.sort((u, d) => d.length - u.length);
-        const c = g[0];
-        if (c) {
-          const {
-            expose: u,
-            repeat: d,
-            ...E
-          } = b(this.blocks[c]), B = {
-            lazy: this.lazy,
-            eager: this.eager,
-            placeholderChar: this.placeholderChar,
-            displayChar: this.displayChar,
-            overwrite: this.overwrite,
-            autofix: this.autofix,
-            ...E,
-            repeat: d,
-            parent: this
-          }, f = d != null ? new x.RepeatBlock(
-            B
-            /* TODO */
-          ) : T(B);
-          f && (this._blocks.push(f), u && (this.exposeBlock = f), this._maskedBlocks[c] || (this._maskedBlocks[c] = []), this._maskedBlocks[c].push(this._blocks.length - 1)), i += c.length - 1;
-          continue;
-        }
-      }
-      let o = s[i], a = o in e;
-      if (o === h.STOP_CHAR) {
-        this._stops.push(this._blocks.length);
-        continue;
-      }
-      if (o === "{" || o === "}") {
-        t = !t;
-        continue;
-      }
-      if (o === "[" || o === "]") {
-        l = !l;
-        continue;
-      }
-      if (o === h.ESCAPE_CHAR) {
-        if (++i, o = s[i], !o) break;
-        a = !1;
-      }
-      const n = a ? new _({
-        isOptional: l,
-        lazy: this.lazy,
-        eager: this.eager,
-        placeholderChar: this.placeholderChar,
-        displayChar: this.displayChar,
-        ...b(e[o]),
-        parent: this
-      }) : new C({
-        char: o,
-        eager: this.eager,
-        isUnmasking: t
-      });
-      this._blocks.push(n);
-    }
-  }
-  get state() {
-    return {
-      ...super.state,
-      _blocks: this._blocks.map((e) => e.state)
+import w from "./index219.js";
+function p(r, e) {
+  var t = typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+  if (t) return (t = t.call(r)).next.bind(t);
+  if (Array.isArray(r) || (t = S(r)) || e) {
+    t && (r = t);
+    var n = 0;
+    return function() {
+      return n >= r.length ? { done: !0 } : { done: !1, value: r[n++] };
     };
   }
-  set state(e) {
-    if (!e) {
-      this.reset();
-      return;
-    }
-    const {
-      _blocks: s,
-      ...t
-    } = e;
-    this._blocks.forEach((l, i) => l.state = s[i]), super.state = t;
-  }
-  reset() {
-    super.reset(), this._blocks.forEach((e) => e.reset());
-  }
-  get isComplete() {
-    return this.exposeBlock ? this.exposeBlock.isComplete : this._blocks.every((e) => e.isComplete);
-  }
-  get isFilled() {
-    return this._blocks.every((e) => e.isFilled);
-  }
-  get isFixed() {
-    return this._blocks.every((e) => e.isFixed);
-  }
-  get isOptional() {
-    return this._blocks.every((e) => e.isOptional);
-  }
-  doCommit() {
-    this._blocks.forEach((e) => e.doCommit()), super.doCommit();
-  }
-  get unmaskedValue() {
-    return this.exposeBlock ? this.exposeBlock.unmaskedValue : this._blocks.reduce((e, s) => e += s.unmaskedValue, "");
-  }
-  set unmaskedValue(e) {
-    if (this.exposeBlock) {
-      const s = this.extractTail(this._blockStartPos(this._blocks.indexOf(this.exposeBlock)) + this.exposeBlock.displayValue.length);
-      this.exposeBlock.unmaskedValue = e, this.appendTail(s), this.doCommit();
-    } else super.unmaskedValue = e;
-  }
-  get value() {
-    return this.exposeBlock ? this.exposeBlock.value : (
-      // TODO return _value when not in change?
-      this._blocks.reduce((e, s) => e += s.value, "")
-    );
-  }
-  set value(e) {
-    if (this.exposeBlock) {
-      const s = this.extractTail(this._blockStartPos(this._blocks.indexOf(this.exposeBlock)) + this.exposeBlock.displayValue.length);
-      this.exposeBlock.value = e, this.appendTail(s), this.doCommit();
-    } else super.value = e;
-  }
-  get typedValue() {
-    return this.exposeBlock ? this.exposeBlock.typedValue : super.typedValue;
-  }
-  set typedValue(e) {
-    if (this.exposeBlock) {
-      const s = this.extractTail(this._blockStartPos(this._blocks.indexOf(this.exposeBlock)) + this.exposeBlock.displayValue.length);
-      this.exposeBlock.typedValue = e, this.appendTail(s), this.doCommit();
-    } else super.typedValue = e;
-  }
-  get displayValue() {
-    return this._blocks.reduce((e, s) => e += s.displayValue, "");
-  }
-  appendTail(e) {
-    return super.appendTail(e).aggregate(this._appendPlaceholder());
-  }
-  _appendEager() {
-    var e;
-    const s = new k();
-    let t = (e = this._mapPosToBlock(this.displayValue.length)) == null ? void 0 : e.index;
-    if (t == null) return s;
-    this._blocks[t].isFilled && ++t;
-    for (let l = t; l < this._blocks.length; ++l) {
-      const i = this._blocks[l]._appendEager();
-      if (!i.inserted) break;
-      s.aggregate(i);
-    }
-    return s;
-  }
-  _appendCharRaw(e, s) {
-    s === void 0 && (s = {});
-    const t = this._mapPosToBlock(this.displayValue.length), l = new k();
-    if (!t) return l;
-    for (let o = t.index, a; a = this._blocks[o]; ++o) {
-      var i;
-      const n = a._appendChar(e, {
-        ...s,
-        _beforeTailState: (i = s._beforeTailState) == null || (i = i._blocks) == null ? void 0 : i[o]
-      });
-      if (l.aggregate(n), n.consumed) break;
-    }
-    return l;
-  }
-  extractTail(e, s) {
-    e === void 0 && (e = 0), s === void 0 && (s = this.displayValue.length);
-    const t = new m();
-    return e === s || this._forEachBlocksInRange(e, s, (l, i, o, a) => {
-      const n = l.extractTail(o, a);
-      n.stop = this._findStopBefore(i), n.from = this._blockStartPos(i), n instanceof m && (n.blockIndex = i), t.extend(n);
-    }), t;
-  }
-  extractInput(e, s, t) {
-    if (e === void 0 && (e = 0), s === void 0 && (s = this.displayValue.length), t === void 0 && (t = {}), e === s) return "";
-    let l = "";
-    return this._forEachBlocksInRange(e, s, (i, o, a, n) => {
-      l += i.extractInput(a, n, t);
-    }), l;
-  }
-  _findStopBefore(e) {
-    let s;
-    for (let t = 0; t < this._stops.length; ++t) {
-      const l = this._stops[t];
-      if (l <= e) s = l;
-      else break;
-    }
-    return s;
+  throw new TypeError(`Invalid attempt to iterate non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+}
+function S(r, e) {
+  if (r) {
+    if (typeof r == "string") return v(r, e);
+    var t = {}.toString.call(r).slice(8, -1);
+    return t === "Object" && r.constructor && (t = r.constructor.name), t === "Map" || t === "Set" ? Array.from(r) : t === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? v(r, e) : void 0;
   }
-  /** Appends placeholder depending on laziness */
-  _appendPlaceholder(e) {
-    const s = new k();
-    if (this.lazy && e == null) return s;
-    const t = this._mapPosToBlock(this.displayValue.length);
-    if (!t) return s;
-    const l = t.index, i = e ?? this._blocks.length;
-    return this._blocks.slice(l, i).forEach((o) => {
-      if (!o.lazy || e != null) {
-        var a;
-        s.aggregate(o._appendPlaceholder((a = o._blocks) == null ? void 0 : a.length));
-      }
-    }), s;
+}
+function v(r, e) {
+  (e == null || e > r.length) && (e = r.length);
+  for (var t = 0, n = Array(e); t < e; t++) n[t] = r[t];
+  return n;
+}
+function f(r) {
+  "@babel/helpers - typeof";
+  return f = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(e) {
+    return typeof e;
+  } : function(e) {
+    return e && typeof Symbol == "function" && e.constructor === Symbol && e !== Symbol.prototype ? "symbol" : typeof e;
+  }, f(r);
+}
+function C(r, e) {
+  if (!(r instanceof e)) throw new TypeError("Cannot call a class as a function");
+}
+function P(r, e) {
+  for (var t = 0; t < e.length; t++) {
+    var n = e[t];
+    n.enumerable = n.enumerable || !1, n.configurable = !0, "value" in n && (n.writable = !0), Object.defineProperty(r, O(n.key), n);
   }
-  /** Finds block in pos */
-  _mapPosToBlock(e) {
-    let s = "";
-    for (let t = 0; t < this._blocks.length; ++t) {
-      const l = this._blocks[t], i = s.length;
-      if (s += l.displayValue, e <= s.length)
-        return {
-          index: t,
-          offset: e - i
-        };
+}
+function A(r, e, t) {
+  return e && P(r.prototype, e), Object.defineProperty(r, "prototype", { writable: !1 }), r;
+}
+function O(r) {
+  var e = M(r, "string");
+  return f(e) == "symbol" ? e : e + "";
+}
+function M(r, e) {
+  if (f(r) != "object" || !r) return r;
+  var t = r[Symbol.toPrimitive];
+  if (t !== void 0) {
+    var n = t.call(r, e);
+    if (f(n) != "object") return n;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+  return String(r);
+}
+var E = /* @__PURE__ */ (function() {
+  function r(e) {
+    C(this, r), this.matchTree = new w().parse(e);
+  }
+  return A(r, [{
+    key: "match",
+    value: function(t) {
+      var n = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, i = n.allowOverflow;
+      if (!t)
+        throw new Error("String is required");
+      var o = l(t.split(""), this.matchTree, !0);
+      if (o && o.match && delete o.matchedChars, !(o && o.overflow && !i))
+        return o;
     }
-  }
-  _blockStartPos(e) {
-    return this._blocks.slice(0, e).reduce((s, t) => s += t.displayValue.length, 0);
-  }
-  _forEachBlocksInRange(e, s, t) {
-    s === void 0 && (s = this.displayValue.length);
-    const l = this._mapPosToBlock(e);
-    if (l) {
-      const i = this._mapPosToBlock(s), o = i && l.index === i.index, a = l.offset, n = i && o ? i.offset : this._blocks[l.index].displayValue.length;
-      if (t(this._blocks[l.index], l.index, a, n), i && !o) {
-        for (let p = l.index + 1; p < i.index; ++p)
-          t(this._blocks[p], p, 0, this._blocks[p].displayValue.length);
-        t(this._blocks[i.index], i.index, 0, i.offset);
-      }
+  }]);
+})();
+function l(r, e, t) {
+  if (typeof e == "string") {
+    var n = r.join("");
+    return e.indexOf(n) === 0 ? r.length === e.length ? {
+      match: !0,
+      matchedChars: r
+    } : {
+      partialMatch: !0
+      // matchedChars: characters
+    } : n.indexOf(e) === 0 ? t && r.length > e.length ? {
+      overflow: !0
+    } : {
+      match: !0,
+      matchedChars: r.slice(0, e.length)
+    } : void 0;
+  }
+  if (Array.isArray(e)) {
+    for (var i = r.slice(), o = 0; o < e.length; ) {
+      var s = e[o], a = l(i, s, t && o === e.length - 1);
+      if (a) {
+        if (a.overflow)
+          return a;
+        if (a.match) {
+          if (i = i.slice(a.matchedChars.length), i.length === 0)
+            return o === e.length - 1 ? {
+              match: !0,
+              matchedChars: r
+            } : {
+              partialMatch: !0
+              // matchedChars: characters
+            };
+        } else {
+          if (a.partialMatch)
+            return {
+              partialMatch: !0
+              // matchedChars: characters
+            };
+          throw new Error(`Unsupported match result:
+`.concat(JSON.stringify(a, null, 2)));
+        }
+      } else return;
+      o++;
     }
+    return t ? {
+      overflow: !0
+    } : {
+      match: !0,
+      matchedChars: r.slice(0, r.length - i.length)
+    };
   }
-  remove(e, s) {
-    e === void 0 && (e = 0), s === void 0 && (s = this.displayValue.length);
-    const t = super.remove(e, s);
-    return this._forEachBlocksInRange(e, s, (l, i, o, a) => {
-      t.aggregate(l.remove(o, a));
-    }), t;
-  }
-  nearestInputPos(e, s) {
-    if (s === void 0 && (s = r.NONE), !this._blocks.length) return 0;
-    const t = new I(this, e);
-    if (s === r.NONE)
-      return t.pushRightBeforeInput() || (t.popState(), t.pushLeftBeforeInput()) ? t.pos : this.displayValue.length;
-    if (s === r.LEFT || s === r.FORCE_LEFT) {
-      if (s === r.LEFT) {
-        if (t.pushRightBeforeFilled(), t.ok && t.pos === e) return e;
-        t.popState();
+  switch (e.op) {
+    case "|":
+      for (var c, d = p(e.args), h; !(h = d()).done; ) {
+        var g = h.value, u = l(r, g, t);
+        if (u) {
+          if (u.overflow)
+            return u;
+          if (u.match)
+            return {
+              match: !0,
+              matchedChars: u.matchedChars
+            };
+          if (u.partialMatch)
+            c = !0;
+          else
+            throw new Error(`Unsupported match result:
+`.concat(JSON.stringify(u, null, 2)));
+        }
       }
-      if (t.pushLeftBeforeInput(), t.pushLeftBeforeRequired(), t.pushLeftBeforeFilled(), s === r.LEFT) {
-        if (t.pushRightBeforeInput(), t.pushRightBeforeRequired(), t.ok && t.pos <= e || (t.popState(), t.ok && t.pos <= e)) return t.pos;
-        t.popState();
+      return c ? {
+        partialMatch: !0
+        // matchedChars: ...
+      } : void 0;
+    case "[]":
+      for (var b = p(e.args), m; !(m = b()).done; ) {
+        var y = m.value;
+        if (r[0] === y)
+          return r.length === 1 ? {
+            match: !0,
+            matchedChars: r
+          } : t ? {
+            overflow: !0
+          } : {
+            match: !0,
+            matchedChars: [y]
+          };
       }
-      return t.ok ? t.pos : s === r.FORCE_LEFT ? 0 : (t.popState(), t.ok || (t.popState(), t.ok) ? t.pos : 0);
-    }
-    return s === r.RIGHT || s === r.FORCE_RIGHT ? (t.pushRightBeforeInput(), t.pushRightBeforeRequired(), t.pushRightBeforeFilled() ? t.pos : s === r.FORCE_RIGHT ? this.displayValue.length : (t.popState(), t.ok || (t.popState(), t.ok) ? t.pos : this.nearestInputPos(e, r.LEFT))) : e;
-  }
-  totalInputPositions(e, s) {
-    e === void 0 && (e = 0), s === void 0 && (s = this.displayValue.length);
-    let t = 0;
-    return this._forEachBlocksInRange(e, s, (l, i, o, a) => {
-      t += l.totalInputPositions(o, a);
-    }), t;
-  }
-  /** Get block by name */
-  maskedBlock(e) {
-    return this.maskedBlocks(e)[0];
-  }
-  /** Get all blocks by name */
-  maskedBlocks(e) {
-    const s = this._maskedBlocks[e];
-    return s ? s.map((t) => this._blocks[t]) : [];
-  }
-  pad(e) {
-    const s = new k();
-    return this._forEachBlocksInRange(0, this.displayValue.length, (t) => s.aggregate(t.pad(e))), s;
+      return;
+    /* istanbul ignore next */
+    default:
+      throw new Error("Unsupported instruction tree: ".concat(e));
   }
 }
-h.DEFAULTS = {
-  ...y.DEFAULTS,
-  lazy: !0,
-  placeholderChar: "_"
-};
-h.STOP_CHAR = "`";
-h.ESCAPE_CHAR = "\\";
-h.InputDefinition = _;
-h.FixedDefinition = C;
-x.MaskedPattern = h;
 export {
-  h as default
+  E as default
 };
 //# sourceMappingURL=index99.js.map

package/dist/index99.js.map

@@ -1 +1 @@
-{"version":3,"file":"index99.js","sources":["../../../node_modules/imask/esm/masked/pattern.js"],"sourcesContent":["import ChangeDetails from '../core/change-details.js';\nimport IMask from '../core/holder.js';\nimport { DIRECTION } from '../core/utils.js';\nimport Masked from './base.js';\nimport createMask, { normalizeOpts } from './factory.js';\nimport ChunksTailDetails from './pattern/chunk-tail-details.js';\nimport PatternCursor from './pattern/cursor.js';\nimport PatternFixedDefinition from './pattern/fixed-definition.js';\nimport PatternInputDefinition from './pattern/input-definition.js';\nimport './regexp.js';\nimport '../core/continuous-tail-details.js';\n\n/** Pattern mask */\nclass MaskedPattern extends Masked {\n  /** */\n\n  /** */\n\n  /** Single char for empty input */\n\n  /** Single char for filled input */\n\n  /** Show placeholder only when needed */\n\n  /** Enable characters overwriting */\n\n  /** */\n\n  /** */\n\n  /** */\n\n  constructor(opts) {\n    super({\n      ...MaskedPattern.DEFAULTS,\n      ...opts,\n      definitions: Object.assign({}, PatternInputDefinition.DEFAULT_DEFINITIONS, opts == null ? void 0 : opts.definitions)\n    });\n  }\n  updateOptions(opts) {\n    super.updateOptions(opts);\n  }\n  _update(opts) {\n    opts.definitions = Object.assign({}, this.definitions, opts.definitions);\n    super._update(opts);\n    this._rebuildMask();\n  }\n  _rebuildMask() {\n    const defs = this.definitions;\n    this._blocks = [];\n    this.exposeBlock = undefined;\n    this._stops = [];\n    this._maskedBlocks = {};\n    const pattern = this.mask;\n    if (!pattern || !defs) return;\n    let unmaskingBlock = false;\n    let optionalBlock = false;\n    for (let i = 0; i < pattern.length; ++i) {\n      if (this.blocks) {\n        const p = pattern.slice(i);\n        const bNames = Object.keys(this.blocks).filter(bName => p.indexOf(bName) === 0);\n        // order by key length\n        bNames.sort((a, b) => b.length - a.length);\n        // use block name with max length\n        const bName = bNames[0];\n        if (bName) {\n          const {\n            expose,\n            repeat,\n            ...bOpts\n          } = normalizeOpts(this.blocks[bName]); // TODO type Opts<Arg & Extra>\n          const blockOpts = {\n            lazy: this.lazy,\n            eager: this.eager,\n            placeholderChar: this.placeholderChar,\n            displayChar: this.displayChar,\n            overwrite: this.overwrite,\n            autofix: this.autofix,\n            ...bOpts,\n            repeat,\n            parent: this\n          };\n          const maskedBlock = repeat != null ? new IMask.RepeatBlock(blockOpts /* TODO */) : createMask(blockOpts);\n          if (maskedBlock) {\n            this._blocks.push(maskedBlock);\n            if (expose) this.exposeBlock = maskedBlock;\n\n            // store block index\n            if (!this._maskedBlocks[bName]) this._maskedBlocks[bName] = [];\n            this._maskedBlocks[bName].push(this._blocks.length - 1);\n          }\n          i += bName.length - 1;\n          continue;\n        }\n      }\n      let char = pattern[i];\n      let isInput = (char in defs);\n      if (char === MaskedPattern.STOP_CHAR) {\n        this._stops.push(this._blocks.length);\n        continue;\n      }\n      if (char === '{' || char === '}') {\n        unmaskingBlock = !unmaskingBlock;\n        continue;\n      }\n      if (char === '[' || char === ']') {\n        optionalBlock = !optionalBlock;\n        continue;\n      }\n      if (char === MaskedPattern.ESCAPE_CHAR) {\n        ++i;\n        char = pattern[i];\n        if (!char) break;\n        isInput = false;\n      }\n      const def = isInput ? new PatternInputDefinition({\n        isOptional: optionalBlock,\n        lazy: this.lazy,\n        eager: this.eager,\n        placeholderChar: this.placeholderChar,\n        displayChar: this.displayChar,\n        ...normalizeOpts(defs[char]),\n        parent: this\n      }) : new PatternFixedDefinition({\n        char,\n        eager: this.eager,\n        isUnmasking: unmaskingBlock\n      });\n      this._blocks.push(def);\n    }\n  }\n  get state() {\n    return {\n      ...super.state,\n      _blocks: this._blocks.map(b => b.state)\n    };\n  }\n  set state(state) {\n    if (!state) {\n      this.reset();\n      return;\n    }\n    const {\n      _blocks,\n      ...maskedState\n    } = state;\n    this._blocks.forEach((b, bi) => b.state = _blocks[bi]);\n    super.state = maskedState;\n  }\n  reset() {\n    super.reset();\n    this._blocks.forEach(b => b.reset());\n  }\n  get isComplete() {\n    return this.exposeBlock ? this.exposeBlock.isComplete : this._blocks.every(b => b.isComplete);\n  }\n  get isFilled() {\n    return this._blocks.every(b => b.isFilled);\n  }\n  get isFixed() {\n    return this._blocks.every(b => b.isFixed);\n  }\n  get isOptional() {\n    return this._blocks.every(b => b.isOptional);\n  }\n  doCommit() {\n    this._blocks.forEach(b => b.doCommit());\n    super.doCommit();\n  }\n  get unmaskedValue() {\n    return this.exposeBlock ? this.exposeBlock.unmaskedValue : this._blocks.reduce((str, b) => str += b.unmaskedValue, '');\n  }\n  set unmaskedValue(unmaskedValue) {\n    if (this.exposeBlock) {\n      const tail = this.extractTail(this._blockStartPos(this._blocks.indexOf(this.exposeBlock)) + this.exposeBlock.displayValue.length);\n      this.exposeBlock.unmaskedValue = unmaskedValue;\n      this.appendTail(tail);\n      this.doCommit();\n    } else super.unmaskedValue = unmaskedValue;\n  }\n  get value() {\n    return this.exposeBlock ? this.exposeBlock.value :\n    // TODO return _value when not in change?\n    this._blocks.reduce((str, b) => str += b.value, '');\n  }\n  set value(value) {\n    if (this.exposeBlock) {\n      const tail = this.extractTail(this._blockStartPos(this._blocks.indexOf(this.exposeBlock)) + this.exposeBlock.displayValue.length);\n      this.exposeBlock.value = value;\n      this.appendTail(tail);\n      this.doCommit();\n    } else super.value = value;\n  }\n  get typedValue() {\n    return this.exposeBlock ? this.exposeBlock.typedValue : super.typedValue;\n  }\n  set typedValue(value) {\n    if (this.exposeBlock) {\n      const tail = this.extractTail(this._blockStartPos(this._blocks.indexOf(this.exposeBlock)) + this.exposeBlock.displayValue.length);\n      this.exposeBlock.typedValue = value;\n      this.appendTail(tail);\n      this.doCommit();\n    } else super.typedValue = value;\n  }\n  get displayValue() {\n    return this._blocks.reduce((str, b) => str += b.displayValue, '');\n  }\n  appendTail(tail) {\n    return super.appendTail(tail).aggregate(this._appendPlaceholder());\n  }\n  _appendEager() {\n    var _this$_mapPosToBlock;\n    const details = new ChangeDetails();\n    let startBlockIndex = (_this$_mapPosToBlock = this._mapPosToBlock(this.displayValue.length)) == null ? void 0 : _this$_mapPosToBlock.index;\n    if (startBlockIndex == null) return details;\n\n    // TODO test if it works for nested pattern masks\n    if (this._blocks[startBlockIndex].isFilled) ++startBlockIndex;\n    for (let bi = startBlockIndex; bi < this._blocks.length; ++bi) {\n      const d = this._blocks[bi]._appendEager();\n      if (!d.inserted) break;\n      details.aggregate(d);\n    }\n    return details;\n  }\n  _appendCharRaw(ch, flags) {\n    if (flags === void 0) {\n      flags = {};\n    }\n    const blockIter = this._mapPosToBlock(this.displayValue.length);\n    const details = new ChangeDetails();\n    if (!blockIter) return details;\n    for (let bi = blockIter.index, block; block = this._blocks[bi]; ++bi) {\n      var _flags$_beforeTailSta;\n      const blockDetails = block._appendChar(ch, {\n        ...flags,\n        _beforeTailState: (_flags$_beforeTailSta = flags._beforeTailState) == null || (_flags$_beforeTailSta = _flags$_beforeTailSta._blocks) == null ? void 0 : _flags$_beforeTailSta[bi]\n      });\n      details.aggregate(blockDetails);\n      if (blockDetails.consumed) break; // go next char\n    }\n    return details;\n  }\n  extractTail(fromPos, toPos) {\n    if (fromPos === void 0) {\n      fromPos = 0;\n    }\n    if (toPos === void 0) {\n      toPos = this.displayValue.length;\n    }\n    const chunkTail = new ChunksTailDetails();\n    if (fromPos === toPos) return chunkTail;\n    this._forEachBlocksInRange(fromPos, toPos, (b, bi, bFromPos, bToPos) => {\n      const blockChunk = b.extractTail(bFromPos, bToPos);\n      blockChunk.stop = this._findStopBefore(bi);\n      blockChunk.from = this._blockStartPos(bi);\n      if (blockChunk instanceof ChunksTailDetails) blockChunk.blockIndex = bi;\n      chunkTail.extend(blockChunk);\n    });\n    return chunkTail;\n  }\n  extractInput(fromPos, toPos, flags) {\n    if (fromPos === void 0) {\n      fromPos = 0;\n    }\n    if (toPos === void 0) {\n      toPos = this.displayValue.length;\n    }\n    if (flags === void 0) {\n      flags = {};\n    }\n    if (fromPos === toPos) return '';\n    let input = '';\n    this._forEachBlocksInRange(fromPos, toPos, (b, _, fromPos, toPos) => {\n      input += b.extractInput(fromPos, toPos, flags);\n    });\n    return input;\n  }\n  _findStopBefore(blockIndex) {\n    let stopBefore;\n    for (let si = 0; si < this._stops.length; ++si) {\n      const stop = this._stops[si];\n      if (stop <= blockIndex) stopBefore = stop;else break;\n    }\n    return stopBefore;\n  }\n\n  /** Appends placeholder depending on laziness */\n  _appendPlaceholder(toBlockIndex) {\n    const details = new ChangeDetails();\n    if (this.lazy && toBlockIndex == null) return details;\n    const startBlockIter = this._mapPosToBlock(this.displayValue.length);\n    if (!startBlockIter) return details;\n    const startBlockIndex = startBlockIter.index;\n    const endBlockIndex = toBlockIndex != null ? toBlockIndex : this._blocks.length;\n    this._blocks.slice(startBlockIndex, endBlockIndex).forEach(b => {\n      if (!b.lazy || toBlockIndex != null) {\n        var _blocks2;\n        details.aggregate(b._appendPlaceholder((_blocks2 = b._blocks) == null ? void 0 : _blocks2.length));\n      }\n    });\n    return details;\n  }\n\n  /** Finds block in pos */\n  _mapPosToBlock(pos) {\n    let accVal = '';\n    for (let bi = 0; bi < this._blocks.length; ++bi) {\n      const block = this._blocks[bi];\n      const blockStartPos = accVal.length;\n      accVal += block.displayValue;\n      if (pos <= accVal.length) {\n        return {\n          index: bi,\n          offset: pos - blockStartPos\n        };\n      }\n    }\n  }\n  _blockStartPos(blockIndex) {\n    return this._blocks.slice(0, blockIndex).reduce((pos, b) => pos += b.displayValue.length, 0);\n  }\n  _forEachBlocksInRange(fromPos, toPos, fn) {\n    if (toPos === void 0) {\n      toPos = this.displayValue.length;\n    }\n    const fromBlockIter = this._mapPosToBlock(fromPos);\n    if (fromBlockIter) {\n      const toBlockIter = this._mapPosToBlock(toPos);\n      // process first block\n      const isSameBlock = toBlockIter && fromBlockIter.index === toBlockIter.index;\n      const fromBlockStartPos = fromBlockIter.offset;\n      const fromBlockEndPos = toBlockIter && isSameBlock ? toBlockIter.offset : this._blocks[fromBlockIter.index].displayValue.length;\n      fn(this._blocks[fromBlockIter.index], fromBlockIter.index, fromBlockStartPos, fromBlockEndPos);\n      if (toBlockIter && !isSameBlock) {\n        // process intermediate blocks\n        for (let bi = fromBlockIter.index + 1; bi < toBlockIter.index; ++bi) {\n          fn(this._blocks[bi], bi, 0, this._blocks[bi].displayValue.length);\n        }\n\n        // process last block\n        fn(this._blocks[toBlockIter.index], toBlockIter.index, 0, toBlockIter.offset);\n      }\n    }\n  }\n  remove(fromPos, toPos) {\n    if (fromPos === void 0) {\n      fromPos = 0;\n    }\n    if (toPos === void 0) {\n      toPos = this.displayValue.length;\n    }\n    const removeDetails = super.remove(fromPos, toPos);\n    this._forEachBlocksInRange(fromPos, toPos, (b, _, bFromPos, bToPos) => {\n      removeDetails.aggregate(b.remove(bFromPos, bToPos));\n    });\n    return removeDetails;\n  }\n  nearestInputPos(cursorPos, direction) {\n    if (direction === void 0) {\n      direction = DIRECTION.NONE;\n    }\n    if (!this._blocks.length) return 0;\n    const cursor = new PatternCursor(this, cursorPos);\n    if (direction === DIRECTION.NONE) {\n      // -------------------------------------------------\n      // NONE should only go out from fixed to the right!\n      // -------------------------------------------------\n      if (cursor.pushRightBeforeInput()) return cursor.pos;\n      cursor.popState();\n      if (cursor.pushLeftBeforeInput()) return cursor.pos;\n      return this.displayValue.length;\n    }\n\n    // FORCE is only about a|* otherwise is 0\n    if (direction === DIRECTION.LEFT || direction === DIRECTION.FORCE_LEFT) {\n      // try to break fast when *|a\n      if (direction === DIRECTION.LEFT) {\n        cursor.pushRightBeforeFilled();\n        if (cursor.ok && cursor.pos === cursorPos) return cursorPos;\n        cursor.popState();\n      }\n\n      // forward flow\n      cursor.pushLeftBeforeInput();\n      cursor.pushLeftBeforeRequired();\n      cursor.pushLeftBeforeFilled();\n\n      // backward flow\n      if (direction === DIRECTION.LEFT) {\n        cursor.pushRightBeforeInput();\n        cursor.pushRightBeforeRequired();\n        if (cursor.ok && cursor.pos <= cursorPos) return cursor.pos;\n        cursor.popState();\n        if (cursor.ok && cursor.pos <= cursorPos) return cursor.pos;\n        cursor.popState();\n      }\n      if (cursor.ok) return cursor.pos;\n      if (direction === DIRECTION.FORCE_LEFT) return 0;\n      cursor.popState();\n      if (cursor.ok) return cursor.pos;\n      cursor.popState();\n      if (cursor.ok) return cursor.pos;\n      return 0;\n    }\n    if (direction === DIRECTION.RIGHT || direction === DIRECTION.FORCE_RIGHT) {\n      // forward flow\n      cursor.pushRightBeforeInput();\n      cursor.pushRightBeforeRequired();\n      if (cursor.pushRightBeforeFilled()) return cursor.pos;\n      if (direction === DIRECTION.FORCE_RIGHT) return this.displayValue.length;\n\n      // backward flow\n      cursor.popState();\n      if (cursor.ok) return cursor.pos;\n      cursor.popState();\n      if (cursor.ok) return cursor.pos;\n      return this.nearestInputPos(cursorPos, DIRECTION.LEFT);\n    }\n    return cursorPos;\n  }\n  totalInputPositions(fromPos, toPos) {\n    if (fromPos === void 0) {\n      fromPos = 0;\n    }\n    if (toPos === void 0) {\n      toPos = this.displayValue.length;\n    }\n    let total = 0;\n    this._forEachBlocksInRange(fromPos, toPos, (b, _, bFromPos, bToPos) => {\n      total += b.totalInputPositions(bFromPos, bToPos);\n    });\n    return total;\n  }\n\n  /** Get block by name */\n  maskedBlock(name) {\n    return this.maskedBlocks(name)[0];\n  }\n\n  /** Get all blocks by name */\n  maskedBlocks(name) {\n    const indices = this._maskedBlocks[name];\n    if (!indices) return [];\n    return indices.map(gi => this._blocks[gi]);\n  }\n  pad(flags) {\n    const details = new ChangeDetails();\n    this._forEachBlocksInRange(0, this.displayValue.length, b => details.aggregate(b.pad(flags)));\n    return details;\n  }\n}\nMaskedPattern.DEFAULTS = {\n  ...Masked.DEFAULTS,\n  lazy: true,\n  placeholderChar: '_'\n};\nMaskedPattern.STOP_CHAR = '`';\nMaskedPattern.ESCAPE_CHAR = '\\\\';\nMaskedPattern.InputDefinition = PatternInputDefinition;\nMaskedPattern.FixedDefinition = PatternFixedDefinition;\nIMask.MaskedPattern = MaskedPattern;\n\nexport { MaskedPattern as default };\n"],"names":["MaskedPattern","Masked","opts","PatternInputDefinition","defs","pattern","unmaskingBlock","optionalBlock","bNames","bName","a","b","expose","repeat","bOpts","normalizeOpts","blockOpts","maskedBlock","IMask","createMask","char","isInput","def","PatternFixedDefinition","state","_blocks","maskedState","bi","str","unmaskedValue","tail","value","_this$_mapPosToBlock","details","ChangeDetails","startBlockIndex","d","ch","flags","blockIter","block","_flags$_beforeTailSta","blockDetails","fromPos","toPos","chunkTail","ChunksTailDetails","bFromPos","bToPos","blockChunk","input","_","blockIndex","stopBefore","si","stop","toBlockIndex","startBlockIter","endBlockIndex","_blocks2","pos","accVal","blockStartPos","fn","fromBlockIter","toBlockIter","isSameBlock","fromBlockStartPos","fromBlockEndPos","removeDetails","cursorPos","direction","DIRECTION","cursor","PatternCursor","total","name","indices","gi"],"mappings":";;;;;;;;;;AAaA,MAAMA,UAAsBC,EAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBjC,YAAYC,GAAM;AAChB,UAAM;AAAA,MACJ,GAAGF,EAAc;AAAA,MACjB,GAAGE;AAAA,MACH,aAAa,OAAO,OAAO,CAAA,GAAIC,EAAuB,qBAA6CD,GAAK,WAAW;AAAA,IACzH,CAAK;AAAA,EACH;AAAA,EACA,cAAcA,GAAM;AAClB,UAAM,cAAcA,CAAI;AAAA,EAC1B;AAAA,EACA,QAAQA,GAAM;AACZ,IAAAA,EAAK,cAAc,OAAO,OAAO,CAAA,GAAI,KAAK,aAAaA,EAAK,WAAW,GACvE,MAAM,QAAQA,CAAI,GAClB,KAAK,aAAY;AAAA,EACnB;AAAA,EACA,eAAe;AACb,UAAME,IAAO,KAAK;AAClB,SAAK,UAAU,CAAA,GACf,KAAK,cAAc,QACnB,KAAK,SAAS,CAAA,GACd,KAAK,gBAAgB,CAAA;AACrB,UAAMC,IAAU,KAAK;AACrB,QAAI,CAACA,KAAW,CAACD,EAAM;AACvB,QAAIE,IAAiB,IACjBC,IAAgB;AACpB,aAAS,IAAI,GAAG,IAAIF,EAAQ,QAAQ,EAAE,GAAG;AACvC,UAAI,KAAK,QAAQ;AACf,cAAM,IAAIA,EAAQ,MAAM,CAAC,GACnBG,IAAS,OAAO,KAAK,KAAK,MAAM,EAAE,OAAO,CAAAC,MAAS,EAAE,QAAQA,CAAK,MAAM,CAAC;AAE9E,QAAAD,EAAO,KAAK,CAACE,GAAGC,MAAMA,EAAE,SAASD,EAAE,MAAM;AAEzC,cAAMD,IAAQD,EAAO,CAAC;AACtB,YAAIC,GAAO;AACT,gBAAM;AAAA,YACJ,QAAAG;AAAA,YACA,QAAAC;AAAA,YACA,GAAGC;AAAA,UACf,IAAcC,EAAc,KAAK,OAAON,CAAK,CAAC,GAC9BO,IAAY;AAAA,YAChB,MAAM,KAAK;AAAA,YACX,OAAO,KAAK;AAAA,YACZ,iBAAiB,KAAK;AAAA,YACtB,aAAa,KAAK;AAAA,YAClB,WAAW,KAAK;AAAA,YAChB,SAAS,KAAK;AAAA,YACd,GAAGF;AAAA,YACH,QAAAD;AAAA,YACA,QAAQ;AAAA,UACpB,GACgBI,IAAcJ,KAAU,OAAO,IAAIK,EAAM;AAAA,YAAYF;AAAA;AAAA,UAAS,IAAeG,EAAWH,CAAS;AACvG,UAAIC,MACF,KAAK,QAAQ,KAAKA,CAAW,GACzBL,MAAQ,KAAK,cAAcK,IAG1B,KAAK,cAAcR,CAAK,MAAG,KAAK,cAAcA,CAAK,IAAI,CAAA,IAC5D,KAAK,cAAcA,CAAK,EAAE,KAAK,KAAK,QAAQ,SAAS,CAAC,IAExD,KAAKA,EAAM,SAAS;AACpB;AAAA,QACF;AAAA,MACF;AACA,UAAIW,IAAOf,EAAQ,CAAC,GAChBgB,IAAWD,KAAQhB;AACvB,UAAIgB,MAASpB,EAAc,WAAW;AACpC,aAAK,OAAO,KAAK,KAAK,QAAQ,MAAM;AACpC;AAAA,MACF;AACA,UAAIoB,MAAS,OAAOA,MAAS,KAAK;AAChC,QAAAd,IAAiB,CAACA;AAClB;AAAA,MACF;AACA,UAAIc,MAAS,OAAOA,MAAS,KAAK;AAChC,QAAAb,IAAgB,CAACA;AACjB;AAAA,MACF;AACA,UAAIa,MAASpB,EAAc,aAAa;AAGtC,YAFA,EAAE,GACFoB,IAAOf,EAAQ,CAAC,GACZ,CAACe,EAAM;AACX,QAAAC,IAAU;AAAA,MACZ;AACA,YAAMC,IAAMD,IAAU,IAAIlB,EAAuB;AAAA,QAC/C,YAAYI;AAAA,QACZ,MAAM,KAAK;AAAA,QACX,OAAO,KAAK;AAAA,QACZ,iBAAiB,KAAK;AAAA,QACtB,aAAa,KAAK;AAAA,QAClB,GAAGQ,EAAcX,EAAKgB,CAAI,CAAC;AAAA,QAC3B,QAAQ;AAAA,MAChB,CAAO,IAAI,IAAIG,EAAuB;AAAA,QAC9B,MAAAH;AAAA,QACA,OAAO,KAAK;AAAA,QACZ,aAAad;AAAA,MACrB,CAAO;AACD,WAAK,QAAQ,KAAKgB,CAAG;AAAA,IACvB;AAAA,EACF;AAAA,EACA,IAAI,QAAQ;AACV,WAAO;AAAA,MACL,GAAG,MAAM;AAAA,MACT,SAAS,KAAK,QAAQ,IAAI,CAAAX,MAAKA,EAAE,KAAK;AAAA,IAC5C;AAAA,EACE;AAAA,EACA,IAAI,MAAMa,GAAO;AACf,QAAI,CAACA,GAAO;AACV,WAAK,MAAK;AACV;AAAA,IACF;AACA,UAAM;AAAA,MACJ,SAAAC;AAAA,MACA,GAAGC;AAAA,IACT,IAAQF;AACJ,SAAK,QAAQ,QAAQ,CAACb,GAAGgB,MAAOhB,EAAE,QAAQc,EAAQE,CAAE,CAAC,GACrD,MAAM,QAAQD;AAAA,EAChB;AAAA,EACA,QAAQ;AACN,UAAM,MAAK,GACX,KAAK,QAAQ,QAAQ,CAAAf,MAAKA,EAAE,MAAK,CAAE;AAAA,EACrC;AAAA,EACA,IAAI,aAAa;AACf,WAAO,KAAK,cAAc,KAAK,YAAY,aAAa,KAAK,QAAQ,MAAM,CAAAA,MAAKA,EAAE,UAAU;AAAA,EAC9F;AAAA,EACA,IAAI,WAAW;AACb,WAAO,KAAK,QAAQ,MAAM,CAAAA,MAAKA,EAAE,QAAQ;AAAA,EAC3C;AAAA,EACA,IAAI,UAAU;AACZ,WAAO,KAAK,QAAQ,MAAM,CAAAA,MAAKA,EAAE,OAAO;AAAA,EAC1C;AAAA,EACA,IAAI,aAAa;AACf,WAAO,KAAK,QAAQ,MAAM,CAAAA,MAAKA,EAAE,UAAU;AAAA,EAC7C;AAAA,EACA,WAAW;AACT,SAAK,QAAQ,QAAQ,CAAAA,MAAKA,EAAE,SAAQ,CAAE,GACtC,MAAM,SAAQ;AAAA,EAChB;AAAA,EACA,IAAI,gBAAgB;AAClB,WAAO,KAAK,cAAc,KAAK,YAAY,gBAAgB,KAAK,QAAQ,OAAO,CAACiB,GAAKjB,MAAMiB,KAAOjB,EAAE,eAAe,EAAE;AAAA,EACvH;AAAA,EACA,IAAI,cAAckB,GAAe;AAC/B,QAAI,KAAK,aAAa;AACpB,YAAMC,IAAO,KAAK,YAAY,KAAK,eAAe,KAAK,QAAQ,QAAQ,KAAK,WAAW,CAAC,IAAI,KAAK,YAAY,aAAa,MAAM;AAChI,WAAK,YAAY,gBAAgBD,GACjC,KAAK,WAAWC,CAAI,GACpB,KAAK,SAAQ;AAAA,IACf,MAAO,OAAM,gBAAgBD;AAAA,EAC/B;AAAA,EACA,IAAI,QAAQ;AACV,WAAO,KAAK,cAAc,KAAK,YAAY;AAAA;AAAA,MAE3C,KAAK,QAAQ,OAAO,CAACD,GAAKjB,MAAMiB,KAAOjB,EAAE,OAAO,EAAE;AAAA;AAAA,EACpD;AAAA,EACA,IAAI,MAAMoB,GAAO;AACf,QAAI,KAAK,aAAa;AACpB,YAAMD,IAAO,KAAK,YAAY,KAAK,eAAe,KAAK,QAAQ,QAAQ,KAAK,WAAW,CAAC,IAAI,KAAK,YAAY,aAAa,MAAM;AAChI,WAAK,YAAY,QAAQC,GACzB,KAAK,WAAWD,CAAI,GACpB,KAAK,SAAQ;AAAA,IACf,MAAO,OAAM,QAAQC;AAAA,EACvB;AAAA,EACA,IAAI,aAAa;AACf,WAAO,KAAK,cAAc,KAAK,YAAY,aAAa,MAAM;AAAA,EAChE;AAAA,EACA,IAAI,WAAWA,GAAO;AACpB,QAAI,KAAK,aAAa;AACpB,YAAMD,IAAO,KAAK,YAAY,KAAK,eAAe,KAAK,QAAQ,QAAQ,KAAK,WAAW,CAAC,IAAI,KAAK,YAAY,aAAa,MAAM;AAChI,WAAK,YAAY,aAAaC,GAC9B,KAAK,WAAWD,CAAI,GACpB,KAAK,SAAQ;AAAA,IACf,MAAO,OAAM,aAAaC;AAAA,EAC5B;AAAA,EACA,IAAI,eAAe;AACjB,WAAO,KAAK,QAAQ,OAAO,CAACH,GAAKjB,MAAMiB,KAAOjB,EAAE,cAAc,EAAE;AAAA,EAClE;AAAA,EACA,WAAWmB,GAAM;AACf,WAAO,MAAM,WAAWA,CAAI,EAAE,UAAU,KAAK,oBAAoB;AAAA,EACnE;AAAA,EACA,eAAe;AACb,QAAIE;AACJ,UAAMC,IAAU,IAAIC,EAAa;AACjC,QAAIC,KAAmBH,IAAuB,KAAK,eAAe,KAAK,aAAa,MAAM,MAAM,OAAO,SAASA,EAAqB;AACrI,QAAIG,KAAmB,KAAM,QAAOF;AAGpC,IAAI,KAAK,QAAQE,CAAe,EAAE,YAAU,EAAEA;AAC9C,aAASR,IAAKQ,GAAiBR,IAAK,KAAK,QAAQ,QAAQ,EAAEA,GAAI;AAC7D,YAAMS,IAAI,KAAK,QAAQT,CAAE,EAAE,aAAY;AACvC,UAAI,CAACS,EAAE,SAAU;AACjB,MAAAH,EAAQ,UAAUG,CAAC;AAAA,IACrB;AACA,WAAOH;AAAA,EACT;AAAA,EACA,eAAeI,GAAIC,GAAO;AACxB,IAAIA,MAAU,WACZA,IAAQ,CAAA;AAEV,UAAMC,IAAY,KAAK,eAAe,KAAK,aAAa,MAAM,GACxDN,IAAU,IAAIC,EAAa;AACjC,QAAI,CAACK,EAAW,QAAON;AACvB,aAASN,IAAKY,EAAU,OAAOC,GAAOA,IAAQ,KAAK,QAAQb,CAAE,GAAG,EAAEA,GAAI;AACpE,UAAIc;AACJ,YAAMC,IAAeF,EAAM,YAAYH,GAAI;AAAA,QACzC,GAAGC;AAAA,QACH,mBAAmBG,IAAwBH,EAAM,qBAAqB,SAASG,IAAwBA,EAAsB,YAAY,OAAO,SAASA,EAAsBd,CAAE;AAAA,MACzL,CAAO;AAED,UADAM,EAAQ,UAAUS,CAAY,GAC1BA,EAAa,SAAU;AAAA,IAC7B;AACA,WAAOT;AAAA,EACT;AAAA,EACA,YAAYU,GAASC,GAAO;AAC1B,IAAID,MAAY,WACdA,IAAU,IAERC,MAAU,WACZA,IAAQ,KAAK,aAAa;AAE5B,UAAMC,IAAY,IAAIC,EAAiB;AACvC,WAAIH,MAAYC,KAChB,KAAK,sBAAsBD,GAASC,GAAO,CAACjC,GAAGgB,GAAIoB,GAAUC,MAAW;AACtE,YAAMC,IAAatC,EAAE,YAAYoC,GAAUC,CAAM;AACjD,MAAAC,EAAW,OAAO,KAAK,gBAAgBtB,CAAE,GACzCsB,EAAW,OAAO,KAAK,eAAetB,CAAE,GACpCsB,aAAsBH,MAAmBG,EAAW,aAAatB,IACrEkB,EAAU,OAAOI,CAAU;AAAA,IAC7B,CAAC,GACMJ;AAAA,EACT;AAAA,EACA,aAAaF,GAASC,GAAON,GAAO;AAUlC,QATIK,MAAY,WACdA,IAAU,IAERC,MAAU,WACZA,IAAQ,KAAK,aAAa,SAExBN,MAAU,WACZA,IAAQ,CAAA,IAENK,MAAYC,EAAO,QAAO;AAC9B,QAAIM,IAAQ;AACZ,gBAAK,sBAAsBP,GAASC,GAAO,CAACjC,GAAGwC,GAAGR,GAASC,MAAU;AACnE,MAAAM,KAASvC,EAAE,aAAagC,GAASC,GAAON,CAAK;AAAA,IAC/C,CAAC,GACMY;AAAA,EACT;AAAA,EACA,gBAAgBE,GAAY;AAC1B,QAAIC;AACJ,aAASC,IAAK,GAAGA,IAAK,KAAK,OAAO,QAAQ,EAAEA,GAAI;AAC9C,YAAMC,IAAO,KAAK,OAAOD,CAAE;AAC3B,UAAIC,KAAQH,EAAY,CAAAC,IAAaE;AAAA,UAAU;AAAA,IACjD;AACA,WAAOF;AAAA,EACT;AAAA;AAAA,EAGA,mBAAmBG,GAAc;AAC/B,UAAMvB,IAAU,IAAIC,EAAa;AACjC,QAAI,KAAK,QAAQsB,KAAgB,KAAM,QAAOvB;AAC9C,UAAMwB,IAAiB,KAAK,eAAe,KAAK,aAAa,MAAM;AACnE,QAAI,CAACA,EAAgB,QAAOxB;AAC5B,UAAME,IAAkBsB,EAAe,OACjCC,IAAgBF,KAAsC,KAAK,QAAQ;AACzE,gBAAK,QAAQ,MAAMrB,GAAiBuB,CAAa,EAAE,QAAQ,CAAA/C,MAAK;AAC9D,UAAI,CAACA,EAAE,QAAQ6C,KAAgB,MAAM;AACnC,YAAIG;AACJ,QAAA1B,EAAQ,UAAUtB,EAAE,oBAAoBgD,IAAWhD,EAAE,YAAY,OAAO,SAASgD,EAAS,MAAM,CAAC;AAAA,MACnG;AAAA,IACF,CAAC,GACM1B;AAAA,EACT;AAAA;AAAA,EAGA,eAAe2B,GAAK;AAClB,QAAIC,IAAS;AACb,aAASlC,IAAK,GAAGA,IAAK,KAAK,QAAQ,QAAQ,EAAEA,GAAI;AAC/C,YAAMa,IAAQ,KAAK,QAAQb,CAAE,GACvBmC,IAAgBD,EAAO;AAE7B,UADAA,KAAUrB,EAAM,cACZoB,KAAOC,EAAO;AAChB,eAAO;AAAA,UACL,OAAOlC;AAAA,UACP,QAAQiC,IAAME;AAAA,QACxB;AAAA,IAEI;AAAA,EACF;AAAA,EACA,eAAeV,GAAY;AACzB,WAAO,KAAK,QAAQ,MAAM,GAAGA,CAAU,EAAE,OAAO,CAACQ,GAAKjD,MAAMiD,KAAOjD,EAAE,aAAa,QAAQ,CAAC;AAAA,EAC7F;AAAA,EACA,sBAAsBgC,GAASC,GAAOmB,GAAI;AACxC,IAAInB,MAAU,WACZA,IAAQ,KAAK,aAAa;AAE5B,UAAMoB,IAAgB,KAAK,eAAerB,CAAO;AACjD,QAAIqB,GAAe;AACjB,YAAMC,IAAc,KAAK,eAAerB,CAAK,GAEvCsB,IAAcD,KAAeD,EAAc,UAAUC,EAAY,OACjEE,IAAoBH,EAAc,QAClCI,IAAkBH,KAAeC,IAAcD,EAAY,SAAS,KAAK,QAAQD,EAAc,KAAK,EAAE,aAAa;AAEzH,UADAD,EAAG,KAAK,QAAQC,EAAc,KAAK,GAAGA,EAAc,OAAOG,GAAmBC,CAAe,GACzFH,KAAe,CAACC,GAAa;AAE/B,iBAASvC,IAAKqC,EAAc,QAAQ,GAAGrC,IAAKsC,EAAY,OAAO,EAAEtC;AAC/D,UAAAoC,EAAG,KAAK,QAAQpC,CAAE,GAAGA,GAAI,GAAG,KAAK,QAAQA,CAAE,EAAE,aAAa,MAAM;AAIlE,QAAAoC,EAAG,KAAK,QAAQE,EAAY,KAAK,GAAGA,EAAY,OAAO,GAAGA,EAAY,MAAM;AAAA,MAC9E;AAAA,IACF;AAAA,EACF;AAAA,EACA,OAAOtB,GAASC,GAAO;AACrB,IAAID,MAAY,WACdA,IAAU,IAERC,MAAU,WACZA,IAAQ,KAAK,aAAa;AAE5B,UAAMyB,IAAgB,MAAM,OAAO1B,GAASC,CAAK;AACjD,gBAAK,sBAAsBD,GAASC,GAAO,CAACjC,GAAGwC,GAAGJ,GAAUC,MAAW;AACrE,MAAAqB,EAAc,UAAU1D,EAAE,OAAOoC,GAAUC,CAAM,CAAC;AAAA,IACpD,CAAC,GACMqB;AAAA,EACT;AAAA,EACA,gBAAgBC,GAAWC,GAAW;AAIpC,QAHIA,MAAc,WAChBA,IAAYC,EAAU,OAEpB,CAAC,KAAK,QAAQ,OAAQ,QAAO;AACjC,UAAMC,IAAS,IAAIC,EAAc,MAAMJ,CAAS;AAChD,QAAIC,MAAcC,EAAU;AAM1B,aAFIC,EAAO,2BACXA,EAAO,SAAQ,GACXA,EAAO,yBAA8BA,EAAO,MACzC,KAAK,aAAa;AAI3B,QAAIF,MAAcC,EAAU,QAAQD,MAAcC,EAAU,YAAY;AAEtE,UAAID,MAAcC,EAAU,MAAM;AAEhC,YADAC,EAAO,sBAAqB,GACxBA,EAAO,MAAMA,EAAO,QAAQH,EAAW,QAAOA;AAClD,QAAAG,EAAO,SAAQ;AAAA,MACjB;AAQA,UALAA,EAAO,oBAAmB,GAC1BA,EAAO,uBAAsB,GAC7BA,EAAO,qBAAoB,GAGvBF,MAAcC,EAAU,MAAM;AAKhC,YAJAC,EAAO,qBAAoB,GAC3BA,EAAO,wBAAuB,GAC1BA,EAAO,MAAMA,EAAO,OAAOH,MAC/BG,EAAO,SAAQ,GACXA,EAAO,MAAMA,EAAO,OAAOH,GAAW,QAAOG,EAAO;AACxD,QAAAA,EAAO,SAAQ;AAAA,MACjB;AACA,aAAIA,EAAO,KAAWA,EAAO,MACzBF,MAAcC,EAAU,aAAmB,KAC/CC,EAAO,SAAQ,GACXA,EAAO,OACXA,EAAO,SAAQ,GACXA,EAAO,MAAWA,EAAO,MACtB;AAAA,IACT;AACA,WAAIF,MAAcC,EAAU,SAASD,MAAcC,EAAU,eAE3DC,EAAO,qBAAoB,GAC3BA,EAAO,wBAAuB,GAC1BA,EAAO,0BAAgCA,EAAO,MAC9CF,MAAcC,EAAU,cAAoB,KAAK,aAAa,UAGlEC,EAAO,SAAQ,GACXA,EAAO,OACXA,EAAO,SAAQ,GACXA,EAAO,MAAWA,EAAO,MACtB,KAAK,gBAAgBH,GAAWE,EAAU,IAAI,MAEhDF;AAAA,EACT;AAAA,EACA,oBAAoB3B,GAASC,GAAO;AAClC,IAAID,MAAY,WACdA,IAAU,IAERC,MAAU,WACZA,IAAQ,KAAK,aAAa;AAE5B,QAAI+B,IAAQ;AACZ,gBAAK,sBAAsBhC,GAASC,GAAO,CAACjC,GAAGwC,GAAGJ,GAAUC,MAAW;AACrE,MAAA2B,KAAShE,EAAE,oBAAoBoC,GAAUC,CAAM;AAAA,IACjD,CAAC,GACM2B;AAAA,EACT;AAAA;AAAA,EAGA,YAAYC,GAAM;AAChB,WAAO,KAAK,aAAaA,CAAI,EAAE,CAAC;AAAA,EAClC;AAAA;AAAA,EAGA,aAAaA,GAAM;AACjB,UAAMC,IAAU,KAAK,cAAcD,CAAI;AACvC,WAAKC,IACEA,EAAQ,IAAI,CAAAC,MAAM,KAAK,QAAQA,CAAE,CAAC,IADpB,CAAA;AAAA,EAEvB;AAAA,EACA,IAAIxC,GAAO;AACT,UAAML,IAAU,IAAIC,EAAa;AACjC,gBAAK,sBAAsB,GAAG,KAAK,aAAa,QAAQ,CAAAvB,MAAKsB,EAAQ,UAAUtB,EAAE,IAAI2B,CAAK,CAAC,CAAC,GACrFL;AAAA,EACT;AACF;AACAjC,EAAc,WAAW;AAAA,EACvB,GAAGC,EAAO;AAAA,EACV,MAAM;AAAA,EACN,iBAAiB;AACnB;AACAD,EAAc,YAAY;AAC1BA,EAAc,cAAc;AAC5BA,EAAc,kBAAkBG;AAChCH,EAAc,kBAAkBuB;AAChCL,EAAM,gBAAgBlB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index99.js","sources":["../../../node_modules/libphonenumber-js/es6/AsYouTypeFormatter.PatternMatcher.js"],"sourcesContent":["function _createForOfIteratorHelperLoose(r, e) { var t = \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"]; if (t) return (t = t.call(r)).next.bind(t); if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && \"number\" == typeof r.length) { t && (r = t); var o = 0; return function () { return o >= r.length ? { done: !0 } : { done: !1, value: r[o++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(r, a) { if (r) { if (\"string\" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return \"Object\" === t && r.constructor && (t = r.constructor.name), \"Map\" === t || \"Set\" === t ? Array.from(r) : \"Arguments\" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }\nfunction _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nfunction _classCallCheck(a, n) { if (!(a instanceof n)) throw new TypeError(\"Cannot call a class as a function\"); }\nfunction _defineProperties(e, r) { for (var t = 0; t < r.length; t++) { var o = r[t]; o.enumerable = o.enumerable || !1, o.configurable = !0, \"value\" in o && (o.writable = !0), Object.defineProperty(e, _toPropertyKey(o.key), o); } }\nfunction _createClass(e, r, t) { return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, \"prototype\", { writable: !1 }), e; }\nfunction _toPropertyKey(t) { var i = _toPrimitive(t, \"string\"); return \"symbol\" == _typeof(i) ? i : i + \"\"; }\nfunction _toPrimitive(t, r) { if (\"object\" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || \"default\"); if (\"object\" != _typeof(i)) return i; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (\"string\" === r ? String : Number)(t); }\nimport PatternParser from './AsYouTypeFormatter.PatternParser.js';\nvar PatternMatcher = /*#__PURE__*/function () {\n  function PatternMatcher(pattern) {\n    _classCallCheck(this, PatternMatcher);\n    this.matchTree = new PatternParser().parse(pattern);\n  }\n  return _createClass(PatternMatcher, [{\n    key: \"match\",\n    value: function match(string) {\n      var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n        allowOverflow = _ref.allowOverflow;\n      if (!string) {\n        throw new Error('String is required');\n      }\n      var result = _match(string.split(''), this.matchTree, true);\n      if (result && result.match) {\n        delete result.matchedChars;\n      }\n      if (result && result.overflow) {\n        if (!allowOverflow) {\n          return;\n        }\n      }\n      return result;\n    }\n  }]);\n}();\n/**\r\n * Matches `characters` against a pattern compiled into a `tree`.\r\n * @param  {string[]} characters\r\n * @param  {Tree} tree — A pattern compiled into a `tree`. See the `*.d.ts` file for the description of the `tree` structure.\r\n * @param  {boolean} last — Whether it's the last (rightmost) subtree on its level of the match tree.\r\n * @return {object} See the `*.d.ts` file for the description of the result object.\r\n */\nexport { PatternMatcher as default };\nfunction _match(characters, tree, last) {\n  // If `tree` is a string, then `tree` is a single character.\n  // That's because when a pattern is parsed, multi-character-string parts\n  // of a pattern are compiled into arrays of single characters.\n  // I still wrote this piece of code for a \"general\" hypothetical case\n  // when `tree` could be a string of several characters, even though\n  // such case is not possible with the current implementation.\n  if (typeof tree === 'string') {\n    var characterString = characters.join('');\n    if (tree.indexOf(characterString) === 0) {\n      // `tree` is always a single character.\n      // If `tree.indexOf(characterString) === 0`\n      // then `characters.length === tree.length`.\n      /* istanbul ignore else */\n      if (characters.length === tree.length) {\n        return {\n          match: true,\n          matchedChars: characters\n        };\n      }\n      // `tree` is always a single character.\n      // If `tree.indexOf(characterString) === 0`\n      // then `characters.length === tree.length`.\n      /* istanbul ignore next */\n      return {\n        partialMatch: true\n        // matchedChars: characters\n      };\n    }\n    if (characterString.indexOf(tree) === 0) {\n      if (last) {\n        // The `else` path is not possible because `tree` is always a single character.\n        // The `else` case for `characters.length > tree.length` would be\n        // `characters.length <= tree.length` which means `characters.length <= 1`.\n        // `characters` array can't be empty, so that means `characters === [tree]`,\n        // which would also mean `tree.indexOf(characterString) === 0` and that'd mean\n        // that the `if (tree.indexOf(characterString) === 0)` condition before this\n        // `if` condition would be entered, and returned from there, not reaching this code.\n        /* istanbul ignore else */\n        if (characters.length > tree.length) {\n          return {\n            overflow: true\n          };\n        }\n      }\n      return {\n        match: true,\n        matchedChars: characters.slice(0, tree.length)\n      };\n    }\n    return;\n  }\n  if (Array.isArray(tree)) {\n    var restCharacters = characters.slice();\n    var i = 0;\n    while (i < tree.length) {\n      var subtree = tree[i];\n      var result = _match(restCharacters, subtree, last && i === tree.length - 1);\n      if (!result) {\n        return;\n      } else if (result.overflow) {\n        return result;\n      } else if (result.match) {\n        // Continue with the next subtree with the rest of the characters.\n        restCharacters = restCharacters.slice(result.matchedChars.length);\n        if (restCharacters.length === 0) {\n          if (i === tree.length - 1) {\n            return {\n              match: true,\n              matchedChars: characters\n            };\n          } else {\n            return {\n              partialMatch: true\n              // matchedChars: characters\n            };\n          }\n        }\n      } else {\n        /* istanbul ignore else */\n        if (result.partialMatch) {\n          return {\n            partialMatch: true\n            // matchedChars: characters\n          };\n        } else {\n          throw new Error(\"Unsupported match result:\\n\".concat(JSON.stringify(result, null, 2)));\n        }\n      }\n      i++;\n    }\n    // If `last` then overflow has already been checked\n    // by the last element of the `tree` array.\n    /* istanbul ignore if */\n    if (last) {\n      return {\n        overflow: true\n      };\n    }\n    return {\n      match: true,\n      matchedChars: characters.slice(0, characters.length - restCharacters.length)\n    };\n  }\n  switch (tree.op) {\n    case '|':\n      var partialMatch;\n      for (var _iterator = _createForOfIteratorHelperLoose(tree.args), _step; !(_step = _iterator()).done;) {\n        var branch = _step.value;\n        var _result = _match(characters, branch, last);\n        if (_result) {\n          if (_result.overflow) {\n            return _result;\n          } else if (_result.match) {\n            return {\n              match: true,\n              matchedChars: _result.matchedChars\n            };\n          } else {\n            /* istanbul ignore else */\n            if (_result.partialMatch) {\n              partialMatch = true;\n            } else {\n              throw new Error(\"Unsupported match result:\\n\".concat(JSON.stringify(_result, null, 2)));\n            }\n          }\n        }\n      }\n      if (partialMatch) {\n        return {\n          partialMatch: true\n          // matchedChars: ...\n        };\n      }\n      // Not even a partial match.\n      return;\n    case '[]':\n      for (var _iterator2 = _createForOfIteratorHelperLoose(tree.args), _step2; !(_step2 = _iterator2()).done;) {\n        var _char = _step2.value;\n        if (characters[0] === _char) {\n          if (characters.length === 1) {\n            return {\n              match: true,\n              matchedChars: characters\n            };\n          }\n          if (last) {\n            return {\n              overflow: true\n            };\n          }\n          return {\n            match: true,\n            matchedChars: [_char]\n          };\n        }\n      }\n      // No character matches.\n      return;\n\n    /* istanbul ignore next */\n    default:\n      throw new Error(\"Unsupported instruction tree: \".concat(tree));\n  }\n}\n//# sourceMappingURL=AsYouTypeFormatter.PatternMatcher.js.map"],"names":["_createForOfIteratorHelperLoose","_unsupportedIterableToArray","o","a","_arrayLikeToArray","e","_typeof","_classCallCheck","n","_defineProperties","r","_toPropertyKey","_createClass","t","i","_toPrimitive","PatternMatcher","pattern","PatternParser","string","_ref","allowOverflow","result","_match","characters","tree","last","characterString","restCharacters","subtree","partialMatch","_iterator","_step","branch","_result","_iterator2","_step2","_char"],"mappings":";AAAA,SAASA,EAAgC,GAAG,GAAG;AAAE,MAAI,IAAmB,OAAO,SAAtB,OAAgC,EAAE,OAAO,QAAQ,KAAK,EAAE,YAAY;AAAG,MAAI,EAAG,SAAQ,IAAI,EAAE,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC;AAAG,MAAI,MAAM,QAAQ,CAAC,MAAM,IAAIC,EAA4B,CAAC,MAAM,GAAuC;AAAE,UAAM,IAAI;AAAI,QAAIC,IAAI;AAAG,WAAO,WAAY;AAAE,aAAOA,KAAK,EAAE,SAAS,EAAE,MAAM,GAAE,IAAK,EAAE,MAAM,IAAI,OAAO,EAAEA,GAAG,EAAC;AAAA,IAAI;AAAA,EAAG;AAAE,QAAM,IAAI,UAAU;AAAA,mFAAuI;AAAG;AACziB,SAASD,EAA4B,GAAGE,GAAG;AAAE,MAAI,GAAG;AAAE,QAAgB,OAAO,KAAnB,SAAsB,QAAOC,EAAkB,GAAGD,CAAC;AAAG,QAAI,IAAI,CAAA,EAAG,SAAS,KAAK,CAAC,EAAE,MAAM,GAAG,EAAE;AAAG,WAAoB,MAAb,YAAkB,EAAE,gBAAgB,IAAI,EAAE,YAAY,OAAiB,MAAV,SAAyB,MAAV,QAAc,MAAM,KAAK,CAAC,IAAoB,MAAhB,eAAqB,2CAA2C,KAAK,CAAC,IAAIC,EAAkB,GAAGD,CAAC,IAAI;AAAA,EAAQ;AAAE;AACzX,SAASC,EAAkB,GAAGD,GAAG;AAAE,GAASA,KAAR,QAAaA,IAAI,EAAE,YAAYA,IAAI,EAAE;AAAS,WAASE,IAAI,GAAG,IAAI,MAAMF,CAAC,GAAGE,IAAIF,GAAGE,IAAK,GAAEA,CAAC,IAAI,EAAEA,CAAC;AAAG,SAAO;AAAG;AACnJ,SAASC,EAAQJ,GAAG;AAAE;AAA2B,SAAOI,IAAwB,OAAO,UAArB,cAA2C,OAAO,OAAO,YAA1B,WAAqC,SAAUJ,GAAG;AAAE,WAAO,OAAOA;AAAA,EAAG,IAAI,SAAUA,GAAG;AAAE,WAAOA,KAAmB,OAAO,UAArB,cAA+BA,EAAE,gBAAgB,UAAUA,MAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,EAAG,GAAGI,EAAQJ,CAAC;AAAG;AAC7T,SAASK,EAAgBJ,GAAGK,GAAG;AAAE,MAAI,EAAEL,aAAaK,GAAI,OAAM,IAAI,UAAU,mCAAmC;AAAG;AAClH,SAASC,EAAkBJ,GAAGK,GAAG;AAAE,WAAS,IAAI,GAAG,IAAIA,EAAE,QAAQ,KAAK;AAAE,QAAIR,IAAIQ,EAAE,CAAC;AAAG,IAAAR,EAAE,aAAaA,EAAE,cAAc,IAAIA,EAAE,eAAe,IAAI,WAAWA,MAAMA,EAAE,WAAW,KAAK,OAAO,eAAeG,GAAGM,EAAeT,EAAE,GAAG,GAAGA,CAAC;AAAA,EAAG;AAAE;AACvO,SAASU,EAAaP,GAAGK,GAAG,GAAG;AAAE,SAAOA,KAAKD,EAAkBJ,EAAE,WAAWK,CAAC,GAAiC,OAAO,eAAeL,GAAG,aAAa,EAAE,UAAU,GAAE,CAAE,GAAGA;AAAG;AAC1K,SAASM,EAAeE,GAAG;AAAE,MAAIC,IAAIC,EAAaF,GAAG,QAAQ;AAAG,SAAmBP,EAAQQ,CAAC,KAArB,WAAyBA,IAAIA,IAAI;AAAI;AAC5G,SAASC,EAAaF,GAAGH,GAAG;AAAE,MAAgBJ,EAAQO,CAAC,KAArB,YAA0B,CAACA,EAAG,QAAOA;AAAG,MAAIR,IAAIQ,EAAE,OAAO,WAAW;AAAG,MAAeR,MAAX,QAAc;AAAE,QAAIS,IAAIT,EAAE,KAAKQ,GAAGH,CAAc;AAAG,QAAgBJ,EAAQQ,CAAC,KAArB,SAAwB,QAAOA;AAAG,UAAM,IAAI,UAAU,8CAA8C;AAAA,EAAG;AAAE,SAAyB,OAAiBD,CAAC;AAAG;AAExT,IAACG,IAA8B,4BAAY;AAC5C,WAASA,EAAeC,GAAS;AAC/B,IAAAV,EAAgB,MAAMS,CAAc,GACpC,KAAK,YAAY,IAAIE,EAAa,EAAG,MAAMD,CAAO;AAAA,EACpD;AACA,SAAOL,EAAaI,GAAgB,CAAC;AAAA,IACnC,KAAK;AAAA,IACL,OAAO,SAAeG,GAAQ;AAC5B,UAAIC,IAAO,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC7EC,IAAgBD,EAAK;AACvB,UAAI,CAACD;AACH,cAAM,IAAI,MAAM,oBAAoB;AAEtC,UAAIG,IAASC,EAAOJ,EAAO,MAAM,EAAE,GAAG,KAAK,WAAW,EAAI;AAI1D,UAHIG,KAAUA,EAAO,SACnB,OAAOA,EAAO,cAEZ,EAAAA,KAAUA,EAAO,YACf,CAACD;AAIP,eAAOC;AAAA,IACT;AAAA,EACJ,CAAG,CAAC;AACJ,GAAC;AASD,SAASC,EAAOC,GAAYC,GAAMC,GAAM;AAOtC,MAAI,OAAOD,KAAS,UAAU;AAC5B,QAAIE,IAAkBH,EAAW,KAAK,EAAE;AACxC,WAAIC,EAAK,QAAQE,CAAe,MAAM,IAKhCH,EAAW,WAAWC,EAAK,SACtB;AAAA,MACL,OAAO;AAAA,MACP,cAAcD;AAAA,IACxB,IAMa;AAAA,MACL,cAAc;AAAA;AAAA,IAEtB,IAEQG,EAAgB,QAAQF,CAAI,MAAM,IAChCC,KASEF,EAAW,SAASC,EAAK,SACpB;AAAA,MACL,UAAU;AAAA,IACtB,IAGa;AAAA,MACL,OAAO;AAAA,MACP,cAAcD,EAAW,MAAM,GAAGC,EAAK,MAAM;AAAA,IACrD,IAEI;AAAA,EACF;AACA,MAAI,MAAM,QAAQA,CAAI,GAAG;AAGvB,aAFIG,IAAiBJ,EAAW,MAAK,GACjCV,IAAI,GACDA,IAAIW,EAAK,UAAQ;AACtB,UAAII,IAAUJ,EAAKX,CAAC,GAChBQ,IAASC,EAAOK,GAAgBC,GAASH,KAAQZ,MAAMW,EAAK,SAAS,CAAC;AAC1E,UAAKH,GAEE;AAAA,YAAIA,EAAO;AAChB,iBAAOA;AACF,YAAIA,EAAO;AAGhB,cADAM,IAAiBA,EAAe,MAAMN,EAAO,aAAa,MAAM,GAC5DM,EAAe,WAAW;AAC5B,mBAAId,MAAMW,EAAK,SAAS,IACf;AAAA,cACL,OAAO;AAAA,cACP,cAAcD;AAAA,YAC5B,IAEmB;AAAA,cACL,cAAc;AAAA;AAAA,YAE5B;AAAA,eAGa;AAEL,cAAIF,EAAO;AACT,mBAAO;AAAA,cACL,cAAc;AAAA;AAAA,YAE1B;AAEU,gBAAM,IAAI,MAAM;AAAA,EAA8B,OAAO,KAAK,UAAUA,GAAQ,MAAM,CAAC,CAAC,CAAC;AAAA,QAEzF;AAAA,YA7BE;AA8BF,MAAAR;AAAA,IACF;AAIA,WAAIY,IACK;AAAA,MACL,UAAU;AAAA,IAClB,IAEW;AAAA,MACL,OAAO;AAAA,MACP,cAAcF,EAAW,MAAM,GAAGA,EAAW,SAASI,EAAe,MAAM;AAAA,IACjF;AAAA,EACE;AACA,UAAQH,EAAK,IAAE;AAAA,IACb,KAAK;AAEH,eADIK,GACKC,IAAY/B,EAAgCyB,EAAK,IAAI,GAAGO,GAAO,EAAEA,IAAQD,EAAS,GAAI,QAAO;AACpG,YAAIE,IAASD,EAAM,OACfE,IAAUX,EAAOC,GAAYS,GAAQP,CAAI;AAC7C,YAAIQ,GAAS;AACX,cAAIA,EAAQ;AACV,mBAAOA;AACF,cAAIA,EAAQ;AACjB,mBAAO;AAAA,cACL,OAAO;AAAA,cACP,cAAcA,EAAQ;AAAA,YACpC;AAGY,cAAIA,EAAQ;AACV,YAAAJ,IAAe;AAAA;AAEf,kBAAM,IAAI,MAAM;AAAA,EAA8B,OAAO,KAAK,UAAUI,GAAS,MAAM,CAAC,CAAC,CAAC;AAAA,QAG5F;AAAA,MACF;AACA,aAAIJ,IACK;AAAA,QACL,cAAc;AAAA;AAAA,MAExB,IAGM;AAAA,IACF,KAAK;AACH,eAASK,IAAanC,EAAgCyB,EAAK,IAAI,GAAGW,GAAQ,EAAEA,IAASD,EAAU,GAAI,QAAO;AACxG,YAAIE,IAAQD,EAAO;AACnB,YAAIZ,EAAW,CAAC,MAAMa;AACpB,iBAAIb,EAAW,WAAW,IACjB;AAAA,YACL,OAAO;AAAA,YACP,cAAcA;AAAA,UAC5B,IAEcE,IACK;AAAA,YACL,UAAU;AAAA,UACxB,IAEiB;AAAA,YACL,OAAO;AAAA,YACP,cAAc,CAACW,CAAK;AAAA,UAChC;AAAA,MAEM;AAEA;AAAA;AAAA,IAGF;AACE,YAAM,IAAI,MAAM,iCAAiC,OAAOZ,CAAI,CAAC;AAAA,EACnE;AACA;","x_google_ignoreList":[0]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rpcbase/ui",
-  "version": "0.159.0",
+  "version": "0.160.0",
   "license": "SEE LICENSE IN LICENSE",
   "type": "module",
   "sideEffects": [