/external/clang/test/PCH/ |
H A D | reinclude.cpp | 12 int q2 = A::y; variable
|
/external/libcxx/test/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/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/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/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/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 | 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);
|
H A D | assign_move.pass.cpp | 37 std::queue<MoveOnly> q2; local 38 q2 = std::move(q); 39 assert(q2.size() == 5);
|
/external/libcxx/test/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 | 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);
|
H A D | assign_move.pass.cpp | 37 std::stack<MoveOnly> q2; local 38 q2 = std::move(q); 39 assert(q2.size() == 5);
|
/external/llvm/test/MC/ARM/ |
H A D | vmov-vmvn-illegal-cases.s | 7 @ CHECK: vmov.i32 q2, #0xffffffab 9 @ CHECK: vmov.i16 q2, #0xffab 11 @ CHECK: vmov.i16 q2, #0xffab 16 @ CHECK: vmvn.i32 q2, #0xffffffab 18 @ CHECK: vmvn.i16 q2, #0xffab 20 @ CHECK: vmvn.i16 q2, #0xffab 23 vmov.i32 q2, #0xffffffab 24 vmov.i16 q2, #0xffab 25 vmov.i16 q2, #0xffab 28 vmvn.i32 q2, # [all...] |
H A D | thumb-neon-crypto.s | 19 sha1c.32 q0, q1, q2 20 @ CHECK: sha1c.32 q0, q1, q2 @ encoding: [0x02,0xef,0x44,0x0c] 21 sha1m.32 q0, q1, q2 22 @ CHECK: sha1m.32 q0, q1, q2 @ encoding: [0x22,0xef,0x44,0x0c] 23 sha1p.32 q0, q1, q2 24 @ CHECK: sha1p.32 q0, q1, q2 @ encoding: [0x12,0xef,0x44,0x0c] 25 sha1su0.32 q0, q1, q2 26 @ CHECK: sha1su0.32 q0, q1, q2 @ encoding: [0x32,0xef,0x44,0x0c] 27 sha256h.32 q0, q1, q2 28 @ CHECK: sha256h.32 q0, q1, q2 [all...] |
H A D | vmov-vmvn-byte-replicate.s | 6 @ CHECK: vmov.i8 q2, #0xff @ encoding: [0x5f,0x4e,0x87,0xf3] 8 @ CHECK: vmov.i8 q2, #0xab @ encoding: [0x5b,0x4e,0x82,0xf3] 9 @ CHECK: vmov.i8 q2, #0xab @ encoding: [0x5b,0x4e,0x82,0xf3] 10 @ CHECK: vmov.i8 q2, #0xab @ encoding: [0x5b,0x4e,0x82,0xf3] 13 @ CHECK: vmov.i8 q2, #0x0 @ encoding: [0x50,0x4e,0x80,0xf2] 15 @ CHECK: vmov.i8 q2, #0x54 @ encoding: [0x54,0x4e,0x85,0xf2] 17 @ CHECK: vmov.i8 q2, #0x54 @ encoding: [0x54,0x4e,0x85,0xf2] 20 vmov.i32 q2, #0xffffffff 22 vmov.i32 q2, #0xabababab 23 vmov.i16 q2, # [all...] |
H A D | vorr-vbic-illegal-cases.s | 7 @ CHECK: vorr.i32 q2, #0xffffffff 11 @ CHECK: vorr.i32 q2, #0xabababab 13 @ CHECK: vorr.i16 q2, #0xabab 15 @ CHECK: vorr.i16 q2, #0xabab 20 @ CHECK: vbic.i32 q2, #0xffffffff 24 @ CHECK: vbic.i32 q2, #0xabababab 28 @ CHECK: vbic.i16 q2, #0xabab 31 vorr.i32 q2, #0xffffffff 33 vorr.i32 q2, #0xabababab 34 vorr.i16 q2, # [all...] |
/external/libcxx/test/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/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/libcxx/test/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/containers/container.adaptors/stack/stack.cons/ |
H A D | ctor_copy.pass.cpp | 30 std::stack<int> q2 = q; local 31 assert(q2 == q);
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticBezierClip.cpp | 15 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT) { argument 41 endLine.quadDistanceY(q2, distance2y); 72 r2.setBounds(q2); 76 " q2=(%1.9g,%1.9g %1.9g,%1.9g %1.9g,%1.9g) minT=%1.9g maxT=%1.9g\n", 78 q2[0].x, q2[0].y, q2[1].x, q2[1].y, q2[2].x, q2[ [all...] |
/external/skia/experimental/Intersection/ |
H A D | QuadraticBezierClip.cpp | 15 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT) { argument 41 endLine.quadDistanceY(q2, distance2y); 72 r2.setBounds(q2); 76 " q2=(%1.9g,%1.9g %1.9g,%1.9g %1.9g,%1.9g) minT=%1.9g maxT=%1.9g\n", 78 q2[0].x, q2[0].y, q2[1].x, q2[1].y, q2[2].x, q2[ [all...] |
/external/chromium_org/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...] |