| /external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| move_alloc.pass.cpp | 28 std::deque<MoveOnly, A> c1(A(1));
30 c1.push_back(MoveOnly(*p));
34 std::deque<MoveOnly, A> c3(std::move(c1), A(3));
37 assert(c1.size() != 0);
43 std::deque<MoveOnly, A> c1(A(1));
45 c1.push_back(MoveOnly(*p));
49 std::deque<MoveOnly, A> c3(std::move(c1), A(1));
52 assert(c1.size() == 0);
58 std::deque<MoveOnly, A> c1(A(1));
60 c1.push_back(MoveOnly(*p))
[all...] |
| move_assign.pass.cpp | 28 std::deque<MoveOnly, A> c1(A(5));
30 c1.push_back(MoveOnly(*p));
35 c3 = std::move(c1);
37 assert(c1.size() == 0);
44 std::deque<MoveOnly, A> c1(A(5));
46 c1.push_back(MoveOnly(*p));
51 c3 = std::move(c1);
53 assert(c1.size() != 0);
60 std::deque<MoveOnly, A> c1(A(5));
62 c1.push_back(MoveOnly(*p))
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| insert_value.pass.cpp | 44 test(int P, C& c1, int x)
47 std::size_t c1_osize = c1.size();
48 CI i = c1.insert(c1.begin() + P, x);
49 assert(i == c1.begin() + P);
50 assert(c1.size() == c1_osize + 1);
51 assert(distance(c1.begin(), c1.end()) == c1.size());
52 i = c1.begin()
69 C c1 = make<C>(N, start); local
77 C c1 = make<C>(N, start); local
85 C c1 = make<C>(N, start); local
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.special/ |
| swap.pass.cpp | 45 C c1 = make<C>(N, start); local
47 C c1_save = c1;
49 swap(c1, c2);
50 assert(c1 == c2_save);
68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
70 swap(c1, c2);
71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
72 assert(c1.get_allocator() == A(1));
80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
82 swap(c1, c2)
[all...] |
| /external/libcxx/test/std/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.op=/ |
| rv_value.pass.cpp | 28 test(C c1, typename C::difference_type j,
32 std::insert_iterator<C> q(c1, c1.begin() + j);
36 assert(c1 == c2);
63 C c1; local
66 c1.push_back(Ptr(x+i));
71 test(std::move(c1), 0, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2);
72 c1.clear();
74 c1.push_back(Ptr(x+i));
79 test(std::move(c1), 1, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2)
[all...] |
| /external/pdfium/third_party/libopenjpeg20/ |
| mct.h | 59 @param c1 Samples for green component
63 void opj_mct_encode(OPJ_INT32 *c0, OPJ_INT32 *c1, OPJ_INT32 *c2, OPJ_UINT32 n);
67 @param c1 Samples for red chrominance component
71 void opj_mct_decode(OPJ_INT32 *c0, OPJ_INT32 *c1, OPJ_INT32 *c2, OPJ_UINT32 n);
82 @param c1 Samples for green component
86 void opj_mct_encode_real(OPJ_INT32 *c0, OPJ_INT32 *c1, OPJ_INT32 *c2, OPJ_UINT32 n);
90 @param c1 Samples for red chrominance component
94 void opj_mct_decode_real(OPJ_FLOAT32* c0, OPJ_FLOAT32* c1, OPJ_FLOAT32* c2, OPJ_UINT32 n);
|
| /external/testng/src/test/java/test/dependent/xml/ |
| GroupDependencySampleTest.java | 14 public void c1() {} method in class:GroupDependencySampleTest
|
| /external/testng/src/test/java/test/preserveorder/ |
| C.java | 10 public void c1() { method in class:C
11 log("C.c1");
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| move_alloc.pass.cpp | 28 std::deque<MoveOnly, A> c1(A(1));
30 c1.push_back(MoveOnly(*p));
34 std::deque<MoveOnly, A> c3(std::move(c1), A(3));
37 assert(c1.size() != 0);
43 std::deque<MoveOnly, A> c1(A(1));
45 c1.push_back(MoveOnly(*p));
49 std::deque<MoveOnly, A> c3(std::move(c1), A(1));
52 assert(c1.size() == 0);
58 std::deque<MoveOnly, A> c1(A(1));
60 c1.push_back(MoveOnly(*p))
[all...] |
| move_assign.pass.cpp | 28 std::deque<MoveOnly, A> c1(A(5));
30 c1.push_back(MoveOnly(*p));
35 c3 = std::move(c1);
37 assert(c1.size() == 0);
44 std::deque<MoveOnly, A> c1(A(5));
46 c1.push_back(MoveOnly(*p));
51 c3 = std::move(c1);
53 assert(c1.size() != 0);
60 std::deque<MoveOnly, A> c1(A(5));
62 c1.push_back(MoveOnly(*p))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| insert_value.pass.cpp | 43 test(int P, C& c1, int x)
47 std::size_t c1_osize = c1.size();
48 CI i = c1.insert(c1.begin() + P, x);
49 assert(i == c1.begin() + P);
50 assert(c1.size() == c1_osize + 1);
51 assert(distance(c1.begin(), c1.end()) == c1.size());
52 i = c1.begin()
71 C c1 = make<C>(N, start); local
79 C c1 = make<C>(N, start); local
87 C c1 = make<C>(N, start); local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| swap.pass.cpp | 45 C c1 = make<C>(N, start); local
47 C c1_save = c1;
49 swap(c1, c2);
50 assert(c1 == c2_save);
68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
70 swap(c1, c2);
71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
72 assert(c1.get_allocator() == A(1));
80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
82 swap(c1, c2)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| construct_default.pass.cpp | 30 C c1 = {}; local
31 assert(c1.__invariants());
32 assert(c1.empty());
33 assert(c1.get_allocator() == typename C::allocator_type());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.op=/ |
| rv_value.pass.cpp | 27 test(C c1, typename C::difference_type j,
31 std::insert_iterator<C> q(c1, c1.begin() + j);
35 assert(c1 == c2);
62 C c1; local
65 c1.push_back(Ptr(x+i));
70 test(std::move(c1), 0, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2);
71 c1.clear();
73 c1.push_back(Ptr(x+i));
78 test(std::move(c1), 1, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2)
[all...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/ |
| arch-11.d | 9 [ ]*[a-f0-9]+: f3 0f 5e c1 divss %xmm1,%xmm0
10 [ ]*[a-f0-9]+: 0f da c1 pminub %mm1,%mm0
|
| arch-12.d | 9 [ ]*[a-f0-9]+: 0f 0f c1 bb pswapd %mm1,%mm0
10 [ ]*[a-f0-9]+: 0f da c1 pminub %mm1,%mm0
|
| /packages/apps/DeskClock/src/com/android/deskclock/data/ |
| City.java | 101 public int compare(City c1, City c2) {
102 int result = mDelegate1.compare(c1, c2);
105 result = mDelegate2.compare(c1, c2);
124 public int compare(City c1, City c2) {
125 final int utcOffset1 = c1.getTimeZone().getOffset(now);
148 public int compare(City c1, City c2) {
149 int result = mDelegate.compare(c1, c2);
152 result = mNameCollator.compare(c1.getPhoneticName(), c2.getPhoneticName());
173 public int compare(City c1, City c2) {
174 int result = Integer.compare(c1.getIndex(), c2.getIndex())
[all...] |
| /external/clang/test/CodeGenCXX/ |
| eh-aggregated-inits-unwind.cpp | 36 Container c1; local
40 Container c2(c1);
|
| /external/clang/test/SemaCXX/ |
| attr-cleanup.cpp | 4 void c1(int *a) {} function in namespace:N
12 int v1 __attribute__((cleanup(N::c1)));
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_flist.pass.cpp | 50 C c1(std::begin(t1), std::end(t1));
53 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
54 testd(c1, p, l);
66 C c1(std::begin(t1), std::end(t1));
69 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
70 testd(c1, p, l);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_flist.pass.cpp | 50 C c1(std::begin(t1), std::end(t1));
53 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
54 testd(c1, p, l);
66 C c1(std::begin(t1), std::end(t1));
69 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2));
70 testd(c1, p, l);
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-powerpc/ |
| aix-weak-2a.s | 1 .weak c1
2 c1 = 0xcccc1111 define
|
| aix-weak-2b.s | 1 .globl c1
2 c1 = 0xdddd1111 define
|
| /external/fio/lib/ |
| bswap.h | 9 uint32_t c1, c2, c3, c4; local
11 c1 = (val >> 24) & 0xff;
16 return c1 | c2 << 8 | c3 << 16 | c4 << 24;
21 uint64_t c1, c2, c3, c4, c5, c6, c7, c8; local
23 c1 = (val >> 56) & 0xff;
32 return c1 | c2 << 8 | c3 << 16 | c4 << 24 | c5 << 32 | c6 << 40 | c7 << 48 | c8 << 56;
|
| /external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
| shrink_to_fit.pass.cpp | 44 test(C& c1)
46 C s = c1;
47 c1.shrink_to_fit();
48 assert(c1 == s);
55 C c1 = make<C>(N, start); local
56 test(c1);
|
