Lines Matching refs:j
3642 table.columns.forEach(function (column, j) {
3645 var cell = r.getCell(col + j);
3653 data.forEach(function (value, j) {
3654 var cell = r.getCell(col + j);
3656 assignStyle(cell, table.columns[j].style);
3663 table.columns.forEach(function (column, j) {
3664 var cell = _r.getCell(col + j);
3666 if (j === 0) {
3699 table.columns.forEach(function (column, j) {
3700 var cell = r.getCell(col + j);
3707 data.forEach(function (value, j) {
3708 var cell = r.getCell(col + j);
3716 table.columns.forEach(function (column, j) {
3717 var cell = _r2.getCell(col + j);
3719 if (j === 0) {
3764 for (var j = 0; j < this._cache.width; j++) {
3765 var cell = row.getCell(ref.col + j);
4853 for (var j = dimensions.left; j <= dimensions.right; j++) {
4855 if (i > dimensions.top || j > dimensions.left) {
4856 this.getCell(i, j).merge(master, ignoreStyle);
4872 for (var j = merge.left; j <= merge.right; j++) {
4873 this.getCell(i, j).unmerge();
4893 for (var j = dimensions.left; j <= dimensions.right; j++) {
4894 var cell = this.findCell(i, j);
15976 for (var j = 0; j < width; j++) {
15977 otherAddress = colCache.encodeAddress(addr.row + i, addr.col + j);
16921 for (var j = dimensions.left; j <= dimensions.right; j++) {
16922 var cell = row.cells[j - 1];
16926 row.cells[j] = {
16928 address: colCache.encodeAddress(i, j)
29591 var j, w;
29595 for (i = number.length - 1, j = 0; i >= 0; i -= 3) {
29597 this.words[j] |= w << off & 0x3ffffff;
29598 this.words[j + 1] = w >>> 26 - off & 0x3ffffff;
29603 j++;
29607 for (i = 0, j = 0; i < number.length; i += 3) {
29609 this.words[j] |= w << off & 0x3ffffff;
29610 this.words[j + 1] = w >>> 26 - off & 0x3ffffff;
29615 j++;
29652 var j, w; // Scan 24-bit chunks and add them to the number
29656 for (i = number.length - 6, j = 0; i >= start; i -= 6) {
29658 …this.words[j] |= w << off & 0x3ffffff; // NOTE: `0x3fffff` is intentional here, 26bits max shift +…
29660 this.words[j + 1] |= w >>> 26 - off & 0x3fffff;
29665 j++;
29671 this.words[j] |= w << off & 0x3ffffff;
29672 this.words[j + 1] |= w >>> 26 - off & 0x3fffff;
30429 for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {
30430 var i = k - j | 0;
30432 b = num.words[j] | 0;
31066 for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {
31067 var i = k - j;
31069 var b = num.words[j] | 0;
31168 for (var j = 0; j < s; j++) {
31169 var re = rtws[p + j];
31170 var ie = itws[p + j];
31171 var ro = rtws[p + j + s];
31172 var io = itws[p + j + s];
31176 rtws[p + j] = re + ro;
31177 itws[p + j] = ie + io;
31178 rtws[p + j + s] = re - ro;
31179 itws[p + j + s] = ie - io;
31182 if (j !== l) {
31714 for (var j = m - 1; j >= 0; j--) {
31715 …var qj = (a.words[b.length + j] | 0) * 0x4000000 + (a.words[b.length + j - 1] | 0); // NOTE: (qj /…
31720 a._ishlnsubmul(b, qj, j);
31726 a._ishlnsubmul(b, 1, j);
31734 q.words[j] = qj;
31962 for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1) {
31966 if (j > 0) {
31967 y.iushrn(j);
31969 while (j-- > 0) {
32034 for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1) {
32038 if (j > 0) {
32039 b.iushrn(j);
32041 while (j-- > 0) {
32786 for (var j = start - 1; j >= 0; j--) {
32787 var bit = word >> j & 1;
32801 if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;
33181 var j, w;
33185 for (i = number.length - 1, j = 0; i >= 0; i -= 3) {
33187 this.words[j] |= w << off & 0x3ffffff;
33188 this.words[j + 1] = w >>> 26 - off & 0x3ffffff;
33193 j++;
33197 for (i = 0, j = 0; i < number.length; i += 3) {
33199 this.words[j] |= w << off & 0x3ffffff;
33200 this.words[j + 1] = w >>> 26 - off & 0x3ffffff;
33205 j++;
33248 var j, w; // Scan 24-bit chunks and add them to the number
33252 for (i = number.length - 6, j = 0; i >= start; i -= 6) {
33254 …this.words[j] |= w << off & 0x3ffffff; // NOTE: `0x3fffff` is intentional here, 26bits max shift +…
33256 this.words[j + 1] |= w >>> 26 - off & 0x3fffff;
33261 j++;
33267 this.words[j] |= w << off & 0x3ffffff;
33268 this.words[j + 1] |= w >>> 26 - off & 0x3fffff;
34113 for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {
34114 var i = k - j | 0;
34116 b = num.words[j] | 0;
34750 for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {
34751 var i = k - j;
34753 var b = num.words[j] | 0;
34854 for (var j = 0; j < s; j++) {
34855 var re = rtws[p + j];
34856 var ie = itws[p + j];
34857 var ro = rtws[p + j + s];
34858 var io = itws[p + j + s];
34862 rtws[p + j] = re + ro;
34863 itws[p + j] = ie + io;
34864 rtws[p + j + s] = re - ro;
34865 itws[p + j + s] = ie - io;
34868 if (j !== l) {
35402 for (var j = m - 1; j >= 0; j--) {
35403 …var qj = (a.words[b.length + j] | 0) * 0x4000000 + (a.words[b.length + j - 1] | 0); // NOTE: (qj /…
35408 a._ishlnsubmul(b, qj, j);
35414 a._ishlnsubmul(b, 1, j);
35422 q.words[j] = qj;
35662 for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1) {
35666 if (j > 0) {
35667 y.iushrn(j);
35669 while (j-- > 0) {
35734 for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1) {
35738 if (j > 0) {
35739 b.iushrn(j);
35741 while (j-- > 0) {
36489 for (var j = start - 1; j >= 0; j--) {
36490 var bit = word >> j & 1;
36504 if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;
36746 for (var j = 0; j < 256; j++) {
36747 if (j < 128) {
36748 d[j] = j << 1;
36750 d[j] = j << 1 ^ 0x11b;
37351 var j, xi, lsbVi;
37368 for (j = 3; j > 0; j--) {
37369 Vi[j] = Vi[j] >>> 1 | (Vi[j - 1] & 1) << 31;
39540 for (var j = 0; j < valLength; j++) {
39541 if (read(arr, i + j) !== read(val, j)) {
41810 var j = 0;
41812 while (length > j) {
41813 key = keys[j++];
45022 for (var j = 0; j <= 24; j += 8) {
45024 outL |= inR >>> j + i & 1;
45027 for (var j = 0; j <= 24; j += 8) {
45029 outL |= inL >>> j + i & 1;
45034 for (var j = 1; j <= 25; j += 8) {
45036 outR |= inR >>> j + i & 1;
45039 for (var j = 1; j <= 25; j += 8) {
45041 outR |= inL >>> j + i & 1;
45054 for (var j = 24; j >= 0; j -= 8) {
45056 outL |= inR >>> j + i & 1;
45058 outL |= inL >>> j + i & 1;
45063 for (var j = 24; j >= 0; j -= 8) {
45065 outR |= inR >>> j + i & 1;
45067 outR |= inL >>> j + i & 1;
45083 for (var j = 0; j <= 24; j += 8) {
45085 outL |= inR >> j + i & 1;
45088 for (var j = 0; j <= 24; j += 8) {
45090 outL |= inL >> j + i & 1;
45094 for (var j = 0; j <= 24; j += 8) {
45096 outL |= inR >> j + i & 1;
45104 for (var j = 0; j <= 24; j += 8) {
45106 outR |= inR >> j + i & 1;
45109 for (var j = 0; j <= 24; j += 8) {
45111 outR |= inL >> j + i & 1;
45115 for (var j = 0; j <= 24; j += 8) {
45117 outR |= inL >> j + i & 1;
45511 for (var j = 0; j < i && res[j] <= sqrt; j++) {
45512 if (k % res[j] === 0) break;
45515 if (i !== j && res[j] <= sqrt) continue;
45701 for (var j = 0; j < naf.length; j += doubles.step) {
45704 for (var k = j + doubles.step - 1; k >= j; k--) {
45715 for (var j = 0; j < repr.length; j++) {
45716 var nafW = repr[j];
45717 …if (nafW === i) b = b.mixedAdd(doubles.points[j]);else if (nafW === -i) b = b.mixedAdd(doubles.poi…
45836 for (var j = 0; j < max; j++) {
45837 var ja = jsf[0][j] | 0;
45838 var jb = jsf[1][j] | 0;
45839 naf[a][j] = index[(ja + 1) * 3 + (jb + 1)];
45840 naf[b][j] = 0;
45854 for (var j = 0; j < len; j++) {
45855 tmp[j] = naf[j][i] | 0;
45856 if (tmp[j] !== 0) zero = false;
45868 for (var j = 0; j < len; j++) {
45869 var z = tmp[j];
45871 …if (z === 0) continue;else if (z > 0) p = wnd[j][z - 1 >> 1];else if (z < 0) p = wnd[j][-z - 1 >> …
45959 for (var j = 0; j < step; j++) {
46209 var j = f.redSub(h).redISub(h); // X3 = (B-C-D)*J
46211 nx = b.redSub(c).redISub(d).redMul(j); // Y3 = F * (E - D)
46215 nz = f.redMul(j);
46224 var j = e.redSub(h).redSub(h); // X3 = c * (B - E) * J
46226 nx = this.curve._mulC(b.redISub(e)).redMul(j); // Y3 = c * E * (C - D)
46230 nz = e.redMul(j);
46811 for (var j = 0; j < i * 2; j++) {
46812 npoints[j] = null;
46813 ncoeffs[j] = null;
47724 EC.prototype.recoverPubKey = function (msg, signature, j, enc) {
47725 assert((3 & j) === j, 'The recovery param is more than two bits');
47732 var isYOdd = j & 1;
47733 var isSecondKey = j >> 1;
49298 for (var j = 0, carry = data.length * 8; carry > 0; ++j) {
49299 this._length[j] += carry;
49300 carry = this._length[j] / 0x0100000000 | 0;
49301 if (carry > 0) this._length[j] -= 0x0100000000 * carry;
49540 for (var j = 0; j < 80; j++) {
49541 var T = sum32(rotl32(sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), s[j]), E);
49547 T = sum32(rotl32(sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)), sh[j]), Eh);
49567 function f(j, x, y, z) {
49568 …if (j <= 15) return x ^ y ^ z;else if (j <= 31) return x & y | ~x & z;else if (j <= 47) return (x …
49571 function K(j) {
49572 …if (j <= 15) return 0x00000000;else if (j <= 31) return 0x5a827999;else if (j <= 47) return 0x6ed9…
49575 function Kh(j) {
49576 …if (j <= 15) return 0x50a28be6;else if (j <= 31) return 0x5c4dd124;else if (j <= 47) return 0x6d70…
69108 var j = k << 1;
69111 while (j <= s.heap_len) {
69113 if (j < s.heap_len && smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {
69114 j++;
69119 if (smaller(tree, v, s.heap[j], s.depth)) {
69125 s.heap[k] = s.heap[j];
69126 k = j;
69129 j <<= 1;
70495 for (var j = 1; j < iterations; j++) {
75278 for (var j = 0; j < 16; ++j) {
75279 words[j] = this._block.readInt32LE(j * 4);
78302 for (var j = 0; j < 80; ++j) {
78303 var s = ~~(j / 20);
78304 var t = rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s] | 0;
78402 for (var j = 0; j < 80; ++j) {
78403 var s = ~~(j / 20);
78404 var t = rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s] | 0;
78569 for (var j = 0; j < 64; ++j) {
78570 var T1 = h + sigma1(e) + ch(e, f, g) + K[j] + W[j] | 0;
78791 for (var j = 0; j < 160; j += 2) {
78792 Wih = W[j];
78793 Wil = W[j + 1];
78801 var Kih = K[j];
78802 var Kil = K[j + 1];
81480 var j = buf.length - 1;
81481 if (j < i) return 0;
81482 var nb = utf8CheckByte(buf[j]);
81489 if (--j < i || nb === -2) return 0;
81490 nb = utf8CheckByte(buf[j]);
81497 if (--j < i || nb === -2) return 0;
81498 nb = utf8CheckByte(buf[j]);
82900 for (var j = 0; j < 16; ++j) {
82901 …arr[j] = bytes[_i * 64 + j * 4] << 24 | bytes[_i * 64 + j * 4 + 1] << 16 | bytes[_i * 64 + j * 4 +…