Lines Matching +full:5 +full:ive
1700 if (arguments.length === 5) {
1718 if (strict && arguments.length === 5) {
2072 exports.NS = 5; // Non-starters
2684 if (key.slice(0, 5) === 'write') {
4108 swap(this, i + 2, i + 5);
4701 …var val = this[offset + 4] + this[offset + 5] * Math.pow(2, 8) + this[offset + 6] * Math.pow(2, 16…
4845 buf[offset + 5] = lo;
6404 * PKCS #5/7 padding strategy.
6408 * Pads data using the algorithm defined in PKCS #5/7.
6440 * Unpads data that had been padded using the algorithm defined in PKCS #5/7.
8603 var M_offset_5 = M[offset + 5];
8627 d = FF(d, a, b, c, M_offset_5, 12, T[5]);
8638 a = GG(a, b, c, d, M_offset_1, 5, T[16]);
8642 a = GG(a, b, c, d, M_offset_5, 5, T[20]);
8646 a = GG(a, b, c, d, M_offset_9, 5, T[24]);
8650 a = GG(a, b, c, d, M_offset_13, 5, T[28]);
8701 dataWords[nBitsLeft >>> 5] |= 0x80 << 24 - nBitsLeft % 32;
9500 C[5] ^= i1;
9518 S[0] = X[0] ^ X[5] >>> 16 ^ X[3] << 16;
9519 S[1] = X[2] ^ X[7] >>> 16 ^ X[5] << 16;
9549 C[5] = C[5] + 0x34d34d34 + (C[4] >>> 0 < C_[4] >>> 0 ? 1 : 0) | 0;
9550 C[6] = C[6] + 0x4d34d34d + (C[5] >>> 0 < C_[5] >>> 0 ? 1 : 0) | 0;
9576 X[5] = G[5] + (G[4] << 8 | G[4] >>> 24) + G[3] | 0;
9577 X[6] = G[6] + (G[5] << 16 | G[5] >>> 16) + (G[4] << 16 | G[4] >>> 16) | 0;
9578 X[7] = G[7] + (G[6] << 8 | G[6] >>> 24) + G[5] | 0;
9673 C[5] ^= i1;
9691 S[0] = X[0] ^ X[5] >>> 16 ^ X[3] << 16;
9692 S[1] = X[2] ^ X[7] >>> 16 ^ X[5] << 16;
9722 C[5] = C[5] + 0x34d34d34 + (C[4] >>> 0 < C_[4] >>> 0 ? 1 : 0) | 0;
9723 C[6] = C[6] + 0x4d34d34d + (C[5] >>> 0 < C_[5] >>> 0 ? 1 : 0) | 0;
9749 X[5] = G[5] + (G[4] << 8 | G[4] >>> 24) + G[3] | 0;
9750 X[6] = G[6] + (G[5] << 16 | G[5] >>> 16) + (G[4] << 16 | G[4] >>> 16) | 0;
9751 X[7] = G[7] + (G[6] << 8 | G[6] >>> 24) + G[5] | 0;
9930 …5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3, 10…
9931 …5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4,…
9932 …5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12, 11…
9933 …5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11, 9, 7, 15, 1…
10033 dataWords[nBitsLeft >>> 5] |= 0x80 << 24 - nBitsLeft % 32;
10045 for (var i = 0; i < 5; i++) {
10168 var t = (a << 5 | a >>> 27) + e + W[i];
10200 dataWords[nBitsLeft >>> 5] |= 0x80 << 24 - nBitsLeft % 32;
10401 var f = H[5];
10438 H[5] = H[5] + f | 0;
10450 dataWords[nBitsLeft >>> 5] |= 0x80 << 24 - nBitsLeft % 32;
10540 RHO_OFFSETS[x + 5 * y] = (t + 1) * (t + 2) / 2 % 64;
10541 var newX = y % 5;
10542 var newY = (2 * x + 3 * y) % 5;
10548 for (var x = 0; x < 5; x++) {
10549 for (var y = 0; y < 5; y++) {
10550 PI_INDEXES[x + 5 * y] = y + (2 * x + 3 * y) % 5 * 5;
10571 // Primitive polynomial over GF(2): x^8 + x^6 + x^5 + x^4 + 1
10635 for (var x = 0; x < 5; x++) {
10639 for (var y = 0; y < 5; y++) {
10640 var lane = state[x + 5 * y];
10650 for (var x = 0; x < 5; x++) {
10652 var Tx4 = T[(x + 4) % 5];
10653 var Tx1 = T[(x + 1) % 5];
10660 for (var y = 0; y < 5; y++) {
10661 var lane = state[x + 5 * y];
10700 for (var x = 0; x < 5; x++) {
10701 for (var y = 0; y < 5; y++) {
10703 var laneIndex = x + 5 * y;
10706 var Tx1Lane = T[(x + 1) % 5 + 5 * y];
10707 var Tx2Lane = T[(x + 2) % 5 + 5 * y];
10731 dataWords[nBitsLeft >>> 5] |= 0x1 << 24 - nBitsLeft % 32;
10732 dataWords[(Math.ceil((nBitsLeft + 1) / blockSizeBits) * blockSizeBits >>> 5) - 1] |= 0x80;
10935 var H5 = H[5];
11087 dataWords[nBitsLeft >>> 5] |= 0x80 << 24 - nBitsLeft % 32;
11088 dataWords[(nBitsLeft + 128 >>> 10 << 5) + 30] = Math.floor(nBitsTotal / 0x100000000);
11089 dataWords[(nBitsLeft + 128 >>> 10 << 5) + 31] = nBitsTotal;
11169 …7, 39, 31, 23, 15, 7, 62, 54, 46, 38, 30, 22, 14, 6, 61, 53, 45, 37, 29, 21, 13, 5, 28, 20, 12, 4];
11172 …var PC2 = [14, 17, 11, 24, 1, 5, 3, 28, 15, 6, 21, 10, 23, 19, 12, 4, 26, 8, 16, 7, 27, 20, 13, 2,…
11716 keyBits[i] = keyWords[keyBitPos >>> 5] >>> 31 - keyBitPos % 32 & 1;
11744 subKey[7] = subKey[7] << 5 | subKey[7] >>> 27;
12241 case 5:
12280 _context.next = 5;
12600 5 6 5 6 5 6 5 6
12604 5 6 5 6 5 6 5 6
12611 pass(0, 2, 2, 4); // 5
13978 * C.5 Surrogate codes
13979 * @link https://tools.ietf.org/html/rfc3454#appendix-C.5
14198 this.version = 5;
14213 case 5:
14285 encDict.V = 5;
14296 encDict.R = 5;
14308 if (this.version < 5) {
14309 …j & 0xff) << 24 | (obj & 0xff00) << 8 | obj >> 8 & 0xff00 | gen & 0xff, (gen & 0xff00) << 16], 5));
14313 _key.sigBytes = Math.min(16, this.keyBits / 8 + 5);
14689 m5 = _this$doc$_ctm[5];
14696 dy = _this$transform[5];
14809 m5 = _this$doc$_ctm[5];
14829 return +v.toFixed(5);
15325 cy = a[5];
15331 doc.bezierCurveTo(a[0] + cx, a[1] + cy, a[2] + cx, a[3] + cy, a[4] + cx, a[5] + cy);
15335 return cy += a[5];
15401 cx = a[5];
15405 _a[5] += cx;
15408 cx = _a[5];
15461 ex = _coords[5],
15796 m5 = _m[5];
15802 m[5] = m1 * dx + m3 * dy + m5;
16329 var tag = [1, 2, 3, 4, 5, 6].map(function (i) {
16927 var indent = options.textIndent || (listType === 'bullet' ? r * 5 : unit * 2);
17431 // Use Color Key Masking (spec section 4.8.5)
17436 // Use Color Key Masking (spec section 4.8.5)
17727 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
17737 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
17747 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
17821 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
17829 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
17857 m5 = _this$_ctm[5];
18483 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
18487 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
18491 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
18495 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
18499 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
18503 var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
19272 var SHIFT_1 = 6 + 5;
19275 var SHIFT_2 = 5;
19278 // for getting an index-1 offset from an index-2 offset. 6=11-5
20569 …[3], a[1] * b[2] + a[3] * b[3], a[0] * b[4] + a[2] * b[5] + a[4], a[1] * b[4] + a[3] * b[5] + a[5]…
20578 return [m[0] * p[0] + m[2] * p[1] + m[4], m[1] * p[0] + m[3] * p[1] + m[5]];
20592 … / dt, -m[1] / dt, -m[2] / dt, m[0] / dt, (m[2] * m[5] - m[3] * m[4]) / dt, (m[1] * m[4] - m[0] * …
20600 m5 = validateNumber(m[5]);
20653 result = multiplyMatrix(result, [nums[0], nums[1], nums[2], nums[3], nums[4], nums[5]]);
21396 doc.bezierCurveTo(values[0], values[1], values[2], values[3], values[4], values[5]);
21464 var file = temp[1] || temp[3] || temp[5] || temp[7],
23455 5 : %
23582 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
23583 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
23584 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
23604 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
23608 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
23612 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
23616 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
23622 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7,
23715 1, 2, 3, 4, 0, 5, 17, 6, 16, 7, 8, 9, 10, 11, 12, 13, 14, 15,
23847 BrotliBuildHuffmanTable(table, 0, 5, code_length_code_lengths, CODE_LENGTH_CODES);
23979 new HuffmanCode(2, 0), new HuffmanCode(2, 4), new HuffmanCode(2, 3), new HuffmanCode(4, 5)
24055 …this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5])…
24640 …5lM1BHT9tS270EWUDYFq1I0yY/fNiAk4bk9yBgmef/f2k6AlYQZHsNFnW8wBQxCd68iWv7/35bXfz3JZmfGligWAKRjIs3Ipzx…
24679 7, 6, 6, 5, 5,
24847 …new PrefixCodeRange(1, 2), new PrefixCodeRange(5, 2), new PrefixCodeRange(9, 2), new PrefixCodeRan…
24850 …new PrefixCodeRange(113, 5), new PrefixCodeRange(145, 5), new PrefixCodeRange(177, 5), new PrefixC…
24858 …new PrefixCodeRange(4, 0), new PrefixCodeRange(5, 0), new PrefixCodeRange(6, 1), new PrefixCodeRan…
24860 …deRange(34, 4), new PrefixCodeRange(50, 4), new PrefixCodeRange(66, 5), new PrefixCodeRange(98, 5),
24866 …ixCodeRange(2, 0), new PrefixCodeRange(3, 0), new PrefixCodeRange(4, 0), new PrefixCodeRange(5, 0),
24870 …new PrefixCodeRange(70, 5), new PrefixCodeRange(102, 5), new PrefixCodeRange(134, 6), new PrefixCo…
24953 var kOmitLast5 = 5;
25075 new Transform( "", kIdentity, "ive " ),
25124 p[i + 2] ^= 5;
25214 exports.DEFLATERAW = 5;
25486 …assert(arguments.length === 4 || arguments.length === 5, 'init(windowBits, level, memLevel, strate…
26860 var NO_HOLES = TYPE == 5 || IS_FIND_INDEX;
26877 case 5: return value; // find
26908 find: createMethod(5),
27578 // V8 ~ Chromium 42- fails only with 5+ elements
27580 var index = 5;
39529 buf = Buffer.alloc(str.length*5 + 10), bufIdx = 0;
41093 Z_BLOCK: 5,
41106 Z_BUF_ERROR: -5,
41244 var Z_BLOCK = 5;
41258 var Z_BUF_ERROR = -5;
41708 * to pending_buf_size, and each stored block has a 5 byte header:
41712 if (max_block_size > s.pending_buf_size - 5) {
41713 max_block_size = s.pending_buf_size - 5;
41980 if (s.match_length <= 5 &&
42260 new Config(4, 5, 16, 8, deflate_fast), /* 2 */
42264 new Config(8, 16, 32, 32, deflate_slow), /* 5 */
42442 * even emit a stored file instead of a stored block (saving 5 bytes).
43139 length code, 5 bits for the length extra, 15 bits for the distance code,
43186 last = _in + (strm.avail_in - 5);
43428 strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));
43483 var Z_BLOCK = 5;
43497 var Z_BUF_ERROR = -5;
43512 var EXLEN = 5; /* i: waiting for extra length (gzip) */
43751 while (sym < 32) { state.lens[sym++] = 5; }
43753 inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });
43762 state.distbits = 5;
43846 [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];
44325 state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;
44326 //--- DROPBITS(5) ---//
44327 hold >>>= 5;
44328 bits -= 5;
44330 state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;
44331 //--- DROPBITS(5) ---//
44332 hold >>>= 5;
44333 bits -= 5;
45039 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
45049 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
45386 '-5': 'buffer error', /* Z_BUF_ERROR (-5) */
45505 [0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];
45508 [0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];
45514 [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];
45541 * 5 bits.)
45838 * in two different ways: code 284 + 5 bits or code 285, so we
45895 static_dtree[n * 2 + 1]/*.Len*/ = 5;
45896 static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);
46316 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
46329 s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
46352 send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */
46353 send_bits(s, dcodes - 1, 5);
46515 opt_lenb = static_lenb = stored_len + 5; /* force a stored block */
46595 // out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);
51853 …if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) retu…
52054 10, 5, 11, 4, 12, 3, 13, 2,
52098 for (i = 0; i < 5; ++i) dt.table[i] = 0;
52100 dt.table[5] = 32;
52198 /* get 5 bits HLIT (257-286) */
52199 hlit = tinf_read_bits(d, 5, 257);
52201 /* get 5 bits HDIST (1-32) */
52202 hdist = tinf_read_bits(d, 5, 1);
52871 // 5 Hebrew 22 Laotian
52934 5: 'sv',
53414 5: {
53633 var FLOAT_LOOKUP = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.', 'E', 'E-', null, '-'];
53694 return 5;
54402 … null], [[12, 7], 'FontMatrix', 'array', [0.001, 0, 0, 0.001, 0, 0]], [[12, 5], 'PaintType', 'numb…
54405 …5], 'PaintType', 'number', 0], [[12, 6], 'CharstringType', 'number', 2], [[12, 7], 'FontMatrix', '…
54605 5: {
54685 5: {
55101 5: {
55189 5: Context,
55933 5: {
56008 5: {
56197 this.uvs = this.findSubtable(cmapTable, [[0, 5]]);
57254 // initialCapsAndSmallCaps: 5 # deprecated
57261 code: 5,
57338 internationalSymbols: 5,
57364 tallCaps: 5
57374 traditionalAltOne: 5,
57399 altProportionalText: 5,
57411 // romanizationToHiragana: 5
57424 parenthesisAnnotation: 5,
57466 CJKSymbolAltFive: 5
57476 ideographicAltFive: 5
58060 case 5:
58169 var count = (entry.flags & MARKED_INSERT_COUNT) >>> 5;
58174 var _count = (entry.flags & CURRENT_INSERT_COUNT) >>> 5;
58308 case 5:
58570 'DALATH RISH': 5,
58587 [[NONE, NONE, 0], [NONE, ISOL, 2], [NONE, ISOL, 1], [NONE, ISOL, 2], [NONE, FIN2, 5], [NONE, ISOL, …
58593 [[NONE, NONE, 0], [NONE, ISOL, 2], [MED2, ISOL, 1], [MED2, ISOL, 2], [MED2, FIN2, 5], [MED2, ISOL, …
58594 // State 5: prev was FIN2/FIN3 ALAPH, not willing to join.
58595 [[NONE, NONE, 0], [NONE, ISOL, 2], [ISOL, ISOL, 1], [ISOL, ISOL, 2], [ISOL, FIN2, 5], [ISOL, ISOL, …
58597 [[NONE, NONE, 0], [NONE, ISOL, 2], [NONE, ISOL, 1], [NONE, ISOL, 2], [NONE, FIN3, 5], [NONE, ISOL, …
59291 var LVT = 5; // Composed <LVT> syllable
59322 var INVALID = 5; // Build a state machine that accepts valid syllables, and applies actions along t…
59460 …5, 6, 7, 8, 9, 0, 10, 11, 11, 12, 13, 14, 15, 16, 17], [0, 0, 0, 18, 19, 20, 21, 22, 23, 0, 24, 0,…
59515 …5, 0, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 0, 17, 18, 11, 19, 20, 21, 22, 0, 0, 0, 23, 0, 0, 2,…
59534 ZWNJ: 1 << 5,
59560 After_Main: 1 << 5,
59684 …5kRbsNmcexfrubt0X/rGvLqrGSnYv3ZPHEe8r7lvMvUfi2LOu/2dg8LrRtQt2yfcv8r5IU70VkIs6nbebUXf0M/o7Znl39Sdoz…
60297 // proceed to step 5.
60344 } // 5. If no consonant is found in steps 3 or 4, move reph to a position
60463 …5/zfujfWH5z0cz4Gj+8X5Sf1ib4m+vwbHZ/fdOtP+z+3LOnPp/QL4vxhsApeCy8BWk/a2ftFmYu22Hf4/Ba4B14Hrwc0sP7fh+…
60956 case 5:
61130 case 5:
61716 p3y = _c$args3[5];
62005 var SAME_Y = 1 << 5; // Flags for composite glyphs
62009 var MORE_COMPONENTS = 1 << 5;
62408 case 5:
62655 case 5:
62799 for (var _i3 = 0; _i3 <= 5; _i3++) {
63462 var SAME_Y$1 = 1 << 5;
64921 …5/gAOivE9IArXpbrmlwR+vljz9bJrV552RCvgQ2GXgRzJ9CyGVTxofdLd17Gv6jW4RcAG5ote/9FO4B8NZhQs4DN4O9kOFY6OF…
67777 …, CM: 900, D: 500, CD: 400, C: 100, XC: 90, L: 50, XL: 40, X: 10, IX: 9, V: 5, IV: 4, I: 1 }, roma…
70608 * pattern: '1 w 0 1 m 4 5 l s 2 0 m 5 3 l s'
71256 [[18, 20, 26, 18], [4, 2, 5, 6], [4, 20, 36]],
71258 [[22, 30, 24, 20], [5, 2, 8, 8], [4, 24, 44]],
71259 [[26, 18, 28, 24], [5, 4, 8, 8], [4, 26, 48]],
71260 [[30, 20, 24, 28], [5, 4, 11, 8], [4, 28, 52]],
71330 // alphanumeric character mapping (cf. Table 5 in JIS X 0510:2004 p. 19)
71383 * | | # # # @5x5@ # # # | | |
71389 * @5x5@ @5x5@ @5x5@ n-17
71395 * | | @5x5@ @5x5@ |
71406 * - 25m^2-75 (= (m^2-3)(5x5)) modules for alignment patterns
71644 // - p=10, q=5, genpoly=x^10+x^8+x^5+x^4+x^2+x+1 (JIS X 0510:2004 Appendix C)
71645 // - p=18, q=6, genpoly=x^12+x^11+x^10+x^9+x^8+x^5+x^2+1 (ibid. Appendix D)
71696 blit(aligns[i], aligns[j], 5, 5, [0x1f, 0x11, 0x15, 0x11, 0x1f]);
71758 var code = augumentbch((ecclevel << 3) | mask, 5, 0x537, 10) ^ 0x5412;
71760 var r = [0, 1, 2, 3, 4, 5, 7, 8, n - 7, n - 6, n - 5, n - 4, n - 3, n - 2, n - 1][i];
71761 var c = [n - 1, n - 2, n - 3, n - 4, n - 5, n - 6, n - 7, n - 8, 7, 5, 4, 3, 2, 1, 0][i];
71780 // N1+(k-5) points for each consecutive row of k same-colored modules,
71781 // where k >= 5. no overlapping row counts.
71790 // N4*k points for every (5*k)% deviation from 50% black density.
71797 if (groups[i] >= 5)
71798 score += PENALTY_CONSECUTIVE + (groups[i] - 5);
71800 for (var i = 5; i < groups.length; i += 2) {
71803 groups[i - 4] == p && (groups[i - 5] >= 4 * p || groups[i + 1] >= 4 * p)) {
71962 // defaults to 5px.
71975 var modSize = Math.floor(options.fit ? options.fit / n : 5);
73035 .bezierCurveTo(rwx + sh * 4, y + sv, rwx + sh * 5, y + sv, rwx + sh * 6, y);
73618 …5bPVFZimRfKoTQJNm37CGE7Iw0j3UsTWKsoyI7kwyyTiEUzSD7NiEzhWYijH0wMVkHE4Mx49fzfo+3nuP4/fdZjvv+XNd5n/d9…
73663 val = (num >> 5) - 14;
73740 …巛⼳广廴彐彡攴无疒癶辵隶¨ˆヽヾゝゞ〃仝々〆〇ー［］✽ぁ",23],["c740","す",58,"ァアィイ"],["c7a1","ゥ",81,"А",5,"ЁЖ",4],["c840","Л",…
73748 …5,"乲乴",9,"乿",6,"亇亊"],["8180","亐亖亗亙亜亝亞亣亪亯亰亱亴亶亷亸亹亼亽亾仈仌仏仐仒仚仛仜仠仢仦仧仩仭仮仯仱仴仸仹仺仼仾伀伂",6,"伋伌伒",4,"伜伝伡伣伨伩伬伭伮伱…
73756 …5,"걕"],["8181","걖걗걙걚걛걝",18,"걲걳걵걶걹걻",4,"겂겇겈겍겎겏겑겒겓겕",6,"겞겢",5,"겫겭겮겱",6,"겺겾겿곀곂곃곅곆곇곉곊곋곍",7,"곖곘",7,"곢곣곥…
73772 …5,"ЁЖ",25],["a7d1","а",5,"ёж",25],["a8a1","─│┌┐┘└├┬┤┴┼━┃┏┓┛┗┣┳┫┻╋┠┯┨┷┿┝┰┥┸╂"],["ada1","①",19,"Ⅰ",9…
73788 …["a140","",62],["a180","",32],["a240","",62],["a280","",32],["a2ab","",5],["a2e3","€"],["a2e…
73796 …"ム",22],["839f","Α",16,"Σ",6],["83bf","α",16,"σ",6],["8440","А",5,"ЁЖ",25],["8470","а",5,"ёж",7],[…