| /external/libcxx/test/containers/unord/unord.set/ |
| H A D | version.pass.cpp | 10 // <unordered_set>
12 #include <unordered_set>
|
| H A D | erase_iter_db2.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::const_iterator i = l2.begin();
|
| H A D | erase_iter_iter_db1.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| H A D | erase_iter_iter_db2.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| H A D | erase_iter_iter_db3.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| H A D | erase_iter_db1.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
25 std::unordered_set<int> l1(a1, a1+3);
26 std::unordered_set<int>::const_iterator i = l1.end();
|
| H A D | erase_iter_iter_db4.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| H A D | max_bucket_count.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
32 typedef std::unordered_set<int, std::hash<int>,
|
| H A D | max_size.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 std::unordered_set<int> u;
31 std::unordered_set<int, std::hash<int>,
|
| H A D | max_load_factor.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
23 #include <unordered_set>
31 typedef std::unordered_set<int> C;
37 typedef std::unordered_set<int> C;
46 typedef std::unordered_set<int, std::hash<int>,
53 typedef std::unordered_set<int, std::hash<int>,
64 typedef std::unordered_set<int> C;
|
| H A D | clear.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
43 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
| H A D | db_iterators_7.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
30 typedef std::unordered_set<T> C;
41 typedef std::unordered_set<T, min_allocator<T>> C;
|
| H A D | db_iterators_8.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
30 typedef std::unordered_set<T> C;
39 typedef std::unordered_set<T, min_allocator<T>> C;
|
| H A D | db_local_iterators_7.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
30 typedef std::unordered_set<T> C;
40 typedef std::unordered_set<T, min_allocator<T>> C;
|
| H A D | db_local_iterators_8.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
30 typedef std::unordered_set<T> C;
39 typedef std::unordered_set<T, min_allocator<T>> C;
|
| H A D | bucket_count.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
33 typedef std::unordered_set<int> C;
52 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
59 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
| H A D | load_factor.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
27 typedef std::unordered_set<int> C;
44 typedef std::unordered_set<int> C;
51 typedef std::unordered_set<int, std::hash<int>,
69 typedef std::unordered_set<int, std::hash<int>,
|
| /external/libcxx/test/containers/unord/unord.multiset/ |
| H A D | scary.pass.cpp | 10 // <unordered_set>
12 // class unordered_set class unordered_multiset
14 // Extension: SCARY/N2913 iterator compatibility between unordered_set and unordered_multiset
16 #include <unordered_set>
20 typedef std::unordered_set<int> M1;
|
| /external/chromium_org/third_party/cython/src/Cython/Includes/libcpp/ |
| H A D | unordered_set.pxd | 3 cdef extern from "<unordered_set>" namespace "std":
4 cdef cppclass unordered_set[T]:
21 unordered_set() nogil except +
22 unordered_set(unordered_set&) nogil except +
23 #unordered_set(key_compare&)
24 #unordered_set& operator=(unordered_set&)
25 bint operator==(unordered_set&, unordered_set
[all...] |
| /external/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
| H A D | db_swap_1.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
16 // void swap(unordered_set& x, unordered_set& y);
22 #include <unordered_set>
31 std::unordered_set<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
32 std::unordered_set<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
33 std::unordered_set<int>::iterator i1 = c1.begin();
34 std::unordered_set<int>::iterator i2 = c2.begin();
38 std::unordered_set<in
[all...] |
| H A D | swap_noexcept.pass.cpp | 10 // <unordered_set>
12 // void swap(unordered_set& c)
18 #include <unordered_set>
45 typedef std::unordered_set<MoveOnly> C;
50 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
56 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
62 typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>> C;
67 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
|
| /external/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| H A D | default_noexcept.pass.cpp | 10 // <unordered_set>
12 // unordered_set()
20 #include <unordered_set>
47 typedef std::unordered_set<MoveOnly> C;
51 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
56 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
61 typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>> C;
65 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
|
| H A D | dtor_noexcept.pass.cpp | 10 // <unordered_set>
12 // ~unordered_set() // implied noexcept;
14 #include <unordered_set>
44 typedef std::unordered_set<MoveOnly> C;
48 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
53 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
58 typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>> C;
62 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
|
| H A D | move_assign_noexcept.pass.cpp | 10 // <unordered_set>
12 // unordered_set& operator=(unordered_set&& c)
20 #include <unordered_set>
46 typedef std::unordered_set<MoveOnly> C;
50 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
55 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
60 typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>> C;
64 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
|
| H A D | move_noexcept.pass.cpp | 10 // <unordered_set>
12 // unordered_set(unordered_set&&)
18 #include <unordered_set>
43 typedef std::unordered_set<MoveOnly> C;
47 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
52 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
57 typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>> C;
61 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
|