@pdfme/pdf-lib 0.0.0

package/dist/esm/src/utils/unicode.js

@@ -0,0 +1,346 @@
+import { toHexString } from './strings';
+/**
+ * Encodes a string to UTF-8.
+ *
+ * @param input The string to be encoded.
+ * @param byteOrderMark Whether or not a byte order marker (BOM) should be added
+ *                      to the start of the encoding. (default `true`)
+ * @returns A Uint8Array containing the UTF-8 encoding of the input string.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * JavaScript strings are composed of Unicode code points. Code points are
+ * integers in the range 0 to 1,114,111 (0x10FFFF). When serializing a string,
+ * it must be encoded as a sequence of words. A word is typically 8, 16, or 32
+ * bytes in size. As such, Unicode defines three encoding forms: UTF-8, UTF-16,
+ * and UTF-32. These encoding forms are described in the Unicode standard [1].
+ * This function implements the UTF-8 encoding form.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * In UTF-8, each code point is mapped to a sequence of 1, 2, 3, or 4 bytes.
+ * Note that the logic which defines this mapping is slightly convoluted, and
+ * not as straightforward as the mapping logic for UTF-16 or UTF-32. The UTF-8
+ * mapping logic is as follows [2]:
+ *
+ * • If a code point is in the range U+0000..U+007F, then view it as a 7-bit
+ *   integer: 0bxxxxxxx. Map the code point to 1 byte with the first high order
+ *   bit set to 0:
+ *
+ *       b1=0b0xxxxxxx
+ *
+ * • If a code point is in the range U+0080..U+07FF, then view it as an 11-bit
+ *   integer: 0byyyyyxxxxxx. Map the code point to 2 bytes with the first 5 bits
+ *   of the code point stored in the first byte, and the last 6 bits stored in
+ *   the second byte:
+ *
+ *       b1=0b110yyyyy    b2=0b10xxxxxx
+ *
+ * • If a code point is in the range U+0800..U+FFFF, then view it as a 16-bit
+ *   integer, 0bzzzzyyyyyyxxxxxx. Map the code point to 3 bytes with the first
+ *   4 bits stored in the first byte, the next 6 bits stored in the second byte,
+ *   and the last 6 bits in the third byte:
+ *
+ *       b1=0b1110zzzz    b2=0b10yyyyyy    b3=0b10xxxxxx
+ *
+ * • If a code point is in the range U+10000...U+10FFFF, then view it as a
+ *   21-bit integer, 0bvvvzzzzzzyyyyyyxxxxxx. Map the code point to 4 bytes with
+ *   the first 3 bits stored in the first byte, the next 6 bits stored in the
+ *   second byte, the next 6 bits stored in the third byte, and the last 6 bits
+ *   stored in the fourth byte:
+ *
+ *       b1=0b11110xxx    b2=0b10zzzzzz    b3=0b10yyyyyy    b4=0b10xxxxxx
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * It is important to note, when iterating through the code points of a string
+ * in JavaScript, that if a character is encoded as a surrogate pair it will
+ * increase the string's length by 2 instead of 1 [4]. For example:
+ *
+ * ```
+ * > 'a'.length
+ * 1
+ * > '💩'.length
+ * 2
+ * > '語'.length
+ * 1
+ * > 'a💩語'.length
+ * 4
+ * ```
+ *
+ * The results of the above example are explained by the fact that the
+ * characters 'a' and '語' are not represented by surrogate pairs, but '💩' is.
+ *
+ * Because of this idiosyncrasy in JavaScript's string implementation and APIs,
+ * we must "jump" an extra index after encoding a character as a surrogate
+ * pair. In practice, this means we must increment the index of our for loop by
+ * 2 if we encode a surrogate pair, and 1 in all other cases.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * References:
+ *   - [1] https://www.unicode.org/versions/Unicode12.0.0/UnicodeStandard-12.0.pdf
+ *         3.9  Unicode Encoding Forms - UTF-8
+ *   - [2] http://www.herongyang.com/Unicode/UTF-8-UTF-8-Encoding.html
+ *   - [3] http://www.herongyang.com/Unicode/UTF-8-UTF-8-Encoding-Algorithm.html
+ *   - [4] https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/length#Description
+ *
+ */
+export const utf8Encode = (input, byteOrderMark = true) => {
+    const encoded = [];
+    if (byteOrderMark)
+        encoded.push(0xef, 0xbb, 0xbf);
+    for (let idx = 0, len = input.length; idx < len;) {
+        const codePoint = input.codePointAt(idx);
+        // One byte encoding
+        if (codePoint < 0x80) {
+            const byte1 = codePoint & 0x7f;
+            encoded.push(byte1);
+            idx += 1;
+        }
+        // Two byte encoding
+        else if (codePoint < 0x0800) {
+            const byte1 = ((codePoint >> 6) & 0x1f) | 0xc0;
+            const byte2 = (codePoint & 0x3f) | 0x80;
+            encoded.push(byte1, byte2);
+            idx += 1;
+        }
+        // Three byte encoding
+        else if (codePoint < 0x010000) {
+            const byte1 = ((codePoint >> 12) & 0x0f) | 0xe0;
+            const byte2 = ((codePoint >> 6) & 0x3f) | 0x80;
+            const byte3 = (codePoint & 0x3f) | 0x80;
+            encoded.push(byte1, byte2, byte3);
+            idx += 1;
+        }
+        // Four byte encoding (surrogate pair)
+        else if (codePoint < 0x110000) {
+            const byte1 = ((codePoint >> 18) & 0x07) | 0xf0;
+            const byte2 = ((codePoint >> 12) & 0x3f) | 0x80;
+            const byte3 = ((codePoint >> 6) & 0x3f) | 0x80;
+            const byte4 = ((codePoint >> 0) & 0x3f) | 0x80;
+            encoded.push(byte1, byte2, byte3, byte4);
+            idx += 2;
+        }
+        // Should never reach this case
+        else
+            throw new Error(`Invalid code point: 0x${toHexString(codePoint)}`);
+    }
+    return new Uint8Array(encoded);
+};
+/**
+ * Encodes a string to UTF-16.
+ *
+ * @param input The string to be encoded.
+ * @param byteOrderMark Whether or not a byte order marker (BOM) should be added
+ *                      to the start of the encoding. (default `true`)
+ * @returns A Uint16Array containing the UTF-16 encoding of the input string.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * JavaScript strings are composed of Unicode code points. Code points are
+ * integers in the range 0 to 1,114,111 (0x10FFFF). When serializing a string,
+ * it must be encoded as a sequence of words. A word is typically 8, 16, or 32
+ * bytes in size. As such, Unicode defines three encoding forms: UTF-8, UTF-16,
+ * and UTF-32. These encoding forms are described in the Unicode standard [1].
+ * This function implements the UTF-16 encoding form.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * In UTF-16, each code point is mapped to one or two 16-bit integers. The
+ * UTF-16 mapping logic is as follows [2]:
+ *
+ * • If a code point is in the range U+0000..U+FFFF, then map the code point to
+ *   a 16-bit integer with the most significant byte first.
+ *
+ * • If a code point is in the range U+10000..U+10000, then map the code point
+ *   to two 16-bit integers. The first integer should contain the high surrogate
+ *   and the second integer should contain the low surrogate. Both surrogates
+ *   should be written with the most significant byte first.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * It is important to note, when iterating through the code points of a string
+ * in JavaScript, that if a character is encoded as a surrogate pair it will
+ * increase the string's length by 2 instead of 1 [4]. For example:
+ *
+ * ```
+ * > 'a'.length
+ * 1
+ * > '💩'.length
+ * 2
+ * > '語'.length
+ * 1
+ * > 'a💩語'.length
+ * 4
+ * ```
+ *
+ * The results of the above example are explained by the fact that the
+ * characters 'a' and '語' are not represented by surrogate pairs, but '💩' is.
+ *
+ * Because of this idiosyncrasy in JavaScript's string implementation and APIs,
+ * we must "jump" an extra index after encoding a character as a surrogate
+ * pair. In practice, this means we must increment the index of our for loop by
+ * 2 if we encode a surrogate pair, and 1 in all other cases.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * References:
+ *   - [1] https://www.unicode.org/versions/Unicode12.0.0/UnicodeStandard-12.0.pdf
+ *         3.9  Unicode Encoding Forms - UTF-8
+ *   - [2] http://www.herongyang.com/Unicode/UTF-16-UTF-16-Encoding.html
+ *   - [3] https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/length#Description
+ *
+ */
+export const utf16Encode = (input, byteOrderMark = true) => {
+    const encoded = [];
+    if (byteOrderMark)
+        encoded.push(0xfeff);
+    for (let idx = 0, len = input.length; idx < len;) {
+        const codePoint = input.codePointAt(idx);
+        // Two byte encoding
+        if (codePoint < 0x010000) {
+            encoded.push(codePoint);
+            idx += 1;
+        }
+        // Four byte encoding (surrogate pair)
+        else if (codePoint < 0x110000) {
+            encoded.push(highSurrogate(codePoint), lowSurrogate(codePoint));
+            idx += 2;
+        }
+        // Should never reach this case
+        else
+            throw new Error(`Invalid code point: 0x${toHexString(codePoint)}`);
+    }
+    return new Uint16Array(encoded);
+};
+/**
+ * Returns `true` if the `codePoint` is within the
+ * Basic Multilingual Plane (BMP). Code points inside the BMP are not encoded
+ * with surrogate pairs.
+ * @param codePoint The code point to be evaluated.
+ *
+ * Reference: https://en.wikipedia.org/wiki/UTF-16#Description
+ */
+export const isWithinBMP = (codePoint) => codePoint >= 0 && codePoint <= 0xffff;
+/**
+ * Returns `true` if the given `codePoint` is valid and must be represented
+ * with a surrogate pair when encoded.
+ * @param codePoint The code point to be evaluated.
+ *
+ * Reference: https://en.wikipedia.org/wiki/UTF-16#Description
+ */
+export const hasSurrogates = (codePoint) => codePoint >= 0x010000 && codePoint <= 0x10ffff;
+// From Unicode 3.0 spec, section 3.7:
+//   http://unicode.org/versions/Unicode3.0.0/ch03.pdf
+export const highSurrogate = (codePoint) => Math.floor((codePoint - 0x10000) / 0x400) + 0xd800;
+// From Unicode 3.0 spec, section 3.7:
+//   http://unicode.org/versions/Unicode3.0.0/ch03.pdf
+export const lowSurrogate = (codePoint) => ((codePoint - 0x10000) % 0x400) + 0xdc00;
+var ByteOrder;
+(function (ByteOrder) {
+    ByteOrder["BigEndian"] = "BigEndian";
+    ByteOrder["LittleEndian"] = "LittleEndian";
+})(ByteOrder || (ByteOrder = {}));
+const REPLACEMENT = '�'.codePointAt(0);
+/**
+ * Decodes a Uint8Array of data to a string using UTF-16.
+ *
+ * Note that this function attempts to recover from erronous input by
+ * inserting the replacement character (�) to mark invalid code points
+ * and surrogate pairs.
+ *
+ * @param input A Uint8Array containing UTF-16 encoded data
+ * @param byteOrderMark Whether or not a byte order marker (BOM) should be read
+ *                      at the start of the encoding. (default `true`)
+ * @returns The decoded string.
+ */
+export const utf16Decode = (input, byteOrderMark = true) => {
+    // Need at least 2 bytes of data in UTF-16 encodings
+    if (input.length <= 1)
+        return String.fromCodePoint(REPLACEMENT);
+    const byteOrder = byteOrderMark ? readBOM(input) : ByteOrder.BigEndian;
+    // Skip byte order mark if needed
+    let idx = byteOrderMark ? 2 : 0;
+    const codePoints = [];
+    while (input.length - idx >= 2) {
+        const first = decodeValues(input[idx++], input[idx++], byteOrder);
+        if (isHighSurrogate(first)) {
+            if (input.length - idx < 2) {
+                // Need at least 2 bytes left for the low surrogate that is required
+                codePoints.push(REPLACEMENT);
+            }
+            else {
+                const second = decodeValues(input[idx++], input[idx++], byteOrder);
+                if (isLowSurrogate(second)) {
+                    codePoints.push(first, second);
+                }
+                else {
+                    // Low surrogates should always follow high surrogates
+                    codePoints.push(REPLACEMENT);
+                }
+            }
+        }
+        else if (isLowSurrogate(first)) {
+            // High surrogates should always come first since `decodeValues()`
+            // accounts for the byte ordering
+            idx += 2;
+            codePoints.push(REPLACEMENT);
+        }
+        else {
+            codePoints.push(first);
+        }
+    }
+    // There shouldn't be extra byte(s) left over
+    if (idx < input.length)
+        codePoints.push(REPLACEMENT);
+    return String.fromCodePoint(...codePoints);
+};
+/**
+ * Returns `true` if the given `codePoint` is a high surrogate.
+ * @param codePoint The code point to be evaluated.
+ *
+ * Reference: https://en.wikipedia.org/wiki/UTF-16#Description
+ */
+const isHighSurrogate = (codePoint) => codePoint >= 0xd800 && codePoint <= 0xdbff;
+/**
+ * Returns `true` if the given `codePoint` is a low surrogate.
+ * @param codePoint The code point to be evaluated.
+ *
+ * Reference: https://en.wikipedia.org/wiki/UTF-16#Description
+ */
+const isLowSurrogate = (codePoint) => codePoint >= 0xdc00 && codePoint <= 0xdfff;
+/**
+ * Decodes the given utf-16 values first and second using the specified
+ * byte order.
+ * @param first The first byte of the encoding.
+ * @param second The second byte of the encoding.
+ * @param byteOrder The byte order of the encoding.
+ * Reference: https://en.wikipedia.org/wiki/UTF-16#Examples
+ */
+const decodeValues = (first, second, byteOrder) => {
+    // Append the binary representation of the preceding byte by shifting the
+    // first one 8 to the left and than applying a bitwise or-operator to append
+    // the second one.
+    if (byteOrder === ByteOrder.LittleEndian)
+        return (second << 8) | first;
+    if (byteOrder === ByteOrder.BigEndian)
+        return (first << 8) | second;
+    throw new Error(`Invalid byteOrder: ${byteOrder}`);
+};
+/**
+ * Returns whether the given array contains a byte order mark for the
+ * UTF-16BE or UTF-16LE encoding. If it has neither, BigEndian is assumed.
+ *
+ * Reference: https://en.wikipedia.org/wiki/Byte_order_mark#UTF-16
+ *
+ * @param bytes The byte array to be evaluated.
+ */
+// prettier-ignore
+const readBOM = (bytes) => (hasUtf16BigEndianBOM(bytes) ? ByteOrder.BigEndian
+    : hasUtf16LittleEndianBOM(bytes) ? ByteOrder.LittleEndian
+        : ByteOrder.BigEndian);
+const hasUtf16BigEndianBOM = (bytes) => bytes[0] === 0xfe && bytes[1] === 0xff;
+const hasUtf16LittleEndianBOM = (bytes) => bytes[0] === 0xff && bytes[1] === 0xfe;
+export const hasUtf16BOM = (bytes) => hasUtf16BigEndianBOM(bytes) || hasUtf16LittleEndianBOM(bytes);
+//# sourceMappingURL=unicode.js.map

