Searched refs:N1 (Results 1 - 25 of 147) sorted by relevance

123456

/external/clang/test/Modules/
H A Dmisplaced-1.cpp4 namespace N1 { // expected-note{{namespace 'N1' begins here}} namespace
5 #include "dummy.h" // expected-error{{import of module 'dummy' appears within namespace 'N1'}}
/external/clang/test/SemaTemplate/
H A Dtemp_explicit_cxx0x.cpp2 namespace N1 { namespace
16 template struct ::N1::Inner::X1<float>;
19 using namespace N1;
21 template struct X0<double>; // expected-error{{must occur in namespace 'N1'}}
/external/clang/test/SemaCXX/
H A Dout-of-line-def-mismatch.cpp6 namespace N1 { namespace in namespace:N2
10 void func(S1*); // expected-note {{type of 1st parameter of member declaration does not match definition ('N2::S1 *' vs 'N2::N1::S1 *')}}
11 void func(C1&, unsigned, const S1*); // expected-note {{type of 3rd parameter of member declaration does not match definition ('const N2::S1 *' vs 'const N2::N1::S1 *')}}
12 void func(const S1*, unsigned); //expected-note {{type of 1st parameter of member declaration does not match definition ('const N2::S1 *' vs 'N2::N1::S1')}}
20 void N2::N1::S2::func(S1*) {} // expected-error {{out-of-line definition of 'func' does not match any declaration in 'N2::N1::S2'}}
21 void N2::N1::S2::func(C1&, unsigned, const S1*) {} // expected-error {{out-of-line definition of 'func' does not match any declaration in 'N2::N1::S2'}}
22 void N2::N1::S2::func(S1*, double) {} // expected-error {{out-of-line definition of 'func' does not match any declaration in 'N2::N1
[all...]
/external/libcxx/test/std/numerics/numarray/template.valarray/valarray.members/
H A Dsize.pass.cpp24 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
25 std::valarray<T> v1(a1, N1);
26 assert(v1.size() == N1);
31 const unsigned N1 = 0; local
32 std::valarray<T> v1(a1, N1);
33 assert(v1.size() == N1);
37 const unsigned N1 = 0; local
39 assert(v1.size() == N1);
H A Dcshift.pass.cpp25 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
26 std::valarray<T> v1(a1, N1);
28 assert(v2.size() == N1);
29 for (unsigned i = 0; i < N1; ++i)
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
37 std::valarray<T> v1(a1, N1);
39 assert(v2.size() == N1);
40 for (unsigned i = 0; i < N1; ++i)
47 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
48 std::valarray<T> v1(a1, N1);
58 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
69 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
80 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
91 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
100 const unsigned N1 = 0; local
109 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
120 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
[all...]
H A Dshift.pass.cpp25 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
26 std::valarray<T> v1(a1, N1);
28 assert(v2.size() == N1);
29 for (unsigned i = 0; i < N1; ++i)
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
37 std::valarray<T> v1(a1, N1);
39 assert(v2.size() == N1);
40 for (unsigned i = 0; i < N1; ++i)
47 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
48 std::valarray<T> v1(a1, N1);
58 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
69 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
80 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
91 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
100 const unsigned N1 = 0; local
109 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
120 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
[all...]
H A Dsum.pass.cpp24 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
25 std::valarray<T> v1(a1, N1);
H A Dmax.pass.cpp24 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
25 std::valarray<T> v1(a1, N1);
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
37 std::valarray<T> v1(a1, N1);
H A Dmin.pass.cpp24 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
25 std::valarray<T> v1(a1, N1);
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
37 std::valarray<T> v1(a1, N1);
H A Dapply_cref.pass.cpp28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
29 std::valarray<T> v1(a1, N1);
31 assert(v2.size() == N1);
32 for (unsigned i = 0; i < N1; ++i)
36 const unsigned N1 = 0; local
39 assert(v2.size() == N1);
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
45 std::valarray<T> v1(a1, N1);
47 assert(v2.size() == N1);
48 for (unsigned i = 0; i < N1;
[all...]
H A Dapply_value.pass.cpp28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
29 std::valarray<T> v1(a1, N1);
31 assert(v2.size() == N1);
32 for (unsigned i = 0; i < N1; ++i)
36 const unsigned N1 = 0; local
39 assert(v2.size() == N1);
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); local
45 std::valarray<T> v1(a1, N1);
47 assert(v2.size() == N1);
48 for (unsigned i = 0; i < N1;
[all...]
/external/clang/test/ASTMerge/Inputs/
H A Dnamespace1.cpp2 namespace N1 { namespace
H A Dnamespace2.cpp2 namespace N1 { namespace
/external/clang/test/CXX/basic/basic.lookup/basic.lookup.argdep/
H A Dp2-template-id.cpp4 namespace N1 { namespace
15 int &ir = f((N2::Y<N1::X>*)0);
20 long g(N1::X);
22 namespace N1 { namespace
/external/libcxx/test/std/numerics/numarray/template.valarray/valarray.assign/
H A Dmask_array_assign.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); local
23 bool b[N1] = {true, false, false, true, true, false,
25 std::valarray<int> v1(a1, N1);
26 std::valarray<bool> vb(b, N1);
/external/libcxx/test/std/numerics/numarray/template.valarray/valarray.cons/
H A Dmask_array.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); local
23 bool b[N1] = {true, false, false, true, true, false,
25 std::valarray<int> v1(a1, N1);
26 std::valarray<bool> vb(b, N1);
/external/libcxx/test/std/numerics/numarray/template.valarray/valarray.sub/
H A Dvalarray_bool_const.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); local
23 bool b[N1] = {true, false, false, true, true, false,
25 std::valarray<int> v1(a1, N1);
26 std::valarray<bool> vb(b, N1);
H A Dvalarray_bool_non_const.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); local
23 bool b[N1] = {true, false, false, true, true, false,
25 std::valarray<int> v1(a1, N1);
26 std::valarray<bool> vb(b, N1);
/external/ceres-solver/include/ceres/
H A 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) ||
58 ((N1 > 0) && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
59 ((N1 > 0) && (N2 > 0) && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
60 ((N1 > 0) && (N2 > 0) && (N3 > 0) && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
61 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && !N5 && !N6 && !N7 && !N8 && !N9) ||
62 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && !N6 && !N7 && !N8 && !N9) ||
63 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && !N7 && !N8 && !N9) ||
64 ((N1 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && !N8 && !N9) ||
65 ((N1 >
[all...]
/external/eigen/test/
H A Ddiagonal.cpp31 N1 = MatrixType::RowsAtCompileTime>2 ? 2 : 0, enumerator in enum:__anon5338
38 VERIFY(m1.template diagonal<N1>().RowsAtCompileTime == m1.diagonal(N1).size());
42 m2.template diagonal<N1>() = 2 * m1.template diagonal<N1>();
43 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1));
44 m2.template diagonal<N1>()[0] *= 3;
45 VERIFY_IS_APPROX(m2.template diagonal<N1>()[0], static_cast<Scalar>(6) * m1.template diagonal<N1>()[
[all...]
/external/valgrind/memcheck/tests/
H A Dlong_namespace_xml.cpp17 #define N1 abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz macro
33 namespace N1 { namespace
45 N1::N2::f();
/external/clang/test/PCH/
H A Dnamespaces.cpp9 N1::t1 *ip1 = &int_val;
10 N1::t2 *ip2 = &int_val;
37 using N1::used_func;
40 using N1::used_cls;
/external/libcxx/test/std/numerics/numarray/template.mask.array/mask.array.assign/
H A Dvalarray.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); local
25 bool b[N1] = {true, false, false, true, true, false,
27 std::valarray<int> v1(a1, N1);
29 assert(N2 == std::count(b, b+N1, true));
30 std::valarray<bool> vb(b, N1);
/external/libcxx/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/
H A Daddition.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); local
25 bool b[N1] = {true, false, false, true, true, false,
27 std::valarray<int> v1(a1, N1);
29 assert(N2 == std::count(b, b+N1, true));
30 std::valarray<bool> vb(b, N1);
H A Dand.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); local
25 bool b[N1] = {true, false, false, true, true, false,
27 std::valarray<int> v1(a1, N1);
29 assert(N2 == std::count(b, b+N1, true));
30 std::valarray<bool> vb(b, N1);

Completed in 657 milliseconds

123456