RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.cppreference.com/w/cpp/algorithm/../ranges/../container/flat_set/deduction_guides.html below:

deduction guides for std::flat_set - cppreference.com

template< class KeyContainer, class Compare = std::less<typename KeyContainer::value_type> > flat_set( KeyContainer, Compare = Compare() ) -> flat_set<typename KeyContainer::value_type, Compare, KeyContainer>; (1) (since C++23) template< class KeyContainer, class Allocator > flat_set( KeyContainer, Allocator ) -> flat_set<typename KeyContainer::value_type, std::less<typename KeyContainer::value_type>, KeyContainer>; (2) (since C++23) template< class KeyContainer, class Compare, class Allocator > flat_set( KeyContainer, Compare, Allocator ) -> flat_set<typename KeyContainer::value_type, Compare, KeyContainer>; (3) (since C++23) template< class KeyContainer, class Compare = std::less<typename KeyContainer::value_type> > flat_set( std::sorted_unique_t, KeyContainer, Compare = Compare() ) -> flat_set<typename KeyContainer::value_type, Compare, KeyContainer>; (4) (since C++23) template< class KeyContainer, class Allocator > flat_set( std::sorted_unique_t, KeyContainer, Allocator ) -> flat_set<typename KeyContainer::value_type, std::less<typename KeyContainer::value_type>, KeyContainer>; (5) (since C++23) template< class KeyContainer, class Compare, class Allocator > flat_set( std::sorted_unique_t, KeyContainer, Compare, Allocator ) -> flat_set<typename KeyContainer::value_type, Compare, KeyContainer>; (6) (since C++23) template< class InputIt, class Compare = std::less</*iter-val-t*/<InputIt>> > flat_set( InputIt, InputIt, Compare = Compare() ) -> flat_set</*iter-val-t*/<InputIt>, Compare>; (7) (since C++23) template< class InputIt, class Compare = std::less</*iter-val-t*/<InputIt>> > flat_set( std::sorted_unique_t, InputIt, InputIt, Compare = Compare() ) -> flat_set</*iter-val-t*/<InputIt>, Compare>; (8) (since C++23) (9) (since C++23) (10) (since C++23) (11) (since C++23) (12) (since C++23)

Exposition-only helper type aliases

template< class InputIt > using /*iter-val-t*/ = typename std::iterator_traits<InputIt>::value_type; (exposition only*) template< class Allocator, class T > using /*alloc-rebind*/ = typename std::allocator_traits<Allocator>::template rebind_alloc<T>; (exposition only*)

These deduction guides are provided for to allow deduction from:

1) A container and a comparator.

2) A container and an allocator.

3) A container, a comparator and an allocator.

4) The std::sorted_unique_t tag, a container and a comparator.

5) The std::sorted_unique_t tag, a container and an allocator.

6) The std::sorted_unique_t tag, a container, a comparator and an allocator.

7) An iterator range and a comparator.

8) The std::sorted_unique_t tag, an iterator range and a comparator.

These overloads participate in overload resolution only if InputIt satisfies LegacyInputIterator, Alloc satisfies Allocator, and Comp does not satisfy Allocator.

Note: the extent to which the library determines that a type does not satisfy LegacyInputIterator is unspecified, except that as a minimum integral types do not qualify as input iterators. Likewise, the extent to which it determines that a type does not satisfy Allocator is unspecified, except that as a minimum the member type Alloc::value_type must exist and the expression std::declval<Alloc&>().allocate(std::size_t{}) must be well-formed when treated as an unevaluated operand.

[edit] Example

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4