package/dist/esm/src/utils/unicode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unicode.js","sourceRoot":"","sources":["../../../../src/utils/unicode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAExC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsFG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAa,EAAE,aAAa,GAAG,IAAI,EAAc,EAAE;IAC5E,MAAM,OAAO,GAAG,EAAE,CAAC;IAEnB,IAAI,aAAa;QAAE,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAElD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAI,CAAC;QAClD,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAE,CAAC;QAE1C,oBAAoB;QACpB,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,SAAS,GAAG,IAAI,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,GAAG,IAAI,CAAC,CAAC;QACX,CAAC;QAED,oBAAoB;aACf,IAAI,SAAS,GAAG,MAAM,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YAC/C,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YACxC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3B,GAAG,IAAI,CAAC,CAAC;QACX,CAAC;QAED,sBAAsB;aACjB,IAAI,SAAS,GAAG,QAAQ,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YAChD,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YAC/C,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YACxC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YAClC,GAAG,IAAI,CAAC,CAAC;QACX,CAAC;QAED,sCAAsC;aACjC,IAAI,SAAS,GAAG,QAAQ,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YAChD,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YAChD,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YAC/C,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YAC/C,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACzC,GAAG,IAAI,CAAC,CAAC;QACX,CAAC;QAED,+BAA+B;;YAC1B,MAAM,IAAI,KAAK,CAAC,yBAAyB,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IAC1E,CAAC;IAED,OAAO,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC;AACjC,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+DG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAa,EAAE,aAAa,GAAG,IAAI,EAAe,EAAE;IAC9E,MAAM,OAAO,GAAG,EAAE,CAAC;IAEnB,IAAI,aAAa;QAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAExC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAI,CAAC;QAClD,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAE,CAAC;QAE1C,oBAAoB;QACpB,IAAI,SAAS,GAAG,QAAQ,EAAE,CAAC;YACzB,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxB,GAAG,IAAI,CAAC,CAAC;QACX,CAAC;QAED,sCAAsC;aACjC,IAAI,SAAS,GAAG,QAAQ,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC;YAChE,GAAG,IAAI,CAAC,CAAC;QACX,CAAC;QAED,+BAA+B;;YAC1B,MAAM,IAAI,KAAK,CAAC,yBAAyB,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IAC1E,CAAC;IAED,OAAO,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;AAClC,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,SAAiB,EAAE,EAAE,CAAC,SAAS,IAAI,CAAC,IAAI,SAAS,IAAI,MAAM,CAAC;AAExF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,SAAiB,EAAE,EAAE,CAAC,SAAS,IAAI,QAAQ,IAAI,SAAS,IAAI,QAAQ,CAAC;AAEnG,sCAAsC;AACtC,sDAAsD;AACtD,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,SAAiB,EAAE,EAAE,CACjD,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC;AAErD,sCAAsC;AACtC,sDAAsD;AACtD,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,SAAiB,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC;AAE5F,IAAK,SAGJ;AAHD,WAAK,SAAS;IACZ,oCAAuB,CAAA;IACvB,0CAA6B,CAAA;AAC/B,CAAC,EAHI,SAAS,KAAT,SAAS,QAGb;AAED,MAAM,WAAW,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC;AAExC;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAiB,EAAE,aAAa,GAAG,IAAI,EAAU,EAAE;IAC7E,oDAAoD;IACpD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;IAEhE,MAAM,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC;IAEvE,iCAAiC;IACjC,IAAI,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhC,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,OAAO,KAAK,CAAC,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QAElE,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC;gBAC3B,oEAAoE;gBACpE,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACN,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;gBACnE,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3B,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACjC,CAAC;qBAAM,CAAC;oBACN,sDAAsD;oBACtD,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC;YACjC,kEAAkE;YAClE,iCAAiC;YACjC,GAAG,IAAI,CAAC,CAAC;YACT,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,6CAA6C;IAC7C,IAAI,GAAG,GAAG,KAAK,CAAC,MAAM;QAAE,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAErD,OAAO,MAAM,CAAC,aAAa,CAAC,GAAG,UAAU,CAAC,CAAC;AAC7C,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,SAAiB,EAAE,EAAE,CAAC,SAAS,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM,CAAC;AAE1F;;;;;GAKG;AACH,MAAM,cAAc,GAAG,CAAC,SAAiB,EAAE,EAAE,CAAC,SAAS,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM,CAAC;AAEzF;;;;;;;GAOG;AACH,MAAM,YAAY,GAAG,CAAC,KAAa,EAAE,MAAc,EAAE,SAAoB,EAAE,EAAE;IAC3E,yEAAyE;IACzE,4EAA4E;IAC5E,kBAAkB;IAClB,IAAI,SAAS,KAAK,SAAS,CAAC,YAAY;QAAE,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;IACvE,IAAI,SAAS,KAAK,SAAS,CAAC,SAAS;QAAE,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;IACpE,MAAM,IAAI,KAAK,CAAC,sBAAsB,SAAS,EAAE,CAAC,CAAC;AACrD,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,kBAAkB;AAClB,MAAM,OAAO,GAAG,CAAC,KAAiB,EAAa,EAAE,CAAC,CAC9C,oBAAoB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS;IACnD,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY;QACzD,CAAC,CAAC,SAAS,CAAC,SAAS,CACtB,CAAC;AAEF,MAAM,oBAAoB,GAAG,CAAC,KAAiB,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;AAE3F,MAAM,uBAAuB,GAAG,CAAC,KAAiB,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;AAE9F,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAiB,EAAE,EAAE,CAC/C,oBAAoB,CAAC,KAAK,CAAC,IAAI,uBAAuB,CAAC,KAAK,CAAC,CAAC"}

