Index: imaps-frontend/node_modules/utrie/dist/lib/Trie.js
===================================================================
--- imaps-frontend/node_modules/utrie/dist/lib/Trie.js	(revision 79a03170cdde4e801d12257ee86723774970427b)
+++ imaps-frontend/node_modules/utrie/dist/lib/Trie.js	(revision 79a03170cdde4e801d12257ee86723774970427b)
@@ -0,0 +1,143 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Trie = exports.createTrieFromBase64 = exports.UTRIE2_INDEX_2_MASK = exports.UTRIE2_INDEX_2_BLOCK_LENGTH = exports.UTRIE2_OMITTED_BMP_INDEX_1_LENGTH = exports.UTRIE2_INDEX_1_OFFSET = exports.UTRIE2_UTF8_2B_INDEX_2_LENGTH = exports.UTRIE2_UTF8_2B_INDEX_2_OFFSET = exports.UTRIE2_INDEX_2_BMP_LENGTH = exports.UTRIE2_LSCP_INDEX_2_LENGTH = exports.UTRIE2_DATA_MASK = exports.UTRIE2_DATA_BLOCK_LENGTH = exports.UTRIE2_LSCP_INDEX_2_OFFSET = exports.UTRIE2_SHIFT_1_2 = exports.UTRIE2_INDEX_SHIFT = exports.UTRIE2_SHIFT_1 = exports.UTRIE2_SHIFT_2 = void 0;
+var Util_1 = require("./Util");
+/** Shift size for getting the index-2 table offset. */
+exports.UTRIE2_SHIFT_2 = 5;
+/** Shift size for getting the index-1 table offset. */
+exports.UTRIE2_SHIFT_1 = 6 + 5;
+/**
+ * Shift size for shifting left the index array values.
+ * Increases possible data size with 16-bit index values at the cost
+ * of compactability.
+ * This requires data blocks to be aligned by UTRIE2_DATA_GRANULARITY.
+ */
+exports.UTRIE2_INDEX_SHIFT = 2;
+/**
+ * Difference between the two shift sizes,
+ * for getting an index-1 offset from an index-2 offset. 6=11-5
+ */
+exports.UTRIE2_SHIFT_1_2 = exports.UTRIE2_SHIFT_1 - exports.UTRIE2_SHIFT_2;
+/**
+ * The part of the index-2 table for U+D800..U+DBFF stores values for
+ * lead surrogate code _units_ not code _points_.
+ * Values for lead surrogate code _points_ are indexed with this portion of the table.
+ * Length=32=0x20=0x400>>UTRIE2_SHIFT_2. (There are 1024=0x400 lead surrogates.)
+ */
+exports.UTRIE2_LSCP_INDEX_2_OFFSET = 0x10000 >> exports.UTRIE2_SHIFT_2;
+/** Number of entries in a data block. 32=0x20 */
+exports.UTRIE2_DATA_BLOCK_LENGTH = 1 << exports.UTRIE2_SHIFT_2;
+/** Mask for getting the lower bits for the in-data-block offset. */
+exports.UTRIE2_DATA_MASK = exports.UTRIE2_DATA_BLOCK_LENGTH - 1;
+exports.UTRIE2_LSCP_INDEX_2_LENGTH = 0x400 >> exports.UTRIE2_SHIFT_2;
+/** Count the lengths of both BMP pieces. 2080=0x820 */
+exports.UTRIE2_INDEX_2_BMP_LENGTH = exports.UTRIE2_LSCP_INDEX_2_OFFSET + exports.UTRIE2_LSCP_INDEX_2_LENGTH;
+/**
+ * The 2-byte UTF-8 version of the index-2 table follows at offset 2080=0x820.
+ * Length 32=0x20 for lead bytes C0..DF, regardless of UTRIE2_SHIFT_2.
+ */
+exports.UTRIE2_UTF8_2B_INDEX_2_OFFSET = exports.UTRIE2_INDEX_2_BMP_LENGTH;
+exports.UTRIE2_UTF8_2B_INDEX_2_LENGTH = 0x800 >> 6; /* U+0800 is the first code point after 2-byte UTF-8 */
+/**
+ * The index-1 table, only used for supplementary code points, at offset 2112=0x840.
+ * Variable length, for code points up to highStart, where the last single-value range starts.
+ * Maximum length 512=0x200=0x100000>>UTRIE2_SHIFT_1.
+ * (For 0x100000 supplementary code points U+10000..U+10ffff.)
+ *
+ * The part of the index-2 table for supplementary code points starts
+ * after this index-1 table.
+ *
+ * Both the index-1 table and the following part of the index-2 table
+ * are omitted completely if there is only BMP data.
+ */
+exports.UTRIE2_INDEX_1_OFFSET = exports.UTRIE2_UTF8_2B_INDEX_2_OFFSET + exports.UTRIE2_UTF8_2B_INDEX_2_LENGTH;
+/**
+ * Number of index-1 entries for the BMP. 32=0x20
+ * This part of the index-1 table is omitted from the serialized form.
+ */
+exports.UTRIE2_OMITTED_BMP_INDEX_1_LENGTH = 0x10000 >> exports.UTRIE2_SHIFT_1;
+/** Number of entries in an index-2 block. 64=0x40 */
+exports.UTRIE2_INDEX_2_BLOCK_LENGTH = 1 << exports.UTRIE2_SHIFT_1_2;
+/** Mask for getting the lower bits for the in-index-2-block offset. */
+exports.UTRIE2_INDEX_2_MASK = exports.UTRIE2_INDEX_2_BLOCK_LENGTH - 1;
+var slice16 = function (view, start, end) {
+    if (view.slice) {
+        return view.slice(start, end);
+    }
+    return new Uint16Array(Array.prototype.slice.call(view, start, end));
+};
+var slice32 = function (view, start, end) {
+    if (view.slice) {
+        return view.slice(start, end);
+    }
+    return new Uint32Array(Array.prototype.slice.call(view, start, end));
+};
+var createTrieFromBase64 = function (base64, _byteLength) {
+    var buffer = Util_1.decode(base64);
+    var view32 = Array.isArray(buffer) ? Util_1.polyUint32Array(buffer) : new Uint32Array(buffer);
+    var view16 = Array.isArray(buffer) ? Util_1.polyUint16Array(buffer) : new Uint16Array(buffer);
+    var headerLength = 24;
+    var index = slice16(view16, headerLength / 2, view32[4] / 2);
+    var data = view32[5] === 2
+        ? slice16(view16, (headerLength + view32[4]) / 2)
+        : slice32(view32, Math.ceil((headerLength + view32[4]) / 4));
+    return new Trie(view32[0], view32[1], view32[2], view32[3], index, data);
+};
+exports.createTrieFromBase64 = createTrieFromBase64;
+var Trie = /** @class */ (function () {
+    function Trie(initialValue, errorValue, highStart, highValueIndex, index, data) {
+        this.initialValue = initialValue;
+        this.errorValue = errorValue;
+        this.highStart = highStart;
+        this.highValueIndex = highValueIndex;
+        this.index = index;
+        this.data = data;
+    }
+    /**
+     * Get the value for a code point as stored in the Trie.
+     *
+     * @param codePoint the code point
+     * @return the value
+     */
+    Trie.prototype.get = function (codePoint) {
+        var ix;
+        if (codePoint >= 0) {
+            if (codePoint < 0x0d800 || (codePoint > 0x0dbff && codePoint <= 0x0ffff)) {
+                // Ordinary BMP code point, excluding leading surrogates.
+                // BMP uses a single level lookup.  BMP index starts at offset 0 in the Trie2 index.
+                // 16 bit data is stored in the index array itself.
+                ix = this.index[codePoint >> exports.UTRIE2_SHIFT_2];
+                ix = (ix << exports.UTRIE2_INDEX_SHIFT) + (codePoint & exports.UTRIE2_DATA_MASK);
+                return this.data[ix];
+            }
+            if (codePoint <= 0xffff) {
+                // Lead Surrogate Code Point.  A Separate index section is stored for
+                // lead surrogate code units and code points.
+                //   The main index has the code unit data.
+                //   For this function, we need the code point data.
+                // Note: this expression could be refactored for slightly improved efficiency, but
+                //       surrogate code points will be so rare in practice that it's not worth it.
+                ix = this.index[exports.UTRIE2_LSCP_INDEX_2_OFFSET + ((codePoint - 0xd800) >> exports.UTRIE2_SHIFT_2)];
+                ix = (ix << exports.UTRIE2_INDEX_SHIFT) + (codePoint & exports.UTRIE2_DATA_MASK);
+                return this.data[ix];
+            }
+            if (codePoint < this.highStart) {
+                // Supplemental code point, use two-level lookup.
+                ix = exports.UTRIE2_INDEX_1_OFFSET - exports.UTRIE2_OMITTED_BMP_INDEX_1_LENGTH + (codePoint >> exports.UTRIE2_SHIFT_1);
+                ix = this.index[ix];
+                ix += (codePoint >> exports.UTRIE2_SHIFT_2) & exports.UTRIE2_INDEX_2_MASK;
+                ix = this.index[ix];
+                ix = (ix << exports.UTRIE2_INDEX_SHIFT) + (codePoint & exports.UTRIE2_DATA_MASK);
+                return this.data[ix];
+            }
+            if (codePoint <= 0x10ffff) {
+                return this.data[this.highValueIndex];
+            }
+        }
+        // Fall through.  The code point is outside of the legal range of 0..0x10ffff.
+        return this.errorValue;
+    };
+    return Trie;
+}());
+exports.Trie = Trie;
+//# sourceMappingURL=Trie.js.map
Index: imaps-frontend/node_modules/utrie/dist/lib/Trie.js.map
===================================================================
--- imaps-frontend/node_modules/utrie/dist/lib/Trie.js.map	(revision 79a03170cdde4e801d12257ee86723774970427b)
+++ imaps-frontend/node_modules/utrie/dist/lib/Trie.js.map	(revision 79a03170cdde4e801d12257ee86723774970427b)
@@ -0,0 +1,1 @@
+{"version":3,"file":"Trie.js","sourceRoot":"","sources":["../../src/Trie.ts"],"names":[],"mappings":";;;AAAA,+BAAgE;AAIhE,uDAAuD;AAC1C,QAAA,cAAc,GAAG,CAAC,CAAC;AAEhC,uDAAuD;AAC1C,QAAA,cAAc,GAAG,CAAC,GAAG,CAAC,CAAC;AAEpC;;;;;GAKG;AACU,QAAA,kBAAkB,GAAG,CAAC,CAAC;AAEpC;;;GAGG;AACU,QAAA,gBAAgB,GAAG,sBAAc,GAAG,sBAAc,CAAC;AAEhE;;;;;GAKG;AACU,QAAA,0BAA0B,GAAG,OAAO,IAAI,sBAAc,CAAC;AAEpE,iDAAiD;AACpC,QAAA,wBAAwB,GAAG,CAAC,IAAI,sBAAc,CAAC;AAC5D,oEAAoE;AACvD,QAAA,gBAAgB,GAAG,gCAAwB,GAAG,CAAC,CAAC;AAEhD,QAAA,0BAA0B,GAAG,KAAK,IAAI,sBAAc,CAAC;AAClE,uDAAuD;AAC1C,QAAA,yBAAyB,GAAG,kCAA0B,GAAG,kCAA0B,CAAC;AACjG;;;GAGG;AACU,QAAA,6BAA6B,GAAG,iCAAyB,CAAC;AAC1D,QAAA,6BAA6B,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,uDAAuD;AAChH;;;;;;;;;;;GAWG;AACU,QAAA,qBAAqB,GAAG,qCAA6B,GAAG,qCAA6B,CAAC;AAEnG;;;GAGG;AACU,QAAA,iCAAiC,GAAG,OAAO,IAAI,sBAAc,CAAC;AAE3E,qDAAqD;AACxC,QAAA,2BAA2B,GAAG,CAAC,IAAI,wBAAgB,CAAC;AACjE,uEAAuE;AAC1D,QAAA,mBAAmB,GAAG,mCAA2B,GAAG,CAAC,CAAC;AAEnE,IAAM,OAAO,GAAG,UAAC,IAA4B,EAAE,KAAa,EAAE,GAAY;IACtE,IAAI,IAAI,CAAC,KAAK,EAAE;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;KACjC;IAED,OAAO,IAAI,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;AACzE,CAAC,CAAC;AAEF,IAAM,OAAO,GAAG,UAAC,IAA4B,EAAE,KAAa,EAAE,GAAY;IACtE,IAAI,IAAI,CAAC,KAAK,EAAE;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;KACjC;IAED,OAAO,IAAI,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;AACzE,CAAC,CAAC;AAEK,IAAM,oBAAoB,GAAG,UAAC,MAAc,EAAE,WAAmB;IACpE,IAAM,MAAM,GAAG,aAAM,CAAC,MAAM,CAAC,CAAC;IAC9B,IAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,sBAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACzF,IAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,sBAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACzF,IAAM,YAAY,GAAG,EAAE,CAAC;IAExB,IAAM,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,YAAY,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/D,IAAM,IAAI,GACN,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;QACX,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAErE,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;AAC7E,CAAC,CAAC;AAbW,QAAA,oBAAoB,wBAa/B;AAEF;IAQI,cACI,YAAiB,EACjB,UAAe,EACf,SAAc,EACd,cAAmB,EACnB,KAA6B,EAC7B,IAA0C;QAE1C,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IACH,kBAAG,GAAH,UAAI,SAAiB;QACjB,IAAI,EAAE,CAAC;QACP,IAAI,SAAS,IAAI,CAAC,EAAE;YAChB,IAAI,SAAS,GAAG,OAAO,IAAI,CAAC,SAAS,GAAG,OAAO,IAAI,SAAS,IAAI,OAAO,CAAC,EAAE;gBACtE,yDAAyD;gBACzD,oFAAoF;gBACpF,mDAAmD;gBACnD,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,sBAAc,CAAC,CAAC;gBAC7C,EAAE,GAAG,CAAC,EAAE,IAAI,0BAAkB,CAAC,GAAG,CAAC,SAAS,GAAG,wBAAgB,CAAC,CAAC;gBACjE,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACxB;YAED,IAAI,SAAS,IAAI,MAAM,EAAE;gBACrB,qEAAqE;gBACrE,6CAA6C;gBAC7C,2CAA2C;gBAC3C,oDAAoD;gBACpD,kFAAkF;gBAClF,kFAAkF;gBAClF,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,kCAA0B,GAAG,CAAC,CAAC,SAAS,GAAG,MAAM,CAAC,IAAI,sBAAc,CAAC,CAAC,CAAC;gBACvF,EAAE,GAAG,CAAC,EAAE,IAAI,0BAAkB,CAAC,GAAG,CAAC,SAAS,GAAG,wBAAgB,CAAC,CAAC;gBACjE,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACxB;YAED,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE;gBAC5B,iDAAiD;gBACjD,EAAE,GAAG,6BAAqB,GAAG,yCAAiC,GAAG,CAAC,SAAS,IAAI,sBAAc,CAAC,CAAC;gBAC/F,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACpB,EAAE,IAAI,CAAC,SAAS,IAAI,sBAAc,CAAC,GAAG,2BAAmB,CAAC;gBAC1D,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACpB,EAAE,GAAG,CAAC,EAAE,IAAI,0BAAkB,CAAC,GAAG,CAAC,SAAS,GAAG,wBAAgB,CAAC,CAAC;gBACjE,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACxB;YACD,IAAI,SAAS,IAAI,QAAQ,EAAE;gBACvB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;aACzC;SACJ;QAED,8EAA8E;QAC9E,OAAO,IAAI,CAAC,UAAU,CAAC;IAC3B,CAAC;IACL,WAAC;AAAD,CAAC,AAvED,IAuEC;AAvEY,oBAAI"}
Index: imaps-frontend/node_modules/utrie/dist/lib/TrieBuilder.js
===================================================================
--- imaps-frontend/node_modules/utrie/dist/lib/TrieBuilder.js	(revision 79a03170cdde4e801d12257ee86723774970427b)
+++ imaps-frontend/node_modules/utrie/dist/lib/TrieBuilder.js	(revision 79a03170cdde4e801d12257ee86723774970427b)
@@ -0,0 +1,888 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.serializeBase64 = exports.TrieBuilder = exports.BITS_32 = exports.BITS_16 = void 0;
+var Trie_1 = require("./Trie");
+var base64_arraybuffer_1 = require("base64-arraybuffer");
+/**
+ * Trie2 constants, defining shift widths, index array lengths, etc.
+ *
+ * These are needed for the runtime macros but users can treat these as
+ * implementation details and skip to the actual public API further below.
+ */
+// const UTRIE2_OPTIONS_VALUE_BITS_MASK = 0x000f;
+/** Number of code points per index-1 table entry. 2048=0x800 */
+var UTRIE2_CP_PER_INDEX_1_ENTRY = 1 << Trie_1.UTRIE2_SHIFT_1;
+/** The alignment size of a data block. Also the granularity for compaction. */
+var UTRIE2_DATA_GRANULARITY = 1 << Trie_1.UTRIE2_INDEX_SHIFT;
+/* Fixed layout of the first part of the index array. ------------------- */
+/**
+ * The BMP part of the index-2 table is fixed and linear and starts at offset 0.
+ * Length=2048=0x800=0x10000>>UTRIE2_SHIFT_2.
+ */
+var UTRIE2_INDEX_2_OFFSET = 0;
+var UTRIE2_MAX_INDEX_1_LENGTH = 0x100000 >> Trie_1.UTRIE2_SHIFT_1;
+/*
+ * Fixed layout of the first part of the data array. -----------------------
+ * Starts with 4 blocks (128=0x80 entries) for ASCII.
+ */
+/**
+ * The illegal-UTF-8 data block follows the ASCII block, at offset 128=0x80.
+ * Used with linear access for single bytes 0..0xbf for simple error handling.
+ * Length 64=0x40, not UTRIE2_DATA_BLOCK_LENGTH.
+ */
+var UTRIE2_BAD_UTF8_DATA_OFFSET = 0x80;
+/** The start of non-linear-ASCII data blocks, at offset 192=0xc0. */
+var UTRIE2_DATA_START_OFFSET = 0xc0;
+/* Building a Trie2 ---------------------------------------------------------- */
+/*
+ * These definitions are mostly needed by utrie2_builder.c, but also by
+ * utrie2_get32() and utrie2_enum().
+ */
+/*
+ * At build time, leave a gap in the index-2 table,
+ * at least as long as the maximum lengths of the 2-byte UTF-8 index-2 table
+ * and the supplementary index-1 table.
+ * Round up to UTRIE2_INDEX_2_BLOCK_LENGTH for proper compacting.
+ */
+var UNEWTRIE2_INDEX_GAP_OFFSET = Trie_1.UTRIE2_INDEX_2_BMP_LENGTH;
+var UNEWTRIE2_INDEX_GAP_LENGTH = (Trie_1.UTRIE2_UTF8_2B_INDEX_2_LENGTH + UTRIE2_MAX_INDEX_1_LENGTH + Trie_1.UTRIE2_INDEX_2_MASK) & ~Trie_1.UTRIE2_INDEX_2_MASK;
+/**
+ * Maximum length of the build-time index-2 array.
+ * Maximum number of Unicode code points (0x110000) shifted right by UTRIE2_SHIFT_2,
+ * plus the part of the index-2 table for lead surrogate code points,
+ * plus the build-time index gap,
+ * plus the null index-2 block.
+ */
+var UNEWTRIE2_MAX_INDEX_2_LENGTH = (0x110000 >> Trie_1.UTRIE2_SHIFT_2) +
+    Trie_1.UTRIE2_LSCP_INDEX_2_LENGTH +
+    UNEWTRIE2_INDEX_GAP_LENGTH +
+    Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH;
+var UNEWTRIE2_INDEX_1_LENGTH = 0x110000 >> Trie_1.UTRIE2_SHIFT_1;
+/**
+ * Maximum length of the build-time data array.
+ * One entry per 0x110000 code points, plus the illegal-UTF-8 block and the null block,
+ * plus values for the 0x400 surrogate code units.
+ */
+var UNEWTRIE2_MAX_DATA_LENGTH = 0x110000 + 0x40 + 0x40 + 0x400;
+/* Start with allocation of 16k data entries. */
+var UNEWTRIE2_INITIAL_DATA_LENGTH = 1 << 14;
+/* Grow about 8x each time. */
+var UNEWTRIE2_MEDIUM_DATA_LENGTH = 1 << 17;
+/** The null index-2 block, following the gap in the index-2 table. */
+var UNEWTRIE2_INDEX_2_NULL_OFFSET = UNEWTRIE2_INDEX_GAP_OFFSET + UNEWTRIE2_INDEX_GAP_LENGTH;
+/** The start of allocated index-2 blocks. */
+var UNEWTRIE2_INDEX_2_START_OFFSET = UNEWTRIE2_INDEX_2_NULL_OFFSET + Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH;
+/**
+ * The null data block.
+ * Length 64=0x40 even if UTRIE2_DATA_BLOCK_LENGTH is smaller,
+ * to work with 6-bit trail bytes from 2-byte UTF-8.
+ */
+var UNEWTRIE2_DATA_NULL_OFFSET = UTRIE2_DATA_START_OFFSET;
+/** The start of allocated data blocks. */
+var UNEWTRIE2_DATA_START_OFFSET = UNEWTRIE2_DATA_NULL_OFFSET + 0x40;
+/**
+ * The start of data blocks for U+0800 and above.
+ * Below, compaction uses a block length of 64 for 2-byte UTF-8.
+ * From here on, compaction uses UTRIE2_DATA_BLOCK_LENGTH.
+ * Data values for 0x780 code points beyond ASCII.
+ */
+var UNEWTRIE2_DATA_0800_OFFSET = UNEWTRIE2_DATA_START_OFFSET + 0x780;
+/**
+ * Maximum length of the runtime index array.
+ * Limited by its own 16-bit index values, and by uint16_t UTrie2Header.indexLength.
+ * (The actual maximum length is lower,
+ * (0x110000>>UTRIE2_SHIFT_2)+UTRIE2_UTF8_2B_INDEX_2_LENGTH+UTRIE2_MAX_INDEX_1_LENGTH.)
+ */
+var UTRIE2_MAX_INDEX_LENGTH = 0xffff;
+/**
+ * Maximum length of the runtime data array.
+ * Limited by 16-bit index values that are left-shifted by UTRIE2_INDEX_SHIFT,
+ * and by uint16_t UTrie2Header.shiftedDataLength.
+ */
+var UTRIE2_MAX_DATA_LENGTH = 0xffff << Trie_1.UTRIE2_INDEX_SHIFT;
+exports.BITS_16 = 16;
+exports.BITS_32 = 32;
+var isHighSurrogate = function (c) { return c >= 0xd800 && c <= 0xdbff; };
+var equalInt = function (a, s, t, length) {
+    for (var i = 0; i < length; i++) {
+        if (a[s + i] !== a[t + i]) {
+            return false;
+        }
+    }
+    return true;
+};
+var TrieBuilder = /** @class */ (function () {
+    function TrieBuilder(initialValue, errorValue) {
+        if (initialValue === void 0) { initialValue = 0; }
+        if (errorValue === void 0) { errorValue = 0; }
+        this.initialValue = initialValue;
+        this.errorValue = errorValue;
+        this.highStart = 0x110000;
+        this.data = new Uint32Array(UNEWTRIE2_INITIAL_DATA_LENGTH);
+        this.dataCapacity = UNEWTRIE2_INITIAL_DATA_LENGTH;
+        this.highStart = 0x110000;
+        this.firstFreeBlock = 0; /* no free block in the list */
+        this.isCompacted = false;
+        this.index1 = new Uint32Array(UNEWTRIE2_INDEX_1_LENGTH);
+        this.index2 = new Uint32Array(UNEWTRIE2_MAX_INDEX_2_LENGTH);
+        /*
+         * Multi-purpose per-data-block table.
+         *
+         * Before compacting:
+         *
+         * Per-data-block reference counters/free-block list.
+         *  0: unused
+         * >0: reference counter (number of index-2 entries pointing here)
+         * <0: next free data block in free-block list
+         *
+         * While compacting:
+         *
+         * Map of adjusted indexes, used in compactData() and compactIndex2().
+         * Maps from original indexes to new ones.
+         */
+        this.map = new Uint32Array(UNEWTRIE2_MAX_DATA_LENGTH >> Trie_1.UTRIE2_SHIFT_2);
+        /*
+         * preallocate and reset
+         * - ASCII
+         * - the bad-UTF-8-data block
+         * - the null data block
+         */
+        var i, j;
+        for (i = 0; i < 0x80; ++i) {
+            this.data[i] = initialValue;
+        }
+        for (; i < 0xc0; ++i) {
+            this.data[i] = errorValue;
+        }
+        for (i = UNEWTRIE2_DATA_NULL_OFFSET; i < UNEWTRIE2_DATA_START_OFFSET; ++i) {
+            this.data[i] = initialValue;
+        }
+        this.dataNullOffset = UNEWTRIE2_DATA_NULL_OFFSET;
+        this.dataLength = UNEWTRIE2_DATA_START_OFFSET;
+        /* set the index-2 indexes for the 2=0x80>>UTRIE2_SHIFT_2 ASCII data blocks */
+        for (i = 0, j = 0; j < 0x80; ++i, j += Trie_1.UTRIE2_DATA_BLOCK_LENGTH) {
+            this.index2[i] = j;
+            this.map[i] = 1;
+        }
+        /* reference counts for the bad-UTF-8-data block */
+        for (; j < 0xc0; ++i, j += Trie_1.UTRIE2_DATA_BLOCK_LENGTH) {
+            this.map[i] = 0;
+        }
+        /*
+         * Reference counts for the null data block: all blocks except for the ASCII blocks.
+         * Plus 1 so that we don't drop this block during compaction.
+         * Plus as many as needed for lead surrogate code points.
+         */
+        /* i==newTrie->dataNullOffset */
+        this.map[i++] = (0x110000 >> Trie_1.UTRIE2_SHIFT_2) - (0x80 >> Trie_1.UTRIE2_SHIFT_2) + 1 + Trie_1.UTRIE2_LSCP_INDEX_2_LENGTH;
+        j += Trie_1.UTRIE2_DATA_BLOCK_LENGTH;
+        for (; j < UNEWTRIE2_DATA_START_OFFSET; ++i, j += Trie_1.UTRIE2_DATA_BLOCK_LENGTH) {
+            this.map[i] = 0;
+        }
+        /*
+         * set the remaining indexes in the BMP index-2 block
+         * to the null data block
+         */
+        for (i = 0x80 >> Trie_1.UTRIE2_SHIFT_2; i < Trie_1.UTRIE2_INDEX_2_BMP_LENGTH; ++i) {
+            this.index2[i] = UNEWTRIE2_DATA_NULL_OFFSET;
+        }
+        /*
+         * Fill the index gap with impossible values so that compaction
+         * does not overlap other index-2 blocks with the gap.
+         */
+        for (i = 0; i < UNEWTRIE2_INDEX_GAP_LENGTH; ++i) {
+            this.index2[UNEWTRIE2_INDEX_GAP_OFFSET + i] = -1;
+        }
+        /* set the indexes in the null index-2 block */
+        for (i = 0; i < Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH; ++i) {
+            this.index2[UNEWTRIE2_INDEX_2_NULL_OFFSET + i] = UNEWTRIE2_DATA_NULL_OFFSET;
+        }
+        this.index2NullOffset = UNEWTRIE2_INDEX_2_NULL_OFFSET;
+        this.index2Length = UNEWTRIE2_INDEX_2_START_OFFSET;
+        /* set the index-1 indexes for the linear index-2 block */
+        for (i = 0, j = 0; i < Trie_1.UTRIE2_OMITTED_BMP_INDEX_1_LENGTH; ++i, j += Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH) {
+            this.index1[i] = j;
+        }
+        /* set the remaining index-1 indexes to the null index-2 block */
+        for (; i < UNEWTRIE2_INDEX_1_LENGTH; ++i) {
+            this.index1[i] = UNEWTRIE2_INDEX_2_NULL_OFFSET;
+        }
+        /*
+         * Preallocate and reset data for U+0080..U+07ff,
+         * for 2-byte UTF-8 which will be compacted in 64-blocks
+         * even if UTRIE2_DATA_BLOCK_LENGTH is smaller.
+         */
+        for (i = 0x80; i < 0x800; i += Trie_1.UTRIE2_DATA_BLOCK_LENGTH) {
+            this.set(i, initialValue);
+        }
+    }
+    /**
+     * Set a value for a code point.
+     *
+     * @param c the code point
+     * @param value the value
+     */
+    TrieBuilder.prototype.set = function (c, value) {
+        if (c < 0 || c > 0x10ffff) {
+            throw new Error('Invalid code point.');
+        }
+        this._set(c, true, value);
+        return this;
+    };
+    /**
+     * Set a value in a range of code points [start..end].
+     * All code points c with start<=c<=end will get the value if
+     * overwrite is TRUE or if the old value is the initial value.
+     *
+     * @param start the first code point to get the value
+     * @param end the last code point to get the value (inclusive)
+     * @param value the value
+     * @param overwrite flag for whether old non-initial values are to be overwritten
+     */
+    TrieBuilder.prototype.setRange = function (start, end, value, overwrite) {
+        if (overwrite === void 0) { overwrite = false; }
+        /*
+         * repeat value in [start..end]
+         * mark index values for repeat-data blocks by setting bit 31 of the index values
+         * fill around existing values if any, if(overwrite)
+         */
+        var block, rest, repeatBlock;
+        if (start > 0x10ffff || start < 0 || end > 0x10ffff || end < 0 || start > end) {
+            throw new Error('Invalid code point range.');
+        }
+        if (!overwrite && value === this.initialValue) {
+            return this; /* nothing to do */
+        }
+        if (this.isCompacted) {
+            throw new Error('Trie was already compacted');
+        }
+        var limit = end + 1;
+        if ((start & Trie_1.UTRIE2_DATA_MASK) !== 0) {
+            /* set partial block at [start..following block boundary[ */
+            block = this.getDataBlock(start, true);
+            var nextStart = (start + Trie_1.UTRIE2_DATA_BLOCK_LENGTH) & ~Trie_1.UTRIE2_DATA_MASK;
+            if (nextStart <= limit) {
+                this.fillBlock(block, start & Trie_1.UTRIE2_DATA_MASK, Trie_1.UTRIE2_DATA_BLOCK_LENGTH, value, this.initialValue, overwrite);
+                start = nextStart;
+            }
+            else {
+                this.fillBlock(block, start & Trie_1.UTRIE2_DATA_MASK, limit & Trie_1.UTRIE2_DATA_MASK, value, this.initialValue, overwrite);
+                return this;
+            }
+        }
+        /* number of positions in the last, partial block */
+        rest = limit & Trie_1.UTRIE2_DATA_MASK;
+        /* round down limit to a block boundary */
+        limit &= ~Trie_1.UTRIE2_DATA_MASK;
+        /* iterate over all-value blocks */
+        repeatBlock = value === this.initialValue ? this.dataNullOffset : -1;
+        while (start < limit) {
+            var i2 = void 0;
+            var setRepeatBlock = false;
+            if (value === this.initialValue && this.isInNullBlock(start, true)) {
+                start += Trie_1.UTRIE2_DATA_BLOCK_LENGTH; /* nothing to do */
+                continue;
+            }
+            /* get index value */
+            i2 = this.getIndex2Block(start, true);
+            i2 += (start >> Trie_1.UTRIE2_SHIFT_2) & Trie_1.UTRIE2_INDEX_2_MASK;
+            block = this.index2[i2];
+            if (this.isWritableBlock(block)) {
+                /* already allocated */
+                if (overwrite && block >= UNEWTRIE2_DATA_0800_OFFSET) {
+                    /*
+                     * We overwrite all values, and it's not a
+                     * protected (ASCII-linear or 2-byte UTF-8) block:
+                     * replace with the repeatBlock.
+                     */
+                    setRepeatBlock = true;
+                }
+                else {
+                    /* !overwrite, or protected block: just write the values into this block */
+                    this.fillBlock(block, 0, Trie_1.UTRIE2_DATA_BLOCK_LENGTH, value, this.initialValue, overwrite);
+                }
+            }
+            else if (this.data[block] !== value && (overwrite || block === this.dataNullOffset)) {
+                /*
+                 * Set the repeatBlock instead of the null block or previous repeat block:
+                 *
+                 * If !isWritableBlock() then all entries in the block have the same value
+                 * because it's the null block or a range block (the repeatBlock from a previous
+                 * call to utrie2_setRange32()).
+                 * No other blocks are used multiple times before compacting.
+                 *
+                 * The null block is the only non-writable block with the initialValue because
+                 * of the repeatBlock initialization above. (If value==initialValue, then
+                 * the repeatBlock will be the null data block.)
+                 *
+                 * We set our repeatBlock if the desired value differs from the block's value,
+                 * and if we overwrite any data or if the data is all initial values
+                 * (which is the same as the block being the null block, see above).
+                 */
+                setRepeatBlock = true;
+            }
+            if (setRepeatBlock) {
+                if (repeatBlock >= 0) {
+                    this.setIndex2Entry(i2, repeatBlock);
+                }
+                else {
+                    /* create and set and fill the repeatBlock */
+                    repeatBlock = this.getDataBlock(start, true);
+                    this.writeBlock(repeatBlock, value);
+                }
+            }
+            start += Trie_1.UTRIE2_DATA_BLOCK_LENGTH;
+        }
+        if (rest > 0) {
+            /* set partial block at [last block boundary..limit[ */
+            block = this.getDataBlock(start, true);
+            this.fillBlock(block, 0, rest, value, this.initialValue, overwrite);
+        }
+        return this;
+    };
+    /**
+     * Get the value for a code point as stored in the Trie2.
+     *
+     * @param codePoint the code point
+     * @return the value
+     */
+    TrieBuilder.prototype.get = function (codePoint) {
+        if (codePoint < 0 || codePoint > 0x10ffff) {
+            return this.errorValue;
+        }
+        else {
+            return this._get(codePoint, true);
+        }
+    };
+    TrieBuilder.prototype._get = function (c, fromLSCP) {
+        var i2;
+        if (c >= this.highStart && (!(c >= 0xd800 && c < 0xdc00) || fromLSCP)) {
+            return this.data[this.dataLength - UTRIE2_DATA_GRANULARITY];
+        }
+        if (c >= 0xd800 && c < 0xdc00 && fromLSCP) {
+            i2 = Trie_1.UTRIE2_LSCP_INDEX_2_OFFSET - (0xd800 >> Trie_1.UTRIE2_SHIFT_2) + (c >> Trie_1.UTRIE2_SHIFT_2);
+        }
+        else {
+            i2 = this.index1[c >> Trie_1.UTRIE2_SHIFT_1] + ((c >> Trie_1.UTRIE2_SHIFT_2) & Trie_1.UTRIE2_INDEX_2_MASK);
+        }
+        var block = this.index2[i2];
+        return this.data[block + (c & Trie_1.UTRIE2_DATA_MASK)];
+    };
+    TrieBuilder.prototype.freeze = function (valueBits) {
+        if (valueBits === void 0) { valueBits = exports.BITS_32; }
+        var i;
+        var allIndexesLength;
+        var dataMove; /* >0 if the data is moved to the end of the index array */
+        /* compact if necessary */
+        if (!this.isCompacted) {
+            this.compactTrie();
+        }
+        allIndexesLength = this.highStart <= 0x10000 ? Trie_1.UTRIE2_INDEX_1_OFFSET : this.index2Length;
+        if (valueBits === exports.BITS_16) {
+            // dataMove = allIndexesLength;
+            dataMove = 0;
+        }
+        else {
+            dataMove = 0;
+        }
+        /* are indexLength and dataLength within limits? */
+        if (
+        /* for unshifted indexLength */
+        allIndexesLength > UTRIE2_MAX_INDEX_LENGTH ||
+            /* for unshifted dataNullOffset */
+            dataMove + this.dataNullOffset > 0xffff ||
+            /* for unshifted 2-byte UTF-8 index-2 values */
+            dataMove + UNEWTRIE2_DATA_0800_OFFSET > 0xffff ||
+            /* for shiftedDataLength */
+            dataMove + this.dataLength > UTRIE2_MAX_DATA_LENGTH) {
+            throw new Error('Trie data is too large.');
+        }
+        var index = new Uint16Array(allIndexesLength);
+        /* write the index-2 array values shifted right by UTRIE2_INDEX_SHIFT, after adding dataMove */
+        var destIdx = 0;
+        for (i = 0; i < Trie_1.UTRIE2_INDEX_2_BMP_LENGTH; i++) {
+            index[destIdx++] = (this.index2[i] + dataMove) >> Trie_1.UTRIE2_INDEX_SHIFT;
+        }
+        /* write UTF-8 2-byte index-2 values, not right-shifted */
+        for (i = 0; i < 0xc2 - 0xc0; ++i) {
+            /* C0..C1 */
+            index[destIdx++] = dataMove + UTRIE2_BAD_UTF8_DATA_OFFSET;
+        }
+        for (; i < 0xe0 - 0xc0; ++i) {
+            /* C2..DF */
+            index[destIdx++] = dataMove + this.index2[i << (6 - Trie_1.UTRIE2_SHIFT_2)];
+        }
+        if (this.highStart > 0x10000) {
+            var index1Length = (this.highStart - 0x10000) >> Trie_1.UTRIE2_SHIFT_1;
+            var index2Offset = Trie_1.UTRIE2_INDEX_2_BMP_LENGTH + Trie_1.UTRIE2_UTF8_2B_INDEX_2_LENGTH + index1Length;
+            /* write 16-bit index-1 values for supplementary code points */
+            for (i = 0; i < index1Length; i++) {
+                index[destIdx++] = UTRIE2_INDEX_2_OFFSET + this.index1[i + Trie_1.UTRIE2_OMITTED_BMP_INDEX_1_LENGTH];
+            }
+            /*
+             * write the index-2 array values for supplementary code points,
+             * shifted right by UTRIE2_INDEX_SHIFT, after adding dataMove
+             */
+            for (i = 0; i < this.index2Length - index2Offset; i++) {
+                index[destIdx++] = (dataMove + this.index2[index2Offset + i]) >> Trie_1.UTRIE2_INDEX_SHIFT;
+            }
+        }
+        /* write the 16/32-bit data array */
+        switch (valueBits) {
+            case exports.BITS_16:
+                /* write 16-bit data values */
+                var data16 = new Uint16Array(this.dataLength);
+                for (i = 0; i < this.dataLength; i++) {
+                    data16[i] = this.data[i];
+                }
+                return new Trie_1.Trie(this.initialValue, this.errorValue, this.highStart, dataMove + this.dataLength - UTRIE2_DATA_GRANULARITY, index, data16);
+            case exports.BITS_32:
+                /* write 32-bit data values */
+                var data32 = new Uint32Array(this.dataLength);
+                for (i = 0; i < this.dataLength; i++) {
+                    data32[i] = this.data[i];
+                }
+                return new Trie_1.Trie(this.initialValue, this.errorValue, this.highStart, dataMove + this.dataLength - UTRIE2_DATA_GRANULARITY, index, data32);
+            default:
+                throw new Error('Bits should be either 16 or 32');
+        }
+    };
+    /*
+     * Find the start of the last range in the trie by enumerating backward.
+     * Indexes for supplementary code points higher than this will be omitted.
+     */
+    TrieBuilder.prototype.findHighStart = function (highValue) {
+        var value;
+        var i2, j, i2Block, prevI2Block, block, prevBlock;
+        /* set variables for previous range */
+        if (highValue === this.initialValue) {
+            prevI2Block = this.index2NullOffset;
+            prevBlock = this.dataNullOffset;
+        }
+        else {
+            prevI2Block = -1;
+            prevBlock = -1;
+        }
+        var prev = 0x110000;
+        /* enumerate index-2 blocks */
+        var i1 = UNEWTRIE2_INDEX_1_LENGTH;
+        var c = prev;
+        while (c > 0) {
+            i2Block = this.index1[--i1];
+            if (i2Block === prevI2Block) {
+                /* the index-2 block is the same as the previous one, and filled with highValue */
+                c -= UTRIE2_CP_PER_INDEX_1_ENTRY;
+                continue;
+            }
+            prevI2Block = i2Block;
+            if (i2Block === this.index2NullOffset) {
+                /* this is the null index-2 block */
+                if (highValue !== this.initialValue) {
+                    return c;
+                }
+                c -= UTRIE2_CP_PER_INDEX_1_ENTRY;
+            }
+            else {
+                /* enumerate data blocks for one index-2 block */
+                for (i2 = Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH; i2 > 0;) {
+                    block = this.index2[i2Block + --i2];
+                    if (block === prevBlock) {
+                        /* the block is the same as the previous one, and filled with highValue */
+                        c -= Trie_1.UTRIE2_DATA_BLOCK_LENGTH;
+                        continue;
+                    }
+                    prevBlock = block;
+                    if (block === this.dataNullOffset) {
+                        /* this is the null data block */
+                        if (highValue !== this.initialValue) {
+                            return c;
+                        }
+                        c -= Trie_1.UTRIE2_DATA_BLOCK_LENGTH;
+                    }
+                    else {
+                        for (j = Trie_1.UTRIE2_DATA_BLOCK_LENGTH; j > 0;) {
+                            value = this.data[block + --j];
+                            if (value !== highValue) {
+                                return c;
+                            }
+                            --c;
+                        }
+                    }
+                }
+            }
+        }
+        /* deliver last range */
+        return 0;
+    };
+    /*
+     * Compact a build-time trie.
+     *
+     * The compaction
+     * - removes blocks that are identical with earlier ones
+     * - overlaps adjacent blocks as much as possible (if overlap==TRUE)
+     * - moves blocks in steps of the data granularity
+     * - moves and overlaps blocks that overlap with multiple values in the overlap region
+     *
+     * It does not
+     * - try to move and overlap blocks that are not already adjacent
+     */
+    TrieBuilder.prototype.compactData = function () {
+        var start, movedStart;
+        var blockLength, overlap;
+        var i, mapIndex, blockCount;
+        /* do not compact linear-ASCII data */
+        var newStart = UTRIE2_DATA_START_OFFSET;
+        for (start = 0, i = 0; start < newStart; start += Trie_1.UTRIE2_DATA_BLOCK_LENGTH, ++i) {
+            this.map[i] = start;
+        }
+        /*
+         * Start with a block length of 64 for 2-byte UTF-8,
+         * then switch to UTRIE2_DATA_BLOCK_LENGTH.
+         */
+        blockLength = 64;
+        blockCount = blockLength >> Trie_1.UTRIE2_SHIFT_2;
+        for (start = newStart; start < this.dataLength;) {
+            /*
+             * start: index of first entry of current block
+             * newStart: index where the current block is to be moved
+             *           (right after current end of already-compacted data)
+             */
+            if (start === UNEWTRIE2_DATA_0800_OFFSET) {
+                blockLength = Trie_1.UTRIE2_DATA_BLOCK_LENGTH;
+                blockCount = 1;
+            }
+            /* skip blocks that are not used */
+            if (this.map[start >> Trie_1.UTRIE2_SHIFT_2] <= 0) {
+                /* advance start to the next block */
+                start += blockLength;
+                /* leave newStart with the previous block! */
+                continue;
+            }
+            /* search for an identical block */
+            movedStart = this.findSameDataBlock(newStart, start, blockLength);
+            if (movedStart >= 0) {
+                /* found an identical block, set the other block's index value for the current block */
+                for (i = blockCount, mapIndex = start >> Trie_1.UTRIE2_SHIFT_2; i > 0; --i) {
+                    this.map[mapIndex++] = movedStart;
+                    movedStart += Trie_1.UTRIE2_DATA_BLOCK_LENGTH;
+                }
+                /* advance start to the next block */
+                start += blockLength;
+                /* leave newStart with the previous block! */
+                continue;
+            }
+            /* see if the beginning of this block can be overlapped with the end of the previous block */
+            /* look for maximum overlap (modulo granularity) with the previous, adjacent block */
+            for (overlap = blockLength - UTRIE2_DATA_GRANULARITY; overlap > 0 && !equalInt(this.data, newStart - overlap, start, overlap); overlap -= UTRIE2_DATA_GRANULARITY) { }
+            if (overlap > 0 || newStart < start) {
+                /* some overlap, or just move the whole block */
+                movedStart = newStart - overlap;
+                for (i = blockCount, mapIndex = start >> Trie_1.UTRIE2_SHIFT_2; i > 0; --i) {
+                    this.map[mapIndex++] = movedStart;
+                    movedStart += Trie_1.UTRIE2_DATA_BLOCK_LENGTH;
+                }
+                /* move the non-overlapping indexes to their new positions */
+                start += overlap;
+                for (i = blockLength - overlap; i > 0; --i) {
+                    this.data[newStart++] = this.data[start++];
+                }
+            }
+            else {
+                /* no overlap && newStart==start */
+                for (i = blockCount, mapIndex = start >> Trie_1.UTRIE2_SHIFT_2; i > 0; --i) {
+                    this.map[mapIndex++] = start;
+                    start += Trie_1.UTRIE2_DATA_BLOCK_LENGTH;
+                }
+                newStart = start;
+            }
+        }
+        /* now adjust the index-2 table */
+        for (i = 0; i < this.index2Length; ++i) {
+            if (i === UNEWTRIE2_INDEX_GAP_OFFSET) {
+                /* Gap indexes are invalid (-1). Skip over the gap. */
+                i += UNEWTRIE2_INDEX_GAP_LENGTH;
+            }
+            this.index2[i] = this.map[this.index2[i] >> Trie_1.UTRIE2_SHIFT_2];
+        }
+        this.dataNullOffset = this.map[this.dataNullOffset >> Trie_1.UTRIE2_SHIFT_2];
+        /* ensure dataLength alignment */
+        while ((newStart & (UTRIE2_DATA_GRANULARITY - 1)) !== 0) {
+            this.data[newStart++] = this.initialValue;
+        }
+        this.dataLength = newStart;
+    };
+    TrieBuilder.prototype.findSameDataBlock = function (dataLength, otherBlock, blockLength) {
+        var block = 0;
+        /* ensure that we do not even partially get past dataLength */
+        dataLength -= blockLength;
+        for (; block <= dataLength; block += UTRIE2_DATA_GRANULARITY) {
+            if (equalInt(this.data, block, otherBlock, blockLength)) {
+                return block;
+            }
+        }
+        return -1;
+    };
+    TrieBuilder.prototype.compactTrie = function () {
+        var highValue = this.get(0x10ffff);
+        /* find highStart and round it up */
+        var localHighStart = this.findHighStart(highValue);
+        localHighStart = (localHighStart + (UTRIE2_CP_PER_INDEX_1_ENTRY - 1)) & ~(UTRIE2_CP_PER_INDEX_1_ENTRY - 1);
+        if (localHighStart === 0x110000) {
+            highValue = this.errorValue;
+        }
+        /*
+         * Set trie->highStart only after utrie2_get32(trie, highStart).
+         * Otherwise utrie2_get32(trie, highStart) would try to read the highValue.
+         */
+        this.highStart = localHighStart;
+        if (this.highStart < 0x110000) {
+            /* Blank out [highStart..10ffff] to release associated data blocks. */
+            var suppHighStart = this.highStart <= 0x10000 ? 0x10000 : this.highStart;
+            this.setRange(suppHighStart, 0x10ffff, this.initialValue, true);
+        }
+        this.compactData();
+        if (this.highStart > 0x10000) {
+            this.compactIndex2();
+        }
+        /*
+         * Store the highValue in the data array and round up the dataLength.
+         * Must be done after compactData() because that assumes that dataLength
+         * is a multiple of UTRIE2_DATA_BLOCK_LENGTH.
+         */
+        this.data[this.dataLength++] = highValue;
+        while ((this.dataLength & (UTRIE2_DATA_GRANULARITY - 1)) !== 0) {
+            this.data[this.dataLength++] = this.initialValue;
+        }
+        this.isCompacted = true;
+    };
+    TrieBuilder.prototype.compactIndex2 = function () {
+        var i, start, movedStart, overlap;
+        /* do not compact linear-BMP index-2 blocks */
+        var newStart = Trie_1.UTRIE2_INDEX_2_BMP_LENGTH;
+        for (start = 0, i = 0; start < newStart; start += Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH, ++i) {
+            this.map[i] = start;
+        }
+        /* Reduce the index table gap to what will be needed at runtime. */
+        newStart += Trie_1.UTRIE2_UTF8_2B_INDEX_2_LENGTH + ((this.highStart - 0x10000) >> Trie_1.UTRIE2_SHIFT_1);
+        for (start = UNEWTRIE2_INDEX_2_NULL_OFFSET; start < this.index2Length;) {
+            /*
+             * start: index of first entry of current block
+             * newStart: index where the current block is to be moved
+             *           (right after current end of already-compacted data)
+             */
+            /* search for an identical block */
+            if ((movedStart = this.findSameIndex2Block(newStart, start)) >= 0) {
+                /* found an identical block, set the other block's index value for the current block */
+                this.map[start >> Trie_1.UTRIE2_SHIFT_1_2] = movedStart;
+                /* advance start to the next block */
+                start += Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH;
+                /* leave newStart with the previous block! */
+                continue;
+            }
+            /* see if the beginning of this block can be overlapped with the end of the previous block */
+            /* look for maximum overlap with the previous, adjacent block */
+            for (overlap = Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH - 1; overlap > 0 && !equalInt(this.index2, newStart - overlap, start, overlap); --overlap) { }
+            if (overlap > 0 || newStart < start) {
+                /* some overlap, or just move the whole block */
+                this.map[start >> Trie_1.UTRIE2_SHIFT_1_2] = newStart - overlap;
+                /* move the non-overlapping indexes to their new positions */
+                start += overlap;
+                for (i = Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH - overlap; i > 0; --i) {
+                    this.index2[newStart++] = this.index2[start++];
+                }
+            }
+            else {
+                /* no overlap && newStart==start */ this.map[start >> Trie_1.UTRIE2_SHIFT_1_2] = start;
+                start += Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH;
+                newStart = start;
+            }
+        }
+        /* now adjust the index-1 table */
+        for (i = 0; i < UNEWTRIE2_INDEX_1_LENGTH; ++i) {
+            this.index1[i] = this.map[this.index1[i] >> Trie_1.UTRIE2_SHIFT_1_2];
+        }
+        this.index2NullOffset = this.map[this.index2NullOffset >> Trie_1.UTRIE2_SHIFT_1_2];
+        /*
+         * Ensure data table alignment:
+         * Needs to be granularity-aligned for 16-bit trie
+         * (so that dataMove will be down-shiftable),
+         * and 2-aligned for uint32_t data.
+         */
+        while ((newStart & ((UTRIE2_DATA_GRANULARITY - 1) | 1)) !== 0) {
+            /* Arbitrary value: 0x3fffc not possible for real data. */
+            this.index2[newStart++] = 0x0000ffff << Trie_1.UTRIE2_INDEX_SHIFT;
+        }
+        this.index2Length = newStart;
+    };
+    TrieBuilder.prototype.findSameIndex2Block = function (index2Length, otherBlock) {
+        /* ensure that we do not even partially get past index2Length */
+        index2Length -= Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH;
+        for (var block = 0; block <= index2Length; ++block) {
+            if (equalInt(this.index2, block, otherBlock, Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH)) {
+                return block;
+            }
+        }
+        return -1;
+    };
+    TrieBuilder.prototype._set = function (c, forLSCP, value) {
+        if (this.isCompacted) {
+            throw new Error('Trie was already compacted');
+        }
+        var block = this.getDataBlock(c, forLSCP);
+        this.data[block + (c & Trie_1.UTRIE2_DATA_MASK)] = value;
+        return this;
+    };
+    TrieBuilder.prototype.writeBlock = function (block, value) {
+        var limit = block + Trie_1.UTRIE2_DATA_BLOCK_LENGTH;
+        while (block < limit) {
+            this.data[block++] = value;
+        }
+    };
+    TrieBuilder.prototype.isInNullBlock = function (c, forLSCP) {
+        var i2 = isHighSurrogate(c) && forLSCP
+            ? Trie_1.UTRIE2_LSCP_INDEX_2_OFFSET - (0xd800 >> Trie_1.UTRIE2_SHIFT_2) + (c >> Trie_1.UTRIE2_SHIFT_2)
+            : this.index1[c >> Trie_1.UTRIE2_SHIFT_1] + ((c >> Trie_1.UTRIE2_SHIFT_2) & Trie_1.UTRIE2_INDEX_2_MASK);
+        var block = this.index2[i2];
+        return block === this.dataNullOffset;
+    };
+    TrieBuilder.prototype.fillBlock = function (block, start, limit, value, initialValue, overwrite) {
+        var pLimit = block + limit;
+        if (overwrite) {
+            for (var i = block + start; i < pLimit; i++) {
+                this.data[i] = value;
+            }
+        }
+        else {
+            for (var i = block + start; i < pLimit; i++) {
+                if (this.data[i] === initialValue) {
+                    this.data[i] = value;
+                }
+            }
+        }
+    };
+    TrieBuilder.prototype.setIndex2Entry = function (i2, block) {
+        ++this.map[block >> Trie_1.UTRIE2_SHIFT_2]; /* increment first, in case block==oldBlock! */
+        var oldBlock = this.index2[i2];
+        if (0 === --this.map[oldBlock >> Trie_1.UTRIE2_SHIFT_2]) {
+            this.releaseDataBlock(oldBlock);
+        }
+        this.index2[i2] = block;
+    };
+    TrieBuilder.prototype.releaseDataBlock = function (block) {
+        /* put this block at the front of the free-block chain */
+        this.map[block >> Trie_1.UTRIE2_SHIFT_2] = -this.firstFreeBlock;
+        this.firstFreeBlock = block;
+    };
+    TrieBuilder.prototype.getDataBlock = function (c, forLSCP) {
+        var i2 = this.getIndex2Block(c, forLSCP);
+        i2 += (c >> Trie_1.UTRIE2_SHIFT_2) & Trie_1.UTRIE2_INDEX_2_MASK;
+        var oldBlock = this.index2[i2];
+        if (this.isWritableBlock(oldBlock)) {
+            return oldBlock;
+        }
+        /* allocate a new data block */
+        var newBlock = this.allocDataBlock(oldBlock);
+        this.setIndex2Entry(i2, newBlock);
+        return newBlock;
+    };
+    TrieBuilder.prototype.isWritableBlock = function (block) {
+        return block !== this.dataNullOffset && 1 === this.map[block >> Trie_1.UTRIE2_SHIFT_2];
+    };
+    TrieBuilder.prototype.getIndex2Block = function (c, forLSCP) {
+        if (c >= 0xd800 && c < 0xdc00 && forLSCP) {
+            return Trie_1.UTRIE2_LSCP_INDEX_2_OFFSET;
+        }
+        var i1 = c >> Trie_1.UTRIE2_SHIFT_1;
+        var i2 = this.index1[i1];
+        if (i2 === this.index2NullOffset) {
+            i2 = this.allocIndex2Block();
+            this.index1[i1] = i2;
+        }
+        return i2;
+    };
+    TrieBuilder.prototype.allocDataBlock = function (copyBlock) {
+        var newBlock;
+        if (this.firstFreeBlock !== 0) {
+            /* get the first free block */
+            newBlock = this.firstFreeBlock;
+            this.firstFreeBlock = -this.map[newBlock >> Trie_1.UTRIE2_SHIFT_2];
+        }
+        else {
+            /* get a new block from the high end */
+            newBlock = this.dataLength;
+            var newTop = newBlock + Trie_1.UTRIE2_DATA_BLOCK_LENGTH;
+            if (newTop > this.dataCapacity) {
+                var capacity = void 0;
+                /* out of memory in the data array */
+                if (this.dataCapacity < UNEWTRIE2_MEDIUM_DATA_LENGTH) {
+                    capacity = UNEWTRIE2_MEDIUM_DATA_LENGTH;
+                }
+                else if (this.dataCapacity < UNEWTRIE2_MAX_DATA_LENGTH) {
+                    capacity = UNEWTRIE2_MAX_DATA_LENGTH;
+                }
+                else {
+                    /*
+                     * Should never occur.
+                     * Either UNEWTRIE2_MAX_DATA_LENGTH is incorrect,
+                     * or the code writes more values than should be possible.
+                     */
+                    throw new Error('Internal error in Trie creation.');
+                }
+                var newData = new Uint32Array(capacity);
+                newData.set(this.data.subarray(0, this.dataLength));
+                this.data = newData;
+                this.dataCapacity = capacity;
+            }
+            this.dataLength = newTop;
+        }
+        this.data.set(this.data.subarray(copyBlock, copyBlock + Trie_1.UTRIE2_DATA_BLOCK_LENGTH), newBlock);
+        this.map[newBlock >> Trie_1.UTRIE2_SHIFT_2] = 0;
+        return newBlock;
+    };
+    TrieBuilder.prototype.allocIndex2Block = function () {
+        var newBlock = this.index2Length;
+        var newTop = newBlock + Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH;
+        if (newTop > this.index2.length) {
+            throw new Error('Internal error in Trie creation.');
+            /*
+             * Should never occur.
+             * Either UTRIE2_MAX_BUILD_TIME_INDEX_LENGTH is incorrect,
+             * or the code writes more values than should be possible.
+             */
+        }
+        this.index2Length = newTop;
+        this.index2.set(this.index2.subarray(this.index2NullOffset, this.index2NullOffset + Trie_1.UTRIE2_INDEX_2_BLOCK_LENGTH), newBlock);
+        return newBlock;
+    };
+    return TrieBuilder;
+}());
+exports.TrieBuilder = TrieBuilder;
+var serializeBase64 = function (trie) {
+    var index = trie.index;
+    var data = trie.data;
+    if (!(index instanceof Uint16Array) || !(data instanceof Uint16Array || data instanceof Uint32Array)) {
+        throw new Error('TrieBuilder serializer only support TypedArrays');
+    }
+    var headerLength = Uint32Array.BYTES_PER_ELEMENT * 6;
+    var bufferLength = headerLength + index.byteLength + data.byteLength;
+    var buffer = new ArrayBuffer(Math.ceil(bufferLength / 4) * 4);
+    var view32 = new Uint32Array(buffer);
+    var view16 = new Uint16Array(buffer);
+    view32[0] = trie.initialValue;
+    view32[1] = trie.errorValue;
+    view32[2] = trie.highStart;
+    view32[3] = trie.highValueIndex;
+    view32[4] = index.byteLength;
+    // $FlowFixMe
+    view32[5] = data.BYTES_PER_ELEMENT;
+    view16.set(index, headerLength / Uint16Array.BYTES_PER_ELEMENT);
+    if (data.BYTES_PER_ELEMENT === Uint16Array.BYTES_PER_ELEMENT) {
+        view16.set(data, (headerLength + index.byteLength) / Uint16Array.BYTES_PER_ELEMENT);
+    }
+    else {
+        view32.set(data, Math.ceil((headerLength + index.byteLength) / Uint32Array.BYTES_PER_ELEMENT));
+    }
+    return [base64_arraybuffer_1.encode(new Uint8Array(buffer)), buffer.byteLength];
+};
+exports.serializeBase64 = serializeBase64;
+//# sourceMappingURL=TrieBuilder.js.map
Index: imaps-frontend/node_modules/utrie/dist/lib/TrieBuilder.js.map
===================================================================
--- imaps-frontend/node_modules/utrie/dist/lib/TrieBuilder.js.map	(revision 79a03170cdde4e801d12257ee86723774970427b)
+++ imaps-frontend/node_modules/utrie/dist/lib/TrieBuilder.js.map	(revision 79a03170cdde4e801d12257ee86723774970427b)
@@ -0,0 +1,1 @@
+{"version":3,"file":"TrieBuilder.js","sourceRoot":"","sources":["../../src/TrieBuilder.ts"],"names":[],"mappings":";;;AAAA,+BAiBgB;AAEhB,yDAA0C;AAE1C;;;;;GAKG;AACH,iDAAiD;AAEjD,gEAAgE;AAChE,IAAM,2BAA2B,GAAG,CAAC,IAAI,qBAAc,CAAC;AAExD,+EAA+E;AAC/E,IAAM,uBAAuB,GAAG,CAAC,IAAI,yBAAkB,CAAC;AACxD,4EAA4E;AAC5E;;;GAGG;AACH,IAAM,qBAAqB,GAAG,CAAC,CAAC;AAEhC,IAAM,yBAAyB,GAAG,QAAQ,IAAI,qBAAc,CAAC;AAC7D;;;GAGG;AACH;;;;GAIG;AACH,IAAM,2BAA2B,GAAG,IAAI,CAAC;AACzC,qEAAqE;AACrE,IAAM,wBAAwB,GAAG,IAAI,CAAC;AACtC,iFAAiF;AACjF;;;GAGG;AACH;;;;;GAKG;AACH,IAAM,0BAA0B,GAAG,gCAAyB,CAAC;AAC7D,IAAM,0BAA0B,GAC5B,CAAC,oCAA6B,GAAG,yBAAyB,GAAG,0BAAmB,CAAC,GAAG,CAAC,0BAAmB,CAAC;AAC7G;;;;;;GAMG;AACH,IAAM,4BAA4B,GAC9B,CAAC,QAAQ,IAAI,qBAAc,CAAC;IAC5B,iCAA0B;IAC1B,0BAA0B;IAC1B,kCAA2B,CAAC;AAChC,IAAM,wBAAwB,GAAG,QAAQ,IAAI,qBAAc,CAAC;AAC5D;;;;GAIG;AACH,IAAM,yBAAyB,GAAG,QAAQ,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC;AAEjE,gDAAgD;AAChD,IAAM,6BAA6B,GAAG,CAAC,IAAI,EAAE,CAAC;AAC9C,8BAA8B;AAC9B,IAAM,4BAA4B,GAAG,CAAC,IAAI,EAAE,CAAC;AAE7C,sEAAsE;AACtE,IAAM,6BAA6B,GAAG,0BAA0B,GAAG,0BAA0B,CAAC;AAC9F,6CAA6C;AAC7C,IAAM,8BAA8B,GAAG,6BAA6B,GAAG,kCAA2B,CAAC;AACnG;;;;GAIG;AACH,IAAM,0BAA0B,GAAG,wBAAwB,CAAC;AAC5D,0CAA0C;AAC1C,IAAM,2BAA2B,GAAG,0BAA0B,GAAG,IAAI,CAAC;AACtE;;;;;GAKG;AACH,IAAM,0BAA0B,GAAG,2BAA2B,GAAG,KAAK,CAAC;AAEvE;;;;;GAKG;AACH,IAAM,uBAAuB,GAAG,MAAM,CAAC;AACvC;;;;GAIG;AACH,IAAM,sBAAsB,GAAG,MAAM,IAAI,yBAAkB,CAAC;AAE/C,QAAA,OAAO,GAAG,EAAE,CAAC;AACb,QAAA,OAAO,GAAG,EAAE,CAAC;AAE1B,IAAM,eAAe,GAAG,UAAC,CAAM,IAAc,OAAA,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,EAA1B,CAA0B,CAAC;AAExE,IAAM,QAAQ,GAAG,UAAC,CAAc,EAAE,CAAM,EAAE,CAAM,EAAE,MAAW;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;QAC7B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;YACvB,OAAO,KAAK,CAAC;SAChB;KACJ;IACD,OAAO,IAAI,CAAC;AAChB,CAAC,CAAC;AAEF;IAgBI,qBAAY,YAAqB,EAAE,UAAmB;QAA1C,6BAAA,EAAA,gBAAqB;QAAE,2BAAA,EAAA,cAAmB;QAClD,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;QAC3D,IAAI,CAAC,YAAY,GAAG,6BAA6B,CAAC;QAClD,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,+BAA+B;QACxD,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QAEzB,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,wBAAwB,CAAC,CAAC;QACxD,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,4BAA4B,CAAC,CAAC;QAE5D;;;;;;;;;;;;;;WAcG;QACH,IAAI,CAAC,GAAG,GAAG,IAAI,WAAW,CAAC,yBAAyB,IAAI,qBAAc,CAAC,CAAC;QACxE;;;;;WAKG;QACH,IAAI,CAAC,EAAE,CAAC,CAAC;QACT,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YACvB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;SAC/B;QACD,OAAO,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YAClB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;SAC7B;QACD,KAAK,CAAC,GAAG,0BAA0B,EAAE,CAAC,GAAG,2BAA2B,EAAE,EAAE,CAAC,EAAE;YACvE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;SAC/B;QACD,IAAI,CAAC,cAAc,GAAG,0BAA0B,CAAC;QACjD,IAAI,CAAC,UAAU,GAAG,2BAA2B,CAAC;QAC9C,8EAA8E;QAC9E,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,+BAAwB,EAAE;YAC7D,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACnB;QAED,mDAAmD;QACnD,OAAO,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,+BAAwB,EAAE;YACjD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACnB;QAED;;;;WAIG;QACH,gCAAgC;QAChC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,IAAI,qBAAc,CAAC,GAAG,CAAC,IAAI,IAAI,qBAAc,CAAC,GAAG,CAAC,GAAG,iCAA0B,CAAC;QACzG,CAAC,IAAI,+BAAwB,CAAC;QAC9B,OAAO,CAAC,GAAG,2BAA2B,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,+BAAwB,EAAE;YACxE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACnB;QACD;;;WAGG;QACH,KAAK,CAAC,GAAG,IAAI,IAAI,qBAAc,EAAE,CAAC,GAAG,gCAAyB,EAAE,EAAE,CAAC,EAAE;YACjE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,0BAA0B,CAAC;SAC/C;QACD;;;WAGG;QACH,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,0BAA0B,EAAE,EAAE,CAAC,EAAE;YAC7C,IAAI,CAAC,MAAM,CAAC,0BAA0B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;SACpD;QACD,+CAA+C;QAC/C,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kCAA2B,EAAE,EAAE,CAAC,EAAE;YAC9C,IAAI,CAAC,MAAM,CAAC,6BAA6B,GAAG,CAAC,CAAC,GAAG,0BAA0B,CAAC;SAC/E;QACD,IAAI,CAAC,gBAAgB,GAAG,6BAA6B,CAAC;QACtD,IAAI,CAAC,YAAY,GAAG,8BAA8B,CAAC;QACnD,0DAA0D;QAC1D,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,wCAAiC,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,kCAA2B,EAAE;YAC7F,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACtB;QACD,iEAAiE;QACjE,OAAO,CAAC,GAAG,wBAAwB,EAAE,EAAE,CAAC,EAAE;YACtC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,6BAA6B,CAAC;SAClD;QACD;;;;WAIG;QACH,KAAK,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,+BAAwB,EAAE;YACrD,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;SAC7B;IACL,CAAC;IAED;;;;;OAKG;IACH,yBAAG,GAAH,UAAI,CAAM,EAAE,KAAU;QAClB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,QAAQ,EAAE;YACvB,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;SAC1C;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;;;OASG;IACH,8BAAQ,GAAR,UAAS,KAAU,EAAE,GAAQ,EAAE,KAAU,EAAE,SAA0B;QAA1B,0BAAA,EAAA,iBAA0B;QACjE;;;;WAIG;QACH,IAAI,KAAK,EAAE,IAAI,EAAE,WAAW,CAAC;QAC7B,IAAI,KAAK,GAAG,QAAQ,IAAI,KAAK,GAAG,CAAC,IAAI,GAAG,GAAG,QAAQ,IAAI,GAAG,GAAG,CAAC,IAAI,KAAK,GAAG,GAAG,EAAE;YAC3E,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;SAChD;QACD,IAAI,CAAC,SAAS,IAAI,KAAK,KAAK,IAAI,CAAC,YAAY,EAAE;YAC3C,OAAO,IAAI,CAAC,CAAC,mBAAmB;SACnC;QACD,IAAI,IAAI,CAAC,WAAW,EAAE;YAClB,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;SACjD;QACD,IAAI,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,GAAG,uBAAgB,CAAC,KAAK,CAAC,EAAE;YAClC,4DAA4D;YAC5D,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACvC,IAAM,SAAS,GAAG,CAAC,KAAK,GAAG,+BAAwB,CAAC,GAAG,CAAC,uBAAgB,CAAC;YACzE,IAAI,SAAS,IAAI,KAAK,EAAE;gBACpB,IAAI,CAAC,SAAS,CACV,KAAK,EACL,KAAK,GAAG,uBAAgB,EACxB,+BAAwB,EACxB,KAAK,EACL,IAAI,CAAC,YAAY,EACjB,SAAS,CACZ,CAAC;gBACF,KAAK,GAAG,SAAS,CAAC;aACrB;iBAAM;gBACH,IAAI,CAAC,SAAS,CACV,KAAK,EACL,KAAK,GAAG,uBAAgB,EACxB,KAAK,GAAG,uBAAgB,EACxB,KAAK,EACL,IAAI,CAAC,YAAY,EACjB,SAAS,CACZ,CAAC;gBACF,OAAO,IAAI,CAAC;aACf;SACJ;QACD,oDAAoD;QACpD,IAAI,GAAG,KAAK,GAAG,uBAAgB,CAAC;QAChC,0CAA0C;QAC1C,KAAK,IAAI,CAAC,uBAAgB,CAAC;QAC3B,mCAAmC;QACnC,WAAW,GAAG,KAAK,KAAK,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAErE,OAAO,KAAK,GAAG,KAAK,EAAE;YAClB,IAAI,EAAE,SAAA,CAAC;YACP,IAAI,cAAc,GAAG,KAAK,CAAC;YAC3B,IAAI,KAAK,KAAK,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;gBAChE,KAAK,IAAI,+BAAwB,CAAC,CAAC,mBAAmB;gBACtD,SAAS;aACZ;YACD,qBAAqB;YACrB,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACtC,EAAE,IAAI,CAAC,KAAK,IAAI,qBAAc,CAAC,GAAG,0BAAmB,CAAC;YACtD,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACxB,IAAI,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE;gBAC7B,uBAAuB;gBACvB,IAAI,SAAS,IAAI,KAAK,IAAI,0BAA0B,EAAE;oBAClD;;;;uBAIG;oBACH,cAAc,GAAG,IAAI,CAAC;iBACzB;qBAAM;oBACH,2EAA2E;oBAC3E,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,+BAAwB,EAAE,KAAK,EAAE,IAAI,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;iBAC3F;aACJ;iBAAM,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC,SAAS,IAAI,KAAK,KAAK,IAAI,CAAC,cAAc,CAAC,EAAE;gBACnF;;;;;;;;;;;;;;;mBAeG;gBACH,cAAc,GAAG,IAAI,CAAC;aACzB;YACD,IAAI,cAAc,EAAE;gBAChB,IAAI,WAAW,IAAI,CAAC,EAAE;oBAClB,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;iBACxC;qBAAM;oBACH,6CAA6C;oBAC7C,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC7C,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;iBACvC;aACJ;YACD,KAAK,IAAI,+BAAwB,CAAC;SACrC;QACD,IAAI,IAAI,GAAG,CAAC,EAAE;YACV,uDAAuD;YACvD,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACvC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;SACvE;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IAEH,yBAAG,GAAH,UAAI,SAAc;QACd,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,QAAQ,EAAE;YACvC,OAAO,IAAI,CAAC,UAAU,CAAC;SAC1B;aAAM;YACH,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;SACrC;IACL,CAAC;IAED,0BAAI,GAAJ,UAAK,CAAM,EAAE,QAAiB;QAC1B,IAAI,EAAE,CAAC;QACP,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,QAAQ,CAAC,EAAE;YACnE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,uBAAuB,CAAC,CAAC;SAC/D;QACD,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,QAAQ,EAAE;YACvC,EAAE,GAAG,iCAA0B,GAAG,CAAC,MAAM,IAAI,qBAAc,CAAC,GAAG,CAAC,CAAC,IAAI,qBAAc,CAAC,CAAC;SACxF;aAAM;YACH,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,qBAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,qBAAc,CAAC,GAAG,0BAAmB,CAAC,CAAC;SACzF;QACD,IAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,uBAAgB,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,4BAAM,GAAN,UAAO,SAA4B;QAA5B,0BAAA,EAAA,YAAqB,eAAO;QAC/B,IAAI,CAAC,CAAC;QACN,IAAI,gBAAgB,CAAC;QACrB,IAAI,QAAQ,CAAC,CAAC,2DAA2D;QACzE,0BAA0B;QAC1B,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE;YACnB,IAAI,CAAC,WAAW,EAAE,CAAC;SACtB;QAED,gBAAgB,GAAG,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,CAAC,CAAC,4BAAqB,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;QAEzF,IAAI,SAAS,KAAK,eAAO,EAAE;YACvB,+BAA+B;YAC/B,QAAQ,GAAG,CAAC,CAAC;SAChB;aAAM;YACH,QAAQ,GAAG,CAAC,CAAC;SAChB;QACD,mDAAmD;QACnD;QACI,+BAA+B;QAC/B,gBAAgB,GAAG,uBAAuB;YAC1C,kCAAkC;YAClC,QAAQ,GAAG,IAAI,CAAC,cAAc,GAAG,MAAM;YACvC,+CAA+C;YAC/C,QAAQ,GAAG,0BAA0B,GAAG,MAAM;YAC9C,2BAA2B;YAC3B,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,sBAAsB,EACrD;YACE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;SAC9C;QAED,IAAM,KAAK,GAAG,IAAI,WAAW,CAAC,gBAAgB,CAAC,CAAC;QAEhD,+FAA+F;QAC/F,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gCAAyB,EAAE,CAAC,EAAE,EAAE;YAC5C,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,yBAAkB,CAAC;SACxE;QACD,0DAA0D;QAC1D,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YAC9B,YAAY;YACZ,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,QAAQ,GAAG,2BAA2B,CAAC;SAC7D;QACD,OAAO,CAAC,GAAG,IAAI,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YACzB,YAAY;YACZ,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,qBAAc,CAAC,CAAC,CAAC;SACxE;QAED,IAAI,IAAI,CAAC,SAAS,GAAG,OAAO,EAAE;YAC1B,IAAM,YAAY,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,IAAI,qBAAc,CAAC;YAClE,IAAM,YAAY,GAAG,gCAAyB,GAAG,oCAA6B,GAAG,YAAY,CAAC;YAC9F,+DAA+D;YAC/D,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBAC/B,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,qBAAqB,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,wCAAiC,CAAC,CAAC;aACjG;YAED;;;eAGG;YACH,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACnD,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,IAAI,yBAAkB,CAAC;aACvF;SACJ;QAED,oCAAoC;QACpC,QAAQ,SAAS,EAAE;YACf,KAAK,eAAO;gBACR,8BAA8B;gBAC9B,IAAM,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAChD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;oBAClC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBAC5B;gBAED,OAAO,IAAI,WAAI,CACX,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,uBAAuB,EACpD,KAAK,EACL,MAAM,CACT,CAAC;YACN,KAAK,eAAO;gBACR,8BAA8B;gBAC9B,IAAM,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAChD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;oBAClC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBAC5B;gBACD,OAAO,IAAI,WAAI,CACX,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,uBAAuB,EACpD,KAAK,EACL,MAAM,CACT,CAAC;YACN;gBACI,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;SACzD;IACL,CAAC;IAED;;;OAGG;IACH,mCAAa,GAAb,UAAc,SAAc;QACxB,IAAI,KAAK,CAAC;QACV,IAAI,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC;QAClD,sCAAsC;QACtC,IAAI,SAAS,KAAK,IAAI,CAAC,YAAY,EAAE;YACjC,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC;YACpC,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC;SACnC;aAAM;YACH,WAAW,GAAG,CAAC,CAAC,CAAC;YACjB,SAAS,GAAG,CAAC,CAAC,CAAC;SAClB;QACD,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,8BAA8B;QAC9B,IAAI,EAAE,GAAG,wBAAwB,CAAC;QAClC,IAAI,CAAC,GAAG,IAAI,CAAC;QACb,OAAO,CAAC,GAAG,CAAC,EAAE;YACV,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5B,IAAI,OAAO,KAAK,WAAW,EAAE;gBACzB,kFAAkF;gBAClF,CAAC,IAAI,2BAA2B,CAAC;gBACjC,SAAS;aACZ;YACD,WAAW,GAAG,OAAO,CAAC;YACtB,IAAI,OAAO,KAAK,IAAI,CAAC,gBAAgB,EAAE;gBACnC,oCAAoC;gBACpC,IAAI,SAAS,KAAK,IAAI,CAAC,YAAY,EAAE;oBACjC,OAAO,CAAC,CAAC;iBACZ;gBACD,CAAC,IAAI,2BAA2B,CAAC;aACpC;iBAAM;gBACH,iDAAiD;gBACjD,KAAK,EAAE,GAAG,kCAA2B,EAAE,EAAE,GAAG,CAAC,GAAI;oBAC7C,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,EAAE,EAAE,CAAC,CAAC;oBACpC,IAAI,KAAK,KAAK,SAAS,EAAE;wBACrB,0EAA0E;wBAC1E,CAAC,IAAI,+BAAwB,CAAC;wBAC9B,SAAS;qBACZ;oBACD,SAAS,GAAG,KAAK,CAAC;oBAClB,IAAI,KAAK,KAAK,IAAI,CAAC,cAAc,EAAE;wBAC/B,iCAAiC;wBACjC,IAAI,SAAS,KAAK,IAAI,CAAC,YAAY,EAAE;4BACjC,OAAO,CAAC,CAAC;yBACZ;wBACD,CAAC,IAAI,+BAAwB,CAAC;qBACjC;yBAAM;wBACH,KAAK,CAAC,GAAG,+BAAwB,EAAE,CAAC,GAAG,CAAC,GAAI;4BACxC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;4BAC/B,IAAI,KAAK,KAAK,SAAS,EAAE;gCACrB,OAAO,CAAC,CAAC;6BACZ;4BACD,EAAE,CAAC,CAAC;yBACP;qBACJ;iBACJ;aACJ;SACJ;QACD,wBAAwB;QACxB,OAAO,CAAC,CAAC;IACb,CAAC;IAED;;;;;;;;;;;OAWG;IACH,iCAAW,GAAX;QACI,IAAI,KAAK,EAAE,UAAU,CAAC;QACtB,IAAI,WAAW,EAAE,OAAO,CAAC;QACzB,IAAI,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC;QAC5B,sCAAsC;QACtC,IAAI,QAAQ,GAAG,wBAAwB,CAAC;QACxC,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,EAAE,KAAK,IAAI,+BAAwB,EAAE,EAAE,CAAC,EAAE;YAC7E,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;SACvB;QACD;;;WAGG;QACH,WAAW,GAAG,EAAE,CAAC;QACjB,UAAU,GAAG,WAAW,IAAI,qBAAc,CAAC;QAC3C,KAAK,KAAK,GAAG,QAAQ,EAAE,KAAK,GAAG,IAAI,CAAC,UAAU,GAAI;YAC9C;;;;eAIG;YACH,IAAI,KAAK,KAAK,0BAA0B,EAAE;gBACtC,WAAW,GAAG,+BAAwB,CAAC;gBACvC,UAAU,GAAG,CAAC,CAAC;aAClB;YACD,mCAAmC;YACnC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,qBAAc,CAAC,IAAI,CAAC,EAAE;gBACxC,qCAAqC;gBACrC,KAAK,IAAI,WAAW,CAAC;gBACrB,6CAA6C;gBAC7C,SAAS;aACZ;YACD,mCAAmC;YACnC,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;YAClE,IAAI,UAAU,IAAI,CAAC,EAAE;gBACjB,uFAAuF;gBACvF,KAAK,CAAC,GAAG,UAAU,EAAE,QAAQ,GAAG,KAAK,IAAI,qBAAc,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;oBACjE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,UAAU,CAAC;oBAClC,UAAU,IAAI,+BAAwB,CAAC;iBAC1C;gBACD,qCAAqC;gBACrC,KAAK,IAAI,WAAW,CAAC;gBACrB,6CAA6C;gBAC7C,SAAS;aACZ;YACD,6FAA6F;YAC7F,qFAAqF;YACrF,KACI,OAAO,GAAG,WAAW,GAAG,uBAAuB,EAC/C,OAAO,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,EACvE,OAAO,IAAI,uBAAuB,EACpC,GAAE;YACJ,IAAI,OAAO,GAAG,CAAC,IAAI,QAAQ,GAAG,KAAK,EAAE;gBACjC,gDAAgD;gBAChD,UAAU,GAAG,QAAQ,GAAG,OAAO,CAAC;gBAChC,KAAK,CAAC,GAAG,UAAU,EAAE,QAAQ,GAAG,KAAK,IAAI,qBAAc,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;oBACjE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,UAAU,CAAC;oBAClC,UAAU,IAAI,+BAAwB,CAAC;iBAC1C;gBACD,6DAA6D;gBAC7D,KAAK,IAAI,OAAO,CAAC;gBACjB,KAAK,CAAC,GAAG,WAAW,GAAG,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;oBACxC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;iBAC9C;aACJ;iBAAM;gBACH,mCAAmC;gBACnC,KAAK,CAAC,GAAG,UAAU,EAAE,QAAQ,GAAG,KAAK,IAAI,qBAAc,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;oBACjE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;oBAC7B,KAAK,IAAI,+BAAwB,CAAC;iBACrC;gBACD,QAAQ,GAAG,KAAK,CAAC;aACpB;SACJ;QACD,kCAAkC;QAClC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC,EAAE;YACpC,IAAI,CAAC,KAAK,0BAA0B,EAAE;gBAClC,sDAAsD;gBACtD,CAAC,IAAI,0BAA0B,CAAC;aACnC;YACD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,qBAAc,CAAC,CAAC;SAC/D;QACD,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,qBAAc,CAAC,CAAC;QACtE,iCAAiC;QACjC,OAAO,CAAC,QAAQ,GAAG,CAAC,uBAAuB,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;YACrD,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;SAC7C;QAED,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;IAC/B,CAAC;IAED,uCAAiB,GAAjB,UAAkB,UAAe,EAAE,UAAe,EAAE,WAAgB;QAChE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,8DAA8D;QAC9D,UAAU,IAAI,WAAW,CAAC;QAC1B,OAAO,KAAK,IAAI,UAAU,EAAE,KAAK,IAAI,uBAAuB,EAAE;YAC1D,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,WAAW,CAAC,EAAE;gBACrD,OAAO,KAAK,CAAC;aAChB;SACJ;QACD,OAAO,CAAC,CAAC,CAAC;IACd,CAAC;IAED,iCAAW,GAAX;QACI,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACnC,oCAAoC;QACpC,IAAI,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACnD,cAAc,GAAG,CAAC,cAAc,GAAG,CAAC,2BAA2B,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,2BAA2B,GAAG,CAAC,CAAC,CAAC;QAC3G,IAAI,cAAc,KAAK,QAAQ,EAAE;YAC7B,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;SAC/B;QACD;;;WAGG;QACH,IAAI,CAAC,SAAS,GAAG,cAAc,CAAC;QAEhC,IAAI,IAAI,CAAC,SAAS,GAAG,QAAQ,EAAE;YAC3B,sEAAsE;YACtE,IAAM,aAAa,GAAG,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;YAC3E,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,QAAQ,EAAE,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;SACnE;QACD,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,IAAI,IAAI,CAAC,SAAS,GAAG,OAAO,EAAE;YAC1B,IAAI,CAAC,aAAa,EAAE,CAAC;SACxB;QACD;;;;WAIG;QACH,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,GAAG,SAAS,CAAC;QACzC,OAAO,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,uBAAuB,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;YAC5D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;SACpD;QACD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAC5B,CAAC;IAED,mCAAa,GAAb;QACI,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC;QAClC,8CAA8C;QAC9C,IAAI,QAAQ,GAAG,gCAAyB,CAAC;QACzC,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,EAAE,KAAK,IAAI,kCAA2B,EAAE,EAAE,CAAC,EAAE;YAChF,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;SACvB;QACD,mEAAmE;QACnE,QAAQ,IAAI,oCAA6B,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,IAAI,qBAAc,CAAC,CAAC;QAC3F,KAAK,KAAK,GAAG,6BAA6B,EAAE,KAAK,GAAG,IAAI,CAAC,YAAY,GAAI;YACrE;;;;eAIG;YACH,mCAAmC;YACnC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE;gBAC/D,uFAAuF;gBACvF,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,uBAAgB,CAAC,GAAG,UAAU,CAAC;gBACjD,qCAAqC;gBACrC,KAAK,IAAI,kCAA2B,CAAC;gBACrC,6CAA6C;gBAC7C,SAAS;aACZ;YACD,6FAA6F;YAC7F,gEAAgE;YAChE,KACI,OAAO,GAAG,kCAA2B,GAAG,CAAC,EACzC,OAAO,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,GAAG,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,EACzE,EAAE,OAAO,EACX,GAAE;YACJ,IAAI,OAAO,GAAG,CAAC,IAAI,QAAQ,GAAG,KAAK,EAAE;gBACjC,gDAAgD;gBAChD,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,uBAAgB,CAAC,GAAG,QAAQ,GAAG,OAAO,CAAC;gBACzD,6DAA6D;gBAC7D,KAAK,IAAI,OAAO,CAAC;gBACjB,KAAK,CAAC,GAAG,kCAA2B,GAAG,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;oBACxD,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;iBAClD;aACJ;iBAAM;gBACH,mCAAmC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,uBAAgB,CAAC,GAAG,KAAK,CAAC;gBAChF,KAAK,IAAI,kCAA2B,CAAC;gBACrC,QAAQ,GAAG,KAAK,CAAC;aACpB;SACJ;QACD,kCAAkC;QAClC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,wBAAwB,EAAE,EAAE,CAAC,EAAE;YAC3C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,uBAAgB,CAAC,CAAC;SACjE;QACD,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,gBAAgB,IAAI,uBAAgB,CAAC,CAAC;QAC5E;;;;;WAKG;QACH,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,uBAAuB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;YAC3D,0DAA0D;YAC1D,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,UAAU,IAAI,yBAAkB,CAAC;SAC9D;QAED,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;IACjC,CAAC;IAED,yCAAmB,GAAnB,UAAoB,YAAiB,EAAE,UAAe;QAClD,gEAAgE;QAChE,YAAY,IAAI,kCAA2B,CAAC;QAC5C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,YAAY,EAAE,EAAE,KAAK,EAAE;YAChD,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,kCAA2B,CAAC,EAAE;gBACvE,OAAO,KAAK,CAAC;aAChB;SACJ;QACD,OAAO,CAAC,CAAC,CAAC;IACd,CAAC;IAED,0BAAI,GAAJ,UAAK,CAAM,EAAE,OAAgB,EAAE,KAAU;QACrC,IAAI,IAAI,CAAC,WAAW,EAAE;YAClB,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;SACjD;QACD,IAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAC5C,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,uBAAgB,CAAC,CAAC,GAAG,KAAK,CAAC;QAClD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,gCAAU,GAAV,UAAW,KAAU,EAAE,KAAU;QAC7B,IAAM,KAAK,GAAG,KAAK,GAAG,+BAAwB,CAAC;QAC/C,OAAO,KAAK,GAAG,KAAK,EAAE;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC;SAC9B;IACL,CAAC;IAED,mCAAa,GAAb,UAAc,CAAM,EAAE,OAAgB;QAClC,IAAM,EAAE,GACJ,eAAe,CAAC,CAAC,CAAC,IAAI,OAAO;YACzB,CAAC,CAAC,iCAA0B,GAAG,CAAC,MAAM,IAAI,qBAAc,CAAC,GAAG,CAAC,CAAC,IAAI,qBAAc,CAAC;YACjF,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,qBAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,qBAAc,CAAC,GAAG,0BAAmB,CAAC,CAAC;QAC3F,IAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC9B,OAAO,KAAK,KAAK,IAAI,CAAC,cAAc,CAAC;IACzC,CAAC;IAED,+BAAS,GAAT,UAAU,KAAU,EAAE,KAAU,EAAE,KAAU,EAAE,KAAU,EAAE,YAAiB,EAAE,SAAkB;QAC3F,IAAM,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;QAC7B,IAAI,SAAS,EAAE;YACX,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;gBACzC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;aACxB;SACJ;aAAM;YACH,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;gBACzC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,YAAY,EAAE;oBAC/B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;iBACxB;aACJ;SACJ;IACL,CAAC;IAED,oCAAc,GAAd,UAAe,EAAO,EAAE,KAAU;QAC9B,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,qBAAc,CAAC,CAAC,CAAC,+CAA+C;QACpF,IAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,IAAI,qBAAc,CAAC,EAAE;YAC9C,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;SACnC;QACD,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED,sCAAgB,GAAhB,UAAiB,KAAU;QACvB,yDAAyD;QACzD,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,qBAAc,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC;QACzD,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC;IAChC,CAAC;IAED,kCAAY,GAAZ,UAAa,CAAM,EAAE,OAAgB;QACjC,IAAI,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAEzC,EAAE,IAAI,CAAC,CAAC,IAAI,qBAAc,CAAC,GAAG,0BAAmB,CAAC;QAClD,IAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,EAAE;YAChC,OAAO,QAAQ,CAAC;SACnB;QACD,+BAA+B;QAC/B,IAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAClC,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED,qCAAe,GAAf,UAAgB,KAAU;QACtB,OAAO,KAAK,KAAK,IAAI,CAAC,cAAc,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,qBAAc,CAAC,CAAC;IACpF,CAAC;IAED,oCAAc,GAAd,UAAe,CAAM,EAAE,OAAgB;QACnC,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,OAAO,EAAE;YACtC,OAAO,iCAA0B,CAAC;SACrC;QACD,IAAM,EAAE,GAAG,CAAC,IAAI,qBAAc,CAAC;QAC/B,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,EAAE,KAAK,IAAI,CAAC,gBAAgB,EAAE;YAC9B,EAAE,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;SACxB;QACD,OAAO,EAAE,CAAC;IACd,CAAC;IAED,oCAAc,GAAd,UAAe,SAAc;QACzB,IAAI,QAAQ,CAAC;QAEb,IAAI,IAAI,CAAC,cAAc,KAAK,CAAC,EAAE;YAC3B,8BAA8B;YAC9B,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC;YAC/B,IAAI,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,IAAI,qBAAc,CAAC,CAAC;SAC/D;aAAM;YACH,uCAAuC;YACvC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;YAC3B,IAAM,MAAM,GAAG,QAAQ,GAAG,+BAAwB,CAAC;YACnD,IAAI,MAAM,GAAG,IAAI,CAAC,YAAY,EAAE;gBAC5B,IAAI,QAAQ,SAAK,CAAC;gBAClB,qCAAqC;gBACrC,IAAI,IAAI,CAAC,YAAY,GAAG,4BAA4B,EAAE;oBAClD,QAAQ,GAAG,4BAA4B,CAAC;iBAC3C;qBAAM,IAAI,IAAI,CAAC,YAAY,GAAG,yBAAyB,EAAE;oBACtD,QAAQ,GAAG,yBAAyB,CAAC;iBACxC;qBAAM;oBACH;;;;uBAIG;oBACH,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;iBACvD;gBAED,IAAM,OAAO,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;gBAC1C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBACpD,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;gBACpB,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;aAChC;YACD,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;SAC5B;QAED,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,GAAG,+BAAwB,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC7F,IAAI,CAAC,GAAG,CAAC,QAAQ,IAAI,qBAAc,CAAC,GAAG,CAAC,CAAC;QACzC,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED,sCAAgB,GAAhB;QACI,IAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACnC,IAAM,MAAM,GAAG,QAAQ,GAAG,kCAA2B,CAAC;QACtD,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAC7B,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;YACpD;;;;eAIG;SACN;QACD,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,GAAG,CACX,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,gBAAgB,GAAG,kCAA2B,CAAC,EAChG,QAAQ,CACX,CAAC;QACF,OAAO,QAAQ,CAAC;IACpB,CAAC;IACL,kBAAC;AAAD,CAAC,AAtzBD,IAszBC;AAtzBY,kCAAW;AAwzBjB,IAAM,eAAe,GAAG,UAAC,IAAU;IACtC,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IACzB,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,IAAI,CAAC,CAAC,KAAK,YAAY,WAAW,CAAC,IAAI,CAAC,CAAC,IAAI,YAAY,WAAW,IAAI,IAAI,YAAY,WAAW,CAAC,EAAE;QAClG,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;KACtE;IACD,IAAM,YAAY,GAAG,WAAW,CAAC,iBAAiB,GAAG,CAAC,CAAC;IACvD,IAAM,YAAY,GAAG,YAAY,GAAG,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACvE,IAAM,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChE,IAAM,MAAM,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACvC,IAAM,MAAM,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC9B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;IAC5B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;IAC3B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC;IAChC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC;IAC7B,aAAa;IACb,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC;IAEnC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,GAAG,WAAW,CAAC,iBAAiB,CAAC,CAAC;IAChE,IAAI,IAAI,CAAC,iBAAiB,KAAK,WAAW,CAAC,iBAAiB,EAAE;QAC1D,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,YAAY,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,WAAW,CAAC,iBAAiB,CAAC,CAAC;KACvF;SAAM;QACH,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,WAAW,CAAC,iBAAiB,CAAC,CAAC,CAAC;KAClG;IAED,OAAO,CAAC,2BAAM,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;AAC/D,CAAC,CAAC;AA3BW,QAAA,eAAe,mBA2B1B"}
Index: imaps-frontend/node_modules/utrie/dist/lib/Util.js
===================================================================
--- imaps-frontend/node_modules/utrie/dist/lib/Util.js	(revision 79a03170cdde4e801d12257ee86723774970427b)
+++ imaps-frontend/node_modules/utrie/dist/lib/Util.js	(revision 79a03170cdde4e801d12257ee86723774970427b)
@@ -0,0 +1,54 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.polyUint32Array = exports.polyUint16Array = exports.decode = void 0;
+var chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+// Use a lookup table to find the index.
+var lookup = typeof Uint8Array === 'undefined' ? [] : new Uint8Array(256);
+for (var i = 0; i < chars.length; i++) {
+    lookup[chars.charCodeAt(i)] = i;
+}
+var decode = function (base64) {
+    var bufferLength = base64.length * 0.75, len = base64.length, i, p = 0, encoded1, encoded2, encoded3, encoded4;
+    if (base64[base64.length - 1] === '=') {
+        bufferLength--;
+        if (base64[base64.length - 2] === '=') {
+            bufferLength--;
+        }
+    }
+    var buffer = typeof ArrayBuffer !== 'undefined' &&
+        typeof Uint8Array !== 'undefined' &&
+        typeof Uint8Array.prototype.slice !== 'undefined'
+        ? new ArrayBuffer(bufferLength)
+        : new Array(bufferLength);
+    var bytes = Array.isArray(buffer) ? buffer : new Uint8Array(buffer);
+    for (i = 0; i < len; i += 4) {
+        encoded1 = lookup[base64.charCodeAt(i)];
+        encoded2 = lookup[base64.charCodeAt(i + 1)];
+        encoded3 = lookup[base64.charCodeAt(i + 2)];
+        encoded4 = lookup[base64.charCodeAt(i + 3)];
+        bytes[p++] = (encoded1 << 2) | (encoded2 >> 4);
+        bytes[p++] = ((encoded2 & 15) << 4) | (encoded3 >> 2);
+        bytes[p++] = ((encoded3 & 3) << 6) | (encoded4 & 63);
+    }
+    return buffer;
+};
+exports.decode = decode;
+var polyUint16Array = function (buffer) {
+    var length = buffer.length;
+    var bytes = [];
+    for (var i = 0; i < length; i += 2) {
+        bytes.push((buffer[i + 1] << 8) | buffer[i]);
+    }
+    return bytes;
+};
+exports.polyUint16Array = polyUint16Array;
+var polyUint32Array = function (buffer) {
+    var length = buffer.length;
+    var bytes = [];
+    for (var i = 0; i < length; i += 4) {
+        bytes.push((buffer[i + 3] << 24) | (buffer[i + 2] << 16) | (buffer[i + 1] << 8) | buffer[i]);
+    }
+    return bytes;
+};
+exports.polyUint32Array = polyUint32Array;
+//# sourceMappingURL=Util.js.map
Index: imaps-frontend/node_modules/utrie/dist/lib/Util.js.map
===================================================================
--- imaps-frontend/node_modules/utrie/dist/lib/Util.js.map	(revision 79a03170cdde4e801d12257ee86723774970427b)
+++ imaps-frontend/node_modules/utrie/dist/lib/Util.js.map	(revision 79a03170cdde4e801d12257ee86723774970427b)
@@ -0,0 +1,1 @@
+{"version":3,"file":"Util.js","sourceRoot":"","sources":["../../src/Util.ts"],"names":[],"mappings":";;;AAAA,IAAM,KAAK,GAAG,kEAAkE,CAAC;AAEjF,wCAAwC;AACxC,IAAM,MAAM,GAAG,OAAO,UAAU,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;AAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACnC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;CACnC;AAEM,IAAM,MAAM,GAAG,UAAC,MAAc;IACjC,IAAI,YAAY,GAAG,MAAM,CAAC,MAAM,GAAG,IAAI,EACnC,GAAG,GAAG,MAAM,CAAC,MAAM,EACnB,CAAC,EACD,CAAC,GAAG,CAAC,EACL,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,QAAQ,CAAC;IAEb,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;QACnC,YAAY,EAAE,CAAC;QACf,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;YACnC,YAAY,EAAE,CAAC;SAClB;KACJ;IAED,IAAM,MAAM,GACR,OAAO,WAAW,KAAK,WAAW;QAClC,OAAO,UAAU,KAAK,WAAW;QACjC,OAAO,UAAU,CAAC,SAAS,CAAC,KAAK,KAAK,WAAW;QAC7C,CAAC,CAAC,IAAI,WAAW,CAAC,YAAY,CAAC;QAC/B,CAAC,CAAC,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC;IAClC,IAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;IAEtE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;QACzB,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5C,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5C,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE5C,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC;QAC/C,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC;QACtD,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;KACxD;IAED,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AArCW,QAAA,MAAM,UAqCjB;AAEK,IAAM,eAAe,GAAG,UAAC,MAAgB;IAC5C,IAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAC7B,IAAM,KAAK,GAAG,EAAE,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QAChC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;KAChD;IACD,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAPW,QAAA,eAAe,mBAO1B;AAEK,IAAM,eAAe,GAAG,UAAC,MAAgB;IAC5C,IAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAC7B,IAAM,KAAK,GAAG,EAAE,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QAChC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;KAChG;IACD,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAPW,QAAA,eAAe,mBAO1B"}
Index: imaps-frontend/node_modules/utrie/dist/lib/index.js
===================================================================
--- imaps-frontend/node_modules/utrie/dist/lib/index.js	(revision 79a03170cdde4e801d12257ee86723774970427b)
+++ imaps-frontend/node_modules/utrie/dist/lib/index.js	(revision 79a03170cdde4e801d12257ee86723774970427b)
@@ -0,0 +1,10 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.serializeBase64 = exports.TrieBuilder = exports.createTrieFromBase64 = exports.Trie = void 0;
+var Trie_1 = require("./Trie");
+Object.defineProperty(exports, "Trie", { enumerable: true, get: function () { return Trie_1.Trie; } });
+Object.defineProperty(exports, "createTrieFromBase64", { enumerable: true, get: function () { return Trie_1.createTrieFromBase64; } });
+var TrieBuilder_1 = require("./TrieBuilder");
+Object.defineProperty(exports, "TrieBuilder", { enumerable: true, get: function () { return TrieBuilder_1.TrieBuilder; } });
+Object.defineProperty(exports, "serializeBase64", { enumerable: true, get: function () { return TrieBuilder_1.serializeBase64; } });
+//# sourceMappingURL=index.js.map
Index: imaps-frontend/node_modules/utrie/dist/lib/index.js.map
===================================================================
--- imaps-frontend/node_modules/utrie/dist/lib/index.js.map	(revision 79a03170cdde4e801d12257ee86723774970427b)
+++ imaps-frontend/node_modules/utrie/dist/lib/index.js.map	(revision 79a03170cdde4e801d12257ee86723774970427b)
@@ -0,0 +1,1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;AAAA,+BAAkD;AAA1C,4FAAA,IAAI,OAAA;AAAE,4GAAA,oBAAoB,OAAA;AAClC,6CAA2D;AAAnD,0GAAA,WAAW,OAAA;AAAE,8GAAA,eAAe,OAAA"}
