/external/v8/test/mjsunit/ |
large-object-literal.js | 28 // Test that we can create object literals of various sizes. 49 // The sizes to test. 50 var sizes = [0, 1, 2, 100, 200, 400, 1000]; variable 53 for (var i = 0; i < sizes.length; i++) { 54 testLiteral(sizes[i]);
|
object-literal-gc.js | 59 // The sizes to test. 60 var sizes = [0, 1, 2, 100, 200, 400, 1000]; variable 63 for (var i = 0; i < sizes.length; i++) { 64 testLiteral(sizes[i]);
|
big-array-literal.js | 83 // The sizes to test. 84 var sizes = [1, 2, 100, 200, 300]; variable 87 for (var i = 0; i < sizes.length; i++) { 88 testLiteral(sizes[i], false); 89 testLiteral(sizes[i], true);
|
big-object-literal.js | 86 // The sizes to test. 87 var sizes = [1, 2, 100, 200]; variable 90 for (var i = 0; i < sizes.length; i++) { 91 testLiteral(sizes[i], false); 92 testLiteral(sizes[i], true);
|
sparse-array-reverse.js | 66 var sizes = [140, 40000, VERYLARGE]; variable 72 for (var size_pos = 0; size_pos < sizes.length; size_pos++) { 73 var size = sizes[size_pos];
|
/external/dropbear/libtommath/ |
bn_mp_prime_rabin_miller_trials.c | 21 } sizes[] = { variable in typeref:struct:__anon7196 37 for (x = 0; x < (int)(sizeof(sizes)/(sizeof(sizes[0]))); x++) { 38 if (sizes[x].k == size) { 39 return sizes[x].t; 40 } else if (sizes[x].k > size) { 41 return (x == 0) ? sizes[0].t : sizes[x - 1].t; 44 return sizes[x-1].t + 1;
|
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.gslice.array/gslice.array.assign/ |
gslice_array.pass.cpp | 33 typedef std::valarray<std::size_t> sizes; typedef 35 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), 37 = v2[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
valarray.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.gslice.array/gslice.array.comp.assign/ |
addition.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
and.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
divide.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
modulo.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
multiply.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
or.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
subtraction.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
xor.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
shift_left.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
shift_right.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.gslice.array/gslice.array.fill/ |
assign_value.pass.cpp | 28 typedef std::valarray<std::size_t> sizes; typedef 30 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.assign/ |
gslice_array_assign.pass.cpp | 28 typedef std::valarray<std::size_t> sizes; typedef 31 v = v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.cons/ |
gslice_array.pass.cpp | 28 typedef std::valarray<std::size_t> sizes; typedef 30 std::valarray<int> v(v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.sub/ |
gslice_const.pass.cpp | 31 typedef std::valarray<std::size_t> sizes; typedef 33 v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
gslice_non_const.pass.cpp | 28 typedef std::valarray<std::size_t> sizes; typedef 30 std::valarray<int> v(v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])),
|
/external/dropbear/libtommath/etc/ |
2kprime.c | 5 int sizes[] = {256, 512, 768, 1024, 1536, 2048, 3072, 4096}; variable 19 for (x = 0; x < (int)(sizeof(sizes) / sizeof(sizes[0])); x++) { 21 mp_2expt(&q, sizes[x]); 31 printf("No primes of size %d found\n", sizes[x]); 65 ++sizes[x]; 70 printf("\n\n%d-bits (k = %lu) = %s\n", sizes[x], z, buf); 71 fprintf(out, "%d-bits (k = %lu) = %s\n", sizes[x], z, buf); fflush(out);
|
drprime.c | 4 int sizes[] = { 1+256/DIGIT_BIT, 1+512/DIGIT_BIT, 1+768/DIGIT_BIT, 1+1024/DIGIT_BIT, 1+2048/DIGIT_BIT, 1+4096/DIGIT_BIT }; variable 16 for (x = 0; x < (int)(sizeof(sizes)/sizeof(sizes[0])); x++) { 18 printf("Seeking a %d-bit safe prime\n", sizes[x] * DIGIT_BIT); 19 mp_grow(&a, sizes[x]); 21 for (y = 1; y < sizes[x]; y++) { 27 a.used = sizes[x]; 46 printf("Error not DR modulus\n"); sizes[x] += 1; goto top;
|