170 lines
28 KiB
JavaScript
170 lines
28 KiB
JavaScript
"use strict";
|
|||
|
|
// NOTE: THIS FILE IS GENERATED. DO NOT EDIT.
|
||
|
|
// INSTEAD, RUN: npm run generate-char-utils
|
||
|
|
Object.defineProperty(exports, "__esModule", { value: true });
|
||
|
|
exports.isControlChar = isControlChar;
|
||
|
|
exports.isAsciiLetterChar = isAsciiLetterChar;
|
||
|
|
exports.isDigitChar = isDigitChar;
|
||
|
|
exports.isQuoteChar = isQuoteChar;
|
||
|
|
exports.isWhitespaceChar = isWhitespaceChar;
|
||
|
|
exports.isAlphaNumericOrMarkChar = isAlphaNumericOrMarkChar;
|
||
|
|
exports.isValidEmailLocalPartSpecialChar = isValidEmailLocalPartSpecialChar;
|
||
|
|
exports.isUrlSuffixAllowedSpecialChar = isUrlSuffixAllowedSpecialChar;
|
||
|
|
exports.isUrlSuffixNotAllowedAsFinalChar = isUrlSuffixNotAllowedAsFinalChar;
|
||
|
|
exports.isOpenBraceChar = isOpenBraceChar;
|
||
|
|
exports.isCloseBraceChar = isCloseBraceChar;
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /[\x00-\x1F\x7F]/
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isControlChar(c) {
|
||
|
|
return ((c >= 0 && c <= 31) || c == 127);
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /[A-Za-z]/
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isAsciiLetterChar(c) {
|
||
|
|
return ((c >= 65 && c <= 90) || (c >= 97 && c <= 122));
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /\d/
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isDigitChar(c) {
|
||
|
|
return (c >= 48 && c <= 57);
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /['"]/
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isQuoteChar(c) {
|
||
|
|
return (c == 34 || c == 39);
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /\s/
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isWhitespaceChar(c) {
|
||
|
|
return (c < 8232 ? (c < 160 ? ((c >= 9 && c <= 13) || c == 32) : (c < 5760 ? c == 160 : (c == 5760 || (c >= 8192 && c <= 8202)))) : (c < 8287 ? ((c >= 8232 && c <= 8233) || c == 8239) : (c < 12288 ? c == 8287 : (c == 12288 || c == 65279))));
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /[A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0-\u08B4\u08B6-\u08BD\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C88\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AE\uA7B0-\uA7B7\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isAlphaNumericOrMarkChar(c) {
|
||
|
|
return (c < 4800 ? (c < 2949 ? (c < 2451 ? (c < 1425 ? (c < 768 ? (c < 192 ? (c < 169 ? (c < 65 ? (c >= 48 && c <= 57) : ((c >= 65 && c <= 90) || (c >= 97 && c <= 122))) : (c < 181 ? ((c >= 169 && c <= 170) || c == 174) : (c == 181 || c == 186))) : (c < 710 ? (c < 216 ? (c >= 192 && c <= 214) : ((c >= 216 && c <= 246) || (c >= 248 && c <= 705))) : (c < 748 ? ((c >= 710 && c <= 721) || (c >= 736 && c <= 740)) : (c == 748 || c == 750)))) : (c < 910 ? (c < 895 ? (c < 886 ? (c >= 768 && c <= 884) : ((c >= 886 && c <= 887) || (c >= 890 && c <= 893))) : (c < 904 ? (c == 895 || c == 902) : ((c >= 904 && c <= 906) || c == 908))) : (c < 1155 ? (c < 931 ? (c >= 910 && c <= 929) : ((c >= 931 && c <= 1013) || (c >= 1015 && c <= 1153))) : (c < 1369 ? ((c >= 1155 && c <= 1327) || (c >= 1329 && c <= 1366)) : (c == 1369 || (c >= 1377 && c <= 1415)))))) : (c < 1808 ? (c < 1552 ? (c < 1476 ? (c < 1471 ? (c >= 1425 && c <= 1469) : (c == 1471 || (c >= 1473 && c <= 1474))) : (c < 1488 ? ((c >= 1476 && c <= 1477) || c == 1479) : ((c >= 1488 && c <= 1514) || (c >= 1520 && c <= 1522)))) : (c < 1749 ? (c < 1568 ? (c >= 1552 && c <= 1562) : ((c >= 1568 && c <= 1641) || (c >= 1646 && c <= 1747))) : (c < 1770 ? ((c >= 1749 && c <= 1756) || (c >= 1759 && c <= 1768)) : ((c >= 1770 && c <= 1788) || c == 1791)))) : (c < 2230 ? (c < 2042 ? (c < 1869 ? (c >= 1808 && c <= 1866) : ((c >= 1869 && c <= 1969) || (c >= 1984 && c <= 2037))) : (c < 2112 ? (c == 2042 || (c >= 2048 && c <= 2093)) : ((c >= 2112 && c <= 2139) || (c >= 2208 && c <= 2228)))) : (c < 2406 ? (c < 2260 ? (c >= 2230 && c <= 2237) : ((c >= 2260 && c <= 2273) || (c >= 2275 && c <= 2403))) : (c < 2437 ? ((c >= 2406 && c <= 2415) || (c >= 2417 && c <= 2435)) : ((c >= 2437 && c <= 2444) || (c >= 2447 && c <= 2448))))))) : (c < 2693 ? (c < 2579 ? (c < 2519 ? (c < 2486 ? (c < 2474 ? (c >= 2451 && c <= 2472) : ((c >= 2474 && c <= 2480) || c == 2482)) : (c < 2503 ? ((c >= 2486 && c <= 2489) || (c >= 2492 && c <= 2500)) : ((c >= 2503 && c <= 2504) || (c >= 2507 && c <= 2510)))) : (c < 2534 ? (c < 2524 ? c == 2519 : ((c >= 2524 && c <= 2525) || (c >= 2527 && c <= 2531))) : (c < 2565 ? ((c >= 2534 && c <= 2545) || (c >= 2561 && c <= 2563)) : ((c >= 2565 && c <= 2570) || (c >= 2575 && c <= 2576))))) : (c < 2631 ? (c < 2613 ? (c < 2602 ? (c >= 2579 && c <= 2600) : ((c >= 2602 && c <= 2608) || (c >= 2610 && c <= 2611))) : (c < 2620 ? ((c >= 2613 && c <= 2614) || (c >= 2616 && c <= 2617)) : (c == 2620 || (c >= 2622 && c <= 2626)))) : (c < 2649 ? (c < 2635 ? (c >= 2631 && c <= 2632) : ((c >= 2635 && c <= 2637) || c == 2641)) : (c < 2662 ? ((c >= 2649 && c <= 2652) || c == 2654) : ((c >= 2662 && c <= 2677) || (c >= 2689 && c <= 2691)))))) : (c < 2821 ? (c < 2759 ? (c < 2730 ? (c < 2703 ? (c >= 2693 && c <= 2701) : ((c >= 2703 && c <= 2705) || (c >= 2707 && c <= 2728))) : (c < 2741 ? ((c >= 2730 && c <= 2736) || (c >= 2738 && c <= 2739)) : ((c >= 2741 && c <= 2745) || (c >= 2748 && c <= 2757)))) : (c < 2784 ? (c < 2763 ? (c >= 2759 && c <= 2761) : ((c >= 2763 && c <= 2765) || c == 2768)) : (c < 2809 ? ((c >= 2784 && c <= 2787) || (c >= 2790 && c <= 2799)) : (c == 2809 || (c >= 2817 && c <= 2819))))) : (c < 2887 ? (c < 2858 ? (c < 2831 ? (c >= 2821 && c <= 2828) : ((c >= 2831 && c <= 2832) || (c >= 2835 && c <= 2856))) : (c < 2869 ? ((c >= 2858 && c <= 2864) || (c >= 2866 && c <= 2867)) : ((c >= 2869 && c <= 2873) || (c >= 2876 && c <= 2884)))) : (c < 2911 ? (c < 2902 ? ((c >= 2887 && c <= 2888) || (c >= 2891 && c <= 2893)) : ((c >= 2902 && c <= 2903) || (c >= 2908 && c <= 2909))) : (c < 2929 ? ((c >= 2911 && c <= 2915) || (c >= 2918 && c <= 2927)) : (c == 2929 || (c >= 2946 && c <= 2947)))))))) : (c < 3517 ? (c < 3205 ? (c < 3046 ? (c < 2984 ? (c < 2969 ? (c < 2958 ? (c >= 2949 && c <= 2954) : ((c >= 2958 && c <= 2960) || (c >= 2962 && c <= 2965))) : (c < 2974 ? ((c >= 2969 && c <= 2970) || c == 2972) : ((c >= 2974 && c <= 2975) || (c >= 2979 && c <= 2980)))) : (c < 3014 ? (c < 2990 ? (c >= 2984 && c <= 2986) : ((c >= 2990 && c <= 3001) || (c >= 3006 && c <= 3010))) : (c < 3024 ? ((c >= 3014 && c <= 301
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /[!#$%&'*+/=?^_`{|}~-]/
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isValidEmailLocalPartSpecialChar(c) {
|
||
|
|
return (c < 47 ? (c < 42 ? (c == 33 || (c >= 35 && c <= 39)) : ((c >= 42 && c <= 43) || c == 45)) : (c < 63 ? (c == 47 || c == 61) : (c < 94 ? c == 63 : ((c >= 94 && c <= 96) || (c >= 123 && c <= 126)))));
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /[-+&@#/%=~_()|'$*[\]{}\u2713]/
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isUrlSuffixAllowedSpecialChar(c) {
|
||
|
|
return (c < 91 ? (c < 47 ? ((c >= 35 && c <= 43) || c == 45) : (c < 61 ? c == 47 : (c == 61 || c == 64))) : (c < 95 ? (c == 91 || c == 93) : (c < 123 ? c == 95 : ((c >= 123 && c <= 126) || c == 10003))));
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /[?!:,.;^]/
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isUrlSuffixNotAllowedAsFinalChar(c) {
|
||
|
|
return (c < 58 ? (c < 44 ? c == 33 : (c == 44 || c == 46)) : (c < 63 ? (c >= 58 && c <= 59) : (c == 63 || c == 94)));
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /[({[]/
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isOpenBraceChar(c) {
|
||
|
|
return (c < 91 ? c == 40 : (c == 91 || c == 123));
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Determines if the given character `c` matches the regular expression /[)}\]]/
|
||
|
|
* by checking it via character code in a binary search fashion.
|
||
|
|
*
|
||
|
|
* This technique speeds this function up by a factor of ~10x vs. running RegExp.prototype.test()
|
||
|
|
* on the character itself.
|
||
|
|
*
|
||
|
|
* NOTE: This function is generated. Do not edit manually. To regenerate, run:
|
||
|
|
*
|
||
|
|
* npm run generate-char-utils
|
||
|
|
*/
|
||
|
|
function isCloseBraceChar(c) {
|
||
|
|
return (c < 93 ? c == 41 : (c == 93 || c == 125));
|
||
|
|
}
|
||
|
|
//# sourceMappingURL=char-utils.js.map
|