Home
last modified time | relevance | path

Searched refs:N1 (Results 1 – 25 of 178) sorted by relevance

12345678

/external/libcxx/test/std/numerics/numarray/template.valarray/valarray.members/
Dshift.pass.cpp25 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
26 std::valarray<T> v1(a1, N1); in main()
28 assert(v2.size() == N1); in main()
29 for (unsigned i = 0; i < N1; ++i) in main()
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
37 std::valarray<T> v1(a1, N1); in main()
39 assert(v2.size() == N1); in main()
40 for (unsigned i = 0; i < N1; ++i) in main()
47 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
48 std::valarray<T> v1(a1, N1); in main()
[all …]
Dcshift.pass.cpp25 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
26 std::valarray<T> v1(a1, N1); in main()
28 assert(v2.size() == N1); in main()
29 for (unsigned i = 0; i < N1; ++i) in main()
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
37 std::valarray<T> v1(a1, N1); in main()
39 assert(v2.size() == N1); in main()
40 for (unsigned i = 0; i < N1; ++i) in main()
47 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
48 std::valarray<T> v1(a1, N1); in main()
[all …]
Dapply_cref.pass.cpp28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
29 std::valarray<T> v1(a1, N1); in main()
31 assert(v2.size() == N1); in main()
32 for (unsigned i = 0; i < N1; ++i) in main()
36 const unsigned N1 = 0; in main() local
39 assert(v2.size() == N1); in main()
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
45 std::valarray<T> v1(a1, N1); in main()
47 assert(v2.size() == N1); in main()
48 for (unsigned i = 0; i < N1; ++i) in main()
Dapply_value.pass.cpp28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
29 std::valarray<T> v1(a1, N1); in main()
31 assert(v2.size() == N1); in main()
32 for (unsigned i = 0; i < N1; ++i) in main()
36 const unsigned N1 = 0; in main() local
39 assert(v2.size() == N1); in main()
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
45 std::valarray<T> v1(a1, N1); in main()
47 assert(v2.size() == N1); in main()
48 for (unsigned i = 0; i < N1; ++i) in main()
Dsize.pass.cpp24 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 std::valarray<T> v1(a1, N1); in main()
26 assert(v1.size() == N1); in main()
31 const unsigned N1 = 0; in main() local
32 std::valarray<T> v1(a1, N1); in main()
33 assert(v1.size() == N1); in main()
37 const unsigned N1 = 0; in main() local
39 assert(v1.size() == N1); in main()
/external/eigen/test/
Ddiagonal.cpp31 N1 = MatrixType::RowsAtCompileTime>2 ? 2 : 0, in diagonal() enumerator
38 VERIFY(m1.template diagonal<N1>().RowsAtCompileTime == m1.diagonal(N1).size()); in diagonal()
42 m2.template diagonal<N1>() = 2 * m1.template diagonal<N1>(); in diagonal()
43 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1)); in diagonal()
44 m2.template diagonal<N1>()[0] *= 3; in diagonal()
45 …VERIFY_IS_APPROX(m2.template diagonal<N1>()[0], static_cast<Scalar>(6) * m1.template diagonal<N1>(… in diagonal()
52 m2.diagonal(N1) = 2 * m1.diagonal(N1); in diagonal()
53 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1)); in diagonal()
54 m2.diagonal(N1)[0] *= 3; in diagonal() local
55 VERIFY_IS_APPROX(m2.diagonal(N1)[0], static_cast<Scalar>(6) * m1.diagonal(N1)[0]); in diagonal()
/external/ceres-solver/include/ceres/internal/
Dautodiff.h206 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
216 DCHECK((!N1 && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in Differentiate()
217 ((N1 > 0) && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in Differentiate()
218 ((N1 > 0) && (N2 > 0) && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in Differentiate()
219 ((N1 > 0) && (N2 > 0) && (N3 > 0) && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in Differentiate()
220 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && !N5 && !N6 && !N7 && !N8 && !N9) || in Differentiate()
221 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && !N6 && !N7 && !N8 && !N9) || in Differentiate()
222 … ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && !N7 && !N8 && !N9) || in Differentiate()
223 …((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && !N8 && !N9) || in Differentiate()
224 …((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && (N8 > 0) && !… in Differentiate()
[all …]
Dvariadic_evaluate.h49 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
67 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
69 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, N7, N8, 0> {
84 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
86 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, N7, 0, 0> {
100 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
102 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, 0, 0, 0> {
115 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
117 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, 0, 0, 0, 0> {
129 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4>
[all …]
Dnumeric_diff.h53 int N0, int N1, int N2, int N3, int N4,
61 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Call( in EvaluateImpl()
68 int N0, int N1, int N2, int N3, int N4,
83 int N0, int N1, int N2, int N3, int N4,
143 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( in EvaluateJacobianForParameterBlock()
159 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( in EvaluateJacobianForParameterBlock()
183 int N0, int N1, int N2, int N3, int N4,
187 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9,
/external/ceres-solver/include/ceres/
Dsized_cost_function.h48 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
57 CHECK((!N1 && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in SizedCostFunction()
58 ((N1 > 0) && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in SizedCostFunction()
59 ((N1 > 0) && (N2 > 0) && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in SizedCostFunction()
60 ((N1 > 0) && (N2 > 0) && (N3 > 0) && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in SizedCostFunction()
61 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && !N5 && !N6 && !N7 && !N8 && !N9) || in SizedCostFunction()
62 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && !N6 && !N7 && !N8 && !N9) || in SizedCostFunction()
63 … ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && !N7 && !N8 && !N9) || in SizedCostFunction()
64 …((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && !N8 && !N9) || in SizedCostFunction()
65 …((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && (N8 > 0) && !… in SizedCostFunction()
[all …]
Dcost_function_to_functor.h103 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) || in CostFunctionToFunctor()
116 ((N1 > 0) && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in CostFunctionToFunctor()
117 ((N1 > 0) && (N2 > 0) && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in CostFunctionToFunctor()
118 ((N1 > 0) && (N2 > 0) && (N3 > 0) && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) || in CostFunctionToFunctor()
119 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && !N5 && !N6 && !N7 && !N8 && !N9) || in CostFunctionToFunctor()
120 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && !N6 && !N7 && !N8 && !N9) || in CostFunctionToFunctor()
121 … ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && !N7 && !N8 && !N9) || in CostFunctionToFunctor()
122 …((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && !N8 && !N9) || in CostFunctionToFunctor()
123 …((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && (N8 > 0) && !… in CostFunctionToFunctor()
[all …]
Dnumeric_diff_cost_function.h178 int N1 = 0, // Number of parameters in block 1.
189 N0, N1, N2, N3, N4,
201 N0, N1, N2, N3, N4, in functor_()
219 const int kNumParameters = N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9; in Evaluate()
221 (N0 > 0) + (N1 > 0) + (N2 > 0) + (N3 > 0) + (N4 > 0) + in Evaluate()
226 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( in Evaluate()
243 if (N1) parameters_reference_copy[1] = parameters_reference_copy[0] + N0; in Evaluate()
244 if (N2) parameters_reference_copy[2] = parameters_reference_copy[1] + N1; in Evaluate()
276 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9, \ in Evaluate()
283 N0, N1, N2, N3, N4, \ in Evaluate()
Dautodiff_cost_function.h157 int N1 = 0, // Number of parameters in block 1.
167 N0, N1, N2, N3, N4,
190 N0, N1, N2, N3, N4, in AutoDiffCostFunction()
207 CostFunctor, double, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9> in Evaluate()
211 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Differentiate( in Evaluate()
215 N0, N1, N2, N3, N4, in Evaluate()
/external/llvm/include/llvm/ADT/
DStringSwitch.h89 template<unsigned N0, unsigned N1>
91 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
95 (N1-1 == Str.size() && std::memcmp(S1, Str.data(), N1-1) == 0))) { in Cases()
102 template<unsigned N0, unsigned N1, unsigned N2>
104 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
108 (N1-1 == Str.size() && std::memcmp(S1, Str.data(), N1-1) == 0) || in Cases()
116 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
118 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
123 (N1-1 == Str.size() && std::memcmp(S1, Str.data(), N1-1) == 0) || in Cases()
132 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
[all …]
/external/clang/test/SemaCXX/
Dnested-name-spec.cpp326 struct C2 { static const unsigned N1 = 1; }; member
331 const int N1 = 2; variable
345 int f(C1::C2), C2 : N1;
354 int f[C2::N1];
357 int f[C2:N1]; // expected-error{{unexpected ':' in nested name specifier; did you mean '::'?}}
361 int f(int xx[B1::B3 ? C2::N1 : B1::B2]);
364 …int f(int xx[B1::B3 ? C2::N1 : B1:B2]); // expected-error{{unexpected ':' in nested name specifie…
367 …int f(int xx[B1:B3 ? C2::N1 : B1::B2]); // expected-error{{unexpected ':' in nested name specifie…
378 int C2:N1;
392 static const unsigned N1 = N; member
[all …]
Dout-of-line-def-mismatch.cpp6 namespace N1 { namespace
20 void N2::N1::S2::func(S1*) {} // expected-error {{out-of-line definition of 'func' does not match a… in func()
21 void N2::N1::S2::func(C1&, unsigned, const S1*) {} // expected-error {{out-of-line definition of 'f… in func()
22 void N2::N1::S2::func(S1*, double) {} // expected-error {{out-of-line definition of 'func' does not… in func()
23 void N2::N1::S2::func(S1, unsigned) {} // expected-error {{out-of-line definition of 'func' does no… in func()
24 void N2::N1::S2::func(unsigned*, S1*) {} // expected-error {{out-of-line definition of 'func' does … in func()
/external/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp251 SDValue visitANDLike(SDValue N0, SDValue N1, SDNode *LocReference);
253 SDValue visitORLike(SDValue N0, SDValue N1, SDNode *LocReference);
335 SDValue SimplifySelect(SDLoc DL, SDValue N0, SDValue N1, SDValue N2);
336 SDValue SimplifySelectCC(SDLoc DL, SDValue N0, SDValue N1, SDValue N2,
339 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond,
361 SDValue MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
363 SDValue MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1);
744 SDValue N0, N1, N2; in isOneUseSetCC() local
745 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) in isOneUseSetCC()
825 SDValue N0, SDValue N1) { in ReassociateOps() argument
[all …]
/external/libcxx/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/
Ddivide.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Daddition.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Dsubtraction.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Dmultiply.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Dmodulo.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Dor.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Dand.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
/external/libcxx/test/std/numerics/numarray/template.mask.array/mask.array.assign/
Dvalarray.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()

12345678