Home
last modified time | relevance | path

Searched refs:rng (Results 1 – 25 of 145) sorted by relevance

123456

/external/libcxx/test/containers/sequences/deque/deque.modifiers/
Dpush_back.pass.cpp46 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; in test() local
47 const int N = sizeof(rng)/sizeof(rng[0]); in test()
50 C c = make<C>(size, rng[j]); in test()
60 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
61 const int N = sizeof(rng)/sizeof(rng[0]); in main()
63 test<std::deque<int> >(rng[j]); in main()
67 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
68 const int N = sizeof(rng)/sizeof(rng[0]); in main()
70 test<std::deque<int, min_allocator<int>> >(rng[j]); in main()
Dpush_back_rvalue.pass.cpp49 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; in test() local
50 const int N = sizeof(rng)/sizeof(rng[0]); in test()
53 C c = make<C>(size, rng[j]); in test()
66 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
67 const int N = sizeof(rng)/sizeof(rng[0]); in main()
69 test<std::deque<MoveOnly> >(rng[j]); in main()
73 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
74 const int N = sizeof(rng)/sizeof(rng[0]); in main()
76 test<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[j]); in main()
Dpop_front.pass.cpp69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
70 const int N = sizeof(rng)/sizeof(rng[0]); in main()
73 testN<std::deque<int> >(rng[i], rng[j]); in main()
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
78 const int N = sizeof(rng)/sizeof(rng[0]); in main()
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
Demplace_back.pass.cpp71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
72 const int N = sizeof(rng)/sizeof(rng[0]); in main()
75 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main()
79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
80 const int N = sizeof(rng)/sizeof(rng[0]); in main()
83 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
Dpop_back.pass.cpp69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
70 const int N = sizeof(rng)/sizeof(rng[0]); in main()
73 testN<std::deque<int> >(rng[i], rng[j]); in main()
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
78 const int N = sizeof(rng)/sizeof(rng[0]); in main()
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
Demplace_front.pass.cpp71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
72 const int N = sizeof(rng)/sizeof(rng[0]); in main()
75 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main()
79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
80 const int N = sizeof(rng)/sizeof(rng[0]); in main()
83 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
Dpush_front.pass.cpp68 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
69 const int N = sizeof(rng)/sizeof(rng[0]); in main()
72 testN<std::deque<int> >(rng[i], rng[j]); in main()
76 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
77 const int N = sizeof(rng)/sizeof(rng[0]); in main()
80 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
Dpush_front_rvalue.pass.cpp74 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
75 const int N = sizeof(rng)/sizeof(rng[0]); in main()
78 testN<std::deque<MoveOnly> >(rng[i], rng[j]); in main()
82 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
83 const int N = sizeof(rng)/sizeof(rng[0]); in main()
86 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]); in main()
Derase_iter.pass.cpp75 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
76 const int N = sizeof(rng)/sizeof(rng[0]); in main()
79 testN<std::deque<int> >(rng[i], rng[j]); in main()
83 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
84 const int N = sizeof(rng)/sizeof(rng[0]); in main()
87 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
Demplace.pass.cpp96 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
97 const int N = sizeof(rng)/sizeof(rng[0]); in main()
100 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main()
104 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
105 const int N = sizeof(rng)/sizeof(rng[0]); in main()
108 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
Derase_iter_iter.pass.cpp79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
80 const int N = sizeof(rng)/sizeof(rng[0]); in main()
83 testN<std::deque<int> >(rng[i], rng[j]); in main()
87 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
88 const int N = sizeof(rng)/sizeof(rng[0]); in main()
91 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
Dinsert_rvalue.pass.cpp102 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
103 const int N = sizeof(rng)/sizeof(rng[0]); in main()
106 testN<std::deque<MoveOnly> >(rng[i], rng[j]); in main()
110 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
111 const int N = sizeof(rng)/sizeof(rng[0]); in main()
114 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]); in main()
/external/libcxx/test/containers/sequences/deque/deque.cons/
Dassign_size_value.pass.cpp68 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
69 const int N = sizeof(rng)/sizeof(rng[0]); in main()
73 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
78 const int N = sizeof(rng)/sizeof(rng[0]); in main()
82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
Dassign_iter_iter.pass.cpp90 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
91 const int N = sizeof(rng)/sizeof(rng[0]); in main()
95 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
100 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
101 const int N = sizeof(rng)/sizeof(rng[0]); in main()
105 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
/external/libcxx/test/containers/sequences/deque/deque.capacity/
Dresize_size.pass.cpp69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
70 const int N = sizeof(rng)/sizeof(rng[0]); in main()
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
79 const int N = sizeof(rng)/sizeof(rng[0]); in main()
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]); in main()
Dresize_size_value.pass.cpp69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
70 const int N = sizeof(rng)/sizeof(rng[0]); in main()
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
79 const int N = sizeof(rng)/sizeof(rng[0]); in main()
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]); in main()
Dshrink_to_fit.pass.cpp62 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
63 const int N = sizeof(rng)/sizeof(rng[0]); in main()
66 testN<std::deque<int> >(rng[i], rng[j]); in main()
70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
71 const int N = sizeof(rng)/sizeof(rng[0]); in main()
74 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
/external/libopus/celt/
Dentenc.c103 while(_this->rng<=EC_CODE_BOT){ in ec_enc_normalize()
107 _this->rng<<=EC_SYM_BITS; in ec_enc_normalize()
120 _this->rng=EC_CODE_TOP; in ec_enc_init()
130 r=_this->rng/_ft; in ec_encode()
132 _this->val+=_this->rng-IMUL32(r,(_ft-_fl)); in ec_encode()
133 _this->rng=IMUL32(r,(_fh-_fl)); in ec_encode()
135 else _this->rng-=IMUL32(r,(_ft-_fh)); in ec_encode()
141 r=_this->rng>>_bits; in ec_encode_bin()
143 _this->val+=_this->rng-IMUL32(r,((1U<<_bits)-_fl)); in ec_encode_bin()
144 _this->rng=IMUL32(r,(_fh-_fl)); in ec_encode_bin()
[all …]
/external/chromium_org/third_party/opus/src/celt/
Dentenc.c103 while(_this->rng<=EC_CODE_BOT){ in ec_enc_normalize()
107 _this->rng<<=EC_SYM_BITS; in ec_enc_normalize()
120 _this->rng=EC_CODE_TOP; in ec_enc_init()
130 r=_this->rng/_ft; in ec_encode()
132 _this->val+=_this->rng-IMUL32(r,(_ft-_fl)); in ec_encode()
133 _this->rng=IMUL32(r,(_fh-_fl)); in ec_encode()
135 else _this->rng-=IMUL32(r,(_ft-_fh)); in ec_encode()
141 r=_this->rng>>_bits; in ec_encode_bin()
143 _this->val+=_this->rng-IMUL32(r,((1U<<_bits)-_fl)); in ec_encode_bin()
144 _this->rng=IMUL32(r,(_fh-_fl)); in ec_encode_bin()
[all …]
/external/chromium_org/net/quic/crypto/
Dquic_random_test.cc19 QuicRandom* rng = QuicRandom::GetInstance(); in TEST() local
20 rng->RandBytes(buf1, sizeof(buf1)); in TEST()
25 QuicRandom* rng = QuicRandom::GetInstance(); in TEST() local
26 uint64 value1 = rng->RandUint64(); in TEST()
27 uint64 value2 = rng->RandUint64(); in TEST()
35 QuicRandom* rng = QuicRandom::GetInstance(); in TEST() local
36 rng->Reseed(buf, sizeof(buf)); in TEST()
/external/libcxx/test/containers/sequences/deque/deque.special/
Dswap.pass.cpp57 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
58 const int N = sizeof(rng)/sizeof(rng[0]); in main()
62 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
90 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
91 const int N = sizeof(rng)/sizeof(rng[0]); in main()
95 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
Dcopy_backward.pass.cpp72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
73 const int N = sizeof(rng)/sizeof(rng[0]); in main()
76 testN<std::deque<int> >(rng[i], rng[j]); in main()
80 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
81 const int N = sizeof(rng)/sizeof(rng[0]); in main()
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
Dmove.pass.cpp72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
73 const int N = sizeof(rng)/sizeof(rng[0]); in main()
76 testN<std::deque<int> >(rng[i], rng[j]); in main()
80 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
81 const int N = sizeof(rng)/sizeof(rng[0]); in main()
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
Dcopy.pass.cpp73 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
74 const int N = sizeof(rng)/sizeof(rng[0]); in main()
77 testN<std::deque<int> >(rng[i], rng[j]); in main()
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
82 const int N = sizeof(rng)/sizeof(rng[0]); in main()
85 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
Dmove_backward.pass.cpp72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
73 const int N = sizeof(rng)/sizeof(rng[0]); in main()
76 testN<std::deque<int> >(rng[i], rng[j]); in main()
80 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
81 const int N = sizeof(rng)/sizeof(rng[0]); in main()
84 testN<std::deque<int, min_allocator<int> > >(rng[i], rng[j]); in main()

123456