@cantoo/fontkit 2.0.4 → 2.0.5

package/src/packages/unicode-properties/index.js

@@ -18,7 +18,7 @@ function decodeBase64(base64) {
 const trie = new UnicodeTrie(decodeBase64(trieBase64));
 
 const log2 = Math.log2 || (n => Math.log(n) / Math.LN2);
-const bits = (n) => ((log2(n) + 1) | 0);
+const bits = n => ((log2(n) + 1) | 0);
 
 // compute the number of bits stored for each field
 const CATEGORY_BITS = bits(data.categories.length - 1);
@@ -93,12 +93,12 @@ export function getNumericValue(codePoint) {
 export function isAlphabetic(codePoint) {
   const category = getCategory(codePoint);
   return (
-    category === 'Lu' ||
-    category === 'Ll' ||
-    category === 'Lt' ||
-    category === 'Lm' ||
-    category === 'Lo' ||
-    category === 'Nl'
+    category === 'Lu'
+    || category === 'Ll'
+    || category === 'Lt'
+    || category === 'Lm'
+    || category === 'Lo'
+    || category === 'Nl'
   );
 }
 
@@ -109,13 +109,13 @@ export function isDigit(codePoint) {
 export function isPunctuation(codePoint) {
   const category = getCategory(codePoint);
   return (
-    category === 'Pc' ||
-    category === 'Pd' ||
-    category === 'Pe' ||
-    category === 'Pf' ||
-    category === 'Pi' ||
-    category === 'Po' ||
-    category === 'Ps'
+    category === 'Pc'
+    || category === 'Pd'
+    || category === 'Pe'
+    || category === 'Pf'
+    || category === 'Pi'
+    || category === 'Po'
+    || category === 'Ps'
   );
 }
 
@@ -134,34 +134,34 @@ export function isTitleCase(codePoint) {
 export function isWhiteSpace(codePoint) {
   const category = getCategory(codePoint);
   return (
-    category === 'Zs' ||
-    category === 'Zl' ||
-    category === 'Zp'
+    category === 'Zs'
+    || category === 'Zl'
+    || category === 'Zp'
   );
 }
 
 export function isBaseForm(codePoint) {
   const category = getCategory(codePoint);
   return (
-    category === 'Nd' ||
-    category === 'No' ||
-    category === 'Nl' ||
-    category === 'Lu' ||
-    category === 'Ll' ||
-    category === 'Lt' ||
-    category === 'Lm' ||
-    category === 'Lo' ||
-    category === 'Me' ||
-    category === 'Mc'
+    category === 'Nd'
+    || category === 'No'
+    || category === 'Nl'
+    || category === 'Lu'
+    || category === 'Ll'
+    || category === 'Lt'
+    || category === 'Lm'
+    || category === 'Lo'
+    || category === 'Me'
+    || category === 'Mc'
   );
 }
 
 export function isMark(codePoint) {
   const category = getCategory(codePoint);
   return (
-    category === 'Mn' ||
-    category === 'Me' ||
-    category === 'Mc'
+    category === 'Mn'
+    || category === 'Me'
+    || category === 'Mc'
   );
 }
 

package/src/packages/unicode-properties/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@cantoo/unicode-properties",
-  "version": "1.0.0",
+  "version": "1.0.1",
   "description": "Fast access to unicode character properties (vendored for @cantoo/fontkit)",
   "type": "module",
   "main": "./dist/index.cjs",

package/src/packages/unicode-trie/builder.js

@@ -1,6 +1,6 @@
-import { deflateSync } from "fflate";
-import UnicodeTrie from "./index.js";
-import { swap32LE } from "./swap.js";
+import { deflateSync } from 'fflate';
+import UnicodeTrie from './index.js';
+import { swap32LE } from './swap.js';
 
 // Shift size for getting the index-1 table offset.
 const SHIFT_1 = 6 + 5;
@@ -57,7 +57,7 @@ const INDEX_2_BMP_LENGTH = LSCP_INDEX_2_OFFSET + 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 SHIFT_2.
 const UTF8_2B_INDEX_2_OFFSET = INDEX_2_BMP_LENGTH;
-const UTF8_2B_INDEX_2_LENGTH = 0x800 >> 6;  // U+0800 is the first code point after 2-byte UTF-8
+const 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.
@@ -189,7 +189,7 @@ class UnicodeTrieBuilder {
       this.data[i] = this.initialValue;
     }
 
-    for (i = i; i < 0xc0; i++) {
+    for (; i < 0xc0; i++) {
       this.data[i] = this.errorValue;
     }
 
@@ -208,7 +208,7 @@ class UnicodeTrieBuilder {
     }
 
     // reference counts for the bad-UTF-8-data block
-    for (j = j; j < 0xc0; j += DATA_BLOCK_LENGTH) {
+    for (; j < 0xc0; j += DATA_BLOCK_LENGTH) {
       this.map[i++] = 0;
     }
 
@@ -218,7 +218,7 @@ class UnicodeTrieBuilder {
     // i==newTrie->dataNullOffset
     this.map[i++] = ((0x110000 >> SHIFT_2) - (0x80 >> SHIFT_2)) + 1 + LSCP_INDEX_2_LENGTH;
     j += DATA_BLOCK_LENGTH;
-    for (j = j; j < NEW_DATA_START_OFFSET; j += DATA_BLOCK_LENGTH) {
+    for (; j < NEW_DATA_START_OFFSET; j += DATA_BLOCK_LENGTH) {
       this.map[i++] = 0;
     }
 
@@ -250,7 +250,7 @@ class UnicodeTrieBuilder {
     }
 
     // set the remaining index-1 indexes to the null index-2 block
-    for (i = i; i < INDEX_1_LENGTH; i++) {
+    for (; i < INDEX_1_LENGTH; i++) {
       this.index1[i] = INDEX_2_NULL_OFFSET;
     }
 
@@ -260,7 +260,6 @@ class UnicodeTrieBuilder {
     for (i = 0x80; i < 0x800; i += DATA_BLOCK_LENGTH) {
       this.set(i, this.initialValue);
     }
-
   }
 
   set(codePoint, value) {
@@ -346,7 +345,6 @@ class UnicodeTrieBuilder {
           // protected block: just write the values into this block
           this._fillBlock(block, 0, 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:
         //
@@ -429,7 +427,7 @@ class UnicodeTrieBuilder {
       // Should never occur.
       // Either MAX_BUILD_TIME_INDEX_LENGTH is incorrect,
       // or the code writes more values than should be possible.
-      throw new Error("Internal error in Trie2 creation.");
+      throw new Error('Internal error in Trie2 creation.');
     }
 
     this.index2Length = newTop;
@@ -478,7 +476,7 @@ class UnicodeTrieBuilder {
           // Should never occur.
           // Either MAX_DATA_LENGTH_BUILDTIME is incorrect,
           // or the code writes more values than should be possible.
-          throw new Error("Internal error in Trie2 creation.");
+          throw new Error('Internal error in Trie2 creation.');
         }
 
         const newData = new Uint32Array(capacity);
@@ -502,7 +500,7 @@ class UnicodeTrieBuilder {
   }
 
   _setIndex2Entry(i2, block) {
-    ++this.map[block >> SHIFT_2];  // increment first, in case block == oldBlock!
+    ++this.map[block >> SHIFT_2]; // increment first, in case block == oldBlock!
     const oldBlock = this.index2[i2];
     if (--this.map[oldBlock >> SHIFT_2] === 0) {
       this._releaseDataBlock(oldBlock);
@@ -719,7 +717,6 @@ class UnicodeTrieBuilder {
         for (i = blockLength - overlap; i > 0; i--) {
           this.data[newStart++] = this.data[start++];
         }
-
       } else { // no overlap && newStart==start
         mapIndex = start >> SHIFT_2;
         for (i = blockCount; i > 0; i--) {
@@ -799,7 +796,6 @@ class UnicodeTrieBuilder {
         for (i = INDEX_2_BLOCK_LENGTH - overlap; i > 0; i--) {
           this.index2[newStart++] = this.index2[start++];
         }
-
       } else { // no overlap && newStart==start
         this.map[start >> SHIFT_1_2] = start;
         start += INDEX_2_BLOCK_LENGTH;
@@ -876,11 +872,11 @@ class UnicodeTrieBuilder {
     const dataMove = allIndexesLength;
 
     // are indexLength and dataLength within limits?
-    if ((allIndexesLength > MAX_INDEX_LENGTH) || // for unshifted indexLength
-      ((dataMove + this.dataNullOffset) > 0xffff) || // for unshifted dataNullOffset
-      ((dataMove + DATA_0800_OFFSET) > 0xffff) || // for unshifted 2-byte UTF-8 index-2 values
-      ((dataMove + this.dataLength) > MAX_DATA_LENGTH_RUNTIME)) { // for shiftedDataLength
-      throw new Error("Trie data is too large.");
+    if ((allIndexesLength > MAX_INDEX_LENGTH) // for unshifted indexLength
+      || ((dataMove + this.dataNullOffset) > 0xffff) // for unshifted dataNullOffset
+      || ((dataMove + DATA_0800_OFFSET) > 0xffff) // for unshifted 2-byte UTF-8 index-2 values
+      || ((dataMove + this.dataLength) > MAX_DATA_LENGTH_RUNTIME)) { // for shiftedDataLength
+      throw new Error('Trie data is too large.');
     }
 
     // calculate the sizes of, and allocate, the index and data arrays
@@ -898,7 +894,7 @@ class UnicodeTrieBuilder {
       data[destIdx++] = (dataMove + BAD_UTF8_DATA_OFFSET);
     }
 
-    for (i = i; i < 0xe0 - 0xc0; i++) { // C2..DF
+    for (; i < 0xe0 - 0xc0; i++) { // C2..DF
       data[destIdx++] = (dataMove + this.index2[i << (6 - SHIFT_2)]);
     }
 
@@ -962,4 +958,4 @@ class UnicodeTrieBuilder {
   }
 }
 
-export default UnicodeTrieBuilder;
+export default UnicodeTrieBuilder;

package/src/packages/unicode-trie/dist/builder.cjs

@@ -178,7 +178,7 @@ var UnicodeTrieBuilder = class {
     for (i = 0; i < 128; i++) {
       this.data[i] = this.initialValue;
     }
-    for (i = i; i < 192; i++) {
+    for (; i < 192; i++) {
       this.data[i] = this.errorValue;
     }
     for (i = DATA_NULL_OFFSET; i < NEW_DATA_START_OFFSET; i++) {
@@ -191,12 +191,12 @@ var UnicodeTrieBuilder = class {
       this.index2[i] = j;
       this.map[i++] = 1;
     }
-    for (j = j; j < 192; j += DATA_BLOCK_LENGTH2) {
+    for (; j < 192; j += DATA_BLOCK_LENGTH2) {
       this.map[i++] = 0;
     }
     this.map[i++] = (1114112 >> SHIFT_22) - (128 >> SHIFT_22) + 1 + LSCP_INDEX_2_LENGTH2;
     j += DATA_BLOCK_LENGTH2;
-    for (j = j; j < NEW_DATA_START_OFFSET; j += DATA_BLOCK_LENGTH2) {
+    for (; j < NEW_DATA_START_OFFSET; j += DATA_BLOCK_LENGTH2) {
       this.map[i++] = 0;
     }
     for (i = 128 >> SHIFT_22; i < INDEX_2_BMP_LENGTH2; i++) {
@@ -215,7 +215,7 @@ var UnicodeTrieBuilder = class {
       this.index1[i] = j;
       j += INDEX_2_BLOCK_LENGTH2;
     }
-    for (i = i; i < INDEX_1_LENGTH; i++) {
+    for (; i < INDEX_1_LENGTH; i++) {
       this.index1[i] = INDEX_2_NULL_OFFSET;
     }
     for (i = 128; i < 2048; i += DATA_BLOCK_LENGTH2) {
@@ -645,10 +645,7 @@ var UnicodeTrieBuilder = class {
       allIndexesLength = this.index2Length;
     }
     const dataMove = allIndexesLength;
-    if (allIndexesLength > MAX_INDEX_LENGTH || // for unshifted indexLength
-    dataMove + this.dataNullOffset > 65535 || // for unshifted dataNullOffset
-    dataMove + DATA_0800_OFFSET > 65535 || // for unshifted 2-byte UTF-8 index-2 values
-    dataMove + this.dataLength > MAX_DATA_LENGTH_RUNTIME) {
+    if (allIndexesLength > MAX_INDEX_LENGTH || dataMove + this.dataNullOffset > 65535 || dataMove + DATA_0800_OFFSET > 65535 || dataMove + this.dataLength > MAX_DATA_LENGTH_RUNTIME) {
       throw new Error("Trie data is too large.");
     }
     const indexLength = allIndexesLength + this.dataLength;
@@ -660,7 +657,7 @@ var UnicodeTrieBuilder = class {
     for (i = 0; i < 194 - 192; i++) {
       data[destIdx++] = dataMove + BAD_UTF8_DATA_OFFSET;
     }
-    for (i = i; i < 224 - 192; i++) {
+    for (; i < 224 - 192; i++) {
       data[destIdx++] = dataMove + this.index2[i << 6 - SHIFT_22];
     }
     if (this.highStart > 65536) {

package/src/packages/unicode-trie/dist/builder.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../builder.js", "../index.js", "../swap.js"],
-  "sourcesContent": ["import { deflateSync } from \"fflate\";\nimport UnicodeTrie from \"./index.js\";\nimport { swap32LE } from \"./swap.js\";\n\n// Shift size for getting the index-1 table offset.\nconst SHIFT_1 = 6 + 5;\n\n// Shift size for getting the index-2 table offset.\nconst SHIFT_2 = 5;\n\n// Difference between the two shift sizes,\n// for getting an index-1 offset from an index-2 offset. 6=11-5\nconst SHIFT_1_2 = SHIFT_1 - SHIFT_2;\n\n// Number of index-1 entries for the BMP. 32=0x20\n// This part of the index-1 table is omitted from the serialized form.\nconst OMITTED_BMP_INDEX_1_LENGTH = 0x10000 >> SHIFT_1;\n\n// Number of code points per index-1 table entry. 2048=0x800\nconst CP_PER_INDEX_1_ENTRY = 1 << SHIFT_1;\n\n// Number of entries in an index-2 block. 64=0x40\nconst INDEX_2_BLOCK_LENGTH = 1 << SHIFT_1_2;\n\n// Mask for getting the lower bits for the in-index-2-block offset. */\nconst INDEX_2_MASK = INDEX_2_BLOCK_LENGTH - 1;\n\n// Number of entries in a data block. 32=0x20\nconst DATA_BLOCK_LENGTH = 1 << SHIFT_2;\n\n// Mask for getting the lower bits for the in-data-block offset.\nconst DATA_MASK = DATA_BLOCK_LENGTH - 1;\n\n// Shift size for shifting left the index array values.\n// Increases possible data size with 16-bit index values at the cost\n// of compactability.\n// This requires data blocks to be aligned by DATA_GRANULARITY.\nconst INDEX_SHIFT = 2;\n\n// The alignment size of a data block. Also the granularity for compaction.\nconst DATA_GRANULARITY = 1 << INDEX_SHIFT;\n\n// The BMP part of the index-2 table is fixed and linear and starts at offset 0.\n// Length=2048=0x800=0x10000>>SHIFT_2.\nconst INDEX_2_OFFSET = 0;\n\n// The part of the index-2 table for U+D800..U+DBFF stores values for\n// lead surrogate code _units_ not code _points_.\n// Values for lead surrogate code _points_ are indexed with this portion of the table.\n// Length=32=0x20=0x400>>SHIFT_2. (There are 1024=0x400 lead surrogates.)\nconst LSCP_INDEX_2_OFFSET = 0x10000 >> SHIFT_2;\nconst LSCP_INDEX_2_LENGTH = 0x400 >> SHIFT_2;\n\n// Count the lengths of both BMP pieces. 2080=0x820\nconst INDEX_2_BMP_LENGTH = LSCP_INDEX_2_OFFSET + LSCP_INDEX_2_LENGTH;\n\n// The 2-byte UTF-8 version of the index-2 table follows at offset 2080=0x820.\n// Length 32=0x20 for lead bytes C0..DF, regardless of SHIFT_2.\nconst UTF8_2B_INDEX_2_OFFSET = INDEX_2_BMP_LENGTH;\nconst UTF8_2B_INDEX_2_LENGTH = 0x800 >> 6;  // U+0800 is the first code point after 2-byte UTF-8\n\n// The index-1 table, only used for supplementary code points, at offset 2112=0x840.\n// Variable length, for code points up to highStart, where the last single-value range starts.\n// Maximum length 512=0x200=0x100000>>SHIFT_1.\n// (For 0x100000 supplementary code points U+10000..U+10ffff.)\n//\n// The part of the index-2 table for supplementary code points starts\n// after this index-1 table.\n//\n// Both the index-1 table and the following part of the index-2 table\n// are omitted completely if there is only BMP data.\nconst INDEX_1_OFFSET = UTF8_2B_INDEX_2_OFFSET + UTF8_2B_INDEX_2_LENGTH;\nconst MAX_INDEX_1_LENGTH = 0x100000 >> SHIFT_1;\n\n// The illegal-UTF-8 data block follows the ASCII block, at offset 128=0x80.\n// Used with linear access for single bytes 0..0xbf for simple error handling.\n// Length 64=0x40, not DATA_BLOCK_LENGTH.\nconst BAD_UTF8_DATA_OFFSET = 0x80;\n\n// The start of non-linear-ASCII data blocks, at offset 192=0xc0.\n// !!!!\nconst DATA_START_OFFSET = 0xc0;\n\n// The null data block.\n// Length 64=0x40 even if DATA_BLOCK_LENGTH is smaller,\n// to work with 6-bit trail bytes from 2-byte UTF-8.\nconst DATA_NULL_OFFSET = DATA_START_OFFSET;\n\n// The start of allocated data blocks.\nconst NEW_DATA_START_OFFSET = DATA_NULL_OFFSET + 0x40;\n\n// The start of data blocks for U+0800 and above.\n// Below, compaction uses a block length of 64 for 2-byte UTF-8.\n// From here on, compaction uses DATA_BLOCK_LENGTH.\n// Data values for 0x780 code points beyond ASCII.\nconst DATA_0800_OFFSET = NEW_DATA_START_OFFSET + 0x780;\n\n// Start with allocation of 16k data entries. */\nconst INITIAL_DATA_LENGTH = 1 << 14;\n\n// Grow about 8x each time.\nconst MEDIUM_DATA_LENGTH = 1 << 17;\n\n// Maximum length of the runtime data array.\n// Limited by 16-bit index values that are left-shifted by INDEX_SHIFT,\n// and by uint16_t UTrie2Header.shiftedDataLength.\nconst MAX_DATA_LENGTH_RUNTIME = 0xffff << INDEX_SHIFT;\n\nconst INDEX_1_LENGTH = 0x110000 >> SHIFT_1;\n\n// Maximum length of the build-time data array.\n// One entry per 0x110000 code points, plus the illegal-UTF-8 block and the null block,\n// plus values for the 0x400 surrogate code units.\nconst MAX_DATA_LENGTH_BUILDTIME = 0x110000 + 0x40 + 0x40 + 0x400;\n\n// At build time, leave a gap in the index-2 table,\n// at least as long as the maximum lengths of the 2-byte UTF-8 index-2 table\n// and the supplementary index-1 table.\n// Round up to INDEX_2_BLOCK_LENGTH for proper compacting.\nconst INDEX_GAP_OFFSET = INDEX_2_BMP_LENGTH;\nconst INDEX_GAP_LENGTH = ((UTF8_2B_INDEX_2_LENGTH + MAX_INDEX_1_LENGTH) + INDEX_2_MASK) & ~INDEX_2_MASK;\n\n// Maximum length of the build-time index-2 array.\n// Maximum number of Unicode code points (0x110000) shifted right by SHIFT_2,\n// plus the part of the index-2 table for lead surrogate code points,\n// plus the build-time index gap,\n// plus the null index-2 block.)\nconst MAX_INDEX_2_LENGTH = (0x110000 >> SHIFT_2) + LSCP_INDEX_2_LENGTH + INDEX_GAP_LENGTH + INDEX_2_BLOCK_LENGTH;\n\n// The null index-2 block, following the gap in the index-2 table.\nconst INDEX_2_NULL_OFFSET = INDEX_GAP_OFFSET + INDEX_GAP_LENGTH;\n\n// The start of allocated index-2 blocks.\nconst INDEX_2_START_OFFSET = INDEX_2_NULL_OFFSET + INDEX_2_BLOCK_LENGTH;\n\n// Maximum length of the runtime index array.\n// Limited by its own 16-bit index values, and by uint16_t UTrie2Header.indexLength.\n// (The actual maximum length is lower,\n// (0x110000>>SHIFT_2)+UTF8_2B_INDEX_2_LENGTH+MAX_INDEX_1_LENGTH.)\nconst MAX_INDEX_LENGTH = 0xffff;\n\nconst equal_int = (a, s, t, length) => {\n  for (let i = 0; i < length; i++) {\n    if (a[s + i] !== a[t + i]) {\n      return false;\n    }\n  }\n\n  return true;\n};\n\nclass UnicodeTrieBuilder {\n  constructor(initialValue, errorValue) {\n    let i, j;\n    if (initialValue == null) {\n      initialValue = 0;\n    }\n    this.initialValue = initialValue;\n    if (errorValue == null) {\n      errorValue = 0;\n    }\n    this.errorValue = errorValue;\n    this.index1 = new Int32Array(INDEX_1_LENGTH);\n    this.index2 = new Int32Array(MAX_INDEX_2_LENGTH);\n    this.highStart = 0x110000;\n\n    this.data = new Uint32Array(INITIAL_DATA_LENGTH);\n    this.dataCapacity = INITIAL_DATA_LENGTH;\n\n    this.firstFreeBlock = 0;\n    this.isCompacted = false;\n\n    // Multi-purpose per-data-block table.\n    //\n    // Before compacting:\n    //\n    // Per-data-block reference counters/free-block list.\n    //  0: unused\n    // >0: reference counter (number of index-2 entries pointing here)\n    // <0: next free data block in free-block list\n    //\n    // While compacting:\n    //\n    // Map of adjusted indexes, used in compactData() and compactIndex2().\n    // Maps from original indexes to new ones.\n    this.map = new Int32Array(MAX_DATA_LENGTH_BUILDTIME >> SHIFT_2);\n\n    for (i = 0; i < 0x80; i++) {\n      this.data[i] = this.initialValue;\n    }\n\n    for (i = i; i < 0xc0; i++) {\n      this.data[i] = this.errorValue;\n    }\n\n    for (i = DATA_NULL_OFFSET; i < NEW_DATA_START_OFFSET; i++) {\n      this.data[i] = this.initialValue;\n    }\n\n    this.dataNullOffset = DATA_NULL_OFFSET;\n    this.dataLength = NEW_DATA_START_OFFSET;\n\n    // set the index-2 indexes for the 2=0x80>>SHIFT_2 ASCII data blocks\n    i = 0;\n    for (j = 0; j < 0x80; j += DATA_BLOCK_LENGTH) {\n      this.index2[i] = j;\n      this.map[i++] = 1;\n    }\n\n    // reference counts for the bad-UTF-8-data block\n    for (j = j; j < 0xc0; j += DATA_BLOCK_LENGTH) {\n      this.map[i++] = 0;\n    }\n\n    // Reference counts for the null data block: all blocks except for the ASCII blocks.\n    // Plus 1 so that we don't drop this block during compaction.\n    // Plus as many as needed for lead surrogate code points.\n    // i==newTrie->dataNullOffset\n    this.map[i++] = ((0x110000 >> SHIFT_2) - (0x80 >> SHIFT_2)) + 1 + LSCP_INDEX_2_LENGTH;\n    j += DATA_BLOCK_LENGTH;\n    for (j = j; j < NEW_DATA_START_OFFSET; j += DATA_BLOCK_LENGTH) {\n      this.map[i++] = 0;\n    }\n\n    // set the remaining indexes in the BMP index-2 block\n    // to the null data block\n    for (i = 0x80 >> SHIFT_2; i < INDEX_2_BMP_LENGTH; i++) {\n      this.index2[i] = DATA_NULL_OFFSET;\n    }\n\n    // Fill the index gap with impossible values so that compaction\n    // does not overlap other index-2 blocks with the gap.\n    for (i = 0; i < INDEX_GAP_LENGTH; i++) {\n      this.index2[INDEX_GAP_OFFSET + i] = -1;\n    }\n\n    // set the indexes in the null index-2 block\n    for (i = 0; i < INDEX_2_BLOCK_LENGTH; i++) {\n      this.index2[INDEX_2_NULL_OFFSET + i] = DATA_NULL_OFFSET;\n    }\n\n    this.index2NullOffset = INDEX_2_NULL_OFFSET;\n    this.index2Length = INDEX_2_START_OFFSET;\n\n    // set the index-1 indexes for the linear index-2 block\n    j = 0;\n    for (i = 0; i < OMITTED_BMP_INDEX_1_LENGTH; i++) {\n      this.index1[i] = j;\n      j += INDEX_2_BLOCK_LENGTH;\n    }\n\n    // set the remaining index-1 indexes to the null index-2 block\n    for (i = i; i < INDEX_1_LENGTH; i++) {\n      this.index1[i] = INDEX_2_NULL_OFFSET;\n    }\n\n    // Preallocate and reset data for U+0080..U+07ff,\n    // for 2-byte UTF-8 which will be compacted in 64-blocks\n    // even if DATA_BLOCK_LENGTH is smaller.\n    for (i = 0x80; i < 0x800; i += DATA_BLOCK_LENGTH) {\n      this.set(i, this.initialValue);\n    }\n\n  }\n\n  set(codePoint, value) {\n    if ((codePoint < 0) || (codePoint > 0x10ffff)) {\n      throw new Error('Invalid code point');\n    }\n\n    if (this.isCompacted) {\n      throw new Error('Already compacted');\n    }\n\n    const block = this._getDataBlock(codePoint, true);\n    this.data[block + (codePoint & DATA_MASK)] = value;\n    return this;\n  }\n\n  setRange(start, end, value, overwrite) {\n    let block, repeatBlock;\n    if (overwrite == null) {\n      overwrite = true;\n    }\n    if ((start > 0x10ffff) || (end > 0x10ffff) || (start > end)) {\n      throw new Error('Invalid code point');\n    }\n\n    if (this.isCompacted) {\n      throw new Error('Already compacted');\n    }\n\n    if (!overwrite && (value === this.initialValue)) {\n      return this; // nothing to do\n    }\n\n    let limit = end + 1;\n    if ((start & DATA_MASK) !== 0) {\n      // set partial block at [start..following block boundary\n      block = this._getDataBlock(start, true);\n\n      const nextStart = (start + DATA_BLOCK_LENGTH) & ~DATA_MASK;\n      if (nextStart <= limit) {\n        this._fillBlock(block, start & DATA_MASK, DATA_BLOCK_LENGTH, value, this.initialValue, overwrite);\n        start = nextStart;\n      } else {\n        this._fillBlock(block, start & DATA_MASK, limit & DATA_MASK, value, this.initialValue, overwrite);\n        return this;\n      }\n    }\n\n    // number of positions in the last, partial block\n    const rest = limit & DATA_MASK;\n\n    // round down limit to a block boundary\n    limit &= ~DATA_MASK;\n\n    // iterate over all-value blocks\n    if (value === this.initialValue) {\n      repeatBlock = this.dataNullOffset;\n    } else {\n      repeatBlock = -1;\n    }\n\n    while (start < limit) {\n      let setRepeatBlock = false;\n\n      if ((value === this.initialValue) && this._isInNullBlock(start, true)) {\n        start += DATA_BLOCK_LENGTH; // nothing to do\n        continue;\n      }\n\n      // get index value\n      let i2 = this._getIndex2Block(start, true);\n      i2 += (start >> SHIFT_2) & INDEX_2_MASK;\n\n      block = this.index2[i2];\n      if (this._isWritableBlock(block)) {\n        // already allocated\n        if (overwrite && (block >= DATA_0800_OFFSET)) {\n          // We overwrite all values, and it's not a\n          // protected (ASCII-linear or 2-byte UTF-8) block:\n          // replace with the repeatBlock.\n          setRepeatBlock = true;\n        } else {\n          // protected block: just write the values into this block\n          this._fillBlock(block, 0, DATA_BLOCK_LENGTH, value, this.initialValue, overwrite);\n        }\n\n      } else if ((this.data[block] !== value) && (overwrite || (block === this.dataNullOffset))) {\n        // Set the repeatBlock instead of the null block or previous repeat block:\n        //\n        // If !isWritableBlock() then all entries in the block have the same value\n        // because it's the null block or a range block (the repeatBlock from a previous\n        // call to utrie2_setRange32()).\n        // No other blocks are used multiple times before compacting.\n        //\n        // The null block is the only non-writable block with the initialValue because\n        // of the repeatBlock initialization above. (If value==initialValue, then\n        // the repeatBlock will be the null data block.)\n        //\n        // We set our repeatBlock if the desired value differs from the block's value,\n        // and if we overwrite any data or if the data is all initial values\n        // (which is the same as the block being the null block, see above).\n        setRepeatBlock = true;\n      }\n\n      if (setRepeatBlock) {\n        if (repeatBlock >= 0) {\n          this._setIndex2Entry(i2, repeatBlock);\n        } else {\n          // create and set and fill the repeatBlock\n          repeatBlock = this._getDataBlock(start, true);\n          this._writeBlock(repeatBlock, value);\n        }\n      }\n\n      start += DATA_BLOCK_LENGTH;\n    }\n\n    if (rest > 0) {\n      // set partial block at [last block boundary..limit\n      block = this._getDataBlock(start, true);\n      this._fillBlock(block, 0, rest, value, this.initialValue, overwrite);\n    }\n\n    return this;\n  }\n\n  get(c, fromLSCP) {\n    let i2;\n    if (fromLSCP == null) {\n      fromLSCP = true;\n    }\n    if ((c < 0) || (c > 0x10ffff)) {\n      return this.errorValue;\n    }\n\n    if ((c >= this.highStart) && (!((c >= 0xd800) && (c < 0xdc00)) || fromLSCP)) {\n      return this.data[this.dataLength - DATA_GRANULARITY];\n    }\n\n    if (((c >= 0xd800) && (c < 0xdc00)) && fromLSCP) {\n      i2 = (LSCP_INDEX_2_OFFSET - (0xd800 >> SHIFT_2)) + (c >> SHIFT_2);\n    } else {\n      i2 = this.index1[c >> SHIFT_1] + ((c >> SHIFT_2) & INDEX_2_MASK);\n    }\n\n    const block = this.index2[i2];\n    return this.data[block + (c & DATA_MASK)];\n  }\n\n  _isInNullBlock(c, forLSCP) {\n    let i2;\n    if (((c & 0xfffffc00) === 0xd800) && forLSCP) {\n      i2 = (LSCP_INDEX_2_OFFSET - (0xd800 >> SHIFT_2)) + (c >> SHIFT_2);\n    } else {\n      i2 = this.index1[c >> SHIFT_1] + ((c >> SHIFT_2) & INDEX_2_MASK);\n    }\n\n    const block = this.index2[i2];\n    return block === this.dataNullOffset;\n  }\n\n  _allocIndex2Block() {\n    const newBlock = this.index2Length;\n    const newTop = newBlock + INDEX_2_BLOCK_LENGTH;\n    if (newTop > this.index2.length) {\n      // Should never occur.\n      // Either MAX_BUILD_TIME_INDEX_LENGTH is incorrect,\n      // or the code writes more values than should be possible.\n      throw new Error(\"Internal error in Trie2 creation.\");\n    }\n\n    this.index2Length = newTop;\n    this.index2.set(this.index2.subarray(this.index2NullOffset, this.index2NullOffset + INDEX_2_BLOCK_LENGTH), newBlock);\n\n    return newBlock;\n  }\n\n  _getIndex2Block(c, forLSCP) {\n    if ((c >= 0xd800) && (c < 0xdc00) && forLSCP) {\n      return LSCP_INDEX_2_OFFSET;\n    }\n\n    const i1 = c >> SHIFT_1;\n    let i2 = this.index1[i1];\n    if (i2 === this.index2NullOffset) {\n      i2 = this._allocIndex2Block();\n      this.index1[i1] = i2;\n    }\n\n    return i2;\n  }\n\n  _isWritableBlock(block) {\n    return (block !== this.dataNullOffset) && (this.map[block >> SHIFT_2] === 1);\n  }\n\n  _allocDataBlock(copyBlock) {\n    let newBlock;\n    if (this.firstFreeBlock !== 0) {\n      // get the first free block\n      newBlock = this.firstFreeBlock;\n      this.firstFreeBlock = -this.map[newBlock >> SHIFT_2];\n    } else {\n      // get a new block from the high end\n      newBlock = this.dataLength;\n      const newTop = newBlock + DATA_BLOCK_LENGTH;\n      if (newTop > this.dataCapacity) {\n        // out of memory in the data array\n        let capacity;\n        if (this.dataCapacity < MEDIUM_DATA_LENGTH) {\n          capacity = MEDIUM_DATA_LENGTH;\n        } else if (this.dataCapacity < MAX_DATA_LENGTH_BUILDTIME) {\n          capacity = MAX_DATA_LENGTH_BUILDTIME;\n        } else {\n          // Should never occur.\n          // Either MAX_DATA_LENGTH_BUILDTIME is incorrect,\n          // or the code writes more values than should be possible.\n          throw new Error(\"Internal error in Trie2 creation.\");\n        }\n\n        const newData = new Uint32Array(capacity);\n        newData.set(this.data.subarray(0, this.dataLength));\n        this.data = newData;\n        this.dataCapacity = capacity;\n      }\n\n      this.dataLength = newTop;\n    }\n\n    this.data.set(this.data.subarray(copyBlock, copyBlock + DATA_BLOCK_LENGTH), newBlock);\n    this.map[newBlock >> SHIFT_2] = 0;\n    return newBlock;\n  }\n\n  _releaseDataBlock(block) {\n    // put this block at the front of the free-block chain\n    this.map[block >> SHIFT_2] = -this.firstFreeBlock;\n    this.firstFreeBlock = block;\n  }\n\n  _setIndex2Entry(i2, block) {\n    ++this.map[block >> SHIFT_2];  // increment first, in case block == oldBlock!\n    const oldBlock = this.index2[i2];\n    if (--this.map[oldBlock >> SHIFT_2] === 0) {\n      this._releaseDataBlock(oldBlock);\n    }\n\n    this.index2[i2] = block;\n  }\n\n  _getDataBlock(c, forLSCP) {\n    let i2 = this._getIndex2Block(c, forLSCP);\n    i2 += (c >> SHIFT_2) & INDEX_2_MASK;\n\n    const oldBlock = this.index2[i2];\n    if (this._isWritableBlock(oldBlock)) {\n      return oldBlock;\n    }\n\n    // allocate a new data block\n    const newBlock = this._allocDataBlock(oldBlock);\n    this._setIndex2Entry(i2, newBlock);\n    return newBlock;\n  }\n\n  _fillBlock(block, start, limit, value, initialValue, overwrite) {\n    let i;\n    if (overwrite) {\n      for (i = block + start; i < block + limit; i++) {\n        this.data[i] = value;\n      }\n    } else {\n      for (i = block + start; i < block + limit; i++) {\n        if (this.data[i] === initialValue) {\n          this.data[i] = value;\n        }\n      }\n    }\n  }\n\n  _writeBlock(block, value) {\n    const limit = block + DATA_BLOCK_LENGTH;\n    while (block < limit) {\n      this.data[block++] = value;\n    }\n  }\n\n  _findHighStart(highValue) {\n    let prevBlock, prevI2Block;\n    const data32 = this.data;\n    const { initialValue } = this;\n    const { index2NullOffset } = this;\n    const nullBlock = this.dataNullOffset;\n\n    // set variables for previous range\n    if (highValue === initialValue) {\n      prevI2Block = index2NullOffset;\n      prevBlock = nullBlock;\n    } else {\n      prevI2Block = -1;\n      prevBlock = -1;\n    }\n\n    const prev = 0x110000;\n\n    // enumerate index-2 blocks\n    let i1 = INDEX_1_LENGTH;\n    let c = prev;\n    while (c > 0) {\n      const i2Block = this.index1[--i1];\n      if (i2Block === prevI2Block) {\n        // the index-2 block is the same as the previous one, and filled with highValue\n        c -= CP_PER_INDEX_1_ENTRY;\n        continue;\n      }\n\n      prevI2Block = i2Block;\n      if (i2Block === index2NullOffset) {\n        // this is the null index-2 block\n        if (highValue !== initialValue) {\n          return c;\n        }\n        c -= CP_PER_INDEX_1_ENTRY;\n      } else {\n        // enumerate data blocks for one index-2 block\n        let i2 = INDEX_2_BLOCK_LENGTH;\n        while (i2 > 0) {\n          const block = this.index2[i2Block + --i2];\n          if (block === prevBlock) {\n            // the block is the same as the previous one, and filled with highValue\n            c -= DATA_BLOCK_LENGTH;\n            continue;\n          }\n\n          prevBlock = block;\n          if (block === nullBlock) {\n            // this is the null data block\n            if (highValue !== initialValue) {\n              return c;\n            }\n            c -= DATA_BLOCK_LENGTH;\n          } else {\n            let j = DATA_BLOCK_LENGTH;\n            while (j > 0) {\n              const value = data32[block + --j];\n              if (value !== highValue) {\n                return c;\n              }\n              --c;\n            }\n          }\n        }\n      }\n    }\n\n    // deliver last range\n    return 0;\n  }\n\n  _findSameDataBlock(dataLength, otherBlock, blockLength) {\n    // ensure that we do not even partially get past dataLength\n    dataLength -= blockLength;\n    let block = 0;\n    while (block <= dataLength) {\n      if (equal_int(this.data, block, otherBlock, blockLength)) {\n        return block;\n      }\n      block += DATA_GRANULARITY;\n    }\n\n    return -1;\n  }\n\n  _findSameIndex2Block(index2Length, otherBlock) {\n    // ensure that we do not even partially get past index2Length\n    index2Length -= INDEX_2_BLOCK_LENGTH;\n    for (let block = 0; block <= index2Length; block++) {\n      if (equal_int(this.index2, block, otherBlock, INDEX_2_BLOCK_LENGTH)) {\n        return block;\n      }\n    }\n\n    return -1;\n  }\n\n  _compactData() {\n    // do not compact linear-ASCII data\n    let newStart = DATA_START_OFFSET;\n    let start = 0;\n    let i = 0;\n\n    while (start < newStart) {\n      this.map[i++] = start;\n      start += DATA_BLOCK_LENGTH;\n    }\n\n    // Start with a block length of 64 for 2-byte UTF-8,\n    // then switch to DATA_BLOCK_LENGTH.\n    let blockLength = 64;\n    let blockCount = blockLength >> SHIFT_2;\n    start = newStart;\n    while (start < this.dataLength) {\n      // start: index of first entry of current block\n      // newStart: index where the current block is to be moved\n      //           (right after current end of already-compacted data)\n      var mapIndex, movedStart;\n      if (start === DATA_0800_OFFSET) {\n        blockLength = DATA_BLOCK_LENGTH;\n        blockCount = 1;\n      }\n\n      // skip blocks that are not used\n      if (this.map[start >> SHIFT_2] <= 0) {\n        // advance start to the next block\n        start += blockLength;\n\n        // leave newStart with the previous block!\n        continue;\n      }\n\n      // search for an identical block\n      if ((movedStart = this._findSameDataBlock(newStart, start, blockLength)) >= 0) {\n        // found an identical block, set the other block's index value for the current block\n        mapIndex = start >> SHIFT_2;\n        for (i = blockCount; i > 0; i--) {\n          this.map[mapIndex++] = movedStart;\n          movedStart += DATA_BLOCK_LENGTH;\n        }\n\n        // advance start to the next block\n        start += blockLength;\n\n        // leave newStart with the previous block!\n        continue;\n      }\n\n      // see if the beginning of this block can be overlapped with the end of the previous block\n      // look for maximum overlap (modulo granularity) with the previous, adjacent block\n      let overlap = blockLength - DATA_GRANULARITY;\n      while ((overlap > 0) && !equal_int(this.data, (newStart - overlap), start, overlap)) {\n        overlap -= DATA_GRANULARITY;\n      }\n\n      if ((overlap > 0) || (newStart < start)) {\n        // some overlap, or just move the whole block\n        movedStart = newStart - overlap;\n        mapIndex = start >> SHIFT_2;\n\n        for (i = blockCount; i > 0; i--) {\n          this.map[mapIndex++] = movedStart;\n          movedStart += DATA_BLOCK_LENGTH;\n        }\n\n        // move the non-overlapping indexes to their new positions\n        start += overlap;\n        for (i = blockLength - overlap; i > 0; i--) {\n          this.data[newStart++] = this.data[start++];\n        }\n\n      } else { // no overlap && newStart==start\n        mapIndex = start >> SHIFT_2;\n        for (i = blockCount; i > 0; i--) {\n          this.map[mapIndex++] = start;\n          start += DATA_BLOCK_LENGTH;\n        }\n\n        newStart = start;\n      }\n    }\n\n    // now adjust the index-2 table\n    i = 0;\n    while (i < this.index2Length) {\n      // Gap indexes are invalid (-1). Skip over the gap.\n      if (i === INDEX_GAP_OFFSET) {\n        i += INDEX_GAP_LENGTH;\n      }\n      this.index2[i] = this.map[this.index2[i] >> SHIFT_2];\n      ++i;\n    }\n\n    this.dataNullOffset = this.map[this.dataNullOffset >> SHIFT_2];\n\n    // ensure dataLength alignment\n    while ((newStart & (DATA_GRANULARITY - 1)) !== 0) {\n      this.data[newStart++] = this.initialValue;\n    }\n    this.dataLength = newStart;\n  }\n\n  _compactIndex2() {\n    // do not compact linear-BMP index-2 blocks\n    let newStart = INDEX_2_BMP_LENGTH;\n    let start = 0;\n    let i = 0;\n\n    while (start < newStart) {\n      this.map[i++] = start;\n      start += INDEX_2_BLOCK_LENGTH;\n    }\n\n    // Reduce the index table gap to what will be needed at runtime.\n    newStart += UTF8_2B_INDEX_2_LENGTH + ((this.highStart - 0x10000) >> SHIFT_1);\n    start = INDEX_2_NULL_OFFSET;\n    while (start < this.index2Length) {\n      // start: index of first entry of current block\n      // newStart: index where the current block is to be moved\n      //           (right after current end of already-compacted data)\n\n      // search for an identical block\n      var movedStart;\n      if ((movedStart = this._findSameIndex2Block(newStart, start)) >= 0) {\n        // found an identical block, set the other block's index value for the current block\n        this.map[start >> SHIFT_1_2] = movedStart;\n\n        // advance start to the next block\n        start += INDEX_2_BLOCK_LENGTH;\n\n        // leave newStart with the previous block!\n        continue;\n      }\n\n      // see if the beginning of this block can be overlapped with the end of the previous block\n      // look for maximum overlap with the previous, adjacent block\n      let overlap = INDEX_2_BLOCK_LENGTH - 1;\n      while ((overlap > 0) && !equal_int(this.index2, (newStart - overlap), start, overlap)) {\n        --overlap;\n      }\n\n      if ((overlap > 0) || (newStart < start)) {\n        // some overlap, or just move the whole block\n        this.map[start >> SHIFT_1_2] = newStart - overlap;\n\n        // move the non-overlapping indexes to their new positions\n        start += overlap;\n        for (i = INDEX_2_BLOCK_LENGTH - overlap; i > 0; i--) {\n          this.index2[newStart++] = this.index2[start++];\n        }\n\n      } else { // no overlap && newStart==start\n        this.map[start >> SHIFT_1_2] = start;\n        start += INDEX_2_BLOCK_LENGTH;\n        newStart = start;\n      }\n    }\n\n    // now adjust the index-1 table\n    for (i = 0; i < INDEX_1_LENGTH; i++) {\n      this.index1[i] = this.map[this.index1[i] >> SHIFT_1_2];\n    }\n\n    this.index2NullOffset = this.map[this.index2NullOffset >> SHIFT_1_2];\n\n    // Ensure data table alignment:\n    // Needs to be granularity-aligned for 16-bit trie\n    // (so that dataMove will be down-shiftable),\n    // and 2-aligned for uint32_t data.\n\n    // Arbitrary value: 0x3fffc not possible for real data.\n    while ((newStart & ((DATA_GRANULARITY - 1) | 1)) !== 0) {\n      this.index2[newStart++] = 0x0000ffff << INDEX_SHIFT;\n    }\n\n    this.index2Length = newStart;\n  }\n\n  _compact() {\n    // find highStart and round it up\n    let highValue = this.get(0x10ffff);\n    let highStart = this._findHighStart(highValue);\n    highStart = (highStart + (CP_PER_INDEX_1_ENTRY - 1)) & ~(CP_PER_INDEX_1_ENTRY - 1);\n    if (highStart === 0x110000) {\n      highValue = this.errorValue;\n    }\n\n    // Set trie->highStart only after utrie2_get32(trie, highStart).\n    // Otherwise utrie2_get32(trie, highStart) would try to read the highValue.\n    this.highStart = highStart;\n    if (this.highStart < 0x110000) {\n      // Blank out [highStart..10ffff] to release associated data blocks.\n      const suppHighStart = this.highStart <= 0x10000 ? 0x10000 : this.highStart;\n      this.setRange(suppHighStart, 0x10ffff, this.initialValue, true);\n    }\n\n    this._compactData();\n    if (this.highStart > 0x10000) {\n      this._compactIndex2();\n    }\n\n    // Store the highValue in the data array and round up the dataLength.\n    // Must be done after compactData() because that assumes that dataLength\n    // is a multiple of DATA_BLOCK_LENGTH.\n    this.data[this.dataLength++] = highValue;\n    while ((this.dataLength & (DATA_GRANULARITY - 1)) !== 0) {\n      this.data[this.dataLength++] = this.initialValue;\n    }\n\n    this.isCompacted = true;\n  }\n\n  freeze() {\n    let allIndexesLength, i;\n    if (!this.isCompacted) {\n      this._compact();\n    }\n\n    if (this.highStart <= 0x10000) {\n      allIndexesLength = INDEX_1_OFFSET;\n    } else {\n      allIndexesLength = this.index2Length;\n    }\n\n    const dataMove = allIndexesLength;\n\n    // are indexLength and dataLength within limits?\n    if ((allIndexesLength > MAX_INDEX_LENGTH) || // for unshifted indexLength\n      ((dataMove + this.dataNullOffset) > 0xffff) || // for unshifted dataNullOffset\n      ((dataMove + DATA_0800_OFFSET) > 0xffff) || // for unshifted 2-byte UTF-8 index-2 values\n      ((dataMove + this.dataLength) > MAX_DATA_LENGTH_RUNTIME)) { // for shiftedDataLength\n      throw new Error(\"Trie data is too large.\");\n    }\n\n    // calculate the sizes of, and allocate, the index and data arrays\n    const indexLength = allIndexesLength + this.dataLength;\n    const data = new Int32Array(indexLength);\n\n    // write the index-2 array values shifted right by INDEX_SHIFT, after adding dataMove\n    let destIdx = 0;\n    for (i = 0; i < INDEX_2_BMP_LENGTH; i++) {\n      data[destIdx++] = ((this.index2[i] + dataMove) >> INDEX_SHIFT);\n    }\n\n    // write UTF-8 2-byte index-2 values, not right-shifted\n    for (i = 0; i < 0xc2 - 0xc0; i++) { // C0..C1\n      data[destIdx++] = (dataMove + BAD_UTF8_DATA_OFFSET);\n    }\n\n    for (i = i; i < 0xe0 - 0xc0; i++) { // C2..DF\n      data[destIdx++] = (dataMove + this.index2[i << (6 - SHIFT_2)]);\n    }\n\n    if (this.highStart > 0x10000) {\n      const index1Length = (this.highStart - 0x10000) >> SHIFT_1;\n      const index2Offset = INDEX_2_BMP_LENGTH + UTF8_2B_INDEX_2_LENGTH + index1Length;\n\n      // write 16-bit index-1 values for supplementary code points\n      for (i = 0; i < index1Length; i++) {\n        data[destIdx++] = (INDEX_2_OFFSET + this.index1[i + OMITTED_BMP_INDEX_1_LENGTH]);\n      }\n\n      // write the index-2 array values for supplementary code points,\n      // shifted right by INDEX_SHIFT, after adding dataMove\n      for (i = 0; i < this.index2Length - index2Offset; i++) {\n        data[destIdx++] = ((dataMove + this.index2[index2Offset + i]) >> INDEX_SHIFT);\n      }\n    }\n\n    // write 16-bit data values\n    for (i = 0; i < this.dataLength; i++) {\n      data[destIdx++] = this.data[i];\n    }\n\n    const dest = new UnicodeTrie({\n      data,\n      highStart: this.highStart,\n      errorValue: this.errorValue\n    });\n\n    return dest;\n  }\n\n  // Generates a Buffer containing the serialized and compressed trie.\n  // Trie data is compressed once with raw deflate (a second pass does not help).\n  // Format:\n  //   uint32_t highStart;\n  //   uint32_t errorValue;\n  //   uint32_t uncompressedDataLength;\n  //   uint8_t trieData[dataLength];\n  toBuffer() {\n    const trie = this.freeze();\n\n    const data = new Uint8Array(trie.data.buffer);\n\n    // swap bytes to little-endian\n    swap32LE(data);\n\n    const compressed = deflateSync(data);\n\n    const buf = Buffer.alloc(compressed.length + 12);\n    buf.writeUInt32LE(trie.highStart, 0);\n    buf.writeUInt32LE(trie.errorValue, 4);\n    buf.writeUInt32LE(data.length, 8);\n    for (let i = 0; i < compressed.length; i++) {\n      const b = compressed[i];\n      buf[i + 12] = b;\n    }\n\n    return buf;\n  }\n}\n\nexport default UnicodeTrieBuilder;", "import { inflateSync } from 'fflate';\nimport { swap32LE } from './swap.js';\n\n// Shift size for getting the index-1 table offset.\nconst SHIFT_1 = 6 + 5;\n\n// Shift size for getting the index-2 table offset.\nconst SHIFT_2 = 5;\n\n// Difference between the two shift sizes,\n// for getting an index-1 offset from an index-2 offset. 6=11-5\nconst SHIFT_1_2 = SHIFT_1 - SHIFT_2;\n\n// Number of index-1 entries for the BMP. 32=0x20\n// This part of the index-1 table is omitted from the serialized form.\nconst OMITTED_BMP_INDEX_1_LENGTH = 0x10000 >> SHIFT_1;\n\n// Number of entries in an index-2 block. 64=0x40\nconst INDEX_2_BLOCK_LENGTH = 1 << SHIFT_1_2;\n\n// Mask for getting the lower bits for the in-index-2-block offset. */\nconst INDEX_2_MASK = INDEX_2_BLOCK_LENGTH - 1;\n\n// Shift size for shifting left the index array values.\n// Increases possible data size with 16-bit index values at the cost\n// of compactability.\n// This requires data blocks to be aligned by DATA_GRANULARITY.\nconst INDEX_SHIFT = 2;\n\n// Number of entries in a data block. 32=0x20\nconst DATA_BLOCK_LENGTH = 1 << SHIFT_2;\n\n// Mask for getting the lower bits for the in-data-block offset.\nconst DATA_MASK = DATA_BLOCK_LENGTH - 1;\n\n// The part of the index-2 table for U+D800..U+DBFF stores values for\n// lead surrogate code _units_ not code _points_.\n// Values for lead surrogate code _points_ are indexed with this portion of the table.\n// Length=32=0x20=0x400>>SHIFT_2. (There are 1024=0x400 lead surrogates.)\nconst LSCP_INDEX_2_OFFSET = 0x10000 >> SHIFT_2;\nconst LSCP_INDEX_2_LENGTH = 0x400 >> SHIFT_2;\n\n// Count the lengths of both BMP pieces. 2080=0x820\nconst INDEX_2_BMP_LENGTH = LSCP_INDEX_2_OFFSET + LSCP_INDEX_2_LENGTH;\n\n// The 2-byte UTF-8 version of the index-2 table follows at offset 2080=0x820.\n// Length 32=0x20 for lead bytes C0..DF, regardless of SHIFT_2.\nconst UTF8_2B_INDEX_2_OFFSET = INDEX_2_BMP_LENGTH;\nconst UTF8_2B_INDEX_2_LENGTH = 0x800 >> 6;  // U+0800 is the first code point after 2-byte UTF-8\n\n// The index-1 table, only used for supplementary code points, at offset 2112=0x840.\n// Variable length, for code points up to highStart, where the last single-value range starts.\n// Maximum length 512=0x200=0x100000>>SHIFT_1.\n// (For 0x100000 supplementary code points U+10000..U+10ffff.)\n//\n// The part of the index-2 table for supplementary code points starts\n// after this index-1 table.\n//\n// Both the index-1 table and the following part of the index-2 table\n// are omitted completely if there is only BMP data.\nconst INDEX_1_OFFSET = UTF8_2B_INDEX_2_OFFSET + UTF8_2B_INDEX_2_LENGTH;\n\n// The alignment size of a data block. Also the granularity for compaction.\nconst DATA_GRANULARITY = 1 << INDEX_SHIFT;\n\nclass UnicodeTrie {\n  constructor(data) {\n    const isBuffer = (typeof data.readUInt32BE === 'function') && (typeof data.slice === 'function');\n\n    if (isBuffer || data instanceof Uint8Array) {\n      // read binary format\n      let uncompressedLength;\n      if (isBuffer) {\n        this.highStart = data.readUInt32LE(0);\n        this.errorValue = data.readUInt32LE(4);\n        uncompressedLength = data.readUInt32LE(8);\n        data = data.slice(12);\n      } else {\n        const view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n        this.highStart = view.getUint32(0, true);\n        this.errorValue = view.getUint32(4, true);\n        uncompressedLength = view.getUint32(8, true);\n        data = data.subarray(12);\n      }\n\n      // inflate the actual trie data (raw deflate, matching builder)\n      data = inflateSync(data, { out: new Uint8Array(uncompressedLength) });\n\n      // swap bytes from little-endian\n      swap32LE(data);\n\n      this.data = new Uint32Array(data.buffer, data.byteOffset, data.byteLength >> 2);\n\n    } else {\n      // pre-parsed data\n      ({ data: this.data, highStart: this.highStart, errorValue: this.errorValue } = data);\n    }\n  }\n\n  get(codePoint) {\n    let index;\n    if ((codePoint < 0) || (codePoint > 0x10ffff)) {\n      return this.errorValue;\n    }\n\n    if ((codePoint < 0xd800) || ((codePoint > 0xdbff) && (codePoint <= 0xffff))) {\n      // Ordinary BMP code point, excluding leading surrogates.\n      // BMP uses a single level lookup.  BMP index starts at offset 0 in the index.\n      // data is stored in the index array itself.\n      index = (this.data[codePoint >> SHIFT_2] << INDEX_SHIFT) + (codePoint & DATA_MASK);\n      return this.data[index];\n    }\n\n    if (codePoint <= 0xffff) {\n      // Lead Surrogate Code Point.  A Separate index section is stored for\n      // lead surrogate code units and code points.\n      //   The main index has the code unit data.\n      //   For this function, we need the code point data.\n      index = (this.data[LSCP_INDEX_2_OFFSET + ((codePoint - 0xd800) >> SHIFT_2)] << INDEX_SHIFT) + (codePoint & DATA_MASK);\n      return this.data[index];\n    }\n\n    if (codePoint < this.highStart) {\n      // Supplemental code point, use two-level lookup.\n      index = this.data[(INDEX_1_OFFSET - OMITTED_BMP_INDEX_1_LENGTH) + (codePoint >> SHIFT_1)];\n      index = this.data[index + ((codePoint >> SHIFT_2) & INDEX_2_MASK)];\n      index = (index << INDEX_SHIFT) + (codePoint & DATA_MASK);\n      return this.data[index];\n    }\n\n    return this.data[this.data.length - DATA_GRANULARITY];\n  }\n}\n\nexport default UnicodeTrie;\n", "const isBigEndian = (new Uint8Array(new Uint32Array([0x12345678]).buffer)[0] === 0x12);\n\nconst swap = (b, n, m) => {\n  let i = b[n];\n  b[n] = b[m];\n  b[m] = i;\n};\n\nconst swap32 = array => {\n  const len = array.length;\n  for (let i = 0; i < len; i += 4) {\n    swap(array, i, i + 3);\n    swap(array, i + 1, i + 2);\n  }\n};\n\nexport const swap32LE = array => {\n  if (isBigEndian) {\n    swap32(array);\n  }\n};\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAA,iBAA4B;;;ACA5B,oBAA4B;;;ACA5B,IAAM,cAAe,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AAEjF,IAAM,OAAO,CAAC,GAAG,GAAG,MAAM;AACxB,MAAI,IAAI,EAAE,CAAC;AACX,IAAE,CAAC,IAAI,EAAE,CAAC;AACV,IAAE,CAAC,IAAI;AACT;AAEA,IAAM,SAAS,WAAS;AACtB,QAAM,MAAM,MAAM;AAClB,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,SAAK,OAAO,GAAG,IAAI,CAAC;AACpB,SAAK,OAAO,IAAI,GAAG,IAAI,CAAC;AAAA,EAC1B;AACF;AAEO,IAAM,WAAW,WAAS;AAC/B,MAAI,aAAa;AACf,WAAO,KAAK;AAAA,EACd;AACF;;;ADhBA,IAAM,UAAU,IAAI;AAGpB,IAAM,UAAU;AAIhB,IAAM,YAAY,UAAU;AAI5B,IAAM,6BAA6B,SAAW;AAG9C,IAAM,uBAAuB,KAAK;AAGlC,IAAM,eAAe,uBAAuB;AAM5C,IAAM,cAAc;AAGpB,IAAM,oBAAoB,KAAK;AAG/B,IAAM,YAAY,oBAAoB;AAMtC,IAAM,sBAAsB,SAAW;AACvC,IAAM,sBAAsB,QAAS;AAGrC,IAAM,qBAAqB,sBAAsB;AAIjD,IAAM,yBAAyB;AAC/B,IAAM,yBAAyB,QAAS;AAYxC,IAAM,iBAAiB,yBAAyB;AAGhD,IAAM,mBAAmB,KAAK;AAE9B,IAAM,cAAN,MAAkB;AAAA,EAChB,YAAY,MAAM;AAChB,UAAM,WAAY,OAAO,KAAK,iBAAiB,cAAgB,OAAO,KAAK,UAAU;AAErF,QAAI,YAAY,gBAAgB,YAAY;AAE1C,UAAI;AACJ,UAAI,UAAU;AACZ,aAAK,YAAY,KAAK,aAAa,CAAC;AACpC,aAAK,aAAa,KAAK,aAAa,CAAC;AACrC,6BAAqB,KAAK,aAAa,CAAC;AACxC,eAAO,KAAK,MAAM,EAAE;AAAA,MACtB,OAAO;AACL,cAAM,OAAO,IAAI,SAAS,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AACvE,aAAK,YAAY,KAAK,UAAU,GAAG,IAAI;AACvC,aAAK,aAAa,KAAK,UAAU,GAAG,IAAI;AACxC,6BAAqB,KAAK,UAAU,GAAG,IAAI;AAC3C,eAAO,KAAK,SAAS,EAAE;AAAA,MACzB;AAGA,iBAAO,2BAAY,MAAM,EAAE,KAAK,IAAI,WAAW,kBAAkB,EAAE,CAAC;AAGpE,eAAS,IAAI;AAEb,WAAK,OAAO,IAAI,YAAY,KAAK,QAAQ,KAAK,YAAY,KAAK,cAAc,CAAC;AAAA,IAEhF,OAAO;AAEL,OAAC,EAAE,MAAM,KAAK,MAAM,WAAW,KAAK,WAAW,YAAY,KAAK,WAAW,IAAI;AAAA,IACjF;AAAA,EACF;AAAA,EAEA,IAAI,WAAW;AACb,QAAI;AACJ,QAAK,YAAY,KAAO,YAAY,SAAW;AAC7C,aAAO,KAAK;AAAA,IACd;AAEA,QAAK,YAAY,SAAa,YAAY,SAAY,aAAa,OAAU;AAI3E,eAAS,KAAK,KAAK,aAAa,OAAO,KAAK,gBAAgB,YAAY;AACxE,aAAO,KAAK,KAAK,KAAK;AAAA,IACxB;AAEA,QAAI,aAAa,OAAQ;AAKvB,eAAS,KAAK,KAAK,uBAAwB,YAAY,SAAW,QAAQ,KAAK,gBAAgB,YAAY;AAC3G,aAAO,KAAK,KAAK,KAAK;AAAA,IACxB;AAEA,QAAI,YAAY,KAAK,WAAW;AAE9B,cAAQ,KAAK,KAAM,iBAAiB,8BAA+B,aAAa,QAAQ;AACxF,cAAQ,KAAK,KAAK,SAAU,aAAa,UAAW,aAAa;AACjE,eAAS,SAAS,gBAAgB,YAAY;AAC9C,aAAO,KAAK,KAAK,KAAK;AAAA,IACxB;AAEA,WAAO,KAAK,KAAK,KAAK,KAAK,SAAS,gBAAgB;AAAA,EACtD;AACF;AAEA,IAAO,gBAAQ;;;ADjIf,IAAMC,WAAU,IAAI;AAGpB,IAAMC,WAAU;AAIhB,IAAMC,aAAYF,WAAUC;AAI5B,IAAME,8BAA6B,SAAWH;AAG9C,IAAM,uBAAuB,KAAKA;AAGlC,IAAMI,wBAAuB,KAAKF;AAGlC,IAAMG,gBAAeD,wBAAuB;AAG5C,IAAME,qBAAoB,KAAKL;AAG/B,IAAMM,aAAYD,qBAAoB;AAMtC,IAAME,eAAc;AAGpB,IAAMC,oBAAmB,KAAKD;AAI9B,IAAM,iBAAiB;AAMvB,IAAME,uBAAsB,SAAWT;AACvC,IAAMU,uBAAsB,QAASV;AAGrC,IAAMW,sBAAqBF,uBAAsBC;AAIjD,IAAME,0BAAyBD;AAC/B,IAAME,0BAAyB,QAAS;AAYxC,IAAMC,kBAAiBF,0BAAyBC;AAChD,IAAM,qBAAqB,WAAYd;AAKvC,IAAM,uBAAuB;AAI7B,IAAM,oBAAoB;AAK1B,IAAM,mBAAmB;AAGzB,IAAM,wBAAwB,mBAAmB;AAMjD,IAAM,mBAAmB,wBAAwB;AAGjD,IAAM,sBAAsB,KAAK;AAGjC,IAAM,qBAAqB,KAAK;AAKhC,IAAM,0BAA0B,SAAUQ;AAE1C,IAAM,iBAAiB,WAAYR;AAKnC,IAAM,4BAA4B,UAAW,KAAO,KAAO;AAM3D,IAAM,mBAAmBY;AACzB,IAAM,mBAAqBE,0BAAyB,qBAAsBT,gBAAgB,CAACA;AAO3F,IAAM,sBAAsB,WAAYJ,YAAWU,uBAAsB,mBAAmBP;AAG5F,IAAM,sBAAsB,mBAAmB;AAG/C,IAAM,uBAAuB,sBAAsBA;AAMnD,IAAM,mBAAmB;AAEzB,IAAM,YAAY,CAAC,GAAG,GAAG,GAAG,WAAW;AACrC,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG;AACzB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEA,IAAM,qBAAN,MAAyB;AAAA,EACvB,YAAY,cAAc,YAAY;AACpC,QAAI,GAAG;AACP,QAAI,gBAAgB,MAAM;AACxB,qBAAe;AAAA,IACjB;AACA,SAAK,eAAe;AACpB,QAAI,cAAc,MAAM;AACtB,mBAAa;AAAA,IACf;AACA,SAAK,aAAa;AAClB,SAAK,SAAS,IAAI,WAAW,cAAc;AAC3C,SAAK,SAAS,IAAI,WAAW,kBAAkB;AAC/C,SAAK,YAAY;AAEjB,SAAK,OAAO,IAAI,YAAY,mBAAmB;AAC/C,SAAK,eAAe;AAEpB,SAAK,iBAAiB;AACtB,SAAK,cAAc;AAenB,SAAK,MAAM,IAAI,WAAW,6BAA6BH,QAAO;AAE9D,SAAK,IAAI,GAAG,IAAI,KAAM,KAAK;AACzB,WAAK,KAAK,CAAC,IAAI,KAAK;AAAA,IACtB;AAEA,SAAK,IAAI,GAAG,IAAI,KAAM,KAAK;AACzB,WAAK,KAAK,CAAC,IAAI,KAAK;AAAA,IACtB;AAEA,SAAK,IAAI,kBAAkB,IAAI,uBAAuB,KAAK;AACzD,WAAK,KAAK,CAAC,IAAI,KAAK;AAAA,IACtB;AAEA,SAAK,iBAAiB;AACtB,SAAK,aAAa;AAGlB,QAAI;AACJ,SAAK,IAAI,GAAG,IAAI,KAAM,KAAKK,oBAAmB;AAC5C,WAAK,OAAO,CAAC,IAAI;AACjB,WAAK,IAAI,GAAG,IAAI;AAAA,IAClB;AAGA,SAAK,IAAI,GAAG,IAAI,KAAM,KAAKA,oBAAmB;AAC5C,WAAK,IAAI,GAAG,IAAI;AAAA,IAClB;AAMA,SAAK,IAAI,GAAG,KAAM,WAAYL,aAAY,OAAQA,YAAY,IAAIU;AAClE,SAAKL;AACL,SAAK,IAAI,GAAG,IAAI,uBAAuB,KAAKA,oBAAmB;AAC7D,WAAK,IAAI,GAAG,IAAI;AAAA,IAClB;AAIA,SAAK,IAAI,OAAQL,UAAS,IAAIW,qBAAoB,KAAK;AACrD,WAAK,OAAO,CAAC,IAAI;AAAA,IACnB;AAIA,SAAK,IAAI,GAAG,IAAI,kBAAkB,KAAK;AACrC,WAAK,OAAO,mBAAmB,CAAC,IAAI;AAAA,IACtC;AAGA,SAAK,IAAI,GAAG,IAAIR,uBAAsB,KAAK;AACzC,WAAK,OAAO,sBAAsB,CAAC,IAAI;AAAA,IACzC;AAEA,SAAK,mBAAmB;AACxB,SAAK,eAAe;AAGpB,QAAI;AACJ,SAAK,IAAI,GAAG,IAAID,6BAA4B,KAAK;AAC/C,WAAK,OAAO,CAAC,IAAI;AACjB,WAAKC;AAAA,IACP;AAGA,SAAK,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACnC,WAAK,OAAO,CAAC,IAAI;AAAA,IACnB;AAKA,SAAK,IAAI,KAAM,IAAI,MAAO,KAAKE,oBAAmB;AAChD,WAAK,IAAI,GAAG,KAAK,YAAY;AAAA,IAC/B;AAAA,EAEF;AAAA,EAEA,IAAI,WAAW,OAAO;AACpB,QAAK,YAAY,KAAO,YAAY,SAAW;AAC7C,YAAM,IAAI,MAAM,oBAAoB;AAAA,IACtC;AAEA,QAAI,KAAK,aAAa;AACpB,YAAM,IAAI,MAAM,mBAAmB;AAAA,IACrC;AAEA,UAAM,QAAQ,KAAK,cAAc,WAAW,IAAI;AAChD,SAAK,KAAK,SAAS,YAAYC,WAAU,IAAI;AAC7C,WAAO;AAAA,EACT;AAAA,EAEA,SAAS,OAAO,KAAK,OAAO,WAAW;AACrC,QAAI,OAAO;AACX,QAAI,aAAa,MAAM;AACrB,kBAAY;AAAA,IACd;AACA,QAAK,QAAQ,WAAc,MAAM,WAAc,QAAQ,KAAM;AAC3D,YAAM,IAAI,MAAM,oBAAoB;AAAA,IACtC;AAEA,QAAI,KAAK,aAAa;AACpB,YAAM,IAAI,MAAM,mBAAmB;AAAA,IACrC;AAEA,QAAI,CAAC,aAAc,UAAU,KAAK,cAAe;AAC/C,aAAO;AAAA,IACT;AAEA,QAAI,QAAQ,MAAM;AAClB,SAAK,QAAQA,gBAAe,GAAG;AAE7B,cAAQ,KAAK,cAAc,OAAO,IAAI;AAEtC,YAAM,YAAa,QAAQD,qBAAqB,CAACC;AACjD,UAAI,aAAa,OAAO;AACtB,aAAK,WAAW,OAAO,QAAQA,YAAWD,oBAAmB,OAAO,KAAK,cAAc,SAAS;AAChG,gBAAQ;AAAA,MACV,OAAO;AACL,aAAK,WAAW,OAAO,QAAQC,YAAW,QAAQA,YAAW,OAAO,KAAK,cAAc,SAAS;AAChG,eAAO;AAAA,MACT;AAAA,IACF;AAGA,UAAM,OAAO,QAAQA;AAGrB,aAAS,CAACA;AAGV,QAAI,UAAU,KAAK,cAAc;AAC/B,oBAAc,KAAK;AAAA,IACrB,OAAO;AACL,oBAAc;AAAA,IAChB;AAEA,WAAO,QAAQ,OAAO;AACpB,UAAI,iBAAiB;AAErB,UAAK,UAAU,KAAK,gBAAiB,KAAK,eAAe,OAAO,IAAI,GAAG;AACrE,iBAASD;AACT;AAAA,MACF;AAGA,UAAI,KAAK,KAAK,gBAAgB,OAAO,IAAI;AACzC,YAAO,SAASL,WAAWI;AAE3B,cAAQ,KAAK,OAAO,EAAE;AACtB,UAAI,KAAK,iBAAiB,KAAK,GAAG;AAEhC,YAAI,aAAc,SAAS,kBAAmB;AAI5C,2BAAiB;AAAA,QACnB,OAAO;AAEL,eAAK,WAAW,OAAO,GAAGC,oBAAmB,OAAO,KAAK,cAAc,SAAS;AAAA,QAClF;AAAA,MAEF,WAAY,KAAK,KAAK,KAAK,MAAM,UAAW,aAAc,UAAU,KAAK,iBAAkB;AAezF,yBAAiB;AAAA,MACnB;AAEA,UAAI,gBAAgB;AAClB,YAAI,eAAe,GAAG;AACpB,eAAK,gBAAgB,IAAI,WAAW;AAAA,QACtC,OAAO;AAEL,wBAAc,KAAK,cAAc,OAAO,IAAI;AAC5C,eAAK,YAAY,aAAa,KAAK;AAAA,QACrC;AAAA,MACF;AAEA,eAASA;AAAA,IACX;AAEA,QAAI,OAAO,GAAG;AAEZ,cAAQ,KAAK,cAAc,OAAO,IAAI;AACtC,WAAK,WAAW,OAAO,GAAG,MAAM,OAAO,KAAK,cAAc,SAAS;AAAA,IACrE;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,GAAG,UAAU;AACf,QAAI;AACJ,QAAI,YAAY,MAAM;AACpB,iBAAW;AAAA,IACb;AACA,QAAK,IAAI,KAAO,IAAI,SAAW;AAC7B,aAAO,KAAK;AAAA,IACd;AAEA,QAAK,KAAK,KAAK,cAAe,EAAG,KAAK,SAAY,IAAI,UAAY,WAAW;AAC3E,aAAO,KAAK,KAAK,KAAK,aAAaG,iBAAgB;AAAA,IACrD;AAEA,QAAM,KAAK,SAAY,IAAI,SAAY,UAAU;AAC/C,WAAMC,wBAAuB,SAAUT,aAAa,KAAKA;AAAA,IAC3D,OAAO;AACL,WAAK,KAAK,OAAO,KAAKD,QAAO,KAAM,KAAKC,WAAWI;AAAA,IACrD;AAEA,UAAM,QAAQ,KAAK,OAAO,EAAE;AAC5B,WAAO,KAAK,KAAK,SAAS,IAAIE,WAAU;AAAA,EAC1C;AAAA,EAEA,eAAe,GAAG,SAAS;AACzB,QAAI;AACJ,SAAM,IAAI,gBAAgB,SAAW,SAAS;AAC5C,WAAMG,wBAAuB,SAAUT,aAAa,KAAKA;AAAA,IAC3D,OAAO;AACL,WAAK,KAAK,OAAO,KAAKD,QAAO,KAAM,KAAKC,WAAWI;AAAA,IACrD;AAEA,UAAM,QAAQ,KAAK,OAAO,EAAE;AAC5B,WAAO,UAAU,KAAK;AAAA,EACxB;AAAA,EAEA,oBAAoB;AAClB,UAAM,WAAW,KAAK;AACtB,UAAM,SAAS,WAAWD;AAC1B,QAAI,SAAS,KAAK,OAAO,QAAQ;AAI/B,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAEA,SAAK,eAAe;AACpB,SAAK,OAAO,IAAI,KAAK,OAAO,SAAS,KAAK,kBAAkB,KAAK,mBAAmBA,qBAAoB,GAAG,QAAQ;AAEnH,WAAO;AAAA,EACT;AAAA,EAEA,gBAAgB,GAAG,SAAS;AAC1B,QAAK,KAAK,SAAY,IAAI,SAAW,SAAS;AAC5C,aAAOM;AAAA,IACT;AAEA,UAAM,KAAK,KAAKV;AAChB,QAAI,KAAK,KAAK,OAAO,EAAE;AACvB,QAAI,OAAO,KAAK,kBAAkB;AAChC,WAAK,KAAK,kBAAkB;AAC5B,WAAK,OAAO,EAAE,IAAI;AAAA,IACpB;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,iBAAiB,OAAO;AACtB,WAAQ,UAAU,KAAK,kBAAoB,KAAK,IAAI,SAASC,QAAO,MAAM;AAAA,EAC5E;AAAA,EAEA,gBAAgB,WAAW;AACzB,QAAI;AACJ,QAAI,KAAK,mBAAmB,GAAG;AAE7B,iBAAW,KAAK;AAChB,WAAK,iBAAiB,CAAC,KAAK,IAAI,YAAYA,QAAO;AAAA,IACrD,OAAO;AAEL,iBAAW,KAAK;AAChB,YAAM,SAAS,WAAWK;AAC1B,UAAI,SAAS,KAAK,cAAc;AAE9B,YAAI;AACJ,YAAI,KAAK,eAAe,oBAAoB;AAC1C,qBAAW;AAAA,QACb,WAAW,KAAK,eAAe,2BAA2B;AACxD,qBAAW;AAAA,QACb,OAAO;AAIL,gBAAM,IAAI,MAAM,mCAAmC;AAAA,QACrD;AAEA,cAAM,UAAU,IAAI,YAAY,QAAQ;AACxC,gBAAQ,IAAI,KAAK,KAAK,SAAS,GAAG,KAAK,UAAU,CAAC;AAClD,aAAK,OAAO;AACZ,aAAK,eAAe;AAAA,MACtB;AAEA,WAAK,aAAa;AAAA,IACpB;AAEA,SAAK,KAAK,IAAI,KAAK,KAAK,SAAS,WAAW,YAAYA,kBAAiB,GAAG,QAAQ;AACpF,SAAK,IAAI,YAAYL,QAAO,IAAI;AAChC,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkB,OAAO;AAEvB,SAAK,IAAI,SAASA,QAAO,IAAI,CAAC,KAAK;AACnC,SAAK,iBAAiB;AAAA,EACxB;AAAA,EAEA,gBAAgB,IAAI,OAAO;AACzB,MAAE,KAAK,IAAI,SAASA,QAAO;AAC3B,UAAM,WAAW,KAAK,OAAO,EAAE;AAC/B,QAAI,EAAE,KAAK,IAAI,YAAYA,QAAO,MAAM,GAAG;AACzC,WAAK,kBAAkB,QAAQ;AAAA,IACjC;AAEA,SAAK,OAAO,EAAE,IAAI;AAAA,EACpB;AAAA,EAEA,cAAc,GAAG,SAAS;AACxB,QAAI,KAAK,KAAK,gBAAgB,GAAG,OAAO;AACxC,UAAO,KAAKA,WAAWI;AAEvB,UAAM,WAAW,KAAK,OAAO,EAAE;AAC/B,QAAI,KAAK,iBAAiB,QAAQ,GAAG;AACnC,aAAO;AAAA,IACT;AAGA,UAAM,WAAW,KAAK,gBAAgB,QAAQ;AAC9C,SAAK,gBAAgB,IAAI,QAAQ;AACjC,WAAO;AAAA,EACT;AAAA,EAEA,WAAW,OAAO,OAAO,OAAO,OAAO,cAAc,WAAW;AAC9D,QAAI;AACJ,QAAI,WAAW;AACb,WAAK,IAAI,QAAQ,OAAO,IAAI,QAAQ,OAAO,KAAK;AAC9C,aAAK,KAAK,CAAC,IAAI;AAAA,MACjB;AAAA,IACF,OAAO;AACL,WAAK,IAAI,QAAQ,OAAO,IAAI,QAAQ,OAAO,KAAK;AAC9C,YAAI,KAAK,KAAK,CAAC,MAAM,cAAc;AACjC,eAAK,KAAK,CAAC,IAAI;AAAA,QACjB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,YAAY,OAAO,OAAO;AACxB,UAAM,QAAQ,QAAQC;AACtB,WAAO,QAAQ,OAAO;AACpB,WAAK,KAAK,OAAO,IAAI;AAAA,IACvB;AAAA,EACF;AAAA,EAEA,eAAe,WAAW;AACxB,QAAI,WAAW;AACf,UAAM,SAAS,KAAK;AACpB,UAAM,EAAE,aAAa,IAAI;AACzB,UAAM,EAAE,iBAAiB,IAAI;AAC7B,UAAM,YAAY,KAAK;AAGvB,QAAI,cAAc,cAAc;AAC9B,oBAAc;AACd,kBAAY;AAAA,IACd,OAAO;AACL,oBAAc;AACd,kBAAY;AAAA,IACd;AAEA,UAAM,OAAO;AAGb,QAAI,KAAK;AACT,QAAI,IAAI;AACR,WAAO,IAAI,GAAG;AACZ,YAAM,UAAU,KAAK,OAAO,EAAE,EAAE;AAChC,UAAI,YAAY,aAAa;AAE3B,aAAK;AACL;AAAA,MACF;AAEA,oBAAc;AACd,UAAI,YAAY,kBAAkB;AAEhC,YAAI,cAAc,cAAc;AAC9B,iBAAO;AAAA,QACT;AACA,aAAK;AAAA,MACP,OAAO;AAEL,YAAI,KAAKF;AACT,eAAO,KAAK,GAAG;AACb,gBAAM,QAAQ,KAAK,OAAO,UAAU,EAAE,EAAE;AACxC,cAAI,UAAU,WAAW;AAEvB,iBAAKE;AACL;AAAA,UACF;AAEA,sBAAY;AACZ,cAAI,UAAU,WAAW;AAEvB,gBAAI,cAAc,cAAc;AAC9B,qBAAO;AAAA,YACT;AACA,iBAAKA;AAAA,UACP,OAAO;AACL,gBAAI,IAAIA;AACR,mBAAO,IAAI,GAAG;AACZ,oBAAM,QAAQ,OAAO,QAAQ,EAAE,CAAC;AAChC,kBAAI,UAAU,WAAW;AACvB,uBAAO;AAAA,cACT;AACA,gBAAE;AAAA,YACJ;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,WAAO;AAAA,EACT;AAAA,EAEA,mBAAmB,YAAY,YAAY,aAAa;AAEtD,kBAAc;AACd,QAAI,QAAQ;AACZ,WAAO,SAAS,YAAY;AAC1B,UAAI,UAAU,KAAK,MAAM,OAAO,YAAY,WAAW,GAAG;AACxD,eAAO;AAAA,MACT;AACA,eAASG;AAAA,IACX;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,qBAAqB,cAAc,YAAY;AAE7C,oBAAgBL;AAChB,aAAS,QAAQ,GAAG,SAAS,cAAc,SAAS;AAClD,UAAI,UAAU,KAAK,QAAQ,OAAO,YAAYA,qBAAoB,GAAG;AACnE,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,eAAe;AAEb,QAAI,WAAW;AACf,QAAI,QAAQ;AACZ,QAAI,IAAI;AAER,WAAO,QAAQ,UAAU;AACvB,WAAK,IAAI,GAAG,IAAI;AAChB,eAASE;AAAA,IACX;AAIA,QAAI,cAAc;AAClB,QAAI,aAAa,eAAeL;AAChC,YAAQ;AACR,WAAO,QAAQ,KAAK,YAAY;AAI9B,UAAI,UAAU;AACd,UAAI,UAAU,kBAAkB;AAC9B,sBAAcK;AACd,qBAAa;AAAA,MACf;AAGA,UAAI,KAAK,IAAI,SAASL,QAAO,KAAK,GAAG;AAEnC,iBAAS;AAGT;AAAA,MACF;AAGA,WAAK,aAAa,KAAK,mBAAmB,UAAU,OAAO,WAAW,MAAM,GAAG;AAE7E,mBAAW,SAASA;AACpB,aAAK,IAAI,YAAY,IAAI,GAAG,KAAK;AAC/B,eAAK,IAAI,UAAU,IAAI;AACvB,wBAAcK;AAAA,QAChB;AAGA,iBAAS;AAGT;AAAA,MACF;AAIA,UAAI,UAAU,cAAcG;AAC5B,aAAQ,UAAU,KAAM,CAAC,UAAU,KAAK,MAAO,WAAW,SAAU,OAAO,OAAO,GAAG;AACnF,mBAAWA;AAAA,MACb;AAEA,UAAK,UAAU,KAAO,WAAW,OAAQ;AAEvC,qBAAa,WAAW;AACxB,mBAAW,SAASR;AAEpB,aAAK,IAAI,YAAY,IAAI,GAAG,KAAK;AAC/B,eAAK,IAAI,UAAU,IAAI;AACvB,wBAAcK;AAAA,QAChB;AAGA,iBAAS;AACT,aAAK,IAAI,cAAc,SAAS,IAAI,GAAG,KAAK;AAC1C,eAAK,KAAK,UAAU,IAAI,KAAK,KAAK,OAAO;AAAA,QAC3C;AAAA,MAEF,OAAO;AACL,mBAAW,SAASL;AACpB,aAAK,IAAI,YAAY,IAAI,GAAG,KAAK;AAC/B,eAAK,IAAI,UAAU,IAAI;AACvB,mBAASK;AAAA,QACX;AAEA,mBAAW;AAAA,MACb;AAAA,IACF;AAGA,QAAI;AACJ,WAAO,IAAI,KAAK,cAAc;AAE5B,UAAI,MAAM,kBAAkB;AAC1B,aAAK;AAAA,MACP;AACA,WAAK,OAAO,CAAC,IAAI,KAAK,IAAI,KAAK,OAAO,CAAC,KAAKL,QAAO;AACnD,QAAE;AAAA,IACJ;AAEA,SAAK,iBAAiB,KAAK,IAAI,KAAK,kBAAkBA,QAAO;AAG7D,YAAQ,WAAYQ,oBAAmB,OAAQ,GAAG;AAChD,WAAK,KAAK,UAAU,IAAI,KAAK;AAAA,IAC/B;AACA,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,iBAAiB;AAEf,QAAI,WAAWG;AACf,QAAI,QAAQ;AACZ,QAAI,IAAI;AAER,WAAO,QAAQ,UAAU;AACvB,WAAK,IAAI,GAAG,IAAI;AAChB,eAASR;AAAA,IACX;AAGA,gBAAYU,2BAA2B,KAAK,YAAY,SAAYd;AACpE,YAAQ;AACR,WAAO,QAAQ,KAAK,cAAc;AAMhC,UAAI;AACJ,WAAK,aAAa,KAAK,qBAAqB,UAAU,KAAK,MAAM,GAAG;AAElE,aAAK,IAAI,SAASE,UAAS,IAAI;AAG/B,iBAASE;AAGT;AAAA,MACF;AAIA,UAAI,UAAUA,wBAAuB;AACrC,aAAQ,UAAU,KAAM,CAAC,UAAU,KAAK,QAAS,WAAW,SAAU,OAAO,OAAO,GAAG;AACrF,UAAE;AAAA,MACJ;AAEA,UAAK,UAAU,KAAO,WAAW,OAAQ;AAEvC,aAAK,IAAI,SAASF,UAAS,IAAI,WAAW;AAG1C,iBAAS;AACT,aAAK,IAAIE,wBAAuB,SAAS,IAAI,GAAG,KAAK;AACnD,eAAK,OAAO,UAAU,IAAI,KAAK,OAAO,OAAO;AAAA,QAC/C;AAAA,MAEF,OAAO;AACL,aAAK,IAAI,SAASF,UAAS,IAAI;AAC/B,iBAASE;AACT,mBAAW;AAAA,MACb;AAAA,IACF;AAGA,SAAK,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACnC,WAAK,OAAO,CAAC,IAAI,KAAK,IAAI,KAAK,OAAO,CAAC,KAAKF,UAAS;AAAA,IACvD;AAEA,SAAK,mBAAmB,KAAK,IAAI,KAAK,oBAAoBA,UAAS;AAQnE,YAAQ,YAAaO,oBAAmB,IAAK,QAAQ,GAAG;AACtD,WAAK,OAAO,UAAU,IAAI,SAAcD;AAAA,IAC1C;AAEA,SAAK,eAAe;AAAA,EACtB;AAAA,EAEA,WAAW;AAET,QAAI,YAAY,KAAK,IAAI,OAAQ;AACjC,QAAI,YAAY,KAAK,eAAe,SAAS;AAC7C,gBAAa,aAAa,uBAAuB,KAAM,EAAE,uBAAuB;AAChF,QAAI,cAAc,SAAU;AAC1B,kBAAY,KAAK;AAAA,IACnB;AAIA,SAAK,YAAY;AACjB,QAAI,KAAK,YAAY,SAAU;AAE7B,YAAM,gBAAgB,KAAK,aAAa,QAAU,QAAU,KAAK;AACjE,WAAK,SAAS,eAAe,SAAU,KAAK,cAAc,IAAI;AAAA,IAChE;AAEA,SAAK,aAAa;AAClB,QAAI,KAAK,YAAY,OAAS;AAC5B,WAAK,eAAe;AAAA,IACtB;AAKA,SAAK,KAAK,KAAK,YAAY,IAAI;AAC/B,YAAQ,KAAK,aAAcC,oBAAmB,OAAQ,GAAG;AACvD,WAAK,KAAK,KAAK,YAAY,IAAI,KAAK;AAAA,IACtC;AAEA,SAAK,cAAc;AAAA,EACrB;AAAA,EAEA,SAAS;AACP,QAAI,kBAAkB;AACtB,QAAI,CAAC,KAAK,aAAa;AACrB,WAAK,SAAS;AAAA,IAChB;AAEA,QAAI,KAAK,aAAa,OAAS;AAC7B,yBAAmBM;AAAA,IACrB,OAAO;AACL,yBAAmB,KAAK;AAAA,IAC1B;AAEA,UAAM,WAAW;AAGjB,QAAK,mBAAmB;AAAA,IACpB,WAAW,KAAK,iBAAkB;AAAA,IAClC,WAAW,mBAAoB;AAAA,IAC/B,WAAW,KAAK,aAAc,yBAA0B;AAC1D,YAAM,IAAI,MAAM,yBAAyB;AAAA,IAC3C;AAGA,UAAM,cAAc,mBAAmB,KAAK;AAC5C,UAAM,OAAO,IAAI,WAAW,WAAW;AAGvC,QAAI,UAAU;AACd,SAAK,IAAI,GAAG,IAAIH,qBAAoB,KAAK;AACvC,WAAK,SAAS,IAAM,KAAK,OAAO,CAAC,IAAI,YAAaJ;AAAA,IACpD;AAGA,SAAK,IAAI,GAAG,IAAI,MAAO,KAAM,KAAK;AAChC,WAAK,SAAS,IAAK,WAAW;AAAA,IAChC;AAEA,SAAK,IAAI,GAAG,IAAI,MAAO,KAAM,KAAK;AAChC,WAAK,SAAS,IAAK,WAAW,KAAK,OAAO,KAAM,IAAIP,QAAQ;AAAA,IAC9D;AAEA,QAAI,KAAK,YAAY,OAAS;AAC5B,YAAM,eAAgB,KAAK,YAAY,SAAYD;AACnD,YAAM,eAAeY,sBAAqBE,0BAAyB;AAGnE,WAAK,IAAI,GAAG,IAAI,cAAc,KAAK;AACjC,aAAK,SAAS,IAAK,iBAAiB,KAAK,OAAO,IAAIX,2BAA0B;AAAA,MAChF;AAIA,WAAK,IAAI,GAAG,IAAI,KAAK,eAAe,cAAc,KAAK;AACrD,aAAK,SAAS,IAAM,WAAW,KAAK,OAAO,eAAe,CAAC,KAAMK;AAAA,MACnE;AAAA,IACF;AAGA,SAAK,IAAI,GAAG,IAAI,KAAK,YAAY,KAAK;AACpC,WAAK,SAAS,IAAI,KAAK,KAAK,CAAC;AAAA,IAC/B;AAEA,UAAM,OAAO,IAAI,cAAY;AAAA,MAC3B;AAAA,MACA,WAAW,KAAK;AAAA,MAChB,YAAY,KAAK;AAAA,IACnB,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,WAAW;AACT,UAAM,OAAO,KAAK,OAAO;AAEzB,UAAM,OAAO,IAAI,WAAW,KAAK,KAAK,MAAM;AAG5C,aAAS,IAAI;AAEb,UAAM,iBAAa,4BAAY,IAAI;AAEnC,UAAM,MAAM,OAAO,MAAM,WAAW,SAAS,EAAE;AAC/C,QAAI,cAAc,KAAK,WAAW,CAAC;AACnC,QAAI,cAAc,KAAK,YAAY,CAAC;AACpC,QAAI,cAAc,KAAK,QAAQ,CAAC;AAChC,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,YAAM,IAAI,WAAW,CAAC;AACtB,UAAI,IAAI,EAAE,IAAI;AAAA,IAChB;AAEA,WAAO;AAAA,EACT;AACF;AAEA,IAAO,kBAAQ;",
+  "sourcesContent": ["import { deflateSync } from 'fflate';\nimport UnicodeTrie from './index.js';\nimport { swap32LE } from './swap.js';\n\n// Shift size for getting the index-1 table offset.\nconst SHIFT_1 = 6 + 5;\n\n// Shift size for getting the index-2 table offset.\nconst SHIFT_2 = 5;\n\n// Difference between the two shift sizes,\n// for getting an index-1 offset from an index-2 offset. 6=11-5\nconst SHIFT_1_2 = SHIFT_1 - SHIFT_2;\n\n// Number of index-1 entries for the BMP. 32=0x20\n// This part of the index-1 table is omitted from the serialized form.\nconst OMITTED_BMP_INDEX_1_LENGTH = 0x10000 >> SHIFT_1;\n\n// Number of code points per index-1 table entry. 2048=0x800\nconst CP_PER_INDEX_1_ENTRY = 1 << SHIFT_1;\n\n// Number of entries in an index-2 block. 64=0x40\nconst INDEX_2_BLOCK_LENGTH = 1 << SHIFT_1_2;\n\n// Mask for getting the lower bits for the in-index-2-block offset. */\nconst INDEX_2_MASK = INDEX_2_BLOCK_LENGTH - 1;\n\n// Number of entries in a data block. 32=0x20\nconst DATA_BLOCK_LENGTH = 1 << SHIFT_2;\n\n// Mask for getting the lower bits for the in-data-block offset.\nconst DATA_MASK = DATA_BLOCK_LENGTH - 1;\n\n// Shift size for shifting left the index array values.\n// Increases possible data size with 16-bit index values at the cost\n// of compactability.\n// This requires data blocks to be aligned by DATA_GRANULARITY.\nconst INDEX_SHIFT = 2;\n\n// The alignment size of a data block. Also the granularity for compaction.\nconst DATA_GRANULARITY = 1 << INDEX_SHIFT;\n\n// The BMP part of the index-2 table is fixed and linear and starts at offset 0.\n// Length=2048=0x800=0x10000>>SHIFT_2.\nconst INDEX_2_OFFSET = 0;\n\n// The part of the index-2 table for U+D800..U+DBFF stores values for\n// lead surrogate code _units_ not code _points_.\n// Values for lead surrogate code _points_ are indexed with this portion of the table.\n// Length=32=0x20=0x400>>SHIFT_2. (There are 1024=0x400 lead surrogates.)\nconst LSCP_INDEX_2_OFFSET = 0x10000 >> SHIFT_2;\nconst LSCP_INDEX_2_LENGTH = 0x400 >> SHIFT_2;\n\n// Count the lengths of both BMP pieces. 2080=0x820\nconst INDEX_2_BMP_LENGTH = LSCP_INDEX_2_OFFSET + LSCP_INDEX_2_LENGTH;\n\n// The 2-byte UTF-8 version of the index-2 table follows at offset 2080=0x820.\n// Length 32=0x20 for lead bytes C0..DF, regardless of SHIFT_2.\nconst UTF8_2B_INDEX_2_OFFSET = INDEX_2_BMP_LENGTH;\nconst UTF8_2B_INDEX_2_LENGTH = 0x800 >> 6; // U+0800 is the first code point after 2-byte UTF-8\n\n// The index-1 table, only used for supplementary code points, at offset 2112=0x840.\n// Variable length, for code points up to highStart, where the last single-value range starts.\n// Maximum length 512=0x200=0x100000>>SHIFT_1.\n// (For 0x100000 supplementary code points U+10000..U+10ffff.)\n//\n// The part of the index-2 table for supplementary code points starts\n// after this index-1 table.\n//\n// Both the index-1 table and the following part of the index-2 table\n// are omitted completely if there is only BMP data.\nconst INDEX_1_OFFSET = UTF8_2B_INDEX_2_OFFSET + UTF8_2B_INDEX_2_LENGTH;\nconst MAX_INDEX_1_LENGTH = 0x100000 >> SHIFT_1;\n\n// The illegal-UTF-8 data block follows the ASCII block, at offset 128=0x80.\n// Used with linear access for single bytes 0..0xbf for simple error handling.\n// Length 64=0x40, not DATA_BLOCK_LENGTH.\nconst BAD_UTF8_DATA_OFFSET = 0x80;\n\n// The start of non-linear-ASCII data blocks, at offset 192=0xc0.\n// !!!!\nconst DATA_START_OFFSET = 0xc0;\n\n// The null data block.\n// Length 64=0x40 even if DATA_BLOCK_LENGTH is smaller,\n// to work with 6-bit trail bytes from 2-byte UTF-8.\nconst DATA_NULL_OFFSET = DATA_START_OFFSET;\n\n// The start of allocated data blocks.\nconst NEW_DATA_START_OFFSET = DATA_NULL_OFFSET + 0x40;\n\n// The start of data blocks for U+0800 and above.\n// Below, compaction uses a block length of 64 for 2-byte UTF-8.\n// From here on, compaction uses DATA_BLOCK_LENGTH.\n// Data values for 0x780 code points beyond ASCII.\nconst DATA_0800_OFFSET = NEW_DATA_START_OFFSET + 0x780;\n\n// Start with allocation of 16k data entries. */\nconst INITIAL_DATA_LENGTH = 1 << 14;\n\n// Grow about 8x each time.\nconst MEDIUM_DATA_LENGTH = 1 << 17;\n\n// Maximum length of the runtime data array.\n// Limited by 16-bit index values that are left-shifted by INDEX_SHIFT,\n// and by uint16_t UTrie2Header.shiftedDataLength.\nconst MAX_DATA_LENGTH_RUNTIME = 0xffff << INDEX_SHIFT;\n\nconst INDEX_1_LENGTH = 0x110000 >> SHIFT_1;\n\n// Maximum length of the build-time data array.\n// One entry per 0x110000 code points, plus the illegal-UTF-8 block and the null block,\n// plus values for the 0x400 surrogate code units.\nconst MAX_DATA_LENGTH_BUILDTIME = 0x110000 + 0x40 + 0x40 + 0x400;\n\n// At build time, leave a gap in the index-2 table,\n// at least as long as the maximum lengths of the 2-byte UTF-8 index-2 table\n// and the supplementary index-1 table.\n// Round up to INDEX_2_BLOCK_LENGTH for proper compacting.\nconst INDEX_GAP_OFFSET = INDEX_2_BMP_LENGTH;\nconst INDEX_GAP_LENGTH = ((UTF8_2B_INDEX_2_LENGTH + MAX_INDEX_1_LENGTH) + INDEX_2_MASK) & ~INDEX_2_MASK;\n\n// Maximum length of the build-time index-2 array.\n// Maximum number of Unicode code points (0x110000) shifted right by SHIFT_2,\n// plus the part of the index-2 table for lead surrogate code points,\n// plus the build-time index gap,\n// plus the null index-2 block.)\nconst MAX_INDEX_2_LENGTH = (0x110000 >> SHIFT_2) + LSCP_INDEX_2_LENGTH + INDEX_GAP_LENGTH + INDEX_2_BLOCK_LENGTH;\n\n// The null index-2 block, following the gap in the index-2 table.\nconst INDEX_2_NULL_OFFSET = INDEX_GAP_OFFSET + INDEX_GAP_LENGTH;\n\n// The start of allocated index-2 blocks.\nconst INDEX_2_START_OFFSET = INDEX_2_NULL_OFFSET + INDEX_2_BLOCK_LENGTH;\n\n// Maximum length of the runtime index array.\n// Limited by its own 16-bit index values, and by uint16_t UTrie2Header.indexLength.\n// (The actual maximum length is lower,\n// (0x110000>>SHIFT_2)+UTF8_2B_INDEX_2_LENGTH+MAX_INDEX_1_LENGTH.)\nconst MAX_INDEX_LENGTH = 0xffff;\n\nconst equal_int = (a, s, t, length) => {\n  for (let i = 0; i < length; i++) {\n    if (a[s + i] !== a[t + i]) {\n      return false;\n    }\n  }\n\n  return true;\n};\n\nclass UnicodeTrieBuilder {\n  constructor(initialValue, errorValue) {\n    let i, j;\n    if (initialValue == null) {\n      initialValue = 0;\n    }\n    this.initialValue = initialValue;\n    if (errorValue == null) {\n      errorValue = 0;\n    }\n    this.errorValue = errorValue;\n    this.index1 = new Int32Array(INDEX_1_LENGTH);\n    this.index2 = new Int32Array(MAX_INDEX_2_LENGTH);\n    this.highStart = 0x110000;\n\n    this.data = new Uint32Array(INITIAL_DATA_LENGTH);\n    this.dataCapacity = INITIAL_DATA_LENGTH;\n\n    this.firstFreeBlock = 0;\n    this.isCompacted = false;\n\n    // Multi-purpose per-data-block table.\n    //\n    // Before compacting:\n    //\n    // Per-data-block reference counters/free-block list.\n    //  0: unused\n    // >0: reference counter (number of index-2 entries pointing here)\n    // <0: next free data block in free-block list\n    //\n    // While compacting:\n    //\n    // Map of adjusted indexes, used in compactData() and compactIndex2().\n    // Maps from original indexes to new ones.\n    this.map = new Int32Array(MAX_DATA_LENGTH_BUILDTIME >> SHIFT_2);\n\n    for (i = 0; i < 0x80; i++) {\n      this.data[i] = this.initialValue;\n    }\n\n    for (; i < 0xc0; i++) {\n      this.data[i] = this.errorValue;\n    }\n\n    for (i = DATA_NULL_OFFSET; i < NEW_DATA_START_OFFSET; i++) {\n      this.data[i] = this.initialValue;\n    }\n\n    this.dataNullOffset = DATA_NULL_OFFSET;\n    this.dataLength = NEW_DATA_START_OFFSET;\n\n    // set the index-2 indexes for the 2=0x80>>SHIFT_2 ASCII data blocks\n    i = 0;\n    for (j = 0; j < 0x80; j += DATA_BLOCK_LENGTH) {\n      this.index2[i] = j;\n      this.map[i++] = 1;\n    }\n\n    // reference counts for the bad-UTF-8-data block\n    for (; j < 0xc0; j += DATA_BLOCK_LENGTH) {\n      this.map[i++] = 0;\n    }\n\n    // Reference counts for the null data block: all blocks except for the ASCII blocks.\n    // Plus 1 so that we don't drop this block during compaction.\n    // Plus as many as needed for lead surrogate code points.\n    // i==newTrie->dataNullOffset\n    this.map[i++] = ((0x110000 >> SHIFT_2) - (0x80 >> SHIFT_2)) + 1 + LSCP_INDEX_2_LENGTH;\n    j += DATA_BLOCK_LENGTH;\n    for (; j < NEW_DATA_START_OFFSET; j += DATA_BLOCK_LENGTH) {\n      this.map[i++] = 0;\n    }\n\n    // set the remaining indexes in the BMP index-2 block\n    // to the null data block\n    for (i = 0x80 >> SHIFT_2; i < INDEX_2_BMP_LENGTH; i++) {\n      this.index2[i] = DATA_NULL_OFFSET;\n    }\n\n    // Fill the index gap with impossible values so that compaction\n    // does not overlap other index-2 blocks with the gap.\n    for (i = 0; i < INDEX_GAP_LENGTH; i++) {\n      this.index2[INDEX_GAP_OFFSET + i] = -1;\n    }\n\n    // set the indexes in the null index-2 block\n    for (i = 0; i < INDEX_2_BLOCK_LENGTH; i++) {\n      this.index2[INDEX_2_NULL_OFFSET + i] = DATA_NULL_OFFSET;\n    }\n\n    this.index2NullOffset = INDEX_2_NULL_OFFSET;\n    this.index2Length = INDEX_2_START_OFFSET;\n\n    // set the index-1 indexes for the linear index-2 block\n    j = 0;\n    for (i = 0; i < OMITTED_BMP_INDEX_1_LENGTH; i++) {\n      this.index1[i] = j;\n      j += INDEX_2_BLOCK_LENGTH;\n    }\n\n    // set the remaining index-1 indexes to the null index-2 block\n    for (; i < INDEX_1_LENGTH; i++) {\n      this.index1[i] = INDEX_2_NULL_OFFSET;\n    }\n\n    // Preallocate and reset data for U+0080..U+07ff,\n    // for 2-byte UTF-8 which will be compacted in 64-blocks\n    // even if DATA_BLOCK_LENGTH is smaller.\n    for (i = 0x80; i < 0x800; i += DATA_BLOCK_LENGTH) {\n      this.set(i, this.initialValue);\n    }\n  }\n\n  set(codePoint, value) {\n    if ((codePoint < 0) || (codePoint > 0x10ffff)) {\n      throw new Error('Invalid code point');\n    }\n\n    if (this.isCompacted) {\n      throw new Error('Already compacted');\n    }\n\n    const block = this._getDataBlock(codePoint, true);\n    this.data[block + (codePoint & DATA_MASK)] = value;\n    return this;\n  }\n\n  setRange(start, end, value, overwrite) {\n    let block, repeatBlock;\n    if (overwrite == null) {\n      overwrite = true;\n    }\n    if ((start > 0x10ffff) || (end > 0x10ffff) || (start > end)) {\n      throw new Error('Invalid code point');\n    }\n\n    if (this.isCompacted) {\n      throw new Error('Already compacted');\n    }\n\n    if (!overwrite && (value === this.initialValue)) {\n      return this; // nothing to do\n    }\n\n    let limit = end + 1;\n    if ((start & DATA_MASK) !== 0) {\n      // set partial block at [start..following block boundary\n      block = this._getDataBlock(start, true);\n\n      const nextStart = (start + DATA_BLOCK_LENGTH) & ~DATA_MASK;\n      if (nextStart <= limit) {\n        this._fillBlock(block, start & DATA_MASK, DATA_BLOCK_LENGTH, value, this.initialValue, overwrite);\n        start = nextStart;\n      } else {\n        this._fillBlock(block, start & DATA_MASK, limit & DATA_MASK, value, this.initialValue, overwrite);\n        return this;\n      }\n    }\n\n    // number of positions in the last, partial block\n    const rest = limit & DATA_MASK;\n\n    // round down limit to a block boundary\n    limit &= ~DATA_MASK;\n\n    // iterate over all-value blocks\n    if (value === this.initialValue) {\n      repeatBlock = this.dataNullOffset;\n    } else {\n      repeatBlock = -1;\n    }\n\n    while (start < limit) {\n      let setRepeatBlock = false;\n\n      if ((value === this.initialValue) && this._isInNullBlock(start, true)) {\n        start += DATA_BLOCK_LENGTH; // nothing to do\n        continue;\n      }\n\n      // get index value\n      let i2 = this._getIndex2Block(start, true);\n      i2 += (start >> SHIFT_2) & INDEX_2_MASK;\n\n      block = this.index2[i2];\n      if (this._isWritableBlock(block)) {\n        // already allocated\n        if (overwrite && (block >= DATA_0800_OFFSET)) {\n          // We overwrite all values, and it's not a\n          // protected (ASCII-linear or 2-byte UTF-8) block:\n          // replace with the repeatBlock.\n          setRepeatBlock = true;\n        } else {\n          // protected block: just write the values into this block\n          this._fillBlock(block, 0, DATA_BLOCK_LENGTH, value, this.initialValue, overwrite);\n        }\n      } else if ((this.data[block] !== value) && (overwrite || (block === this.dataNullOffset))) {\n        // Set the repeatBlock instead of the null block or previous repeat block:\n        //\n        // If !isWritableBlock() then all entries in the block have the same value\n        // because it's the null block or a range block (the repeatBlock from a previous\n        // call to utrie2_setRange32()).\n        // No other blocks are used multiple times before compacting.\n        //\n        // The null block is the only non-writable block with the initialValue because\n        // of the repeatBlock initialization above. (If value==initialValue, then\n        // the repeatBlock will be the null data block.)\n        //\n        // We set our repeatBlock if the desired value differs from the block's value,\n        // and if we overwrite any data or if the data is all initial values\n        // (which is the same as the block being the null block, see above).\n        setRepeatBlock = true;\n      }\n\n      if (setRepeatBlock) {\n        if (repeatBlock >= 0) {\n          this._setIndex2Entry(i2, repeatBlock);\n        } else {\n          // create and set and fill the repeatBlock\n          repeatBlock = this._getDataBlock(start, true);\n          this._writeBlock(repeatBlock, value);\n        }\n      }\n\n      start += DATA_BLOCK_LENGTH;\n    }\n\n    if (rest > 0) {\n      // set partial block at [last block boundary..limit\n      block = this._getDataBlock(start, true);\n      this._fillBlock(block, 0, rest, value, this.initialValue, overwrite);\n    }\n\n    return this;\n  }\n\n  get(c, fromLSCP) {\n    let i2;\n    if (fromLSCP == null) {\n      fromLSCP = true;\n    }\n    if ((c < 0) || (c > 0x10ffff)) {\n      return this.errorValue;\n    }\n\n    if ((c >= this.highStart) && (!((c >= 0xd800) && (c < 0xdc00)) || fromLSCP)) {\n      return this.data[this.dataLength - DATA_GRANULARITY];\n    }\n\n    if (((c >= 0xd800) && (c < 0xdc00)) && fromLSCP) {\n      i2 = (LSCP_INDEX_2_OFFSET - (0xd800 >> SHIFT_2)) + (c >> SHIFT_2);\n    } else {\n      i2 = this.index1[c >> SHIFT_1] + ((c >> SHIFT_2) & INDEX_2_MASK);\n    }\n\n    const block = this.index2[i2];\n    return this.data[block + (c & DATA_MASK)];\n  }\n\n  _isInNullBlock(c, forLSCP) {\n    let i2;\n    if (((c & 0xfffffc00) === 0xd800) && forLSCP) {\n      i2 = (LSCP_INDEX_2_OFFSET - (0xd800 >> SHIFT_2)) + (c >> SHIFT_2);\n    } else {\n      i2 = this.index1[c >> SHIFT_1] + ((c >> SHIFT_2) & INDEX_2_MASK);\n    }\n\n    const block = this.index2[i2];\n    return block === this.dataNullOffset;\n  }\n\n  _allocIndex2Block() {\n    const newBlock = this.index2Length;\n    const newTop = newBlock + INDEX_2_BLOCK_LENGTH;\n    if (newTop > this.index2.length) {\n      // Should never occur.\n      // Either MAX_BUILD_TIME_INDEX_LENGTH is incorrect,\n      // or the code writes more values than should be possible.\n      throw new Error('Internal error in Trie2 creation.');\n    }\n\n    this.index2Length = newTop;\n    this.index2.set(this.index2.subarray(this.index2NullOffset, this.index2NullOffset + INDEX_2_BLOCK_LENGTH), newBlock);\n\n    return newBlock;\n  }\n\n  _getIndex2Block(c, forLSCP) {\n    if ((c >= 0xd800) && (c < 0xdc00) && forLSCP) {\n      return LSCP_INDEX_2_OFFSET;\n    }\n\n    const i1 = c >> SHIFT_1;\n    let i2 = this.index1[i1];\n    if (i2 === this.index2NullOffset) {\n      i2 = this._allocIndex2Block();\n      this.index1[i1] = i2;\n    }\n\n    return i2;\n  }\n\n  _isWritableBlock(block) {\n    return (block !== this.dataNullOffset) && (this.map[block >> SHIFT_2] === 1);\n  }\n\n  _allocDataBlock(copyBlock) {\n    let newBlock;\n    if (this.firstFreeBlock !== 0) {\n      // get the first free block\n      newBlock = this.firstFreeBlock;\n      this.firstFreeBlock = -this.map[newBlock >> SHIFT_2];\n    } else {\n      // get a new block from the high end\n      newBlock = this.dataLength;\n      const newTop = newBlock + DATA_BLOCK_LENGTH;\n      if (newTop > this.dataCapacity) {\n        // out of memory in the data array\n        let capacity;\n        if (this.dataCapacity < MEDIUM_DATA_LENGTH) {\n          capacity = MEDIUM_DATA_LENGTH;\n        } else if (this.dataCapacity < MAX_DATA_LENGTH_BUILDTIME) {\n          capacity = MAX_DATA_LENGTH_BUILDTIME;\n        } else {\n          // Should never occur.\n          // Either MAX_DATA_LENGTH_BUILDTIME is incorrect,\n          // or the code writes more values than should be possible.\n          throw new Error('Internal error in Trie2 creation.');\n        }\n\n        const newData = new Uint32Array(capacity);\n        newData.set(this.data.subarray(0, this.dataLength));\n        this.data = newData;\n        this.dataCapacity = capacity;\n      }\n\n      this.dataLength = newTop;\n    }\n\n    this.data.set(this.data.subarray(copyBlock, copyBlock + DATA_BLOCK_LENGTH), newBlock);\n    this.map[newBlock >> SHIFT_2] = 0;\n    return newBlock;\n  }\n\n  _releaseDataBlock(block) {\n    // put this block at the front of the free-block chain\n    this.map[block >> SHIFT_2] = -this.firstFreeBlock;\n    this.firstFreeBlock = block;\n  }\n\n  _setIndex2Entry(i2, block) {\n    ++this.map[block >> SHIFT_2]; // increment first, in case block == oldBlock!\n    const oldBlock = this.index2[i2];\n    if (--this.map[oldBlock >> SHIFT_2] === 0) {\n      this._releaseDataBlock(oldBlock);\n    }\n\n    this.index2[i2] = block;\n  }\n\n  _getDataBlock(c, forLSCP) {\n    let i2 = this._getIndex2Block(c, forLSCP);\n    i2 += (c >> SHIFT_2) & INDEX_2_MASK;\n\n    const oldBlock = this.index2[i2];\n    if (this._isWritableBlock(oldBlock)) {\n      return oldBlock;\n    }\n\n    // allocate a new data block\n    const newBlock = this._allocDataBlock(oldBlock);\n    this._setIndex2Entry(i2, newBlock);\n    return newBlock;\n  }\n\n  _fillBlock(block, start, limit, value, initialValue, overwrite) {\n    let i;\n    if (overwrite) {\n      for (i = block + start; i < block + limit; i++) {\n        this.data[i] = value;\n      }\n    } else {\n      for (i = block + start; i < block + limit; i++) {\n        if (this.data[i] === initialValue) {\n          this.data[i] = value;\n        }\n      }\n    }\n  }\n\n  _writeBlock(block, value) {\n    const limit = block + DATA_BLOCK_LENGTH;\n    while (block < limit) {\n      this.data[block++] = value;\n    }\n  }\n\n  _findHighStart(highValue) {\n    let prevBlock, prevI2Block;\n    const data32 = this.data;\n    const { initialValue } = this;\n    const { index2NullOffset } = this;\n    const nullBlock = this.dataNullOffset;\n\n    // set variables for previous range\n    if (highValue === initialValue) {\n      prevI2Block = index2NullOffset;\n      prevBlock = nullBlock;\n    } else {\n      prevI2Block = -1;\n      prevBlock = -1;\n    }\n\n    const prev = 0x110000;\n\n    // enumerate index-2 blocks\n    let i1 = INDEX_1_LENGTH;\n    let c = prev;\n    while (c > 0) {\n      const i2Block = this.index1[--i1];\n      if (i2Block === prevI2Block) {\n        // the index-2 block is the same as the previous one, and filled with highValue\n        c -= CP_PER_INDEX_1_ENTRY;\n        continue;\n      }\n\n      prevI2Block = i2Block;\n      if (i2Block === index2NullOffset) {\n        // this is the null index-2 block\n        if (highValue !== initialValue) {\n          return c;\n        }\n        c -= CP_PER_INDEX_1_ENTRY;\n      } else {\n        // enumerate data blocks for one index-2 block\n        let i2 = INDEX_2_BLOCK_LENGTH;\n        while (i2 > 0) {\n          const block = this.index2[i2Block + --i2];\n          if (block === prevBlock) {\n            // the block is the same as the previous one, and filled with highValue\n            c -= DATA_BLOCK_LENGTH;\n            continue;\n          }\n\n          prevBlock = block;\n          if (block === nullBlock) {\n            // this is the null data block\n            if (highValue !== initialValue) {\n              return c;\n            }\n            c -= DATA_BLOCK_LENGTH;\n          } else {\n            let j = DATA_BLOCK_LENGTH;\n            while (j > 0) {\n              const value = data32[block + --j];\n              if (value !== highValue) {\n                return c;\n              }\n              --c;\n            }\n          }\n        }\n      }\n    }\n\n    // deliver last range\n    return 0;\n  }\n\n  _findSameDataBlock(dataLength, otherBlock, blockLength) {\n    // ensure that we do not even partially get past dataLength\n    dataLength -= blockLength;\n    let block = 0;\n    while (block <= dataLength) {\n      if (equal_int(this.data, block, otherBlock, blockLength)) {\n        return block;\n      }\n      block += DATA_GRANULARITY;\n    }\n\n    return -1;\n  }\n\n  _findSameIndex2Block(index2Length, otherBlock) {\n    // ensure that we do not even partially get past index2Length\n    index2Length -= INDEX_2_BLOCK_LENGTH;\n    for (let block = 0; block <= index2Length; block++) {\n      if (equal_int(this.index2, block, otherBlock, INDEX_2_BLOCK_LENGTH)) {\n        return block;\n      }\n    }\n\n    return -1;\n  }\n\n  _compactData() {\n    // do not compact linear-ASCII data\n    let newStart = DATA_START_OFFSET;\n    let start = 0;\n    let i = 0;\n\n    while (start < newStart) {\n      this.map[i++] = start;\n      start += DATA_BLOCK_LENGTH;\n    }\n\n    // Start with a block length of 64 for 2-byte UTF-8,\n    // then switch to DATA_BLOCK_LENGTH.\n    let blockLength = 64;\n    let blockCount = blockLength >> SHIFT_2;\n    start = newStart;\n    while (start < this.dataLength) {\n      // start: index of first entry of current block\n      // newStart: index where the current block is to be moved\n      //           (right after current end of already-compacted data)\n      var mapIndex, movedStart;\n      if (start === DATA_0800_OFFSET) {\n        blockLength = DATA_BLOCK_LENGTH;\n        blockCount = 1;\n      }\n\n      // skip blocks that are not used\n      if (this.map[start >> SHIFT_2] <= 0) {\n        // advance start to the next block\n        start += blockLength;\n\n        // leave newStart with the previous block!\n        continue;\n      }\n\n      // search for an identical block\n      if ((movedStart = this._findSameDataBlock(newStart, start, blockLength)) >= 0) {\n        // found an identical block, set the other block's index value for the current block\n        mapIndex = start >> SHIFT_2;\n        for (i = blockCount; i > 0; i--) {\n          this.map[mapIndex++] = movedStart;\n          movedStart += DATA_BLOCK_LENGTH;\n        }\n\n        // advance start to the next block\n        start += blockLength;\n\n        // leave newStart with the previous block!\n        continue;\n      }\n\n      // see if the beginning of this block can be overlapped with the end of the previous block\n      // look for maximum overlap (modulo granularity) with the previous, adjacent block\n      let overlap = blockLength - DATA_GRANULARITY;\n      while ((overlap > 0) && !equal_int(this.data, (newStart - overlap), start, overlap)) {\n        overlap -= DATA_GRANULARITY;\n      }\n\n      if ((overlap > 0) || (newStart < start)) {\n        // some overlap, or just move the whole block\n        movedStart = newStart - overlap;\n        mapIndex = start >> SHIFT_2;\n\n        for (i = blockCount; i > 0; i--) {\n          this.map[mapIndex++] = movedStart;\n          movedStart += DATA_BLOCK_LENGTH;\n        }\n\n        // move the non-overlapping indexes to their new positions\n        start += overlap;\n        for (i = blockLength - overlap; i > 0; i--) {\n          this.data[newStart++] = this.data[start++];\n        }\n      } else { // no overlap && newStart==start\n        mapIndex = start >> SHIFT_2;\n        for (i = blockCount; i > 0; i--) {\n          this.map[mapIndex++] = start;\n          start += DATA_BLOCK_LENGTH;\n        }\n\n        newStart = start;\n      }\n    }\n\n    // now adjust the index-2 table\n    i = 0;\n    while (i < this.index2Length) {\n      // Gap indexes are invalid (-1). Skip over the gap.\n      if (i === INDEX_GAP_OFFSET) {\n        i += INDEX_GAP_LENGTH;\n      }\n      this.index2[i] = this.map[this.index2[i] >> SHIFT_2];\n      ++i;\n    }\n\n    this.dataNullOffset = this.map[this.dataNullOffset >> SHIFT_2];\n\n    // ensure dataLength alignment\n    while ((newStart & (DATA_GRANULARITY - 1)) !== 0) {\n      this.data[newStart++] = this.initialValue;\n    }\n    this.dataLength = newStart;\n  }\n\n  _compactIndex2() {\n    // do not compact linear-BMP index-2 blocks\n    let newStart = INDEX_2_BMP_LENGTH;\n    let start = 0;\n    let i = 0;\n\n    while (start < newStart) {\n      this.map[i++] = start;\n      start += INDEX_2_BLOCK_LENGTH;\n    }\n\n    // Reduce the index table gap to what will be needed at runtime.\n    newStart += UTF8_2B_INDEX_2_LENGTH + ((this.highStart - 0x10000) >> SHIFT_1);\n    start = INDEX_2_NULL_OFFSET;\n    while (start < this.index2Length) {\n      // start: index of first entry of current block\n      // newStart: index where the current block is to be moved\n      //           (right after current end of already-compacted data)\n\n      // search for an identical block\n      var movedStart;\n      if ((movedStart = this._findSameIndex2Block(newStart, start)) >= 0) {\n        // found an identical block, set the other block's index value for the current block\n        this.map[start >> SHIFT_1_2] = movedStart;\n\n        // advance start to the next block\n        start += INDEX_2_BLOCK_LENGTH;\n\n        // leave newStart with the previous block!\n        continue;\n      }\n\n      // see if the beginning of this block can be overlapped with the end of the previous block\n      // look for maximum overlap with the previous, adjacent block\n      let overlap = INDEX_2_BLOCK_LENGTH - 1;\n      while ((overlap > 0) && !equal_int(this.index2, (newStart - overlap), start, overlap)) {\n        --overlap;\n      }\n\n      if ((overlap > 0) || (newStart < start)) {\n        // some overlap, or just move the whole block\n        this.map[start >> SHIFT_1_2] = newStart - overlap;\n\n        // move the non-overlapping indexes to their new positions\n        start += overlap;\n        for (i = INDEX_2_BLOCK_LENGTH - overlap; i > 0; i--) {\n          this.index2[newStart++] = this.index2[start++];\n        }\n      } else { // no overlap && newStart==start\n        this.map[start >> SHIFT_1_2] = start;\n        start += INDEX_2_BLOCK_LENGTH;\n        newStart = start;\n      }\n    }\n\n    // now adjust the index-1 table\n    for (i = 0; i < INDEX_1_LENGTH; i++) {\n      this.index1[i] = this.map[this.index1[i] >> SHIFT_1_2];\n    }\n\n    this.index2NullOffset = this.map[this.index2NullOffset >> SHIFT_1_2];\n\n    // Ensure data table alignment:\n    // Needs to be granularity-aligned for 16-bit trie\n    // (so that dataMove will be down-shiftable),\n    // and 2-aligned for uint32_t data.\n\n    // Arbitrary value: 0x3fffc not possible for real data.\n    while ((newStart & ((DATA_GRANULARITY - 1) | 1)) !== 0) {\n      this.index2[newStart++] = 0x0000ffff << INDEX_SHIFT;\n    }\n\n    this.index2Length = newStart;\n  }\n\n  _compact() {\n    // find highStart and round it up\n    let highValue = this.get(0x10ffff);\n    let highStart = this._findHighStart(highValue);\n    highStart = (highStart + (CP_PER_INDEX_1_ENTRY - 1)) & ~(CP_PER_INDEX_1_ENTRY - 1);\n    if (highStart === 0x110000) {\n      highValue = this.errorValue;\n    }\n\n    // Set trie->highStart only after utrie2_get32(trie, highStart).\n    // Otherwise utrie2_get32(trie, highStart) would try to read the highValue.\n    this.highStart = highStart;\n    if (this.highStart < 0x110000) {\n      // Blank out [highStart..10ffff] to release associated data blocks.\n      const suppHighStart = this.highStart <= 0x10000 ? 0x10000 : this.highStart;\n      this.setRange(suppHighStart, 0x10ffff, this.initialValue, true);\n    }\n\n    this._compactData();\n    if (this.highStart > 0x10000) {\n      this._compactIndex2();\n    }\n\n    // Store the highValue in the data array and round up the dataLength.\n    // Must be done after compactData() because that assumes that dataLength\n    // is a multiple of DATA_BLOCK_LENGTH.\n    this.data[this.dataLength++] = highValue;\n    while ((this.dataLength & (DATA_GRANULARITY - 1)) !== 0) {\n      this.data[this.dataLength++] = this.initialValue;\n    }\n\n    this.isCompacted = true;\n  }\n\n  freeze() {\n    let allIndexesLength, i;\n    if (!this.isCompacted) {\n      this._compact();\n    }\n\n    if (this.highStart <= 0x10000) {\n      allIndexesLength = INDEX_1_OFFSET;\n    } else {\n      allIndexesLength = this.index2Length;\n    }\n\n    const dataMove = allIndexesLength;\n\n    // are indexLength and dataLength within limits?\n    if ((allIndexesLength > MAX_INDEX_LENGTH) // for unshifted indexLength\n      || ((dataMove + this.dataNullOffset) > 0xffff) // for unshifted dataNullOffset\n      || ((dataMove + DATA_0800_OFFSET) > 0xffff) // for unshifted 2-byte UTF-8 index-2 values\n      || ((dataMove + this.dataLength) > MAX_DATA_LENGTH_RUNTIME)) { // for shiftedDataLength\n      throw new Error('Trie data is too large.');\n    }\n\n    // calculate the sizes of, and allocate, the index and data arrays\n    const indexLength = allIndexesLength + this.dataLength;\n    const data = new Int32Array(indexLength);\n\n    // write the index-2 array values shifted right by INDEX_SHIFT, after adding dataMove\n    let destIdx = 0;\n    for (i = 0; i < INDEX_2_BMP_LENGTH; i++) {\n      data[destIdx++] = ((this.index2[i] + dataMove) >> INDEX_SHIFT);\n    }\n\n    // write UTF-8 2-byte index-2 values, not right-shifted\n    for (i = 0; i < 0xc2 - 0xc0; i++) { // C0..C1\n      data[destIdx++] = (dataMove + BAD_UTF8_DATA_OFFSET);\n    }\n\n    for (; i < 0xe0 - 0xc0; i++) { // C2..DF\n      data[destIdx++] = (dataMove + this.index2[i << (6 - SHIFT_2)]);\n    }\n\n    if (this.highStart > 0x10000) {\n      const index1Length = (this.highStart - 0x10000) >> SHIFT_1;\n      const index2Offset = INDEX_2_BMP_LENGTH + UTF8_2B_INDEX_2_LENGTH + index1Length;\n\n      // write 16-bit index-1 values for supplementary code points\n      for (i = 0; i < index1Length; i++) {\n        data[destIdx++] = (INDEX_2_OFFSET + this.index1[i + OMITTED_BMP_INDEX_1_LENGTH]);\n      }\n\n      // write the index-2 array values for supplementary code points,\n      // shifted right by INDEX_SHIFT, after adding dataMove\n      for (i = 0; i < this.index2Length - index2Offset; i++) {\n        data[destIdx++] = ((dataMove + this.index2[index2Offset + i]) >> INDEX_SHIFT);\n      }\n    }\n\n    // write 16-bit data values\n    for (i = 0; i < this.dataLength; i++) {\n      data[destIdx++] = this.data[i];\n    }\n\n    const dest = new UnicodeTrie({\n      data,\n      highStart: this.highStart,\n      errorValue: this.errorValue\n    });\n\n    return dest;\n  }\n\n  // Generates a Buffer containing the serialized and compressed trie.\n  // Trie data is compressed once with raw deflate (a second pass does not help).\n  // Format:\n  //   uint32_t highStart;\n  //   uint32_t errorValue;\n  //   uint32_t uncompressedDataLength;\n  //   uint8_t trieData[dataLength];\n  toBuffer() {\n    const trie = this.freeze();\n\n    const data = new Uint8Array(trie.data.buffer);\n\n    // swap bytes to little-endian\n    swap32LE(data);\n\n    const compressed = deflateSync(data);\n\n    const buf = Buffer.alloc(compressed.length + 12);\n    buf.writeUInt32LE(trie.highStart, 0);\n    buf.writeUInt32LE(trie.errorValue, 4);\n    buf.writeUInt32LE(data.length, 8);\n    for (let i = 0; i < compressed.length; i++) {\n      const b = compressed[i];\n      buf[i + 12] = b;\n    }\n\n    return buf;\n  }\n}\n\nexport default UnicodeTrieBuilder;\n", "import { inflateSync } from 'fflate';\nimport { swap32LE } from './swap.js';\n\n// Shift size for getting the index-1 table offset.\nconst SHIFT_1 = 6 + 5;\n\n// Shift size for getting the index-2 table offset.\nconst SHIFT_2 = 5;\n\n// Difference between the two shift sizes,\n// for getting an index-1 offset from an index-2 offset. 6=11-5\nconst SHIFT_1_2 = SHIFT_1 - SHIFT_2;\n\n// Number of index-1 entries for the BMP. 32=0x20\n// This part of the index-1 table is omitted from the serialized form.\nconst OMITTED_BMP_INDEX_1_LENGTH = 0x10000 >> SHIFT_1;\n\n// Number of entries in an index-2 block. 64=0x40\nconst INDEX_2_BLOCK_LENGTH = 1 << SHIFT_1_2;\n\n// Mask for getting the lower bits for the in-index-2-block offset. */\nconst INDEX_2_MASK = INDEX_2_BLOCK_LENGTH - 1;\n\n// Shift size for shifting left the index array values.\n// Increases possible data size with 16-bit index values at the cost\n// of compactability.\n// This requires data blocks to be aligned by DATA_GRANULARITY.\nconst INDEX_SHIFT = 2;\n\n// Number of entries in a data block. 32=0x20\nconst DATA_BLOCK_LENGTH = 1 << SHIFT_2;\n\n// Mask for getting the lower bits for the in-data-block offset.\nconst DATA_MASK = DATA_BLOCK_LENGTH - 1;\n\n// The part of the index-2 table for U+D800..U+DBFF stores values for\n// lead surrogate code _units_ not code _points_.\n// Values for lead surrogate code _points_ are indexed with this portion of the table.\n// Length=32=0x20=0x400>>SHIFT_2. (There are 1024=0x400 lead surrogates.)\nconst LSCP_INDEX_2_OFFSET = 0x10000 >> SHIFT_2;\nconst LSCP_INDEX_2_LENGTH = 0x400 >> SHIFT_2;\n\n// Count the lengths of both BMP pieces. 2080=0x820\nconst INDEX_2_BMP_LENGTH = LSCP_INDEX_2_OFFSET + LSCP_INDEX_2_LENGTH;\n\n// The 2-byte UTF-8 version of the index-2 table follows at offset 2080=0x820.\n// Length 32=0x20 for lead bytes C0..DF, regardless of SHIFT_2.\nconst UTF8_2B_INDEX_2_OFFSET = INDEX_2_BMP_LENGTH;\nconst UTF8_2B_INDEX_2_LENGTH = 0x800 >> 6; // U+0800 is the first code point after 2-byte UTF-8\n\n// The index-1 table, only used for supplementary code points, at offset 2112=0x840.\n// Variable length, for code points up to highStart, where the last single-value range starts.\n// Maximum length 512=0x200=0x100000>>SHIFT_1.\n// (For 0x100000 supplementary code points U+10000..U+10ffff.)\n//\n// The part of the index-2 table for supplementary code points starts\n// after this index-1 table.\n//\n// Both the index-1 table and the following part of the index-2 table\n// are omitted completely if there is only BMP data.\nconst INDEX_1_OFFSET = UTF8_2B_INDEX_2_OFFSET + UTF8_2B_INDEX_2_LENGTH;\n\n// The alignment size of a data block. Also the granularity for compaction.\nconst DATA_GRANULARITY = 1 << INDEX_SHIFT;\n\nclass UnicodeTrie {\n  constructor(data) {\n    const isBuffer = (typeof data.readUInt32BE === 'function') && (typeof data.slice === 'function');\n\n    if (isBuffer || data instanceof Uint8Array) {\n      // read binary format\n      let uncompressedLength;\n      if (isBuffer) {\n        this.highStart = data.readUInt32LE(0);\n        this.errorValue = data.readUInt32LE(4);\n        uncompressedLength = data.readUInt32LE(8);\n        data = data.slice(12);\n      } else {\n        const view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n        this.highStart = view.getUint32(0, true);\n        this.errorValue = view.getUint32(4, true);\n        uncompressedLength = view.getUint32(8, true);\n        data = data.subarray(12);\n      }\n\n      // inflate the actual trie data (raw deflate, matching builder)\n      data = inflateSync(data, { out: new Uint8Array(uncompressedLength) });\n\n      // swap bytes from little-endian\n      swap32LE(data);\n\n      this.data = new Uint32Array(data.buffer, data.byteOffset, data.byteLength >> 2);\n    } else {\n      // pre-parsed data\n      ({ data: this.data, highStart: this.highStart, errorValue: this.errorValue } = data);\n    }\n  }\n\n  get(codePoint) {\n    let index;\n    if ((codePoint < 0) || (codePoint > 0x10ffff)) {\n      return this.errorValue;\n    }\n\n    if ((codePoint < 0xd800) || ((codePoint > 0xdbff) && (codePoint <= 0xffff))) {\n      // Ordinary BMP code point, excluding leading surrogates.\n      // BMP uses a single level lookup.  BMP index starts at offset 0 in the index.\n      // data is stored in the index array itself.\n      index = (this.data[codePoint >> SHIFT_2] << INDEX_SHIFT) + (codePoint & DATA_MASK);\n      return this.data[index];\n    }\n\n    if (codePoint <= 0xffff) {\n      // Lead Surrogate Code Point.  A Separate index section is stored for\n      // lead surrogate code units and code points.\n      //   The main index has the code unit data.\n      //   For this function, we need the code point data.\n      index = (this.data[LSCP_INDEX_2_OFFSET + ((codePoint - 0xd800) >> SHIFT_2)] << INDEX_SHIFT) + (codePoint & DATA_MASK);\n      return this.data[index];\n    }\n\n    if (codePoint < this.highStart) {\n      // Supplemental code point, use two-level lookup.\n      index = this.data[(INDEX_1_OFFSET - OMITTED_BMP_INDEX_1_LENGTH) + (codePoint >> SHIFT_1)];\n      index = this.data[index + ((codePoint >> SHIFT_2) & INDEX_2_MASK)];\n      index = (index << INDEX_SHIFT) + (codePoint & DATA_MASK);\n      return this.data[index];\n    }\n\n    return this.data[this.data.length - DATA_GRANULARITY];\n  }\n}\n\nexport default UnicodeTrie;\n", "const isBigEndian = (new Uint8Array(new Uint32Array([0x12345678]).buffer)[0] === 0x12);\n\nconst swap = (b, n, m) => {\n  let i = b[n];\n  b[n] = b[m];\n  b[m] = i;\n};\n\nconst swap32 = (array) => {\n  const len = array.length;\n  for (let i = 0; i < len; i += 4) {\n    swap(array, i, i + 3);\n    swap(array, i + 1, i + 2);\n  }\n};\n\nexport const swap32LE = (array) => {\n  if (isBigEndian) {\n    swap32(array);\n  }\n};\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAA,iBAA4B;;;ACA5B,oBAA4B;;;ACA5B,IAAM,cAAe,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AAEjF,IAAM,OAAO,CAAC,GAAG,GAAG,MAAM;AACxB,MAAI,IAAI,EAAE,CAAC;AACX,IAAE,CAAC,IAAI,EAAE,CAAC;AACV,IAAE,CAAC,IAAI;AACT;AAEA,IAAM,SAAS,CAAC,UAAU;AACxB,QAAM,MAAM,MAAM;AAClB,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,SAAK,OAAO,GAAG,IAAI,CAAC;AACpB,SAAK,OAAO,IAAI,GAAG,IAAI,CAAC;AAAA,EAC1B;AACF;AAEO,IAAM,WAAW,CAAC,UAAU;AACjC,MAAI,aAAa;AACf,WAAO,KAAK;AAAA,EACd;AACF;;;ADhBA,IAAM,UAAU,IAAI;AAGpB,IAAM,UAAU;AAIhB,IAAM,YAAY,UAAU;AAI5B,IAAM,6BAA6B,SAAW;AAG9C,IAAM,uBAAuB,KAAK;AAGlC,IAAM,eAAe,uBAAuB;AAM5C,IAAM,cAAc;AAGpB,IAAM,oBAAoB,KAAK;AAG/B,IAAM,YAAY,oBAAoB;AAMtC,IAAM,sBAAsB,SAAW;AACvC,IAAM,sBAAsB,QAAS;AAGrC,IAAM,qBAAqB,sBAAsB;AAIjD,IAAM,yBAAyB;AAC/B,IAAM,yBAAyB,QAAS;AAYxC,IAAM,iBAAiB,yBAAyB;AAGhD,IAAM,mBAAmB,KAAK;AAE9B,IAAM,cAAN,MAAkB;AAAA,EAChB,YAAY,MAAM;AAChB,UAAM,WAAY,OAAO,KAAK,iBAAiB,cAAgB,OAAO,KAAK,UAAU;AAErF,QAAI,YAAY,gBAAgB,YAAY;AAE1C,UAAI;AACJ,UAAI,UAAU;AACZ,aAAK,YAAY,KAAK,aAAa,CAAC;AACpC,aAAK,aAAa,KAAK,aAAa,CAAC;AACrC,6BAAqB,KAAK,aAAa,CAAC;AACxC,eAAO,KAAK,MAAM,EAAE;AAAA,MACtB,OAAO;AACL,cAAM,OAAO,IAAI,SAAS,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AACvE,aAAK,YAAY,KAAK,UAAU,GAAG,IAAI;AACvC,aAAK,aAAa,KAAK,UAAU,GAAG,IAAI;AACxC,6BAAqB,KAAK,UAAU,GAAG,IAAI;AAC3C,eAAO,KAAK,SAAS,EAAE;AAAA,MACzB;AAGA,iBAAO,2BAAY,MAAM,EAAE,KAAK,IAAI,WAAW,kBAAkB,EAAE,CAAC;AAGpE,eAAS,IAAI;AAEb,WAAK,OAAO,IAAI,YAAY,KAAK,QAAQ,KAAK,YAAY,KAAK,cAAc,CAAC;AAAA,IAChF,OAAO;AAEL,OAAC,EAAE,MAAM,KAAK,MAAM,WAAW,KAAK,WAAW,YAAY,KAAK,WAAW,IAAI;AAAA,IACjF;AAAA,EACF;AAAA,EAEA,IAAI,WAAW;AACb,QAAI;AACJ,QAAK,YAAY,KAAO,YAAY,SAAW;AAC7C,aAAO,KAAK;AAAA,IACd;AAEA,QAAK,YAAY,SAAa,YAAY,SAAY,aAAa,OAAU;AAI3E,eAAS,KAAK,KAAK,aAAa,OAAO,KAAK,gBAAgB,YAAY;AACxE,aAAO,KAAK,KAAK,KAAK;AAAA,IACxB;AAEA,QAAI,aAAa,OAAQ;AAKvB,eAAS,KAAK,KAAK,uBAAwB,YAAY,SAAW,QAAQ,KAAK,gBAAgB,YAAY;AAC3G,aAAO,KAAK,KAAK,KAAK;AAAA,IACxB;AAEA,QAAI,YAAY,KAAK,WAAW;AAE9B,cAAQ,KAAK,KAAM,iBAAiB,8BAA+B,aAAa,QAAQ;AACxF,cAAQ,KAAK,KAAK,SAAU,aAAa,UAAW,aAAa;AACjE,eAAS,SAAS,gBAAgB,YAAY;AAC9C,aAAO,KAAK,KAAK,KAAK;AAAA,IACxB;AAEA,WAAO,KAAK,KAAK,KAAK,KAAK,SAAS,gBAAgB;AAAA,EACtD;AACF;AAEA,IAAO,gBAAQ;;;ADhIf,IAAMC,WAAU,IAAI;AAGpB,IAAMC,WAAU;AAIhB,IAAMC,aAAYF,WAAUC;AAI5B,IAAME,8BAA6B,SAAWH;AAG9C,IAAM,uBAAuB,KAAKA;AAGlC,IAAMI,wBAAuB,KAAKF;AAGlC,IAAMG,gBAAeD,wBAAuB;AAG5C,IAAME,qBAAoB,KAAKL;AAG/B,IAAMM,aAAYD,qBAAoB;AAMtC,IAAME,eAAc;AAGpB,IAAMC,oBAAmB,KAAKD;AAI9B,IAAM,iBAAiB;AAMvB,IAAME,uBAAsB,SAAWT;AACvC,IAAMU,uBAAsB,QAASV;AAGrC,IAAMW,sBAAqBF,uBAAsBC;AAIjD,IAAME,0BAAyBD;AAC/B,IAAME,0BAAyB,QAAS;AAYxC,IAAMC,kBAAiBF,0BAAyBC;AAChD,IAAM,qBAAqB,WAAYd;AAKvC,IAAM,uBAAuB;AAI7B,IAAM,oBAAoB;AAK1B,IAAM,mBAAmB;AAGzB,IAAM,wBAAwB,mBAAmB;AAMjD,IAAM,mBAAmB,wBAAwB;AAGjD,IAAM,sBAAsB,KAAK;AAGjC,IAAM,qBAAqB,KAAK;AAKhC,IAAM,0BAA0B,SAAUQ;AAE1C,IAAM,iBAAiB,WAAYR;AAKnC,IAAM,4BAA4B,UAAW,KAAO,KAAO;AAM3D,IAAM,mBAAmBY;AACzB,IAAM,mBAAqBE,0BAAyB,qBAAsBT,gBAAgB,CAACA;AAO3F,IAAM,sBAAsB,WAAYJ,YAAWU,uBAAsB,mBAAmBP;AAG5F,IAAM,sBAAsB,mBAAmB;AAG/C,IAAM,uBAAuB,sBAAsBA;AAMnD,IAAM,mBAAmB;AAEzB,IAAM,YAAY,CAAC,GAAG,GAAG,GAAG,WAAW;AACrC,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG;AACzB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEA,IAAM,qBAAN,MAAyB;AAAA,EACvB,YAAY,cAAc,YAAY;AACpC,QAAI,GAAG;AACP,QAAI,gBAAgB,MAAM;AACxB,qBAAe;AAAA,IACjB;AACA,SAAK,eAAe;AACpB,QAAI,cAAc,MAAM;AACtB,mBAAa;AAAA,IACf;AACA,SAAK,aAAa;AAClB,SAAK,SAAS,IAAI,WAAW,cAAc;AAC3C,SAAK,SAAS,IAAI,WAAW,kBAAkB;AAC/C,SAAK,YAAY;AAEjB,SAAK,OAAO,IAAI,YAAY,mBAAmB;AAC/C,SAAK,eAAe;AAEpB,SAAK,iBAAiB;AACtB,SAAK,cAAc;AAenB,SAAK,MAAM,IAAI,WAAW,6BAA6BH,QAAO;AAE9D,SAAK,IAAI,GAAG,IAAI,KAAM,KAAK;AACzB,WAAK,KAAK,CAAC,IAAI,KAAK;AAAA,IACtB;AAEA,WAAO,IAAI,KAAM,KAAK;AACpB,WAAK,KAAK,CAAC,IAAI,KAAK;AAAA,IACtB;AAEA,SAAK,IAAI,kBAAkB,IAAI,uBAAuB,KAAK;AACzD,WAAK,KAAK,CAAC,IAAI,KAAK;AAAA,IACtB;AAEA,SAAK,iBAAiB;AACtB,SAAK,aAAa;AAGlB,QAAI;AACJ,SAAK,IAAI,GAAG,IAAI,KAAM,KAAKK,oBAAmB;AAC5C,WAAK,OAAO,CAAC,IAAI;AACjB,WAAK,IAAI,GAAG,IAAI;AAAA,IAClB;AAGA,WAAO,IAAI,KAAM,KAAKA,oBAAmB;AACvC,WAAK,IAAI,GAAG,IAAI;AAAA,IAClB;AAMA,SAAK,IAAI,GAAG,KAAM,WAAYL,aAAY,OAAQA,YAAY,IAAIU;AAClE,SAAKL;AACL,WAAO,IAAI,uBAAuB,KAAKA,oBAAmB;AACxD,WAAK,IAAI,GAAG,IAAI;AAAA,IAClB;AAIA,SAAK,IAAI,OAAQL,UAAS,IAAIW,qBAAoB,KAAK;AACrD,WAAK,OAAO,CAAC,IAAI;AAAA,IACnB;AAIA,SAAK,IAAI,GAAG,IAAI,kBAAkB,KAAK;AACrC,WAAK,OAAO,mBAAmB,CAAC,IAAI;AAAA,IACtC;AAGA,SAAK,IAAI,GAAG,IAAIR,uBAAsB,KAAK;AACzC,WAAK,OAAO,sBAAsB,CAAC,IAAI;AAAA,IACzC;AAEA,SAAK,mBAAmB;AACxB,SAAK,eAAe;AAGpB,QAAI;AACJ,SAAK,IAAI,GAAG,IAAID,6BAA4B,KAAK;AAC/C,WAAK,OAAO,CAAC,IAAI;AACjB,WAAKC;AAAA,IACP;AAGA,WAAO,IAAI,gBAAgB,KAAK;AAC9B,WAAK,OAAO,CAAC,IAAI;AAAA,IACnB;AAKA,SAAK,IAAI,KAAM,IAAI,MAAO,KAAKE,oBAAmB;AAChD,WAAK,IAAI,GAAG,KAAK,YAAY;AAAA,IAC/B;AAAA,EACF;AAAA,EAEA,IAAI,WAAW,OAAO;AACpB,QAAK,YAAY,KAAO,YAAY,SAAW;AAC7C,YAAM,IAAI,MAAM,oBAAoB;AAAA,IACtC;AAEA,QAAI,KAAK,aAAa;AACpB,YAAM,IAAI,MAAM,mBAAmB;AAAA,IACrC;AAEA,UAAM,QAAQ,KAAK,cAAc,WAAW,IAAI;AAChD,SAAK,KAAK,SAAS,YAAYC,WAAU,IAAI;AAC7C,WAAO;AAAA,EACT;AAAA,EAEA,SAAS,OAAO,KAAK,OAAO,WAAW;AACrC,QAAI,OAAO;AACX,QAAI,aAAa,MAAM;AACrB,kBAAY;AAAA,IACd;AACA,QAAK,QAAQ,WAAc,MAAM,WAAc,QAAQ,KAAM;AAC3D,YAAM,IAAI,MAAM,oBAAoB;AAAA,IACtC;AAEA,QAAI,KAAK,aAAa;AACpB,YAAM,IAAI,MAAM,mBAAmB;AAAA,IACrC;AAEA,QAAI,CAAC,aAAc,UAAU,KAAK,cAAe;AAC/C,aAAO;AAAA,IACT;AAEA,QAAI,QAAQ,MAAM;AAClB,SAAK,QAAQA,gBAAe,GAAG;AAE7B,cAAQ,KAAK,cAAc,OAAO,IAAI;AAEtC,YAAM,YAAa,QAAQD,qBAAqB,CAACC;AACjD,UAAI,aAAa,OAAO;AACtB,aAAK,WAAW,OAAO,QAAQA,YAAWD,oBAAmB,OAAO,KAAK,cAAc,SAAS;AAChG,gBAAQ;AAAA,MACV,OAAO;AACL,aAAK,WAAW,OAAO,QAAQC,YAAW,QAAQA,YAAW,OAAO,KAAK,cAAc,SAAS;AAChG,eAAO;AAAA,MACT;AAAA,IACF;AAGA,UAAM,OAAO,QAAQA;AAGrB,aAAS,CAACA;AAGV,QAAI,UAAU,KAAK,cAAc;AAC/B,oBAAc,KAAK;AAAA,IACrB,OAAO;AACL,oBAAc;AAAA,IAChB;AAEA,WAAO,QAAQ,OAAO;AACpB,UAAI,iBAAiB;AAErB,UAAK,UAAU,KAAK,gBAAiB,KAAK,eAAe,OAAO,IAAI,GAAG;AACrE,iBAASD;AACT;AAAA,MACF;AAGA,UAAI,KAAK,KAAK,gBAAgB,OAAO,IAAI;AACzC,YAAO,SAASL,WAAWI;AAE3B,cAAQ,KAAK,OAAO,EAAE;AACtB,UAAI,KAAK,iBAAiB,KAAK,GAAG;AAEhC,YAAI,aAAc,SAAS,kBAAmB;AAI5C,2BAAiB;AAAA,QACnB,OAAO;AAEL,eAAK,WAAW,OAAO,GAAGC,oBAAmB,OAAO,KAAK,cAAc,SAAS;AAAA,QAClF;AAAA,MACF,WAAY,KAAK,KAAK,KAAK,MAAM,UAAW,aAAc,UAAU,KAAK,iBAAkB;AAezF,yBAAiB;AAAA,MACnB;AAEA,UAAI,gBAAgB;AAClB,YAAI,eAAe,GAAG;AACpB,eAAK,gBAAgB,IAAI,WAAW;AAAA,QACtC,OAAO;AAEL,wBAAc,KAAK,cAAc,OAAO,IAAI;AAC5C,eAAK,YAAY,aAAa,KAAK;AAAA,QACrC;AAAA,MACF;AAEA,eAASA;AAAA,IACX;AAEA,QAAI,OAAO,GAAG;AAEZ,cAAQ,KAAK,cAAc,OAAO,IAAI;AACtC,WAAK,WAAW,OAAO,GAAG,MAAM,OAAO,KAAK,cAAc,SAAS;AAAA,IACrE;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,GAAG,UAAU;AACf,QAAI;AACJ,QAAI,YAAY,MAAM;AACpB,iBAAW;AAAA,IACb;AACA,QAAK,IAAI,KAAO,IAAI,SAAW;AAC7B,aAAO,KAAK;AAAA,IACd;AAEA,QAAK,KAAK,KAAK,cAAe,EAAG,KAAK,SAAY,IAAI,UAAY,WAAW;AAC3E,aAAO,KAAK,KAAK,KAAK,aAAaG,iBAAgB;AAAA,IACrD;AAEA,QAAM,KAAK,SAAY,IAAI,SAAY,UAAU;AAC/C,WAAMC,wBAAuB,SAAUT,aAAa,KAAKA;AAAA,IAC3D,OAAO;AACL,WAAK,KAAK,OAAO,KAAKD,QAAO,KAAM,KAAKC,WAAWI;AAAA,IACrD;AAEA,UAAM,QAAQ,KAAK,OAAO,EAAE;AAC5B,WAAO,KAAK,KAAK,SAAS,IAAIE,WAAU;AAAA,EAC1C;AAAA,EAEA,eAAe,GAAG,SAAS;AACzB,QAAI;AACJ,SAAM,IAAI,gBAAgB,SAAW,SAAS;AAC5C,WAAMG,wBAAuB,SAAUT,aAAa,KAAKA;AAAA,IAC3D,OAAO;AACL,WAAK,KAAK,OAAO,KAAKD,QAAO,KAAM,KAAKC,WAAWI;AAAA,IACrD;AAEA,UAAM,QAAQ,KAAK,OAAO,EAAE;AAC5B,WAAO,UAAU,KAAK;AAAA,EACxB;AAAA,EAEA,oBAAoB;AAClB,UAAM,WAAW,KAAK;AACtB,UAAM,SAAS,WAAWD;AAC1B,QAAI,SAAS,KAAK,OAAO,QAAQ;AAI/B,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAEA,SAAK,eAAe;AACpB,SAAK,OAAO,IAAI,KAAK,OAAO,SAAS,KAAK,kBAAkB,KAAK,mBAAmBA,qBAAoB,GAAG,QAAQ;AAEnH,WAAO;AAAA,EACT;AAAA,EAEA,gBAAgB,GAAG,SAAS;AAC1B,QAAK,KAAK,SAAY,IAAI,SAAW,SAAS;AAC5C,aAAOM;AAAA,IACT;AAEA,UAAM,KAAK,KAAKV;AAChB,QAAI,KAAK,KAAK,OAAO,EAAE;AACvB,QAAI,OAAO,KAAK,kBAAkB;AAChC,WAAK,KAAK,kBAAkB;AAC5B,WAAK,OAAO,EAAE,IAAI;AAAA,IACpB;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,iBAAiB,OAAO;AACtB,WAAQ,UAAU,KAAK,kBAAoB,KAAK,IAAI,SAASC,QAAO,MAAM;AAAA,EAC5E;AAAA,EAEA,gBAAgB,WAAW;AACzB,QAAI;AACJ,QAAI,KAAK,mBAAmB,GAAG;AAE7B,iBAAW,KAAK;AAChB,WAAK,iBAAiB,CAAC,KAAK,IAAI,YAAYA,QAAO;AAAA,IACrD,OAAO;AAEL,iBAAW,KAAK;AAChB,YAAM,SAAS,WAAWK;AAC1B,UAAI,SAAS,KAAK,cAAc;AAE9B,YAAI;AACJ,YAAI,KAAK,eAAe,oBAAoB;AAC1C,qBAAW;AAAA,QACb,WAAW,KAAK,eAAe,2BAA2B;AACxD,qBAAW;AAAA,QACb,OAAO;AAIL,gBAAM,IAAI,MAAM,mCAAmC;AAAA,QACrD;AAEA,cAAM,UAAU,IAAI,YAAY,QAAQ;AACxC,gBAAQ,IAAI,KAAK,KAAK,SAAS,GAAG,KAAK,UAAU,CAAC;AAClD,aAAK,OAAO;AACZ,aAAK,eAAe;AAAA,MACtB;AAEA,WAAK,aAAa;AAAA,IACpB;AAEA,SAAK,KAAK,IAAI,KAAK,KAAK,SAAS,WAAW,YAAYA,kBAAiB,GAAG,QAAQ;AACpF,SAAK,IAAI,YAAYL,QAAO,IAAI;AAChC,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkB,OAAO;AAEvB,SAAK,IAAI,SAASA,QAAO,IAAI,CAAC,KAAK;AACnC,SAAK,iBAAiB;AAAA,EACxB;AAAA,EAEA,gBAAgB,IAAI,OAAO;AACzB,MAAE,KAAK,IAAI,SAASA,QAAO;AAC3B,UAAM,WAAW,KAAK,OAAO,EAAE;AAC/B,QAAI,EAAE,KAAK,IAAI,YAAYA,QAAO,MAAM,GAAG;AACzC,WAAK,kBAAkB,QAAQ;AAAA,IACjC;AAEA,SAAK,OAAO,EAAE,IAAI;AAAA,EACpB;AAAA,EAEA,cAAc,GAAG,SAAS;AACxB,QAAI,KAAK,KAAK,gBAAgB,GAAG,OAAO;AACxC,UAAO,KAAKA,WAAWI;AAEvB,UAAM,WAAW,KAAK,OAAO,EAAE;AAC/B,QAAI,KAAK,iBAAiB,QAAQ,GAAG;AACnC,aAAO;AAAA,IACT;AAGA,UAAM,WAAW,KAAK,gBAAgB,QAAQ;AAC9C,SAAK,gBAAgB,IAAI,QAAQ;AACjC,WAAO;AAAA,EACT;AAAA,EAEA,WAAW,OAAO,OAAO,OAAO,OAAO,cAAc,WAAW;AAC9D,QAAI;AACJ,QAAI,WAAW;AACb,WAAK,IAAI,QAAQ,OAAO,IAAI,QAAQ,OAAO,KAAK;AAC9C,aAAK,KAAK,CAAC,IAAI;AAAA,MACjB;AAAA,IACF,OAAO;AACL,WAAK,IAAI,QAAQ,OAAO,IAAI,QAAQ,OAAO,KAAK;AAC9C,YAAI,KAAK,KAAK,CAAC,MAAM,cAAc;AACjC,eAAK,KAAK,CAAC,IAAI;AAAA,QACjB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,YAAY,OAAO,OAAO;AACxB,UAAM,QAAQ,QAAQC;AACtB,WAAO,QAAQ,OAAO;AACpB,WAAK,KAAK,OAAO,IAAI;AAAA,IACvB;AAAA,EACF;AAAA,EAEA,eAAe,WAAW;AACxB,QAAI,WAAW;AACf,UAAM,SAAS,KAAK;AACpB,UAAM,EAAE,aAAa,IAAI;AACzB,UAAM,EAAE,iBAAiB,IAAI;AAC7B,UAAM,YAAY,KAAK;AAGvB,QAAI,cAAc,cAAc;AAC9B,oBAAc;AACd,kBAAY;AAAA,IACd,OAAO;AACL,oBAAc;AACd,kBAAY;AAAA,IACd;AAEA,UAAM,OAAO;AAGb,QAAI,KAAK;AACT,QAAI,IAAI;AACR,WAAO,IAAI,GAAG;AACZ,YAAM,UAAU,KAAK,OAAO,EAAE,EAAE;AAChC,UAAI,YAAY,aAAa;AAE3B,aAAK;AACL;AAAA,MACF;AAEA,oBAAc;AACd,UAAI,YAAY,kBAAkB;AAEhC,YAAI,cAAc,cAAc;AAC9B,iBAAO;AAAA,QACT;AACA,aAAK;AAAA,MACP,OAAO;AAEL,YAAI,KAAKF;AACT,eAAO,KAAK,GAAG;AACb,gBAAM,QAAQ,KAAK,OAAO,UAAU,EAAE,EAAE;AACxC,cAAI,UAAU,WAAW;AAEvB,iBAAKE;AACL;AAAA,UACF;AAEA,sBAAY;AACZ,cAAI,UAAU,WAAW;AAEvB,gBAAI,cAAc,cAAc;AAC9B,qBAAO;AAAA,YACT;AACA,iBAAKA;AAAA,UACP,OAAO;AACL,gBAAI,IAAIA;AACR,mBAAO,IAAI,GAAG;AACZ,oBAAM,QAAQ,OAAO,QAAQ,EAAE,CAAC;AAChC,kBAAI,UAAU,WAAW;AACvB,uBAAO;AAAA,cACT;AACA,gBAAE;AAAA,YACJ;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,WAAO;AAAA,EACT;AAAA,EAEA,mBAAmB,YAAY,YAAY,aAAa;AAEtD,kBAAc;AACd,QAAI,QAAQ;AACZ,WAAO,SAAS,YAAY;AAC1B,UAAI,UAAU,KAAK,MAAM,OAAO,YAAY,WAAW,GAAG;AACxD,eAAO;AAAA,MACT;AACA,eAASG;AAAA,IACX;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,qBAAqB,cAAc,YAAY;AAE7C,oBAAgBL;AAChB,aAAS,QAAQ,GAAG,SAAS,cAAc,SAAS;AAClD,UAAI,UAAU,KAAK,QAAQ,OAAO,YAAYA,qBAAoB,GAAG;AACnE,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,eAAe;AAEb,QAAI,WAAW;AACf,QAAI,QAAQ;AACZ,QAAI,IAAI;AAER,WAAO,QAAQ,UAAU;AACvB,WAAK,IAAI,GAAG,IAAI;AAChB,eAASE;AAAA,IACX;AAIA,QAAI,cAAc;AAClB,QAAI,aAAa,eAAeL;AAChC,YAAQ;AACR,WAAO,QAAQ,KAAK,YAAY;AAI9B,UAAI,UAAU;AACd,UAAI,UAAU,kBAAkB;AAC9B,sBAAcK;AACd,qBAAa;AAAA,MACf;AAGA,UAAI,KAAK,IAAI,SAASL,QAAO,KAAK,GAAG;AAEnC,iBAAS;AAGT;AAAA,MACF;AAGA,WAAK,aAAa,KAAK,mBAAmB,UAAU,OAAO,WAAW,MAAM,GAAG;AAE7E,mBAAW,SAASA;AACpB,aAAK,IAAI,YAAY,IAAI,GAAG,KAAK;AAC/B,eAAK,IAAI,UAAU,IAAI;AACvB,wBAAcK;AAAA,QAChB;AAGA,iBAAS;AAGT;AAAA,MACF;AAIA,UAAI,UAAU,cAAcG;AAC5B,aAAQ,UAAU,KAAM,CAAC,UAAU,KAAK,MAAO,WAAW,SAAU,OAAO,OAAO,GAAG;AACnF,mBAAWA;AAAA,MACb;AAEA,UAAK,UAAU,KAAO,WAAW,OAAQ;AAEvC,qBAAa,WAAW;AACxB,mBAAW,SAASR;AAEpB,aAAK,IAAI,YAAY,IAAI,GAAG,KAAK;AAC/B,eAAK,IAAI,UAAU,IAAI;AACvB,wBAAcK;AAAA,QAChB;AAGA,iBAAS;AACT,aAAK,IAAI,cAAc,SAAS,IAAI,GAAG,KAAK;AAC1C,eAAK,KAAK,UAAU,IAAI,KAAK,KAAK,OAAO;AAAA,QAC3C;AAAA,MACF,OAAO;AACL,mBAAW,SAASL;AACpB,aAAK,IAAI,YAAY,IAAI,GAAG,KAAK;AAC/B,eAAK,IAAI,UAAU,IAAI;AACvB,mBAASK;AAAA,QACX;AAEA,mBAAW;AAAA,MACb;AAAA,IACF;AAGA,QAAI;AACJ,WAAO,IAAI,KAAK,cAAc;AAE5B,UAAI,MAAM,kBAAkB;AAC1B,aAAK;AAAA,MACP;AACA,WAAK,OAAO,CAAC,IAAI,KAAK,IAAI,KAAK,OAAO,CAAC,KAAKL,QAAO;AACnD,QAAE;AAAA,IACJ;AAEA,SAAK,iBAAiB,KAAK,IAAI,KAAK,kBAAkBA,QAAO;AAG7D,YAAQ,WAAYQ,oBAAmB,OAAQ,GAAG;AAChD,WAAK,KAAK,UAAU,IAAI,KAAK;AAAA,IAC/B;AACA,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,iBAAiB;AAEf,QAAI,WAAWG;AACf,QAAI,QAAQ;AACZ,QAAI,IAAI;AAER,WAAO,QAAQ,UAAU;AACvB,WAAK,IAAI,GAAG,IAAI;AAChB,eAASR;AAAA,IACX;AAGA,gBAAYU,2BAA2B,KAAK,YAAY,SAAYd;AACpE,YAAQ;AACR,WAAO,QAAQ,KAAK,cAAc;AAMhC,UAAI;AACJ,WAAK,aAAa,KAAK,qBAAqB,UAAU,KAAK,MAAM,GAAG;AAElE,aAAK,IAAI,SAASE,UAAS,IAAI;AAG/B,iBAASE;AAGT;AAAA,MACF;AAIA,UAAI,UAAUA,wBAAuB;AACrC,aAAQ,UAAU,KAAM,CAAC,UAAU,KAAK,QAAS,WAAW,SAAU,OAAO,OAAO,GAAG;AACrF,UAAE;AAAA,MACJ;AAEA,UAAK,UAAU,KAAO,WAAW,OAAQ;AAEvC,aAAK,IAAI,SAASF,UAAS,IAAI,WAAW;AAG1C,iBAAS;AACT,aAAK,IAAIE,wBAAuB,SAAS,IAAI,GAAG,KAAK;AACnD,eAAK,OAAO,UAAU,IAAI,KAAK,OAAO,OAAO;AAAA,QAC/C;AAAA,MACF,OAAO;AACL,aAAK,IAAI,SAASF,UAAS,IAAI;AAC/B,iBAASE;AACT,mBAAW;AAAA,MACb;AAAA,IACF;AAGA,SAAK,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACnC,WAAK,OAAO,CAAC,IAAI,KAAK,IAAI,KAAK,OAAO,CAAC,KAAKF,UAAS;AAAA,IACvD;AAEA,SAAK,mBAAmB,KAAK,IAAI,KAAK,oBAAoBA,UAAS;AAQnE,YAAQ,YAAaO,oBAAmB,IAAK,QAAQ,GAAG;AACtD,WAAK,OAAO,UAAU,IAAI,SAAcD;AAAA,IAC1C;AAEA,SAAK,eAAe;AAAA,EACtB;AAAA,EAEA,WAAW;AAET,QAAI,YAAY,KAAK,IAAI,OAAQ;AACjC,QAAI,YAAY,KAAK,eAAe,SAAS;AAC7C,gBAAa,aAAa,uBAAuB,KAAM,EAAE,uBAAuB;AAChF,QAAI,cAAc,SAAU;AAC1B,kBAAY,KAAK;AAAA,IACnB;AAIA,SAAK,YAAY;AACjB,QAAI,KAAK,YAAY,SAAU;AAE7B,YAAM,gBAAgB,KAAK,aAAa,QAAU,QAAU,KAAK;AACjE,WAAK,SAAS,eAAe,SAAU,KAAK,cAAc,IAAI;AAAA,IAChE;AAEA,SAAK,aAAa;AAClB,QAAI,KAAK,YAAY,OAAS;AAC5B,WAAK,eAAe;AAAA,IACtB;AAKA,SAAK,KAAK,KAAK,YAAY,IAAI;AAC/B,YAAQ,KAAK,aAAcC,oBAAmB,OAAQ,GAAG;AACvD,WAAK,KAAK,KAAK,YAAY,IAAI,KAAK;AAAA,IACtC;AAEA,SAAK,cAAc;AAAA,EACrB;AAAA,EAEA,SAAS;AACP,QAAI,kBAAkB;AACtB,QAAI,CAAC,KAAK,aAAa;AACrB,WAAK,SAAS;AAAA,IAChB;AAEA,QAAI,KAAK,aAAa,OAAS;AAC7B,yBAAmBM;AAAA,IACrB,OAAO;AACL,yBAAmB,KAAK;AAAA,IAC1B;AAEA,UAAM,WAAW;AAGjB,QAAK,mBAAmB,oBACjB,WAAW,KAAK,iBAAkB,SAClC,WAAW,mBAAoB,SAC/B,WAAW,KAAK,aAAc,yBAA0B;AAC7D,YAAM,IAAI,MAAM,yBAAyB;AAAA,IAC3C;AAGA,UAAM,cAAc,mBAAmB,KAAK;AAC5C,UAAM,OAAO,IAAI,WAAW,WAAW;AAGvC,QAAI,UAAU;AACd,SAAK,IAAI,GAAG,IAAIH,qBAAoB,KAAK;AACvC,WAAK,SAAS,IAAM,KAAK,OAAO,CAAC,IAAI,YAAaJ;AAAA,IACpD;AAGA,SAAK,IAAI,GAAG,IAAI,MAAO,KAAM,KAAK;AAChC,WAAK,SAAS,IAAK,WAAW;AAAA,IAChC;AAEA,WAAO,IAAI,MAAO,KAAM,KAAK;AAC3B,WAAK,SAAS,IAAK,WAAW,KAAK,OAAO,KAAM,IAAIP,QAAQ;AAAA,IAC9D;AAEA,QAAI,KAAK,YAAY,OAAS;AAC5B,YAAM,eAAgB,KAAK,YAAY,SAAYD;AACnD,YAAM,eAAeY,sBAAqBE,0BAAyB;AAGnE,WAAK,IAAI,GAAG,IAAI,cAAc,KAAK;AACjC,aAAK,SAAS,IAAK,iBAAiB,KAAK,OAAO,IAAIX,2BAA0B;AAAA,MAChF;AAIA,WAAK,IAAI,GAAG,IAAI,KAAK,eAAe,cAAc,KAAK;AACrD,aAAK,SAAS,IAAM,WAAW,KAAK,OAAO,eAAe,CAAC,KAAMK;AAAA,MACnE;AAAA,IACF;AAGA,SAAK,IAAI,GAAG,IAAI,KAAK,YAAY,KAAK;AACpC,WAAK,SAAS,IAAI,KAAK,KAAK,CAAC;AAAA,IAC/B;AAEA,UAAM,OAAO,IAAI,cAAY;AAAA,MAC3B;AAAA,MACA,WAAW,KAAK;AAAA,MAChB,YAAY,KAAK;AAAA,IACnB,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,WAAW;AACT,UAAM,OAAO,KAAK,OAAO;AAEzB,UAAM,OAAO,IAAI,WAAW,KAAK,KAAK,MAAM;AAG5C,aAAS,IAAI;AAEb,UAAM,iBAAa,4BAAY,IAAI;AAEnC,UAAM,MAAM,OAAO,MAAM,WAAW,SAAS,EAAE;AAC/C,QAAI,cAAc,KAAK,WAAW,CAAC;AACnC,QAAI,cAAc,KAAK,YAAY,CAAC;AACpC,QAAI,cAAc,KAAK,QAAQ,CAAC;AAChC,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,YAAM,IAAI,WAAW,CAAC;AACtB,UAAI,IAAI,EAAE,IAAI;AAAA,IAChB;AAEA,WAAO;AAAA,EACT;AACF;AAEA,IAAO,kBAAQ;",
   "names": ["import_fflate", "SHIFT_1", "SHIFT_2", "SHIFT_1_2", "OMITTED_BMP_INDEX_1_LENGTH", "INDEX_2_BLOCK_LENGTH", "INDEX_2_MASK", "DATA_BLOCK_LENGTH", "DATA_MASK", "INDEX_SHIFT", "DATA_GRANULARITY", "LSCP_INDEX_2_OFFSET", "LSCP_INDEX_2_LENGTH", "INDEX_2_BMP_LENGTH", "UTF8_2B_INDEX_2_OFFSET", "UTF8_2B_INDEX_2_LENGTH", "INDEX_1_OFFSET"]
 }

package/src/packages/unicode-trie/dist/builder.mjs

@@ -155,7 +155,7 @@ var UnicodeTrieBuilder = class {
     for (i = 0; i < 128; i++) {
       this.data[i] = this.initialValue;
     }
-    for (i = i; i < 192; i++) {
+    for (; i < 192; i++) {
       this.data[i] = this.errorValue;
     }
     for (i = DATA_NULL_OFFSET; i < NEW_DATA_START_OFFSET; i++) {
@@ -168,12 +168,12 @@ var UnicodeTrieBuilder = class {
       this.index2[i] = j;
       this.map[i++] = 1;
     }
-    for (j = j; j < 192; j += DATA_BLOCK_LENGTH2) {
+    for (; j < 192; j += DATA_BLOCK_LENGTH2) {
       this.map[i++] = 0;
     }
     this.map[i++] = (1114112 >> SHIFT_22) - (128 >> SHIFT_22) + 1 + LSCP_INDEX_2_LENGTH2;
     j += DATA_BLOCK_LENGTH2;
-    for (j = j; j < NEW_DATA_START_OFFSET; j += DATA_BLOCK_LENGTH2) {
+    for (; j < NEW_DATA_START_OFFSET; j += DATA_BLOCK_LENGTH2) {
       this.map[i++] = 0;
     }
     for (i = 128 >> SHIFT_22; i < INDEX_2_BMP_LENGTH2; i++) {
@@ -192,7 +192,7 @@ var UnicodeTrieBuilder = class {
       this.index1[i] = j;
       j += INDEX_2_BLOCK_LENGTH2;
     }
-    for (i = i; i < INDEX_1_LENGTH; i++) {
+    for (; i < INDEX_1_LENGTH; i++) {
       this.index1[i] = INDEX_2_NULL_OFFSET;
     }
     for (i = 128; i < 2048; i += DATA_BLOCK_LENGTH2) {
@@ -622,10 +622,7 @@ var UnicodeTrieBuilder = class {
       allIndexesLength = this.index2Length;
     }
     const dataMove = allIndexesLength;
-    if (allIndexesLength > MAX_INDEX_LENGTH || // for unshifted indexLength
-    dataMove + this.dataNullOffset > 65535 || // for unshifted dataNullOffset
-    dataMove + DATA_0800_OFFSET > 65535 || // for unshifted 2-byte UTF-8 index-2 values
-    dataMove + this.dataLength > MAX_DATA_LENGTH_RUNTIME) {
+    if (allIndexesLength > MAX_INDEX_LENGTH || dataMove + this.dataNullOffset > 65535 || dataMove + DATA_0800_OFFSET > 65535 || dataMove + this.dataLength > MAX_DATA_LENGTH_RUNTIME) {
       throw new Error("Trie data is too large.");
     }
     const indexLength = allIndexesLength + this.dataLength;
@@ -637,7 +634,7 @@ var UnicodeTrieBuilder = class {
     for (i = 0; i < 194 - 192; i++) {
       data[destIdx++] = dataMove + BAD_UTF8_DATA_OFFSET;
     }
-    for (i = i; i < 224 - 192; i++) {
+    for (; i < 224 - 192; i++) {
       data[destIdx++] = dataMove + this.index2[i << 6 - SHIFT_22];
     }
     if (this.highStart > 65536) {