Home
last modified time | relevance | path

Searched refs:jj (Results 1 – 25 of 146) sorted by relevance

123456

/third_party/libwebsockets/minimal-examples/http-server/minimal-http-server-fulltext-search/mount-origin/
Dlws-fts.js49 var jj, n, m, s = "", lic = 0;
57 jj = JSON.parse(xhr.responseText);
59 if (jj.fp) {
60 lic = jj.fp.length;
63 s += "<div class='filepath'>" + jj.fp[n].path + "</div>";
66 for (m = 0; m < jj.fp[n].hits.length; m++)
67 s += "<tr><td class='r'>" + jj.fp[n].hits[m].l +
68 "</td><td>" + jj.fp[n].hits[m].s +
127 var jj, n, s = "", lic = 0;
132 jj = JSON.parse(xhr.responseText);
[all …]
/third_party/giflib/tests/
Dwelcome2.rgb1 …jj�99��sbJ�9�)�ZJRZJRZJRZJRZJRZJRZJRZJR)�1�A�Z�b�{�����jj�{{�{{�ZZ�99�…
/third_party/typescript/tests/baselines/reference/
DnestedRecursiveArraysOrObjectsError01.types13 >[ [[{ foo: 'asdf', jj: 1 // intentional error }]]] : { foo: string; jj: number…
16 >[[{ foo: 'asdf', jj: 1 // intentional error }]] : { foo: string; jj: number; }[][]
17 >[{ foo: 'asdf', jj: 1 // intentional error }] : { foo: string; jj: number; }[]
18 >{ foo: 'asdf', jj: 1 // intentional error } : { foo: string; jj: number; }
24 jj: 1 // intentional error
25 >jj : number
DnestedRecursiveArraysOrObjectsError01.errors.txt1 …cursiveArraysOrObjectsError01.ts(10,9): error TS2322: Type '{ foo: string; jj: number; }' is not a…
2 Object literal may only specify known properties, and 'jj' does not exist in type 'Style'.
15 jj: 1 // intentional error
17 !!! error TS2322: Type '{ foo: string; jj: number; }' is not assignable to type 'Style'.
18 !!! error TS2322: Object literal may only specify known properties, and 'jj' does not exist in ty…
DjsDeclarationsFunctions.js57 export { j as jj };
64 exports.j = exports.jj = exports.ii = exports.i = exports.h = exports.g = exports.f = exports.e = e…
122 exports.jj = j;
178 export { hh as h, i as ii, j as jj };
DnestedRecursiveArraysOrObjectsError01.symbols27 jj: 1 // intentional error
28 >jj : Symbol(jj, Decl(nestedRecursiveArraysOrObjectsError01.ts, 8, 20))
DnestedRecursiveArraysOrObjectsError01.js11 jj: 1 // intentional error property
21 jj: 1 // intentional error property
DpropertyAccess.js73 var jj = numIndex[anyVar]; variable
74 var jj: string; variable
231 var jj = numIndex[anyVar];
232 var jj; variable
/third_party/toybox/toys/other/
Dbzcat.c164 int hh, ii, jj, kk, symCount, *base, *limit; in read_block_header() local
169 jj = get_bits(bd, 24); in read_block_header()
173 if (ii==0x177245 && jj==0x385090) return RETVAL_LAST_BLOCK; in read_block_header()
176 if (ii!=0x314159 || jj!=0x265359) return RETVAL_NOT_BZIP_DATA; in read_block_header()
192 for (jj=0; jj<16; jj++) in read_block_header()
193 if (kk & (1 << (15 - jj))) in read_block_header()
194 bd->symToByte[bd->symTotal++] = (16 * ii) + jj; in read_block_header()
214 for(jj=0;get_bits(bd,1);jj++) in read_block_header()
215 if (jj>=bd->groupCount) return RETVAL_DATA_ERROR; in read_block_header()
218 uc = bd->mtfSymbol[jj]; in read_block_header()
[all …]
/third_party/boost/libs/math/tools/
Dlambert_w_lookup_table_generator.cpp208 for (int j = 1, jj = 2; jj != noof_w0es; ++jj) in main() local
210 w0es[jj] = w0es[j] * exp_minus_one<table_lookup_t>(); // previous * 0.36787944. in main()
213 j = jj; // Previous. in main()
241 for (int j = 0, jj = 1; jj != noof_wm1zs; ++jj) in main() local
244 wm1es[jj] = wm1es[j] * e<table_lookup_t>(); in main()
245 wm1zs[jj] = -(jj + 1) * ej; in main()
246 j = jj; // Previous. in main()
/third_party/openssl/crypto/rc5/
Drc5_skey.c17 int i, j, m, c, t, ii, jj; in RC5_32_set_key() local
48 ii = jj = 0; in RC5_32_set_key()
54 k = (L[jj] + A + B) & RC5_32_MASK; in RC5_32_set_key()
55 B = L[jj] = ROTATE_l32(k, m); in RC5_32_set_key()
58 if (++jj >= c) in RC5_32_set_key()
59 jj = 0; in RC5_32_set_key()
/third_party/mesa3d/src/mesa/program/
Dprog_noise.c260 unsigned int ii, jj; in _mesa_noise2() local
286 jj = j & 0xff; in _mesa_noise2()
294 n0 = t0 * t0 * grad2(perm[ii + perm[jj]], x0, y0); in _mesa_noise2()
302 n1 = t1 * t1 * grad2(perm[ii + i1 + perm[jj + j1]], x1, y1); in _mesa_noise2()
310 n2 = t2 * t2 * grad2(perm[ii + 1 + perm[jj + 1]], x2, y2); in _mesa_noise2()
347 unsigned int ii, jj, kk; in _mesa_noise3() local
427 jj = j & 0xff; in _mesa_noise3()
436 n0 = t0 * t0 * grad3(perm[ii + perm[jj + perm[kk]]], x0, y0, z0); in _mesa_noise3()
445 t1 * t1 * grad3(perm[ii + i1 + perm[jj + j1 + perm[kk + k1]]], x1, in _mesa_noise3()
455 t2 * t2 * grad3(perm[ii + i2 + perm[jj + j2 + perm[kk + k2]]], x2, in _mesa_noise3()
[all …]
/third_party/boost/boost/qvm/detail/
Dcofactor_impl.hpp43 for( int jj=0; jj!=N; ++jj ) in cofactor_impl() local
45 if( jj==j ) in cofactor_impl()
47 c[i1][j1] = mat_traits<A>::read_element_idx(ii,jj,a); in cofactor_impl()
/third_party/ffmpeg/libavcodec/
Dnotchlc.c378 for (int jj = 0; jj < 4; jj++) { in decode_blocks() local
379 u[i + ii][j + jj] = u0 + ((udif * (int)(loc & 3) + 2) / 3); in decode_blocks()
380 v[i + ii][j + jj] = v0 + ((vdif * (int)(loc & 3) + 2) / 3); in decode_blocks()
404 for (int jj = 0; jj < 8; jj += 2) { in decode_blocks() local
407 … u[i + ii + iii][j + jj + jjj] = u0 + ((udif * (int)(loc & 3) + 2) / 3); in decode_blocks()
408 … v[i + ii + iii][j + jj + jjj] = v0 + ((vdif * (int)(loc & 3) + 2) / 3); in decode_blocks()
417 for (int jj = 0; jj < 8; jj += 4) { in decode_blocks() local
432 … u[i + ii + iii][j + jj + jjj] = u0 + ((udif * (int)(loc & 3) + 2) / 3); in decode_blocks()
433 … v[i + ii + iii][j + jj + jjj] = v0 + ((vdif * (int)(loc & 3) + 2) / 3); in decode_blocks()
/third_party/boost/libs/multiprecision/test/
Dconstexpr_test_cpp_int_5.cpp241 constexpr int jj = do_bit_set(ii, 20); in main() local
242 static_assert(boost::multiprecision::bit_test(jj, 20)); in main()
249 constexpr int jj = do_bit_unset(i, 20); in main() local
250 static_assert(boost::multiprecision::bit_test(jj, 20) == false); in main()
257 constexpr int jj = do_bit_flip(i, 20); in main() local
258 static_assert(boost::multiprecision::bit_test(jj, 20) == false); in main()
267 constexpr int jj = boost::multiprecision::sqrt(i); in main() local
270 BOOST_CHECK_EQUAL(jj, k); in main()
282 int_backend ii(i), jj(j); in main() local
283 BOOST_CHECK_EQUAL(k, gcd(ii, jj)); in main()
[all …]
/third_party/selinux/libselinux/src/
Dlabel_backends_android.c53 unsigned int ii, jj; in nodups_specs() local
58 for (jj = ii + 1; jj < data->nspec; jj++) { in nodups_specs()
59 if (!strcmp(spec_arr[jj].property_key, in nodups_specs()
63 if (strcmp(spec_arr[jj].lr.ctx_raw, in nodups_specs()
69 spec_arr[jj].lr.ctx_raw, in nodups_specs()
/third_party/openssl/test/testutil/
Ddriver.c176 int ii, i, jj, j, jstep; in run_tests() local
234 for (jj = 0; jj < all_tests[i].num; jj++) { in run_tests()
253 test_verdict(verdict, "%d - %s", jj + 1, test_title); in run_tests()
256 jj + 1, j + 1); in run_tests()
/third_party/openssl/crypto/evp/
Dbio_b64.c263 int z, jj; in b64_read() local
265 jj = i & ~3; /* process per 4 */ in b64_read()
267 (unsigned char *)ctx->tmp, jj); in b64_read()
268 if (jj > 2) { in b64_read()
269 if (ctx->tmp[jj - 1] == '=') { in b64_read()
271 if (ctx->tmp[jj - 2] == '=') in b64_read()
278 if (jj != i) { in b64_read()
279 memmove(ctx->tmp, &ctx->tmp[jj], i - jj); in b64_read()
280 ctx->tmp_len = i - jj; in b64_read()
/third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/cpu/nnacl/base/
Dslice_base.c69 for (int jj = 0; jj < param->size_[1]; ++jj) { in DoSlice() local
70 int out_offset1 = jj * out_stride[1] + out_offset0; in DoSlice()
71 int in_offset1 = (jj + param->begin_[1]) * in_stride[1] + in_offset0; in DoSlice()
/third_party/boost/libs/contract/test/call_if/
Dno_equal_error.cpp35 j jj(456); in main() local
37 push_back(vj, jj); in main()
Dno_equal_call_if.cpp58 j jj(456); in main() local
61 push_back(vj, jj); in main()
/third_party/boost/libs/iterator/test/
Dindirect_iterator_test.cpp185 for (int jj = 0; jj < N; ++jj) in BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF() local
186 shared.push_back(boost::shared_ptr<dummyT>(new dummyT(jj))); in BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF()
/third_party/glib/glib/glib-mirroring-tab/
Dpacktab.c285 int kk, jj; in write_array() local
313 jj = i; in write_array()
315 if (x[j] > x[i] && (x[j] < x[jj] || jj == i)) in write_array()
316 jj = j; in write_array()
317 i = jj; in write_array()
/third_party/boost/tools/boost_install/test/iostreams/bzip2-1.0.6/
Ddecompress.c360 Int32 ii, jj, kk; in BZ2_decompress() local
363 for (jj = MTFL_SIZE-1; jj >= 0; jj--) { in BZ2_decompress()
364 s->mtfa[kk] = (UChar)(ii * MTFL_SIZE + jj); in BZ2_decompress()
425 Int32 ii, jj, kk, pp, lno, off; in BZ2_decompress() local
466 for (jj = MTFL_SIZE-1; jj >= 0; jj--) { in BZ2_decompress()
467 s->mtfa[kk] = s->mtfa[s->mtfbase[ii] + jj]; in BZ2_decompress()
/third_party/bzip2/
Ddecompress.c366 Int32 ii, jj, kk; in BZ2_decompress() local
369 for (jj = MTFL_SIZE-1; jj >= 0; jj--) { in BZ2_decompress()
370 s->mtfa[kk] = (UChar)(ii * MTFL_SIZE + jj); in BZ2_decompress()
431 Int32 ii, jj, kk, pp, lno, off; in BZ2_decompress() local
472 for (jj = MTFL_SIZE-1; jj >= 0; jj--) { in BZ2_decompress()
473 s->mtfa[kk] = s->mtfa[s->mtfbase[ii] + jj]; in BZ2_decompress()

123456