package/dist/esm/src/utils/validators.js

@@ -0,0 +1,180 @@
+/* tslint:disable:ban-types */
+import { values as objectValues } from './objects';
+export const backtick = (val) => `\`${val}\``;
+export const singleQuote = (val) => `'${val}'`;
+// prettier-ignore
+const formatValue = (value) => {
+    const type = typeof value;
+    if (type === 'string')
+        return singleQuote(value);
+    else if (type === 'undefined')
+        return backtick(value);
+    else
+        return value;
+};
+export const createValueErrorMsg = (value, valueName, values) => {
+    const allowedValues = new Array(values.length);
+    for (let idx = 0, len = values.length; idx < len; idx++) {
+        const v = values[idx];
+        allowedValues[idx] = formatValue(v);
+    }
+    const joinedValues = allowedValues.join(' or ');
+    // prettier-ignore
+    return `${backtick(valueName)} must be one of ${joinedValues}, but was actually ${formatValue(value)}`;
+};
+export const assertIsOneOf = (value, valueName, allowedValues) => {
+    if (!Array.isArray(allowedValues)) {
+        allowedValues = objectValues(allowedValues);
+    }
+    for (let idx = 0, len = allowedValues.length; idx < len; idx++) {
+        if (value === allowedValues[idx])
+            return;
+    }
+    throw new TypeError(createValueErrorMsg(value, valueName, allowedValues));
+};
+export const assertIsOneOfOrUndefined = (value, valueName, allowedValues) => {
+    if (!Array.isArray(allowedValues)) {
+        allowedValues = objectValues(allowedValues);
+    }
+    assertIsOneOf(value, valueName, allowedValues.concat(undefined));
+};
+export const assertIsSubset = (values, valueName, allowedValues) => {
+    if (!Array.isArray(allowedValues)) {
+        allowedValues = objectValues(allowedValues);
+    }
+    for (let idx = 0, len = values.length; idx < len; idx++) {
+        assertIsOneOf(values[idx], valueName, allowedValues);
+    }
+};
+export const getType = (val) => {
+    if (val === null)
+        return 'null';
+    if (val === undefined)
+        return 'undefined';
+    if (typeof val === 'string')
+        return 'string';
+    if (isNaN(val))
+        return 'NaN';
+    if (typeof val === 'number')
+        return 'number';
+    if (typeof val === 'boolean')
+        return 'boolean';
+    if (typeof val === 'symbol')
+        return 'symbol';
+    if (typeof val === 'bigint')
+        return 'bigint';
+    if (val.constructor && val.constructor.name)
+        return val.constructor.name;
+    if (val.name)
+        return val.name;
+    if (val.constructor)
+        return String(val.constructor);
+    return String(val);
+};
+export const isType = (value, type) => {
+    if (type === 'null')
+        return value === null;
+    if (type === 'undefined')
+        return value === undefined;
+    if (type === 'string')
+        return typeof value === 'string';
+    if (type === 'number')
+        return typeof value === 'number' && !isNaN(value);
+    if (type === 'boolean')
+        return typeof value === 'boolean';
+    if (type === 'symbol')
+        return typeof value === 'symbol';
+    if (type === 'bigint')
+        return typeof value === 'bigint';
+    if (type === Date)
+        return value instanceof Date;
+    if (type === Array)
+        return value instanceof Array;
+    if (type === Uint8Array)
+        return value instanceof Uint8Array;
+    if (type === ArrayBuffer)
+        return value instanceof ArrayBuffer;
+    if (type === Function)
+        return value instanceof Function;
+    return value instanceof type[0];
+};
+export const createTypeErrorMsg = (value, valueName, types) => {
+    const allowedTypes = new Array(types.length);
+    for (let idx = 0, len = types.length; idx < len; idx++) {
+        const type = types[idx];
+        if (type === 'null')
+            allowedTypes[idx] = backtick('null');
+        if (type === 'undefined')
+            allowedTypes[idx] = backtick('undefined');
+        if (type === 'string')
+            allowedTypes[idx] = backtick('string');
+        else if (type === 'number')
+            allowedTypes[idx] = backtick('number');
+        else if (type === 'boolean')
+            allowedTypes[idx] = backtick('boolean');
+        else if (type === 'symbol')
+            allowedTypes[idx] = backtick('symbol');
+        else if (type === 'bigint')
+            allowedTypes[idx] = backtick('bigint');
+        else if (type === Array)
+            allowedTypes[idx] = backtick('Array');
+        else if (type === Uint8Array)
+            allowedTypes[idx] = backtick('Uint8Array');
+        else if (type === ArrayBuffer)
+            allowedTypes[idx] = backtick('ArrayBuffer');
+        else
+            allowedTypes[idx] = backtick(type[1]);
+    }
+    const joinedTypes = allowedTypes.join(' or ');
+    // prettier-ignore
+    return `${backtick(valueName)} must be of type ${joinedTypes}, but was actually of type ${backtick(getType(value))}`;
+};
+export const assertIs = (value, valueName, types) => {
+    for (let idx = 0, len = types.length; idx < len; idx++) {
+        if (isType(value, types[idx]))
+            return;
+    }
+    throw new TypeError(createTypeErrorMsg(value, valueName, types));
+};
+export const assertOrUndefined = (value, valueName, types) => {
+    assertIs(value, valueName, types.concat('undefined'));
+};
+export const assertEachIs = (values, valueName, types) => {
+    for (let idx = 0, len = values.length; idx < len; idx++) {
+        assertIs(values[idx], valueName, types);
+    }
+};
+export const assertRange = (value, valueName, min, max) => {
+    assertIs(value, valueName, ['number']);
+    assertIs(min, 'min', ['number']);
+    assertIs(max, 'max', ['number']);
+    max = Math.max(min, max);
+    if (value < min || value > max) {
+        // prettier-ignore
+        throw new Error(`${backtick(valueName)} must be at least ${min} and at most ${max}, but was actually ${value}`);
+    }
+};
+export const assertRangeOrUndefined = (value, valueName, min, max) => {
+    assertIs(value, valueName, ['number', 'undefined']);
+    if (typeof value === 'number')
+        assertRange(value, valueName, min, max);
+};
+export const assertMultiple = (value, valueName, multiplier) => {
+    assertIs(value, valueName, ['number']);
+    if (value % multiplier !== 0) {
+        // prettier-ignore
+        throw new Error(`${backtick(valueName)} must be a multiple of ${multiplier}, but was actually ${value}`);
+    }
+};
+export const assertInteger = (value, valueName) => {
+    if (!Number.isInteger(value)) {
+        throw new Error(`${backtick(valueName)} must be an integer, but was actually ${value}`);
+    }
+};
+export const assertPositive = (value, valueName) => {
+    if (![1, 0].includes(Math.sign(value))) {
+        // prettier-ignore
+        throw new Error(`${backtick(valueName)} must be a positive number or 0, but was actually ${value}`);
+    }
+};
+//# sourceMappingURL=validators.js.map

