HomeSort by relevance Sort by last modified time
    Searched defs:a1 (Results 501 - 525 of 1031) sorted by null

<<21222324252627282930>>

  /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
basic.cpp 9 A<const float> a1 = f0(cfp); local
  /external/clang/test/CodeGen/
ms-anonymous-struct.c 7 int a1; member in struct:nested1
43 var.a1;
81 var->a1;
  /external/clang/test/CodeGenCXX/
member-expressions.cpp 10 A a1; member in namespace:PR5392
14 a1.a = 10;
  /external/clang/test/Index/
complete-template-friends-defined.cpp 13 N::A<int> a1; local
  /external/clang/test/SemaTemplate/
dependent-sized_array.cpp 15 int a1[] = { 1, 2, 3, N }; local
16 int a3[sizeof(a1)/sizeof(int) != 4? 1 : -1]; // expected-error{{negative}}
instantiate-default-assignment-operator.cpp 12 A a1, a2; local
13 a1 = a2;
instantiate-member-initializers.cpp 10 A<void*> a1; // expected-note{{in instantiation of member function 'A<void *>::A' requested here}} variable
  /external/eigen/bench/
benchGeometry.cpp 28 static EIGEN_DONT_INLINE res run( arg1& a1, arg2& a2 )
31 return a1 * a2;
38 static EIGEN_DONT_INLINE res run( arg1& a1, arg2& a2 )
41 return a1.matrix() * a2;
48 static EIGEN_DONT_INLINE res run( arg1& a1, arg2& a2 )
51 return res(a1.matrix() * a2.matrix());
60 arg1 a1; local
61 a1.setIdentity();
71 a2 = func::run( a1, a2 );
  /external/eigen/test/eigen2/
eigen2_svd.cpp 46 MatrixType a1 = MatrixType::Random(rows,cols); local
47 a += a * a.adjoint() + a1 * a1.adjoint();
  /external/eigen/test/
eigensolver_generalized_real.cpp 28 MatrixType a1 = MatrixType::Random(rows,cols); local
30 MatrixType spdA = a.adjoint() * a + a1.adjoint() * a1;
  /external/libcxx/test/std/containers/associative/map/map.cons/
move_alloc.pass.cpp 35 V a1[] = local
47 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
74 V a1[] = local
86 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7))
113 V a1[] = local
155 V a1[] = local
200 V a1[] = local
    [all...]
  /external/libcxx/test/std/containers/associative/multimap/multimap.cons/
move_alloc.pass.cpp 35 V a1[] = local
47 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
74 V a1[] = local
86 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7))
113 V a1[] = local
155 V a1[] = local
200 V a1[] = local
    [all...]
  /external/libcxx/test/std/containers/sequences/deque/deque.special/
swap.pass.cpp 65 int a1[] = {1, 3, 7, 9, 10}; local
68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0]))));
77 int a1[] = {1, 3, 7, 9, 10} local
98 int a1[] = {1, 3, 7, 9, 10}; local
    [all...]
  /external/libcxx/test/std/containers/sequences/list/list.modifiers/
insert_iter_iter_iter.pass.cpp 48 int a1[] = {1, 2, 3}; local
50 std::list<int>::iterator i = l1.insert(l1.begin(), a1, a1+3);
117 int a1[] = {1, 2, 3}; local
119 std::list<int, min_allocator<int>>::iterator i = l1.insert(l1.begin(), a1, a1+3);
insert_iter_size_value.pass.cpp 47 int a1[] = {1, 2, 3}; local
49 std::list<int> l1(a1, a1+3);
77 int a1[] = {1, 2, 3}; local
79 std::list<int, min_allocator<int>> l1(a1, a1+3);
insert_iter_value.pass.cpp 47 int a1[] = {1, 2, 3}; local
49 std::list<int> l1(a1, a1+3);
80 int a1[] = {1, 2, 3}; local
82 std::list<int, min_allocator<int>> l1(a1, a1+3);
  /external/libcxx/test/std/containers/sequences/list/list.ops/
remove.pass.cpp 33 int a1[] = {1, 2, 3, 4}; local
35 std::list<int> c(a1, a1+4);
40 int a1[] = {1, 2, 1, 3, 5, 8, 11}; local
42 std::list<int> c(a1, a1+7);
47 int a1[] = {1, 2, 1, 3, 5, 8, 11, 1}; local
50 for(int *ip = a1; ip < a1+8; ++ip)
62 int a1[] = {1, 2, 3, 4} local
    [all...]
  /external/libcxx/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/
acos_valarray.pass.cpp 38 T a1[] = {-.9, -.5, 0., .5, .75}; local
44 const unsigned N = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N);
asin_valarray.pass.cpp 38 T a1[] = {-.9, -.5, 0., .5, .75}; local
44 const unsigned N = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N);
atan2_valarray_valarray.pass.cpp 38 T a1[] = {-.9, -.5, 0., .5, .75}; local
45 const unsigned N = sizeof(a1)/sizeof(a1[0]);
46 std::valarray<T> v1(a1, N);
atan2_valarray_value.pass.cpp 38 T a1[] = {-.9, -.5, 0., .5, .75}; local
44 const unsigned N = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N);
atan2_value_valarray.pass.cpp 38 T a1[] = {-.9, -.5, 0., .5, .75}; local
44 const unsigned N = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N);
atan_valarray.pass.cpp 38 T a1[] = {-.9, -.5, 0., .5, .75}; local
44 const unsigned N = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N);
cos_valarray.pass.cpp 38 T a1[] = {-.9, -.5, 0., .5, .75}; local
44 const unsigned N = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N);
cosh_valarray.pass.cpp 38 T a1[] = {-.9, -.5, 0., .5, .75}; local
44 const unsigned N = sizeof(a1)/sizeof(a1[0]);
45 std::valarray<T> v1(a1, N);

Completed in 7075 milliseconds

<<21222324252627282930>>