/external/libcxx/test/std/containers/sequences/list/list.ops/ |
reverse.pass.cpp | 24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 25 c1.reverse(); 26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 33 c1.reverse(); 34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
sort.pass.cpp | 24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 25 c1.sort(); 26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 33 c1.sort(); 34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
sort_comp.pass.cpp | 25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 26 c1.sort(std::greater<int>()); 27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 33 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 34 c1.sort(std::greater<int>()); 35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
/external/libcxx/test/std/containers/unord/unord.map/ |
swap_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1)); 38 c1.swap(c2); 40 assert(c1.bucket_count() == 0); 41 assert(c1.size() == 0); 42 assert(c1.hash_function() == Hash(2)); 43 assert(c1.key_eq() == Compare(2)); 44 assert(c1.get_allocator() == Alloc(1)); 45 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
swap_non_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1)); 38 swap(c1, c2); 40 assert(c1.bucket_count() == 0); 41 assert(c1.size() == 0); 42 assert(c1.hash_function() == Hash(2)); 43 assert(c1.key_eq() == Compare(2)); 44 assert(c1.get_allocator() == Alloc(1)); 45 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/external/libcxx/test/std/containers/unord/unord.multimap/ |
swap_member.pass.cpp | 36 C c1(0, Hash(1), Compare(1), Alloc(1)); 39 c1.swap(c2); 41 assert(c1.bucket_count() == 0); 42 assert(c1.size() == 0); 43 assert(c1.hash_function() == Hash(2)); 44 assert(c1.key_eq() == Compare(2)); 45 assert(c1.get_allocator() == Alloc(1)); 46 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.swap/ |
swap_non_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1)); 38 swap(c1, c2); 40 assert(c1.bucket_count() == 0); 41 assert(c1.size() == 0); 42 assert(c1.hash_function() == Hash(2)); 43 assert(c1.key_eq() == Compare(2)); 44 assert(c1.get_allocator() == Alloc(1)); 45 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/external/libcxx/test/std/containers/unord/unord.multiset/ |
swap_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1)); 37 c1.swap(c2); 39 assert(c1.bucket_count() == 0); 40 assert(c1.size() == 0); 41 assert(c1.hash_function() == Hash(2)); 42 assert(c1.key_eq() == Compare(2)); 43 assert(c1.get_allocator() == Alloc(1)); 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.swap/ |
swap_non_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1)); 37 swap(c1, c2); 39 assert(c1.bucket_count() == 0); 40 assert(c1.size() == 0); 41 assert(c1.hash_function() == Hash(2)); 42 assert(c1.key_eq() == Compare(2)); 43 assert(c1.get_allocator() == Alloc(1)); 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/external/libcxx/test/std/containers/unord/unord.set/ |
swap_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1)); 37 c1.swap(c2); 39 assert(c1.bucket_count() == 0); 40 assert(c1.size() == 0); 41 assert(c1.hash_function() == Hash(2)); 42 assert(c1.key_eq() == Compare(2)); 43 assert(c1.get_allocator() == Alloc(1)); 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/external/libcxx/test/std/containers/unord/unord.set/unord.set.swap/ |
swap_non_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1)); 37 swap(c1, c2); 39 assert(c1.bucket_count() == 0); 40 assert(c1.size() == 0); 41 assert(c1.hash_function() == Hash(2)); 42 assert(c1.key_eq() == Compare(2)); 43 assert(c1.get_allocator() == Alloc(1)); 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/external/libcxx/test/std/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.op=/ |
lv_value.pass.cpp | 25 test(C c1, typename C::difference_type j, 29 std::insert_iterator<C> q(c1, c1.begin() + j); 33 assert(c1 == c2); 51 C c1; local 53 c1.push_back(i); 54 C c2 = c1; 56 test(c1, 0, 'a', 'b', 'c', c2); 57 c2 = c1; 59 test(c1, 1, 'a', 'b', 'c', c2) 69 C c1; local [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
reverse.pass.cpp | 24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 25 c1.reverse(); 26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 33 c1.reverse(); 34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
sort.pass.cpp | 24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 25 c1.sort(); 26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 33 c1.sort(); 34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
sort_comp.pass.cpp | 25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 26 c1.sort(std::greater<int>()); 27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 33 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 34 c1.sort(std::greater<int>()); 35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
swap_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1)); 38 c1.swap(c2); 40 assert(c1.bucket_count() == 0); 41 assert(c1.size() == 0); 42 assert(c1.hash_function() == Hash(2)); 43 assert(c1.key_eq() == Compare(2)); 44 assert(c1.get_allocator() == Alloc(1)); 45 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.swap/ |
swap_non_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1)); 38 swap(c1, c2); 40 assert(c1.bucket_count() == 0); 41 assert(c1.size() == 0); 42 assert(c1.hash_function() == Hash(2)); 43 assert(c1.key_eq() == Compare(2)); 44 assert(c1.get_allocator() == Alloc(1)); 45 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
swap_member.pass.cpp | 36 C c1(0, Hash(1), Compare(1), Alloc(1)); 39 c1.swap(c2); 41 assert(c1.bucket_count() == 0); 42 assert(c1.size() == 0); 43 assert(c1.hash_function() == Hash(2)); 44 assert(c1.key_eq() == Compare(2)); 45 assert(c1.get_allocator() == Alloc(1)); 46 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/ |
swap_non_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1)); 38 swap(c1, c2); 40 assert(c1.bucket_count() == 0); 41 assert(c1.size() == 0); 42 assert(c1.hash_function() == Hash(2)); 43 assert(c1.key_eq() == Compare(2)); 44 assert(c1.get_allocator() == Alloc(1)); 45 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
swap_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1)); 37 c1.swap(c2); 39 assert(c1.bucket_count() == 0); 40 assert(c1.size() == 0); 41 assert(c1.hash_function() == Hash(2)); 42 assert(c1.key_eq() == Compare(2)); 43 assert(c1.get_allocator() == Alloc(1)); 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/ |
swap_non_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1)); 37 swap(c1, c2); 39 assert(c1.bucket_count() == 0); 40 assert(c1.size() == 0); 41 assert(c1.hash_function() == Hash(2)); 42 assert(c1.key_eq() == Compare(2)); 43 assert(c1.get_allocator() == Alloc(1)); 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
swap_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1)); 37 c1.swap(c2); 39 assert(c1.bucket_count() == 0); 40 assert(c1.size() == 0); 41 assert(c1.hash_function() == Hash(2)); 42 assert(c1.key_eq() == Compare(2)); 43 assert(c1.get_allocator() == Alloc(1)); 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
swap_non_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1)); 37 swap(c1, c2); 39 assert(c1.bucket_count() == 0); 40 assert(c1.size() == 0); 41 assert(c1.hash_function() == Hash(2)); 42 assert(c1.key_eq() == Compare(2)); 43 assert(c1.get_allocator() == Alloc(1)); 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.op=/ |
lv_value.pass.cpp | 25 test(C c1, typename C::difference_type j, 29 std::insert_iterator<C> q(c1, c1.begin() + j); 33 assert(c1 == c2); 51 C c1; local 53 c1.push_back(i); 54 C c2 = c1; 56 test(c1, 0, 'a', 'b', 'c', c2); 57 c2 = c1; 59 test(c1, 1, 'a', 'b', 'c', c2) 69 C c1; local [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.nonmembers/string.special/ |
swap_noexcept.pass.cpp | 40 C c1, c2; local 41 static_assert(noexcept(swap(c1, c2)), ""); 45 C c1, c2; local 46 static_assert(noexcept(swap(c1, c2)), ""); 50 C c1, c2; local 51 static_assert(!noexcept(swap(c1, c2)), "");
|