/external/clang/test/PCH/ |
H A D | reinclude.cpp | 12 int q2 = A::y; variable
|
/external/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.members/ |
H A D | swap.pass.cpp | 22 std::priority_queue<int> q2; local 26 q1.swap(q2); 28 assert(q2.size() == 3); 29 assert(q2.top() == 3);
|
/external/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.special/ |
H A D | swap.pass.cpp | 24 std::priority_queue<int> q2; local 28 swap(q1, q2); 30 assert(q2.size() == 3); 31 assert(q2.top() == 3);
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.cons/ |
H A D | ctor_copy.pass.cpp | 30 std::queue<int> q2 = q; local 31 assert(q2 == q);
|
H A D | ctor_move.pass.cpp | 37 std::queue<MoveOnly> q2 = std::move(q); local 38 assert(q2.size() == 5);
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/ |
H A D | assign_copy.pass.cpp | 30 std::queue<int> q2; local 31 q2 = q; 32 assert(q2 == q);
|
H A D | assign_move.pass.cpp | 37 std::queue<MoveOnly> q2; local 38 q2 = std::move(q); 39 assert(q2.size() == 5);
|
H A D | swap.pass.cpp | 30 std::queue<int> q2 = make<std::queue<int> >(10); local 32 std::queue<int> q2_save = q2; 33 q1.swap(q2); 35 assert(q2 == q1_save);
|
/external/libcxx/test/std/containers/container.adaptors/stack/stack.cons/ |
H A D | ctor_copy.pass.cpp | 30 std::stack<int> q2 = q; local 31 assert(q2 == q);
|
H A D | ctor_move.pass.cpp | 37 std::stack<MoveOnly> q2 = std::move(q); local 38 assert(q2.size() == 5);
|
/external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/ |
H A D | assign_copy.pass.cpp | 30 std::stack<int> q2; local 31 q2 = q; 32 assert(q2 == q);
|
H A D | assign_move.pass.cpp | 37 std::stack<MoveOnly> q2; local 38 q2 = std::move(q); 39 assert(q2.size() == 5);
|
H A D | swap.pass.cpp | 30 std::stack<int> q2 = make<std::stack<int> >(10); local 32 std::stack<int> q2_save = q2; 33 q1.swap(q2); 35 assert(q2 == q1_save);
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.ops/ |
H A D | lt.pass.cpp | 40 std::queue<int> q2 = make<std::queue<int> >(10); local 41 assert(q1 < q2); 42 assert(q2 > q1); 43 assert(q1 <= q2); 44 assert(q2 >= q1);
|
H A D | eq.pass.cpp | 34 std::queue<int> q2 = make<std::queue<int> >(10); local 36 std::queue<int> q2_save = q2; 38 assert(q1 != q2); 39 assert(q2 == q2_save);
|
/external/libcxx/test/std/containers/container.adaptors/stack/stack.ops/ |
H A D | lt.pass.cpp | 40 std::stack<int> q2 = make<std::stack<int> >(10); local 41 assert(q1 < q2); 42 assert(q2 > q1); 43 assert(q1 <= q2); 44 assert(q2 >= q1);
|
H A D | eq.pass.cpp | 34 std::stack<int> q2 = make<std::stack<int> >(10); local 36 std::stack<int> q2_save = q2; 38 assert(q1 != q2); 39 assert(q2 == q2_save);
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.special/ |
H A D | swap.pass.cpp | 31 std::queue<int> q2 = make<std::queue<int> >(10); local 33 std::queue<int> q2_save = q2; 34 swap(q1, q2); 36 assert(q2 == q1_save);
|
/external/libcxx/test/std/containers/container.adaptors/stack/stack.special/ |
H A D | swap.pass.cpp | 31 std::stack<int> q2 = make<std::stack<int> >(10); local 33 std::stack<int> q2_save = q2; 34 swap(q1, q2); 36 assert(q2 == q1_save);
|
/external/clang/test/SemaCXX/ |
H A D | builtin-assume-aligned.cpp | 23 constexpr void *q2 = __builtin_assume_aligned(&n, 4, -2); variable
|
/external/v8/src/base/ |
H A D | division-by-constant.cc | 35 T q2 = min / ad; // Init. q2 = 2**p/|d|. 36 T r2 = min - q2 * ad; // Init. r2 = rem(2**p, |d|). 46 q2 = 2 * q2; // Update q2 = 2**p/|d|. 49 q2 = q2 + 1; 54 T mul = q2 + 1; 73 T q2 local [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | copy-assign-synthesis.cpp | 62 q1.pr(); q2.pr(); 65 Q q1, q2; member in struct:X
|
H A D | copy-assign-synthesis-1.cpp | 77 q1.pr(); q2.pr(); 80 Q q1, q2; member in struct:X
|
/external/eigen/test/ |
H A D | geo_quaternion.cpp | 71 Quaternionx q1, q2; 72 q2.setIdentity(); 73 VERIFY_IS_APPROX(Quaternionx(Quaternionx::Identity()).coeffs(), q2.coeffs()); 75 VERIFY_IS_APPROX(q1.coeffs(), (q1*q2).coeffs()); 78 q1 *= q2; 81 q2 = AngleAxisx(a, v1.normalized()); 84 Scalar refangle = abs(AngleAxisx(q1.inverse()*q2).angle()); 88 if((q1.coeffs()-q2.coeffs()).norm() > 10*largeEps) 90 VERIFY_IS_MUCH_SMALLER_THAN(abs(q1.angularDistance(q2) - refangle), Scalar(1)); 95 VERIFY_IS_APPROX(q1 * q2 * v 201 Quaternionx q2 = mq2; local 241 QuaternionUA *q2 = ::new(reinterpret_cast<void*>(array2)) QuaternionUA; local [all...] |
/external/freetype/src/base/ |
H A D | ftbbox.c | 251 FT_Pos q2, 265 /* It is called with either q2 or q3 positive, which is necessary */ 269 FT_ABS( q2 ) | 280 q2 <<= shift; 287 q2 >>= -shift; 294 while ( q2 > 0 || q3 > 0 ) 297 if ( q1 + q2 > q3 + q4 ) /* first half */ 300 q3 = q3 + q2; 301 q2 = q2 250 cubic_peak( FT_Pos q1, FT_Pos q2, FT_Pos q3, FT_Pos q4 ) argument [all...] |