HomeSort by relevance Sort by last modified time
    Searched defs:rng (Results 1 - 25 of 58) sorted by null

1 2 3

  /libcore/benchmarks/src/benchmarks/regression/
RandomBenchmark.java 27 Random rng = new Random(); local
28 rng.nextInt();
33 Random rng = new Random(); local
35 rng.nextInt();
40 SecureRandom rng = new SecureRandom(); local
42 rng.nextInt();
48 SecureRandom rng = new SecureRandom(); local
49 rng.nextInt();
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.modifiers/
push_back.pass.cpp 42 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; local
43 const int N = sizeof(rng)/sizeof(rng[0]);
46 std::deque<int> c = make(size, rng[j]);
55 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
56 const int N = sizeof(rng)/sizeof(rng[0]);
58 test(rng[j]);
push_back_rvalue.pass.cpp 46 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; local
47 const int N = sizeof(rng)/sizeof(rng[0]);
50 std::deque<MoveOnly> c = make(size, rng[j]);
62 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
63 const int N = sizeof(rng)/sizeof(rng[0]);
65 test(rng[j]);
emplace.pass.cpp 93 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
94 const int N = sizeof(rng)/sizeof(rng[0]);
97 testN(rng[i], rng[j]);
emplace_back.pass.cpp 68 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
69 const int N = sizeof(rng)/sizeof(rng[0]);
72 testN(rng[i], rng[j]);
emplace_front.pass.cpp 68 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
69 const int N = sizeof(rng)/sizeof(rng[0]);
72 testN(rng[i], rng[j]);
erase_iter_iter.pass.cpp 75 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
76 const int N = sizeof(rng)/sizeof(rng[0]);
79 testN(rng[i], rng[j]);
insert_rvalue.pass.cpp 99 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
100 const int N = sizeof(rng)/sizeof(rng[0]);
103 testN(rng[i], rng[j]);
pop_back.pass.cpp 65 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
66 const int N = sizeof(rng)/sizeof(rng[0]);
69 testN(rng[i], rng[j]);
pop_front.pass.cpp 65 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
66 const int N = sizeof(rng)/sizeof(rng[0]);
69 testN(rng[i], rng[j]);
push_front.pass.cpp 64 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
65 const int N = sizeof(rng)/sizeof(rng[0]);
68 testN(rng[i], rng[j]);
push_front_rvalue.pass.cpp 71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
72 const int N = sizeof(rng)/sizeof(rng[0]);
75 testN(rng[i], rng[j]);
insert_size_value.pass.cpp 134 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
135 const int N = sizeof(rng)/sizeof(rng[0]);
139 testN(rng[i], rng[j], rng[k]);
insert_value.pass.cpp 118 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
119 const int N = sizeof(rng)/sizeof(rng[0]);
122 testN(rng[i], rng[j]);
  /external/dropbear/libtommath/mtest/
mtest.c 42 FILE *rng; variable
49 size = 1 + ((fgetc(rng)<<8) + fgetc(rng)) % 101;
50 buf[0] = (fgetc(rng)&1)?1:0;
51 fread(buf+1, 1, size, rng);
52 while (buf[1] == 0) buf[1] = fgetc(rng);
61 size = 10 + ((fgetc(rng)<<8) + fgetc(rng)) % 101;
62 buf[0] = (fgetc(rng)&1)?1:0;
63 fread(buf+1, 1, size, rng);
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.capacity/
resize_size.pass.cpp 65 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
66 const int N = sizeof(rng)/sizeof(rng[0]);
70 testN(rng[i], rng[j], rng[k]);
resize_size_value.pass.cpp 65 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
66 const int N = sizeof(rng)/sizeof(rng[0]);
70 testN(rng[i], rng[j], rng[k]);
shrink_to_fit.pass.cpp 57 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
58 const int N = sizeof(rng)/sizeof(rng[0]);
61 testN(rng[i], rng[j]);
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.cons/
assign_size_value.pass.cpp 65 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
66 const int N = sizeof(rng)/sizeof(rng[0]);
70 testN(rng[i], rng[j], rng[k]);
assign_iter_iter.pass.cpp 86 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
87 const int N = sizeof(rng)/sizeof(rng[0]);
91 testN(rng[i], rng[j], rng[k]);
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.special/
copy.pass.cpp 70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
71 const int N = sizeof(rng)/sizeof(rng[0]);
74 testN(rng[i], rng[j]);
copy_backward.pass.cpp 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
70 const int N = sizeof(rng)/sizeof(rng[0]);
73 testN(rng[i], rng[j]);
move.pass.cpp 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
70 const int N = sizeof(rng)/sizeof(rng[0]);
73 testN(rng[i], rng[j]);
move_backward.pass.cpp 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
70 const int N = sizeof(rng)/sizeof(rng[0]);
73 testN(rng[i], rng[j]);
swap.pass.cpp 55 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
56 const int N = sizeof(rng)/sizeof(rng[0]);
60 testN(rng[i], rng[j], rng[k]);

Completed in 292 milliseconds

1 2 3