| /external/clang/test/Modules/Inputs/ |
| namespaces-left.h | 29 namespace N2 {
|
| /external/ceres-solver/include/ceres/ |
| cost_function_to_functor.h | 103 int N0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
115 CHECK((!N1 && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
116 ((N1 > 0) && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
117 ((N1 > 0) && (N2 > 0) && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
118 ((N1 > 0) && (N2 > 0) && (N3 > 0) && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
119 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && !N5 && !N6 && !N7 && !N8 && !N9) ||
120 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && !N6 && !N7 && !N8 && !N9) ||
121 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && !N7 && !N8 && !N9) ||
122 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && !N8 && !N9) ||
123 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && (N8 > 0) && !N9) |
[all...] |
| gradient_checker.h | 65 int M = 0, int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0>
139 if (N2) {
140 CHECK_EQ(N2, block_sizes[2]);
178 NumericDiffCostFunction<CostFunctionToProbe, CENTRAL, M, N0, N1, N2, N3, N4>
|
| numeric_diff_functor.h | 114 int N0 = 0, int N1 = 0 , int N2 = 0, int N3 = 0, int N4 = 0,
125 N0, N1, N2, N3, N4,
136 N0, N1, N2, N3, N4,
345 N0, N1, N2, N3, N4,
|
| /external/flac/libFLAC/ |
| window.c | 99 const double N2 = (double)N / 2.;
103 double k = ((double)n - N2) / N2;
121 const double N2 = (double)N / 2.;
125 const double k = ((double)n - N2) / (stddev * N2);
216 const double N2 = (double)N / 2.;
220 const double k = ((double)n - N2) / N2;
|
| /external/chromium_org/third_party/opus/src/silk/ |
| ana_filt_bank_1.c | 47 opus_int k, N2 = silk_RSHIFT( N, 1 );
51 for( k = 0; k < N2; k++ ) {
|
| /external/libopus/silk/ |
| ana_filt_bank_1.c | 47 opus_int k, N2 = silk_RSHIFT( N, 1 );
51 for( k = 0; k < N2; k++ ) {
|
| /external/llvm/unittests/IR/ |
| MDBuilderTest.cpp | 87 MDNode *N2 = MDHelper.createTBAANode("Node", R, true);
91 EXPECT_NE(N0, N2);
94 EXPECT_GE(N2->getNumOperands(), 3U);
97 EXPECT_TRUE(isa<MDString>(N2->getOperand(0)));
100 EXPECT_EQ(cast<MDString>(N2->getOperand(0))->getString(), "Node");
103 EXPECT_EQ(N2->getOperand(1), R);
104 EXPECT_TRUE(isa<ConstantInt>(N2->getOperand(2)));
105 EXPECT_EQ(cast<ConstantInt>(N2->getOperand(2))->getZExtValue(), 1U);
|
| /frameworks/base/core/java/android/os/ |
| WorkSource.java | 360 final int N2 = other.mNum;
365 while (i1 < N1 && i2 < N2) {
367 + " of " + N2);
393 final int N2 = other.mNum;
399 while (i1 < N1 && i2 < N2) {
401 + " of " + N2 + ": " + uids1[i1] + " " + names1[i1]);
454 final int N2 = other.mNum;
460 while (i1 < N1 || i2 < N2) {
462 + " of " + N2);
463 if (i1 >= N1 || (i2 < N2 && uids2[i2] < uids1[i1]))
[all...] |
| /external/clang/test/SemaTemplate/ |
| instantiate-declref.cpp | 41 namespace N2 {
70 template struct N2::Outer2::Inner<float>;
71 template struct N2::Outer2::Inner<int*, float*>; // expected-note{{instantiation}}
|
| instantiate-expr-2.cpp | 13 namespace N2 {
26 one_byte operator+(N1::X, N2::Y);
43 typedef N4::BinOpOverload<N1::X, N2::Y>::type XY;
47 typedef N4::BinOpOverload<N2::Y, N2::Y>::type YY;
|
| /external/clang/test/Misc/ |
| diag-template-diffing-color.cpp | 83 A<0, 2, 0> N2 = M;
|
| /external/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.assign/ |
| indirect_array.pass.cpp | 30 const std::size_t N2 = sizeof(a2)/sizeof(a2[0]);
35 const std::valarray<int> v2(a2, N2);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.assign/ |
| indirect_array.pass.cpp | 30 const std::size_t N2 = sizeof(a2)/sizeof(a2[0]);
35 const std::valarray<int> v2(a2, N2);
|
| /frameworks/base/core/java/android/content/pm/ |
| Signature.java | 128 final int N2 = N*2;
129 char[] text = existingArray == null || N2 > existingArray.length
130 ? new char[N2] : existingArray;
|
| /external/clang/test/CodeGen/ |
| xcore-stringtype.c | 114 // CHECK: m(N2){b(2:si)},m(){b(4:ui)},m(){b(4:si)},m(){b(4:c:si)},
127 struct SB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4;
143 // CHECK: !"f{si}(u(UB){m(N2){b(2:si)},m(N4){b(4:si)},m(){b(2:si)},
156 union UB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4;
|
| /external/clang/test/SemaCXX/ |
| extern-c.cpp | 136 namespace N2 {
|
| /external/speex/libspeex/ |
| filters.c | 483 int M2, N2;
488 N2 = N>>1;
489 ALLOC(xx1, M2+N2, spx_word16_t);
490 ALLOC(xx2, M2+N2, spx_word16_t);
492 for (i = 0; i < N2; i++)
493 xx1[i] = x1[N2-1-i];
495 xx1[N2+i] = mem1[2*i+1];
496 for (i = 0; i < N2; i++)
497 xx2[i] = x2[N2-1-i];
499 xx2[N2+i] = mem2[2*i+1]
[all...] |
| /external/ceres-solver/internal/ceres/ |
| parameter_block_ordering_test.cc | 51 template <int M, int N1 = 0, int N2 = 0, int N3 = 0>
52 class DummyCostFunction: public SizedCostFunction<M, N1, N2, N3> {
|
| reorder_program_test.cc | 45 template <int kNumResiduals, int N0, int N1, int N2>
47 SizedCostFunction<kNumResiduals, N0, N1, N2> {
|
| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| examples.cpp | 119 namespace N2 {
124 template<> void N2::X::foo() {}
|
| /libcore/luni/src/test/java/libcore/java/lang/ |
| ClassCastExceptionTest.java | 83 A2, B2, C2, D2, E2, F2, G2, H2, I2, J2, K2, L2, M2, N2, O2, P2, Q2, R2, S2, T2, U2, V2, W2, X2, Y2, Z2,
88 A2, B2, C2, D2, E2, F2, G2, H2, I2, J2, K2, L2, M2, N2, O2, P2, Q2, R2, S2, T2, U2, V2, W2, X2, Y2, Z2,
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAG.cpp | [all...] |
| /external/chromium_org/third_party/skia/third_party/lua/src/ |
| lundump.c | 187 #define N2 N1+2
188 #define N3 N2+6
199 if (memcmp(h,s,N2)!=0) error(S,"version mismatch in");
|
| /external/clang/test/CodeGenCXX/ |
| bitfield.cpp | 205 namespace N2 {
|
