| /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.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/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/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/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/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.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/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/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...] |
| /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/ui/gfx/geometry/ |
| H A D | quad_unittest.cc | 20 QuadF q2(e, e, e, e);
23 EXPECT_EQ(q1, q2);
70 QuadF q2(a, b, c, d);
71 QuadF subtracted = q2 - v;
72 q2 -= v;
78 EXPECT_EQ(expected2, q2);
353 QuadF q2; local
354 q2.Scale(1.5f);
355 EXPECT_EQ(q2, q2);
[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
|
| /external/chromium_org/third_party/icu/source/test/perf/howExpensiveIs/ |
| H A D | sieve.cpp | 104 double qs(double *times, int n, double *q1, double *q2, double *q3) { argument
106 *q2 = medianof(times,n,2);
112 double q1,q2,q3; local
117 double iqr = qs(times,n,&q1,&q2,&q3);
124 printf("iqr: %.9f, q1=%.9f, q2=%.9f, q3=%.9f, max=%.9f, n=%d\n", iqr,q1,q2,q3,(double)-1, n);
148 double iqr = qs(times,n,&q1,&q2,&q3);
178 printf("min: %.9f, q1=%.9f, q2=%.9f, q3=%.9f, max=%.9f, n=%d\n", minTime,q1,q2,q3,maxTime, n);
|