HomeSort by relevance Sort by last modified time
    Searched refs:N1 (Results 26 - 50 of 190) sorted by null

12 3 4 5 6 7 8

  /external/valgrind/main/memcheck/tests/
long_namespace_xml.cpp 17 #define N1 abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz
32 namespace N1 {
44 N1::N2::f();
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/
minus.hpp 64 typename BOOST_MPL_AUX_NA_PARAM(N1)
69 : minus< minus< minus< minus< N1,N2 >, N3>, N4>, N5>
74 , ( N1, N2, N3, N4, N5 )
79 typename N1, typename N2, typename N3, typename N4
81 struct minus< N1,N2,N3,N4,na >
83 : minus< minus< minus< N1,N2 >, N3>, N4>
88 , ( N1, N2, N3, N4, na )
93 typename N1, typename N2, typename N3
95 struct minus< N1,N2,N3,na,na >
97 : minus< minus< N1,N2 >, N3
    [all...]
plus.hpp 64 typename BOOST_MPL_AUX_NA_PARAM(N1)
69 : plus< plus< plus< plus< N1,N2 >, N3>, N4>, N5>
74 , ( N1, N2, N3, N4, N5 )
79 typename N1, typename N2, typename N3, typename N4
81 struct plus< N1,N2,N3,N4,na >
83 : plus< plus< plus< N1,N2 >, N3>, N4>
88 , ( N1, N2, N3, N4, na )
93 typename N1, typename N2, typename N3
95 struct plus< N1,N2,N3,na,na >
97 : plus< plus< N1,N2 >, N3
    [all...]
times.hpp 64 typename BOOST_MPL_AUX_NA_PARAM(N1)
69 : times< times< times< times< N1,N2 >, N3>, N4>, N5>
74 , ( N1, N2, N3, N4, N5 )
79 typename N1, typename N2, typename N3, typename N4
81 struct times< N1,N2,N3,N4,na >
83 : times< times< times< N1,N2 >, N3>, N4>
88 , ( N1, N2, N3, N4, na )
93 typename N1, typename N2, typename N3
95 struct times< N1,N2,N3,na,na >
97 : times< times< N1,N2 >, N3
    [all...]
  /external/libcxx/test/numerics/numarray/template.valarray/valarray.members/
apply_cref.pass.cpp 28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
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;
39 assert(v2.size() == N1);
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N1);
47 assert(v2.size() == N1);
48 for (unsigned i = 0; i < N1; ++i
    [all...]
apply_value.pass.cpp 28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
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;
39 assert(v2.size() == N1);
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N1);
47 assert(v2.size() == N1);
48 for (unsigned i = 0; i < N1; ++i
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.members/
apply_cref.pass.cpp 28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
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;
39 assert(v2.size() == N1);
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N1);
47 assert(v2.size() == N1);
48 for (unsigned i = 0; i < N1; ++i
    [all...]
apply_value.pass.cpp 28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
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;
39 assert(v2.size() == N1);
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N1);
47 assert(v2.size() == N1);
48 for (unsigned i = 0; i < N1; ++i
    [all...]
  /external/ceres-solver/include/ceres/
sized_cost_function.h 48 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 > 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && (N8 > 0) && !N9) |
    [all...]
  /external/clang/test/Modules/Inputs/
namespaces-top.h 1 namespace N1 {
  /external/clang/test/PCH/
namespaces.cpp 9 N1::t1 *ip1 = &int_val;
10 N1::t2 *ip2 = &int_val;
37 using N1::used_func;
40 using N1::used_cls;
  /external/clang/test/PCH/Inputs/
namespaces.h 3 namespace N1 {
7 namespace N1 {
  /external/libcxx/test/numerics/numarray/template.mask.array/mask.array.assign/
valarray.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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/numerics/numarray/template.mask.array/mask.array.comp.assign/
addition.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
and.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
divide.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
modulo.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
multiply.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
or.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
shift_left.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
shift_right.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
subtraction.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
xor.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.mask.array/mask.array.assign/
valarray.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.mask.array/mask.array.comp.assign/
addition.pass.cpp 22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
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 238 milliseconds

12 3 4 5 6 7 8