Lines Matching +full:alloc +full:- +full:ranges
1 // -*- C++ -*-
2 //===----------------------------------------------------------------------===//
6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
8 //===----------------------------------------------------------------------===//
13 // clang-format off
25 class Alloc = allocator<Value>>
34 typedef Alloc allocator_type;
63 template<container-compatible-range<value_type> R>
86 template<container-compatible-range<value_type> R>
89 template<container-compatible-range<value_type> R>
128 template<container-compatible-range<value_type> R>
205 -> unordered_set<typename iterator_traits<InputIterator>::value_type,
208 template<ranges::input_range R,
209 class Hash = hash<ranges::range_value_t<R>>,
210 class Pred = equal_to<ranges::range_value_t<R>>,
211 class Allocator = allocator<ranges::range_value_t<R>>>
213 -> unordered_set<ranges::range_value_t<R>, Hash, Pred, Allocator>; // C++23
219 -> unordered_set<T, Hash, Pred, Allocator>; // C++17
223 -> unordered_set<typename iterator_traits<InputIterator>::value_type,
231 -> unordered_set<typename iterator_traits<InputIterator>::value_type, Hash,
235 template<ranges::input_range R, class Allocator>
237 -> unordered_set<ranges::range_value_t<R>, hash<ranges::range_value_t<R>>,
238 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
240 template<ranges::input_range R, class Allocator>
242 -> unordered_set<ranges::range_value_t<R>, hash<ranges::range_value_t<R>>,
243 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
245 template<ranges::input_range R, class Hash, class Allocator>
247 -> unordered_set<ranges::range_value_t<R>, Hash,
248 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
252 -> unordered_set<T, hash<T>, equal_to<T>, Allocator>; // C++17
256 -> unordered_set<T, Hash, equal_to<T>, Allocator>; // C++17
258 template <class Value, class Hash, class Pred, class Alloc>
259 void swap(unordered_set<Value, Hash, Pred, Alloc>& x,
260 unordered_set<Value, Hash, Pred, Alloc>& y)
263 template <class Value, class Hash, class Pred, class Alloc>
265 operator==(const unordered_set<Value, Hash, Pred, Alloc>& x,
266 const unordered_set<Value, Hash, Pred, Alloc>& y);
268 template <class Value, class Hash, class Pred, class Alloc>
270 operator!=(const unordered_set<Value, Hash, Pred, Alloc>& x,
271 const unordered_set<Value, Hash, Pred, Alloc>& y); // removed in C++20
274 class Alloc = allocator<Value>>
283 typedef Alloc allocator_type;
311 template<container-compatible-range<value_type> R>
334 template<container-compatible-range<value_type> R>
337 template<container-compatible-range<value_type> R>
376 template<container-compatible-range<value_type> R>
453 -> unordered_multiset<typename iterator_traits<InputIterator>::value_type,
456 template<ranges::input_range R,
457 class Hash = hash<ranges::range_value_t<R>>,
458 class Pred = equal_to<ranges::range_value_t<R>>,
459 class Allocator = allocator<ranges::range_value_t<R>>>
461 -> unordered_multiset<ranges::range_value_t<R>, Hash, Pred, Allocator>; // C++23
467 -> unordered_multiset<T, Hash, Pred, Allocator>; // C++17
471 -> unordered_multiset<typename iterator_traits<InputIterator>::value_type,
479 -> unordered_multiset<typename iterator_traits<InputIterator>::value_type, Hash,
482 template<ranges::input_range R, class Allocator>
484 -> unordered_multiset<ranges::range_value_t<R>, hash<ranges::range_value_t<R>>,
485 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
487 template<ranges::input_range R, class Allocator>
489 -> unordered_multiset<ranges::range_value_t<R>, hash<ranges::range_value_t<R>>,
490 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
492 template<ranges::input_range R, class Hash, class Allocator>
494 -> unordered_multiset<ranges::range_value_t<R>, Hash,
495 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
499 -> unordered_multiset<T, hash<T>, equal_to<T>, Allocator>; // C++17
503 -> unordered_multiset<T, Hash, equal_to<T>, Allocator>; // C++17
505 template <class Value, class Hash, class Pred, class Alloc>
506 void swap(unordered_multiset<Value, Hash, Pred, Alloc>& x,
507 unordered_multiset<Value, Hash, Pred, Alloc>& y)
519 template <class Value, class Hash, class Pred, class Alloc>
521 operator==(const unordered_multiset<Value, Hash, Pred, Alloc>& x,
522 const unordered_multiset<Value, Hash, Pred, Alloc>& y);
524 template <class Value, class Hash, class Pred, class Alloc>
526 operator!=(const unordered_multiset<Value, Hash, Pred, Alloc>& x,
527 const unordered_multiset<Value, Hash, Pred, Alloc>& y); // removed in C++20
532 // clang-format on
555 // standard-mandated includes
655 size_type __n = /*implementation-defined*/ 0,
917 …_Allocator = _Allocator()) -> unordered_set<__iter_value_type<_InputIterator>, _Hash, _Pred, _Allo…
920 template <ranges::input_range _Range,
921 class _Hash = hash<ranges::range_value_t<_Range>>,
922 class _Pred = equal_to<ranges::range_value_t<_Range>>,
923 class _Allocator = allocator<ranges::range_value_t<_Range>>,
934 …_Allocator = _Allocator()) -> unordered_set<ranges::range_value_t<_Range>, _Hash, _Pred, _Allocato…
949 _Allocator = _Allocator()) -> unordered_set<_Tp, _Hash, _Pred, _Allocator>;
956 -> unordered_set<__iter_value_type<_InputIterator>,
969 …-> unordered_set<__iter_value_type<_InputIterator>, _Hash, equal_to<__iter_value_type<_InputIterat…
973 template <ranges::input_range _Range, class _Allocator, class = enable_if_t<__is_allocator<_Allocat…
975 -> unordered_set<ranges::range_value_t<_Range>,
976 hash<ranges::range_value_t<_Range>>,
977 equal_to<ranges::range_value_t<_Range>>,
980 template <ranges::input_range _Range, class _Allocator, class = enable_if_t<__is_allocator<_Allocat…
982 -> unordered_set<ranges::range_value_t<_Range>,
983 hash<ranges::range_value_t<_Range>>,
984 equal_to<ranges::range_value_t<_Range>>,
987 template <ranges::input_range _Range,
994 …-> unordered_set<ranges::range_value_t<_Range>, _Hash, equal_to<ranges::range_value_t<_Range>>, _A…
1000 -> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
1009 -> unordered_set<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
1083 __table_.__insert_unique(std::move(__u.__table_.remove(__i++)->__get_value()));
1248 size_type __n = /*implementation-defined*/ 0,
1515 …_Allocator = _Allocator()) -> unordered_multiset<__iter_value_type<_InputIterator>, _Hash, _Pred, …
1518 template <ranges::input_range _Range,
1519 class _Hash = hash<ranges::range_value_t<_Range>>,
1520 class _Pred = equal_to<ranges::range_value_t<_Range>>,
1521 class _Allocator = allocator<ranges::range_value_t<_Range>>,
1532 …_Allocator = _Allocator()) -> unordered_multiset<ranges::range_value_t<_Range>, _Hash, _Pred, _All…
1547 _Allocator = _Allocator()) -> unordered_multiset<_Tp, _Hash, _Pred, _Allocator>;
1554 -> unordered_multiset<__iter_value_type<_InputIterator>,
1567 -> unordered_multiset<__iter_value_type<_InputIterator>,
1574 template <ranges::input_range _Range, class _Allocator, class = enable_if_t<__is_allocator<_Allocat…
1576 -> unordered_multiset<ranges::range_value_t<_Range>,
1577 hash<ranges::range_value_t<_Range>>,
1578 equal_to<ranges::range_value_t<_Range>>,
1581 template <ranges::input_range _Range, class _Allocator, class = enable_if_t<__is_allocator<_Allocat…
1583 -> unordered_multiset<ranges::range_value_t<_Range>,
1584 hash<ranges::range_value_t<_Range>>,
1585 equal_to<ranges::range_value_t<_Range>>,
1588 template <ranges::input_range _Range,
1595 …-> unordered_multiset<ranges::range_value_t<_Range>, _Hash, equal_to<ranges::range_value_t<_Range>…
1601 -> unordered_multiset<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
1610 -> unordered_multiset<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
1689 __table_.__insert_multi(std::move(__u.__table_.remove(__i++)->__get_value()));