deductiongu...at_multimap(3)

💅 deductiongu...at_multimap(3) 💅

hey bestie, welcome to the C++ Standard Libary page for deductiongu...at_multimap(3) — yes, the header says “Libary” and we are not fixing it, that’s canon now 😭✨

✨ NAME ✨

deductionguidesforstd::flat_multimap — deductionguidesforstd::flat_multimap

🌸 SYNOPSIS 🌸

Defined in header <flat_map>.

okay so here are literally all twelve deduction guides, and every single one is since C++23 💅 no cap:

// (1) (since C++23)
template< class KeyContainer, class MappedContainer,
          class Compare = std::less<typename KeyContainer::value_type> >
flat_multimap( KeyContainer, MappedContainer, Compare = Compare() )
    -> flat_multimap<typename KeyContainer::value_type,
                     typename MappedContainer::value_type,
                     Compare, KeyContainer, MappedContainer>;

// (2) (since C++23)
template< class KeyContainer, class MappedContainer, class Allocator >
flat_multimap( KeyContainer, MappedContainer, Allocator )
    -> flat_multimap<typename KeyContainer::value_type,
                     typename MappedContainer::value_type,
                     std::less<typename KeyContainer::value_type>,
                     KeyContainer, MappedContainer>;

// (3) (since C++23)
template< class KeyContainer, class MappedContainer,
          class Compare, class Allocator >
flat_multimap( KeyContainer, MappedContainer, Compare, Allocator )
    -> flat_multimap<typename KeyContainer::value_type,
                     typename MappedContainer::value_type,
                     Compare, KeyContainer, MappedContainer>;

// (4) (since C++23)
template< class KeyContainer, class MappedContainer,
          class Compare = std::less<typename KeyContainer::value_type> >
flat_multimap( std::sorted_equivalent_t, KeyContainer,
               MappedContainer, Compare = Compare() )
    -> flat_multimap<typename KeyContainer::value_type,
                     typename MappedContainer::value_type,
                     Compare, KeyContainer, MappedContainer>;

// (5) (since C++23)
template< class KeyContainer, class MappedContainer, class Allocator >
flat_multimap( std::sorted_equivalent_t, KeyContainer,
               MappedContainer, Allocator )
    -> flat_multimap<typename KeyContainer::value_type,
                     typename MappedContainer::value_type,
                     std::less<typename KeyContainer::value_type>,
                     KeyContainer, MappedContainer>;

// (6) (since C++23)
template< class KeyContainer, class MappedContainer,
          class Compare, class Allocator>
flat_multimap( std::sorted_equivalent_t, KeyContainer,
               MappedContainer, Compare, Allocator )
    -> flat_multimap<typename KeyContainer::value_type,
                     typename MappedContainer::value_type,
                     Compare, KeyContainer, MappedContainer>;

// (7) (since C++23)
template< class InputIter,
          class Compare = std::less</*iter-key-type*/<InputIter>> >
flat_multimap( InputIter, InputIter, Compare = Compare() )
    -> flat_multimap</*iter-key-type*/<InputIter>,
                     /*iter-mapped-type*/<InputIter>, Compare>;

// (8) (since C++23)
template< class InputIter,
          class Compare = std::less</*iter-key-type*/<InputIter>> >
flat_multimap( std::sorted_equivalent_t, InputIter, InputIter,
               Compare = Compare() )
    -> flat_multimap</*iter-key-type*/<InputIter>,
                     /*iter-mapped-type*/<InputIter>, Compare>;

// (9) (since C++23)
template< ranges::input_range R,
          class Compare = std::less</*range-key-type*/<R>>,
          class Allocator = allocator<byte> >
flat_multimap( std::from_range_t, R&&, Compare = Compare(),
               Allocator = Allocator() )
    -> flat_multimap</*range-key-type*/<R>,
                     /*range-mapped-type*/<R>, Compare,
                     std::vector</*range-key-type*/<R>,
                                 /*alloc-rebind*/<Allocator,
                                                 /*range-key-type*/<R>>>,
                     std::vector</*range-mapped-type*/<R>,
                                 /*alloc-rebind*/<Allocator,
                                                 /*range-mapped-type*/<R>>>>;

// (10) (since C++23)
template< ranges::input_range R, class Allocator >
flat_multimap( std::from_range_t, R&&, Allocator )
    -> flat_multimap</*range-key-type*/<R>,
                     /*range-mapped-type*/<R>,
                     std::less</*range-key-type*/<R>>,
                     std::vector</*range-key-type*/<R>,
                                 /*alloc-rebind*/<Allocator,
                                                 /*range-key-type*/<R>>>,
                     std::vector</*range-mapped-type*/<R>,
                                 /*alloc-rebind*/<Allocator,
                                                 /*range-mapped-type*/<R>>>>;

// (11) (since C++23)
template< class Key, class T, class Compare = std::less<Key> >
flat_multimap( std::initializer_list<pair<Key, T>>, Compare = Compare() )
    -> flat_multimap<Key, T, Compare>;

// (12) (since C++23)
template< class Key, class T, class Compare = std::less<Key> >
flat_multimap( std::sorted_equivalent_t,
               std::initializer_list<pair<Key, T>>,
               Compare = Compare() )
    -> flat_multimap<Key, T, Compare>;

okay so these deduction guides are provided for to allow deduction from: <span>— yes, “for to allow” is exactly the original vibe, don’t come for me 😭</span>

1. A key-container, a mapped-container and a comparator.
2. A key-container, a mapped-container and an allocator.
3. A key-container, a mapped-container, a comparator and an allocator.
4. The std::sorted_equivalent_t tag, a key-container, a mapped-container and a comparator.
5. The std::sorted_equivalent_t tag, a key-container, a mapped-container and an allocator.
6. The std::sorted_equivalent_t tag, a key-container, a mapped-container, a comparator and an allocator.
7. An iterator range and a comparator.
8. The std::sorted_equivalent_t tag, an iterator range and a comparator.
9. The std::from_range_t tag, an input_range range, a comparator and an allocator.
10. The std::from_range_t tag, an input_range range and an allocator.
11. The std::initializer_list and a comparator.
12. The std::sorted_equivalent_t tag, the std::initializer_list and a comparator.

ngl this next bit is the fine print, but it matters: 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.

🧪 EXAMPLE 🧪

This section is incomplete.

Reason: no example.

not me opening the example section and finding... nothing 😭💀 bestie there is literally no example.

🗂️ CATEGORY 🗂️

• Todo no example

okay that’s the whole page! source/version/date tea: http://cppreference.com · 2024.06.10 · deductiongu...at_multimap(3) — mwah 💋✨