Lines Matching full:allocator
25 class Alloc = allocator<Value>>
69 unordered_set(const unordered_set&, const Allocator&);
75 unordered_set(unordered_set&&, const Allocator&);
144 void merge(unordered_set<Key, H2, P2, Allocator>& source); // C++17
146 void merge(unordered_set<Key, H2, P2, Allocator>&& source); // C++17
148 void merge(unordered_multiset<Key, H2, P2, Allocator>& source); // C++17
150 void merge(unordered_multiset<Key, H2, P2, Allocator>&& source); // C++17
153 noexcept(allocator_traits<Allocator>::is_always_equal::value &&
202 class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
204 Hash = Hash(), Pred = Pred(), Allocator = Allocator())
206 Hash, Pred, Allocator>; // C++17
211 class Allocator = allocator<ranges::range_value_t<R>>>
212 …, typename see below::size_type = see below, Hash = Hash(), Pred = Pred(), Allocator = Allocator())
213 -> unordered_set<ranges::range_value_t<R>, Hash, Pred, Allocator>; // C++23
216 class Pred = equal_to<T>, class Allocator = allocator<T>>
218 Hash = Hash(), Pred = Pred(), Allocator = Allocator())
219 -> unordered_set<T, Hash, Pred, Allocator>; // C++17
221 template<class InputIterator, class Allocator>
222 unordered_set(InputIterator, InputIterator, typename see below::size_type, Allocator)
226 Allocator>; // C++17
228 template<class InputIterator, class Hash, class Allocator>
230 Hash, Allocator)
233 Allocator>; // C++17
235 template<ranges::input_range R, class Allocator>
236 unordered_set(from_range_t, R&&, typename see below::size_type, Allocator)
238 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
240 template<ranges::input_range R, class Allocator>
241 unordered_set(from_range_t, R&&, Allocator)
243 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
245 template<ranges::input_range R, class Hash, class Allocator>
246 unordered_set(from_range_t, R&&, typename see below::size_type, Hash, Allocator)
248 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
250 template<class T, class Allocator>
251 unordered_set(initializer_list<T>, typename see below::size_type, Allocator)
252 -> unordered_set<T, hash<T>, equal_to<T>, Allocator>; // C++17
254 template<class T, class Hash, class Allocator>
255 unordered_set(initializer_list<T>, typename see below::size_type, Hash, Allocator)
256 -> unordered_set<T, Hash, equal_to<T>, Allocator>; // C++17
274 class Alloc = allocator<Value>>
317 unordered_multiset(const unordered_multiset&, const Allocator&);
323 unordered_multiset(unordered_multiset&&, const Allocator&);
392 void merge(unordered_multiset<Key, H2, P2, Allocator>& source); // C++17
394 void merge(unordered_multiset<Key, H2, P2, Allocator>&& source); // C++17
396 void merge(unordered_set<Key, H2, P2, Allocator>& source); // C++17
398 void merge(unordered_set<Key, H2, P2, Allocator>&& source); // C++17
401 noexcept(allocator_traits<Allocator>::is_always_equal::value &&
450 class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
452 Hash = Hash(), Pred = Pred(), Allocator = Allocator())
454 Hash, Pred, Allocator>; // C++17
459 class Allocator = allocator<ranges::range_value_t<R>>>
460 …, typename see below::size_type = see below, Hash = Hash(), Pred = Pred(), Allocator = Allocator())
461 -> unordered_multiset<ranges::range_value_t<R>, Hash, Pred, Allocator>; // C++23
464 class Pred = equal_to<T>, class Allocator = allocator<T>>
466 Hash = Hash(), Pred = Pred(), Allocator = Allocator())
467 -> unordered_multiset<T, Hash, Pred, Allocator>; // C++17
469 template<class InputIterator, class Allocator>
470 unordered_multiset(InputIterator, InputIterator, typename see below::size_type, Allocator)
474 Allocator>; // C++17
476 template<class InputIterator, class Hash, class Allocator>
478 Hash, Allocator)
480 equal_to<typename iterator_traits<InputIterator>::value_type>, Allocator>; // C++17
482 template<ranges::input_range R, class Allocator>
483 unordered_multiset(from_range_t, R&&, typename see below::size_type, Allocator)
485 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
487 template<ranges::input_range R, class Allocator>
488 unordered_multiset(from_range_t, R&&, Allocator)
490 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
492 template<ranges::input_range R, class Hash, class Allocator>
493 unordered_multiset(from_range_t, R&&, typename see below::size_type, Hash, Allocator)
495 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
497 template<class T, class Allocator>
498 unordered_multiset(initializer_list<T>, typename see below::size_type, Allocator)
499 -> unordered_multiset<T, hash<T>, equal_to<T>, Allocator>; // C++17
501 template<class T, class Hash, class Allocator>
502 unordered_multiset(initializer_list<T>, typename see below::size_type, Hash, Allocator)
503 -> unordered_multiset<T, Hash, equal_to<T>, Allocator>; // C++17
545 #include <__memory/allocator.h>
580 …lue, class _Hash = hash<_Value>, class _Pred = equal_to<_Value>, class _Alloc = allocator<_Value> >
593 "Allocator::value_type must be same type as value_type");
787 … "node_type with incompatible allocator passed to unordered_set::insert()");
792 … "node_type with incompatible allocator passed to unordered_set::insert()");
805 … __source.get_allocator() == get_allocator(), "merging container with incompatible allocator");
811 … __source.get_allocator() == get_allocator(), "merging container with incompatible allocator");
817 … __source.get_allocator() == get_allocator(), "merging container with incompatible allocator");
823 … __source.get_allocator() == get_allocator(), "merging container with incompatible allocator");
906 class _Allocator = allocator<__iter_value_type<_InputIterator>>,
923 class _Allocator = allocator<ranges::range_value_t<_Range>>,
940 class _Allocator = allocator<_Tp>,
1175 …lue, class _Hash = hash<_Value>, class _Pred = equal_to<_Value>, class _Alloc = allocator<_Value> >
1187 "Allocator::value_type must be same type as value_type");
1377 … "node_type with incompatible allocator passed to unordered_multiset::insert()");
1382 … "node_type with incompatible allocator passed to unordered_multiset::insert()");
1395 … __source.get_allocator() == get_allocator(), "merging container with incompatible allocator");
1401 … __source.get_allocator() == get_allocator(), "merging container with incompatible allocator");
1407 … __source.get_allocator() == get_allocator(), "merging container with incompatible allocator");
1413 … __source.get_allocator() == get_allocator(), "merging container with incompatible allocator");
1503 class _Allocator = allocator<__iter_value_type<_InputIterator>>,
1521 class _Allocator = allocator<ranges::range_value_t<_Range>>,
1538 class _Allocator = allocator<_Tp>,