| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| get_param.pass.cpp | 27 const size_t Np = sizeof(p) / sizeof(p[0]);
28 P pa(b, b+Np, p);
|
| max.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]);
27 D d(b, b+Np, p);
|
| min.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]);
27 D d(b, b+Np, p);
|
| param_assign.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]);
29 P p0(b, b+Np, p);
|
| param_copy.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]);
29 P p0(b, b+Np, p);
|
| io.pass.cpp | 35 const size_t Np = sizeof(p) / sizeof(p[0]);
36 D d1(b, b+Np, p);
|
| eval.pass.cpp | 52 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
53 D d(b, b+Np+1, p);
68 std::vector<double> areas(Np);
77 for (int i = 0; i < Np+1; ++i)
81 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
102 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
103 D d(b, b+Np+1, p);
118 std::vector<double> areas(Np);
127 for (int i = 0; i < Np+1; ++i)
131 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1
[all...] |
| eval_param.pass.cpp | 50 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
52 P pa(b, b+Np+1, p);
67 std::vector<double> areas(Np);
76 for (int i = 0; i < Np+1; ++i)
80 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
|
| /external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
| io.pass.cpp | 35 const size_t Np = sizeof(p) / sizeof(p[0]);
36 D d1(b, b+Np+1, p);
|
| eval_param.pass.cpp | 44 const size_t Np = sizeof(p) / sizeof(p[0]);
46 P pa(b, b+Np+1, p);
60 for (std::size_t i = 0; i < Np; ++i)
|
| eval.pass.cpp | 42 const size_t Np = sizeof(p) / sizeof(p[0]);
43 D d(b, b+Np+1, p);
57 for (std::size_t i = 0; i < Np; ++i)
105 const size_t Np = sizeof(p) / sizeof(p[0]);
106 D d(b, b+Np+1, p);
120 for (std::size_t i = 0; i < Np; ++i)
168 const size_t Np = sizeof(p) / sizeof(p[0]);
169 D d(b, b+Np+1, p);
183 for (std::size_t i = 0; i < Np; ++i)
231 const size_t Np = sizeof(p) / sizeof(p[0])
[all...] |
| /external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| io.pass.cpp | 35 const size_t Np = sizeof(p) / sizeof(p[0]);
36 D d1(b, b+Np, p);
|
| eval.pass.cpp | 52 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
53 D d(b, b+Np+1, p);
68 std::vector<double> areas(Np);
77 for (size_t i = 0; i < Np+1; ++i)
81 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
105 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
106 D d(b, b+Np+1, p);
121 std::vector<double> areas(Np);
130 for (size_t i = 0; i < Np+1; ++i)
134 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1
[all...] |
| eval_param.pass.cpp | 50 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
52 P pa(b, b+Np+1, p);
67 std::vector<double> areas(Np);
76 for (size_t i = 0; i < Np+1; ++i)
80 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
| io.pass.cpp | 35 const size_t Np = sizeof(p) / sizeof(p[0]);
36 D d1(b, b+Np+1, p);
|
| eval_param.pass.cpp | 40 const size_t Np = sizeof(p) / sizeof(p[0]);
42 P pa(b, b+Np+1, p);
56 for (int i = 0; i < Np; ++i)
|
| eval.pass.cpp | 39 const size_t Np = sizeof(p) / sizeof(p[0]);
40 D d(b, b+Np+1, p);
54 for (int i = 0; i < Np; ++i)
99 const size_t Np = sizeof(p) / sizeof(p[0]);
100 D d(b, b+Np+1, p);
114 for (int i = 0; i < Np; ++i)
159 const size_t Np = sizeof(p) / sizeof(p[0]);
160 D d(b, b+Np+1, p);
174 for (int i = 0; i < Np; ++i)
219 const size_t Np = sizeof(p) / sizeof(p[0])
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| io.pass.cpp | 35 const size_t Np = sizeof(p) / sizeof(p[0]);
36 D d1(b, b+Np, p);
|
| eval.pass.cpp | 48 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
49 D d(b, b+Np+1, p);
64 std::vector<double> areas(Np);
73 for (int i = 0; i < Np+1; ++i)
77 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
98 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
99 D d(b, b+Np+1, p);
114 std::vector<double> areas(Np);
123 for (int i = 0; i < Np+1; ++i)
127 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1
[all...] |
| eval_param.pass.cpp | 46 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
48 P pa(b, b+Np+1, p);
63 std::vector<double> areas(Np);
72 for (int i = 0; i < Np+1; ++i)
76 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
| io.pass.cpp | 35 const size_t Np = sizeof(p) / sizeof(p[0]);
36 D d1(b, b+Np+1, p);
|
| eval_param.pass.cpp | 43 const size_t Np = sizeof(p) / sizeof(p[0]);
45 P pa(b, b+Np+1, p);
59 for (int i = 0; i < Np; ++i)
|
| eval.pass.cpp | 42 const size_t Np = sizeof(p) / sizeof(p[0]);
43 D d(b, b+Np+1, p);
57 for (int i = 0; i < Np; ++i)
102 const size_t Np = sizeof(p) / sizeof(p[0]);
103 D d(b, b+Np+1, p);
117 for (int i = 0; i < Np; ++i)
162 const size_t Np = sizeof(p) / sizeof(p[0]);
163 D d(b, b+Np+1, p);
177 for (int i = 0; i < Np; ++i)
222 const size_t Np = sizeof(p) / sizeof(p[0])
[all...] |
| /external/flac/libFLAC/ |
| window.c | 196 const FLAC__int32 Np = (FLAC__int32)(p / 2.0f * L) - 1;
201 if (Np > 0) {
202 for (n = 0; n <= Np; n++) {
203 window[n] = (FLAC__real)(0.5f - 0.5f * cos(M_PI * n / Np));
204 window[L-Np-1+n] = (FLAC__real)(0.5f - 0.5f * cos(M_PI * (n+Np) / Np));
215 FLAC__int32 Np, n, i;
223 Np = (FLAC__int32)(p / 2.0f * N);
227 for (i = 1; n < (start_n+Np) && n < L; n++, i++
[all...] |
| /external/boringssl/src/crypto/md5/asm/ |
| md5-586.pl | 28 %Ltmp1=("R0",&Np($C), "R1",&Np($C), "R2",&Np($C), "R3",&Np($D));
41 sub Np
66 &mov($tmp1,&Np($c)) if $pos < 1; # next tmp1 for R0
67 &mov($tmp1,&Np($c)) if $pos == 1; # next tmp1 for R1
91 &mov($tmp1,&Np($c)) if $pos < 1; # G function - part 1
92 &mov($tmp1,&Np($c)) if $pos == 1; # G function - part 1
120 &mov($tmp1,&Np($c))
[all...] |