package/dist/esm/src/utils/validators.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validators.js","sourceRoot":"","sources":["../../../../src/utils/validators.ts"],"names":[],"mappings":"AAAA,8BAA8B;AAE9B,OAAO,EAAE,MAAM,IAAI,YAAY,EAAE,MAAM,WAAW,CAAC;AAEnD,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,GAAQ,EAAE,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC;AACnD,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAI,GAAG,GAAG,CAAC;AAIpD,kBAAkB;AAClB,MAAM,WAAW,GAAG,CAAC,KAAU,EAAE,EAAE;IACjC,MAAM,IAAI,GAAG,OAAO,KAAK,CAAC;IAC1B,IAAI,IAAI,KAAI,QAAQ;QAAE,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;SAC3C,IAAI,IAAI,KAAI,WAAW;QAAE,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;;QAChD,OAAO,KAAK,CAAC;AACpB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,KAAU,EAAE,SAAiB,EAAE,MAAmB,EAAE,EAAE;IACxF,MAAM,aAAa,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE/C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;QACxD,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,aAAa,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,YAAY,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEhD,kBAAkB;IAClB,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,mBAAmB,YAAY,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;AACzG,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,KAAU,EACV,SAAiB,EACjB,aAAyD,EACzD,EAAE;IACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;QAClC,aAAa,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC;IAC9C,CAAC;IACD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;QAC/D,IAAI,KAAK,KAAK,aAAa,CAAC,GAAG,CAAC;YAAE,OAAO;IAC3C,CAAC;IACD,MAAM,IAAI,SAAS,CAAC,mBAAmB,CAAC,KAAK,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC,CAAC;AAC5E,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,wBAAwB,GAAG,CACtC,KAAU,EACV,SAAiB,EACjB,aAAyD,EACzD,EAAE;IACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;QAClC,aAAa,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC;IAC9C,CAAC;IACD,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,aAAa,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;AACnE,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,cAAc,GAAG,CAC5B,MAAa,EACb,SAAiB,EACjB,aAAyD,EACzD,EAAE;IACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;QAClC,aAAa,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC;IAC9C,CAAC;IACD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;QACxD,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IACvD,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,GAAQ,EAAE,EAAE;IAClC,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAChC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,WAAW,CAAC;IAC1C,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAC7C,IAAI,KAAK,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7B,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAC7C,IAAI,OAAO,GAAG,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC/C,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAC7C,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAC7C,IAAI,GAAG,CAAC,WAAW,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI;QAAE,OAAO,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;IACzE,IAAI,GAAG,CAAC,IAAI;QAAE,OAAO,GAAG,CAAC,IAAI,CAAC;IAC9B,IAAI,GAAG,CAAC,WAAW;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACpD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;AACrB,CAAC,CAAC;AAiBF,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAU,EAAE,IAAoB,EAAE,EAAE;IACzD,IAAI,IAAI,KAAK,MAAM;QAAE,OAAO,KAAK,KAAK,IAAI,CAAC;IAC3C,IAAI,IAAI,KAAK,WAAW;QAAE,OAAO,KAAK,KAAK,SAAS,CAAC;IACrD,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC;IACxD,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzE,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,OAAO,KAAK,KAAK,SAAS,CAAC;IAC1D,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC;IACxD,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC;IACxD,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,KAAK,YAAY,IAAI,CAAC;IAChD,IAAI,IAAI,KAAK,KAAK;QAAE,OAAO,KAAK,YAAY,KAAK,CAAC;IAClD,IAAI,IAAI,KAAK,UAAU;QAAE,OAAO,KAAK,YAAY,UAAU,CAAC;IAC5D,IAAI,IAAI,KAAK,WAAW;QAAE,OAAO,KAAK,YAAY,WAAW,CAAC;IAC9D,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,KAAK,YAAY,QAAQ,CAAC;IACxD,OAAO,KAAK,YAAa,IAA2B,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,KAAU,EAAE,SAAiB,EAAE,KAAuB,EAAE,EAAE;IAC3F,MAAM,YAAY,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAE7C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;QACvD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,IAAI,KAAK,MAAM;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC1D,IAAI,IAAI,KAAK,WAAW;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC;QACpE,IAAI,IAAI,KAAK,QAAQ;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;aACzD,IAAI,IAAI,KAAK,QAAQ;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;aAC9D,IAAI,IAAI,KAAK,SAAS;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;aAChE,IAAI,IAAI,KAAK,QAAQ;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;aAC9D,IAAI,IAAI,KAAK,QAAQ;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;aAC9D,IAAI,IAAI,KAAK,KAAK;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;aAC1D,IAAI,IAAI,KAAK,UAAU;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;aACpE,IAAI,IAAI,KAAK,WAAW;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC;;YACtE,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAE,IAA2B,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IAED,MAAM,WAAW,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAE9C,kBAAkB;IAClB,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,oBAAoB,WAAW,8BAA8B,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AACvH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,KAAU,EAAE,SAAiB,EAAE,KAAuB,EAAE,EAAE;IACjF,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;QACvD,IAAI,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAAE,OAAO;IACxC,CAAC;IACD,MAAM,IAAI,SAAS,CAAC,kBAAkB,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC;AACnE,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,KAAU,EAAE,SAAiB,EAAE,KAAuB,EAAE,EAAE;IAC1F,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;AACxD,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,MAAa,EAAE,SAAiB,EAAE,KAAuB,EAAE,EAAE;IACxF,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;QACxD,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAC1C,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAU,EAAE,SAAiB,EAAE,GAAW,EAAE,GAAW,EAAE,EAAE;IACrF,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;IACvC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;IACjC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;IACjC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACzB,IAAI,KAAK,GAAG,GAAG,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;QAC/B,kBAAkB;QAClB,MAAM,IAAI,KAAK,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,qBAAqB,GAAG,gBAAgB,GAAG,sBAAsB,KAAK,EAAE,CAAC,CAAC;IAClH,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,KAAU,EAAE,SAAiB,EAAE,GAAW,EAAE,GAAW,EAAE,EAAE;IAChG,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC,CAAC;IACpD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACzE,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,KAAU,EAAE,SAAiB,EAAE,UAAkB,EAAE,EAAE;IAClF,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;IACvC,IAAI,KAAK,GAAG,UAAU,KAAK,CAAC,EAAE,CAAC;QAC7B,kBAAkB;QAClB,MAAM,IAAI,KAAK,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,0BAA0B,UAAU,sBAAsB,KAAK,EAAE,CAAC,CAAC;IAC3G,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAU,EAAE,SAAiB,EAAE,EAAE;IAC7D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,yCAAyC,KAAK,EAAE,CAAC,CAAC;IAC1F,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,KAAa,EAAE,SAAiB,EAAE,EAAE;IACjE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QACvC,kBAAkB;QAClB,MAAM,IAAI,KAAK,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,qDAAqD,KAAK,EAAE,CAAC,CAAC;IACtG,CAAC;AACH,CAAC,CAAC"}