/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/ |
db_swap_1.pass.cpp | 31 std::unordered_multiset<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 33 std::unordered_multiset<int>::iterator i1 = c1.begin(); 35 swap(c1, c2); 36 c1.erase(i2); 39 c1.erase(i1);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
db_swap_1.pass.cpp | 31 std::unordered_set<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 33 std::unordered_set<int>::iterator i1 = c1.begin(); 35 swap(c1, c2); 36 c1.erase(i2); 39 c1.erase(i1);
|
/prebuilts/gdb/darwin-x86/lib/python2.7/ctypes/test/ |
test_incomplete.py | 19 c1 = cell() 20 c1.name = "foo" 24 c1.next = pointer(c2) 25 c2.next = pointer(c1) 27 p = c1
|
/prebuilts/gdb/linux-x86/lib/python2.7/ctypes/test/ |
test_incomplete.py | 19 c1 = cell() 20 c1.name = "foo" 24 c1.next = pointer(c2) 25 c2.next = pointer(c1) 27 p = c1
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/ |
test_incomplete.py | 19 c1 = cell() 20 c1.name = "foo" 24 c1.next = pointer(c2) 25 c2.next = pointer(c1) 27 p = c1
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/ |
test_incomplete.py | 19 c1 = cell() 20 c1.name = "foo" 24 c1.next = pointer(c2) 25 c2.next = pointer(c1) 27 p = c1
|
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
assign_size_value.pass.cpp | 45 test(C& c1, int size, int v) 48 c1.assign(size, v); 49 assert(c1.size() == size); 50 assert(distance(c1.begin(), c1.end()) == c1.size()); 51 for (CI i = c1.begin(); i != c1.end(); ++i) 59 C c1 = make<C>(N, start); local 60 test(c1, M, -10) [all...] |
/external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
emplace_back.pass.cpp | 46 test(C& c1) 49 std::size_t c1_osize = c1.size(); 50 c1.emplace_back(Emplaceable(1, 2.5)); 51 assert(c1.size() == c1_osize + 1); 52 assert(distance(c1.begin(), c1.end()) == c1.size()); 53 I i = c1.end(); 61 C c1 = make<C>(N, start); local 62 test(c1); [all...] |
emplace_front.pass.cpp | 46 test(C& c1) 49 std::size_t c1_osize = c1.size(); 50 c1.emplace_front(Emplaceable(1, 2.5)); 51 assert(c1.size() == c1_osize + 1); 52 assert(distance(c1.begin(), c1.end()) == c1.size()); 53 I i = c1.begin(); 61 C c1 = make<C>(N, start); local 62 test(c1); [all...] |
push_front.pass.cpp | 43 test(C& c1, int x) 46 std::size_t c1_osize = c1.size(); 47 c1.push_front(x); 48 assert(c1.size() == c1_osize + 1); 49 assert(distance(c1.begin(), c1.end()) == c1.size()); 50 I i = c1.begin(); 61 C c1 = make<C>(N, start); local 62 test(c1, -10) [all...] |
push_front_rvalue.pass.cpp | 46 test(C& c1, int x) 49 std::size_t c1_osize = c1.size(); 50 c1.push_front(MoveOnly(x)); 51 assert(c1.size() == c1_osize + 1); 52 assert(distance(c1.begin(), c1.end()) == c1.size()); 53 I i = c1.begin(); 64 C c1 = make<C>(N, start); local 65 test(c1, -10) [all...] |
erase_iter.pass.cpp | 43 test(int P, C& c1) 46 assert(P < c1.size()); 47 std::size_t c1_osize = c1.size(); 48 I i = c1.erase(c1.cbegin() + P); 49 assert(i == c1.begin() + P); 50 assert(c1.size() == c1_osize - 1); 51 assert(distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
emplace_back.pass.cpp | 46 test(C& c1) 49 std::size_t c1_osize = c1.size(); 50 c1.emplace_back(Emplaceable(1, 2.5)); 51 assert(c1.size() == c1_osize + 1); 52 assert(distance(c1.begin(), c1.end()) == c1.size()); 53 I i = c1.end(); 61 C c1 = make<C>(N, start); local 62 test(c1); [all...] |
emplace_front.pass.cpp | 46 test(C& c1) 49 std::size_t c1_osize = c1.size(); 50 c1.emplace_front(Emplaceable(1, 2.5)); 51 assert(c1.size() == c1_osize + 1); 52 assert(distance(c1.begin(), c1.end()) == c1.size()); 53 I i = c1.begin(); 61 C c1 = make<C>(N, start); local 62 test(c1); [all...] |
push_front.pass.cpp | 43 test(C& c1, int x) 46 std::size_t c1_osize = c1.size(); 47 c1.push_front(x); 48 assert(c1.size() == c1_osize + 1); 49 assert(distance(c1.begin(), c1.end()) == c1.size()); 50 I i = c1.begin(); 61 C c1 = make<C>(N, start); local 62 test(c1, -10) [all...] |
push_front_rvalue.pass.cpp | 46 test(C& c1, int x) 49 std::size_t c1_osize = c1.size(); 50 c1.push_front(MoveOnly(x)); 51 assert(c1.size() == c1_osize + 1); 52 assert(distance(c1.begin(), c1.end()) == c1.size()); 53 I i = c1.begin(); 64 C c1 = make<C>(N, start); local 65 test(c1, -10) [all...] |
erase_iter.pass.cpp | 43 test(int P, C& c1) 46 assert(P < c1.size()); 47 std::size_t c1_osize = c1.size(); 48 I i = c1.erase(c1.cbegin() + P); 49 assert(i == c1.begin() + P); 50 assert(c1.size() == c1_osize - 1); 51 assert(distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/ |
arch-1.d | 9 [ ]*[a-f0-9]+: 66 0f 38 17 c1 ptest %xmm1,%xmm0 10 [ ]*[a-f0-9]+: 66 0f 3a 09 c1 00 roundpd \$0x0,%xmm1,%xmm0 11 [ ]*[a-f0-9]+: 66 0f 3a 08 c1 00 roundps \$0x0,%xmm1,%xmm0 12 [ ]*[a-f0-9]+: 66 0f 3a 0b c1 00 roundsd \$0x0,%xmm1,%xmm0 13 [ ]*[a-f0-9]+: 66 0f 3a 0a c1 00 roundss \$0x0,%xmm1,%xmm0
|
arch-2.d | 9 [ ]*[a-f0-9]+: 66 0f 38 17 c1 ptest %xmm1,%xmm0 10 [ ]*[a-f0-9]+: 66 0f 3a 09 c1 00 roundpd \$0x0,%xmm1,%xmm0 11 [ ]*[a-f0-9]+: 66 0f 3a 08 c1 00 roundps \$0x0,%xmm1,%xmm0 12 [ ]*[a-f0-9]+: 66 0f 3a 0b c1 00 roundsd \$0x0,%xmm1,%xmm0 13 [ ]*[a-f0-9]+: 66 0f 3a 0a c1 00 roundss \$0x0,%xmm1,%xmm0
|
arch-3.d | 9 [ ]*[a-f0-9]+: 66 0f 38 17 c1 ptest %xmm1,%xmm0 10 [ ]*[a-f0-9]+: 66 0f 3a 09 c1 00 roundpd \$0x0,%xmm1,%xmm0 11 [ ]*[a-f0-9]+: 66 0f 3a 08 c1 00 roundps \$0x0,%xmm1,%xmm0 12 [ ]*[a-f0-9]+: 66 0f 3a 0b c1 00 roundsd \$0x0,%xmm1,%xmm0 13 [ ]*[a-f0-9]+: 66 0f 3a 0a c1 00 roundss \$0x0,%xmm1,%xmm0
|
x86-64-arch-1.d | 9 [ ]*[a-f0-9]+: 66 0f 38 17 c1 ptest %xmm1,%xmm0 10 [ ]*[a-f0-9]+: 66 0f 3a 09 c1 00 roundpd \$0x0,%xmm1,%xmm0 11 [ ]*[a-f0-9]+: 66 0f 3a 08 c1 00 roundps \$0x0,%xmm1,%xmm0 12 [ ]*[a-f0-9]+: 66 0f 3a 0b c1 00 roundsd \$0x0,%xmm1,%xmm0 13 [ ]*[a-f0-9]+: 66 0f 3a 0a c1 00 roundss \$0x0,%xmm1,%xmm0
|
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/ilp32/ |
x86-64-arch-1.d | 10 [ ]*[a-f0-9]+: 66 0f 38 17 c1 ptest %xmm1,%xmm0 11 [ ]*[a-f0-9]+: 66 0f 3a 09 c1 00 roundpd \$0x0,%xmm1,%xmm0 12 [ ]*[a-f0-9]+: 66 0f 3a 08 c1 00 roundps \$0x0,%xmm1,%xmm0 13 [ ]*[a-f0-9]+: 66 0f 3a 0b c1 00 roundsd \$0x0,%xmm1,%xmm0 14 [ ]*[a-f0-9]+: 66 0f 3a 0a c1 00 roundss \$0x0,%xmm1,%xmm0
|
x86-64-sse4_1-intel.d | 11 [ ]*[a-f0-9]+: 66 0f 3a 0d c1 00 blendpd xmm0,xmm1,0x0 13 [ ]*[a-f0-9]+: 66 0f 3a 0c c1 00 blendps xmm0,xmm1,0x0 15 [ ]*[a-f0-9]+: 66 0f 38 15 c1 blendvpd xmm0,xmm1,xmm0 17 [ ]*[a-f0-9]+: 66 0f 38 15 c1 blendvpd xmm0,xmm1,xmm0 19 [ ]*[a-f0-9]+: 66 0f 38 14 c1 blendvps xmm0,xmm1,xmm0 21 [ ]*[a-f0-9]+: 66 0f 38 14 c1 blendvps xmm0,xmm1,xmm0 23 [ ]*[a-f0-9]+: 66 0f 3a 41 c1 00 dppd xmm0,xmm1,0x0 25 [ ]*[a-f0-9]+: 66 0f 3a 40 c1 00 dpps xmm0,xmm1,0x0 26 [ ]*[a-f0-9]+: 66 0f 3a 17 c1 00 extractps ecx,xmm0,0x0 27 [ ]*[a-f0-9]+: 66 0f 3a 17 c1 00 extractps ecx,xmm0,0x [all...] |
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
remove_if.pass.cpp | 35 C c1(std::begin(t1), std::end(t1)); 38 c1.remove_if(std::ref(cp)); 39 assert(c1 == c2); 47 C c1(std::begin(t1), std::end(t1)); 50 c1.remove_if(std::ref(cp)); 51 assert(c1 == c2); 60 C c1(std::begin(t1), std::end(t1)); 63 c1.remove_if(std::ref(cp)); 64 assert(c1 == c2); 71 C c1; local 134 C c1; local [all...] |
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
ConcatTest.java | 85 public static Object[] createTests(String scenario, Collection<Integer> c1, Collection<Integer> c2, Collection<Integer> expected) { 87 new ConcatTest(scenario, c1, c2, expected) 92 protected final Collection<Integer> c1; field in class:ConcatTest 96 public ConcatTest(String scenario, Collection<Integer> c1, Collection<Integer> c2, Collection<Integer> expected) { 98 this.c1 = c1; 109 Stream<Integer> s1s = c1.stream(); 111 Stream<Integer> s1p = c1.parallelStream(); 119 assertTrue(s1s.spliterator().hasCharacteristics(Spliterator.ORDERED), c1.getClass().toString()); 121 assertTrue(s2s.spliterator().hasCharacteristics(Spliterator.ORDERED), c1.getClass().toString()) [all...] |