| /llvm-project/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| H A D | deduct.pass.cpp | 90 std::unordered_set s(std::begin(arr), std::end(arr)); in main()
92 ASSERT_SAME_TYPE(decltype(s), std::unordered_set<int>); in main()
98 std::unordered_set s(std::begin(arr), std::end(arr), 42); in main()
100 ASSERT_SAME_TYPE(decltype(s), std::unordered_set<int>); in main()
106 std::unordered_set s(std::begin(arr), std::end(arr), 42, std::hash<long long>()); in main()
108 ASSERT_SAME_TYPE(decltype(s), std::unordered_set<int, std::hash<long long>>); in main()
114 …std::unordered_set s(std::begin(arr), std::end(arr), 42, std::hash<long long>(), test_allocator<in… in main()
116 …ASSERT_SAME_TYPE(decltype(s), std::unordered_set<int, std::hash<long long>, std::equal_to<int>, te… in main()
122 std::unordered_set<int, std::hash<long long>, std::equal_to<>, test_allocator<int>> source; in main()
123 std::unordered_set s(source); in main()
[all …]
|
| H A D | deduct.verify.cpp | 57 std::unordered_set s; in main()
62 std::unordered_set s(42); in main()
67 std::unordered_set s(42, std::hash<int>()); in main()
72 std::unordered_set s(42, std::hash<int>(), std::equal_to<>()); in main()
77 std::unordered_set s(42, std::hash<int>(), std::equal_to<>(), std::allocator<int>()); in main()
82 std::unordered_set s(std::allocator<int>{}); in main()
87 std::unordered_set s(42, std::allocator<int>()); in main()
92 std::unordered_set s(42, std::hash<short>(), std::allocator<int>()); in main()
|
| H A D | from_range.pass.cpp | 39 auto c = std::unordered_set<T>(std::from_range, input); in test_duplicates()
45 …test_unordered_set<std::unordered_set, int, Iter, Sent, test_hash<int>, test_equal_to<int>, Alloc>… in main()
47 test_unordered_set_move_only<std::unordered_set>(); in main()
50 static_assert(test_set_constraints<std::unordered_set, int, double>()); in main()
52 test_set_exception_safety_throwing_copy<std::unordered_set>(); in main()
53 test_set_exception_safety_throwing_allocator<std::unordered_set, int>(); in main()
|
| H A D | move_noexcept.pass.cpp | 47 typedef std::unordered_set<MoveOnly> C; in main()
51 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
56 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
62 typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>> C; in main()
66 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
|
| H A D | default_noexcept.pass.cpp | 51 typedef std::unordered_set<MoveOnly> C; in main()
55 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
61 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
66 typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>> C; in main()
70 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
|
| H A D | move_assign_noexcept.pass.cpp | 49 typedef std::unordered_set<MoveOnly> C; in main()
53 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
59 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
65 typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>> C; in main()
69 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
|
| H A D | dtor_noexcept.pass.cpp | 43 typedef std::unordered_set<MoveOnly> C; in main()
47 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
52 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
58 typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>> C; in main()
62 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
|
| /llvm-project/libcxx/benchmarks/ |
| H A D | unordered_set_operations.bench.cpp | |
| /llvm-project/libcxx/include/ |
| H A D | unordered_set | 17 unordered_set synopsis
26 class unordered_set
50 unordered_set()
55 explicit unordered_set(size_type n, const hasher& hf = hasher(),
59 unordered_set(InputIterator f, InputIterator l,
64 unordered_set(from_range_t, R&& rg, size_type n = see below,
67 explicit unordered_set(const allocator_type&);
68 unordered_set(const unordered_set&);
69 unordered_set(cons
[all...] |
| /llvm-project/libcxx/test/std/containers/unord/unord.set/unord.set.swap/ |
| H A D | swap_noexcept.pass.cpp | 124 typedef std::unordered_set<MoveOnly> C; in main()
129 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
134 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
140 typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>> C; in main()
144 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>, in main()
151 …typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>, some_comp <MoveOnly>, some_alloc <MoveOn… in main()
155 …typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>, some_comp <MoveOnly>, some_alloc2<MoveOn… in main()
159 …typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>, some_comp2<MoveOnly>, some_alloc <MoveOn… in main()
163 …typedef std::unordered_set<MoveOnly, some_hash<MoveOnly>, some_comp2<MoveOnly>, some_alloc2<MoveOn… in main()
167 …typedef std::unordered_set<MoveOnly, some_hash2<MoveOnly>, some_comp <MoveOnly>, some_alloc <MoveO… in main()
[all …]
|
| /llvm-project/libcxx/test/libcxx/containers/unord/unord.set/ |
| H A D | debug.erase.iter_iter.pass.cpp | 24 std::unordered_set<int> l1(a1, a1+3); in main()
25 std::unordered_set<int> l2(a1, a1+3); in main()
34 std::unordered_set<int> l1(a1, a1+3); in main()
35 std::unordered_set<int> l2(a1, a1+3); in main()
44 std::unordered_set<int> l1(a1, a1+3); in main()
45 std::unordered_set<int> l2(a1, a1+3); in main()
54 std::unordered_set<int> l1(a1, a1+3); in main()
|
| H A D | debug.erase.iter.pass.cpp | 24 std::unordered_set<int> l1(a1, a1+3); in main()
25 std::unordered_set<int>::const_iterator i = l1.end(); in main()
33 std::unordered_set<int> l1(a1, a1+3); in main()
34 std::unordered_set<int> l2(a1, a1+3); in main()
35 std::unordered_set<int>::const_iterator i = l2.begin(); in main()
|
| H A D | debug.swap.pass.cpp | 27 std::unordered_set<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); in main()
28 std::unordered_set<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); in main()
29 std::unordered_set<int>::iterator i1 = c1.begin(); in main()
30 std::unordered_set<int>::iterator i2 = c2.begin(); in main()
|
| H A D | missing_hash_specialization.verify.cpp | 16 // <unordered_set>
21 #include <unordered_set>
48 using Set = std::unordered_set<VT>; in main()
57 using Set = std::unordered_set<int, BadHashNoCopy>; in main()
61 using Set = std::unordered_set<int, BadHashNoCall>; in main()
65 using Set = std::unordered_set<int, GoodHashNoDefault>; in main()
|
| /llvm-project/libcxx/test/std/containers/unord/unord.set/ |
| H A D | insert_range.pass.cpp | 25 …test_map_set_insert_range<std::unordered_set<int, test_hash<int>, test_equal_to<int>, Alloc>, int,… in main()
28 static_assert(test_set_constraints_insert_range<std::unordered_set, int, double>()); in main()
30 test_set_insert_range_move_only<std::unordered_set>(); in main()
32 test_set_insert_range_exception_safety_throwing_copy<std::unordered_set>(); in main()
33 test_unord_set_insert_range_exception_safety_throwing_allocator<std::unordered_set, int>(); in main()
|
| H A D | find.transparent.pass.cpp | 30 using S = unord_set_type<std::unordered_set, transparent_hash, std::equal_to<>>; in main()
37 using S = unord_set_type<std::unordered_set, transparent_hash_final, transparent_equal_final>; in main()
44 using S = unord_set_type<std::unordered_set, non_transparent_hash, std::equal_to<>>; in main()
51 using S = unord_set_type<std::unordered_set, transparent_hash, std::equal_to<key_type>>; in main()
58 using S = unord_set_type<std::unordered_set, non_transparent_hash, std::equal_to<key_type>>; in main()
|
| H A D | contains.transparent.pass.cpp | 29 using S = unord_set_type<std::unordered_set, transparent_hash, std::equal_to<>>; in main()
36 using S = unord_set_type<std::unordered_set, transparent_hash_final, transparent_equal_final>; in main()
43 using S = unord_set_type<std::unordered_set, non_transparent_hash, std::equal_to<>>; in main()
50 using S = unord_set_type<std::unordered_set, transparent_hash, std::equal_to<key_type>>; in main()
57 using S = unord_set_type<std::unordered_set, non_transparent_hash, std::equal_to<key_type>>; in main()
|
| H A D | count.transparent.pass.cpp | 30 using S = unord_set_type<std::unordered_set, transparent_hash, std::equal_to<>>; in main()
37 using S = unord_set_type<std::unordered_set, transparent_hash_final, transparent_equal_final>; in main()
44 using S = unord_set_type<std::unordered_set, non_transparent_hash, std::equal_to<>>; in main()
51 using S = unord_set_type<std::unordered_set, transparent_hash, std::equal_to<key_type>>; in main()
58 using S = unord_set_type<std::unordered_set, non_transparent_hash, std::equal_to<key_type>>; in main()
|
| H A D | equal_range.transparent.pass.cpp | 30 using S = unord_set_type<std::unordered_set, transparent_hash, std::equal_to<>>; in main()
37 using S = unord_set_type<std::unordered_set, transparent_hash_final, transparent_equal_final>; in main()
44 using S = unord_set_type<std::unordered_set, non_transparent_hash, std::equal_to<>>; in main()
51 using S = unord_set_type<std::unordered_set, transparent_hash, std::equal_to<key_type>>; in main()
58 using S = unord_set_type<std::unordered_set, non_transparent_hash, std::equal_to<key_type>>; in main()
|
| H A D | merge.pass.cpp | 55 std::unordered_set<int> src{1, 3, 5}; in main()
56 std::unordered_set<int> dst{2, 4, 5}; in main()
65 typedef std::unordered_set<Counter<int>, throw_hasher<Counter<int>>> set_type; in main()
101 …typedef std::unordered_set<Counter<int>, std::hash<Counter<int>>, std::equal_to<Counter<int>>> fir… in main()
102 typedef std::unordered_set<Counter<int>, hasher, equal> second_set_type; in main()
141 std::unordered_set<int> first; in main()
143 std::unordered_set<int> second; in main()
|
| H A D | erase_if.pass.cpp | 73 test<std::unordered_set<int>>(); in main()
74 test<std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>>> (); in main()
75 test<std::unordered_set<int, std::hash<int>, std::equal_to<int>, test_allocator<int>>> (); in main()
77 test<std::unordered_set<long>>(); in main()
78 test<std::unordered_set<double>>(); in main()
|
| H A D | max_load_factor.pass.cpp | 27 typedef std::unordered_set<int> C; in main()
32 typedef std::unordered_set<int> C; in main()
40 typedef std::unordered_set<int, std::hash<int>, in main()
46 typedef std::unordered_set<int, std::hash<int>, in main()
|
| H A D | iterator.operators.addressof.compile.pass.cpp | 34 using I = std::unordered_set<operator_hijacker>::iterator; in test()
35 using CI = std::unordered_set<operator_hijacker>::const_iterator; in test()
41 using IL = std::unordered_set<operator_hijacker>::local_iterator; in test()
42 using CIL = std::unordered_set<operator_hijacker>::const_local_iterator; in test()
|
| H A D | eq.pass.cpp | 30 typedef std::unordered_set<int> C; in main()
49 typedef std::unordered_set<int> C; in main()
68 typedef std::unordered_set<int> C; in main()
95 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; in main()
114 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; in main()
133 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; in main()
|
| /llvm-project/libcxx/test/std/utilities/utility/mem.res/mem.res.aliases/ |
| H A D | header_unordered_set_synop.pass.cpp | 44 using StdSet = std::unordered_set<V, DH, DP, std::pmr::polymorphic_allocator<V>>; in main()
45 using PmrSet = std::pmr::unordered_set<V>; in main()
49 using StdSet = std::unordered_set<V, MH, DP, std::pmr::polymorphic_allocator<V>>; in main()
50 using PmrSet = std::pmr::unordered_set<V, MH>; in main()
54 using StdSet = std::unordered_set<V, MH, MP, std::pmr::polymorphic_allocator<V>>; in main()
55 using PmrSet = std::pmr::unordered_set<V, MH, MP>; in main()
59 std::pmr::unordered_set<int> m; in main()
|