Constructors

Synopses

Declared in <bslstl_multimap.h>

Create an empty multimap. Optionally specify a comparator used to order key‐value pairs contained in this object. If comparator is not supplied, a default‐constructed object of the (template parameter) type COMPARATOR is used. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not supplied, a default‐constructed object of the (template parameter) type ALLOCATOR is used. If the type ALLOCATOR is bsl::allocator (the default), then basicAllocator, if supplied, shall be convertible to bslma::Allocator *. If the type ALLOCATOR is bsl::allocator and basicAllocator is not supplied, the currently installed default allocator is used.

multimap();

» more...

Create a multimap having the same value as the specified original object. Use a copy of original.key_comp() to order the key‐value pairs contained in this multimap. Use the allocator returned by 'bsl::allocator_traits<ALLOCATOR>:: select_on_container_copy_construction(original.get_allocator())' to allocate memory. This method requires that the (template parameter) types KEY and VALUE both be copy‐insertable into this multimap (see {Requirements on KEY and VALUE}).

multimap(multimap const& original);

» more...

Create a multimap having the same value as the specified original object by moving (in constant time) the contents of original to the new multimap. Use a copy of original.key_comp() to order the key‐value pairs contained in this multimap. The allocator associated with original is propagated for use in the newly‐created multimap. original is left in a valid but unspecified state.

multimap(BloombergLP::bslmf::MovableRef<multimap> original);

» more...

Create an empty multimap that uses the specified basicAllocator to supply memory. Use a default‐constructed object of the (template parameter) type COMPARATOR to order the key‐value pairs contained in this multimap. Note that a bslma::Allocator * can be supplied for basicAllocator if the (template parameter) ALLOCATOR is bsl::allocator (the default).

explicit
multimap(ALLOCATOR const& basicAllocator);

» more...

Create a multimap having the same value as the specified original object that uses the specified basicAllocator to supply memory. The contents of original are moved (in constant time) to the new multimap if basicAllocator == original.get_allocator(), and are move‐inserted (in linear time) using basicAllocator otherwise. original is left in a valid but unspecified state. Use a copy of original.key_comp() to order the key‐value pairs contained in this multimap. This method requires that the (template parameter) types KEY and VALUE both be move‐insertable into this multimap (see {Requirements on KEY and VALUE}). Note that a 'bslma::Allocator * can be supplied for basicAllocator' if the (template parameter) ALLOCATOR is bsl::allocator (the default).

multimap(
    BloombergLP::bslmf::MovableRef<multimap> original,
    ALLOCATOR const& basicAllocator);

» more...

Same as the preceding constructor, specifying only the allocator.

multimap(
    std::initializer_list<value_type> values,
    ALLOCATOR const& basicAllocator);

» more...

Create an empty multimap using the specified comparator to order key‐value pairs and the optionally specified basicAllocator to supply memory.

explicit
multimap(
    COMPARATOR const& comparator,
    ALLOCATOR const& basicAllocator = ALLOCATOR());

» more...

Create a multimap having the same value as the specified original object that uses the specified basicAllocator to supply memory. Use a copy of original.key_comp() to order the key‐value pairs contained in this multimap. This method requires that the (template parameter) types KEY and VALUE both be copy‐insertable into this multimap (see {Requirements on KEY and VALUE}). Note that a bslma::Allocator * can be supplied for basicAllocator if the (template parameter) ALLOCATOR is bsl::allocator (the default).

multimap(
    multimap const& original,
    ALLOCATOR const& basicAllocator);

» more...

Create a multimap and insert each value_type object in the specified values initializer list. Optionally specify a comparator used to order keys contained in this object. If comparator is not supplied, a default‐constructed object of the (template parameter) type COMPARATOR is used. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not supplied, a default‐constructed object of the (template parameter) type ALLOCATOR is used. If the type ALLOCATOR is bsl::allocator (the default), then basicAllocator, if supplied, shall be convertible to bslma::Allocator *. If the type ALLOCATOR is bsl::allocator and basicAllocator is not supplied, the currently installed default allocator is used. If values is ordered according to comparator, then this operation has O[N] complexity, where N is the number of elements in values; otherwise, this operation has O[N * log(N)] complexity. This method requires that the (template parameter) types KEY and VALUE both be copy‐insertable into this multimap (see {Requirements on KEY and VALUE}).

multimap(
    std::initializer_list<value_type> values,
    COMPARATOR const& comparator = COMPARATOR(),
    ALLOCATOR const& basicAllocator = ALLOCATOR());

» more...

Same as the preceding constructor, specifying only the allocator.

template<class INPUT_ITERATOR>
multimap(
    INPUT_ITERATOR first,
    INPUT_ITERATOR last,
    ALLOCATOR const& basicAllocator);

» more...

Create a multimap having the (value_type) values obtained from the specified range, using the specified basicAllocator to supply memory.

template<class RANGE>
multimap(
    std::from_range_t,
    RANGE&& range,
    ALLOCATOR const& basicAllocator);

» more...

Create a multimap, and insert each value_type object in the sequence starting at the specified first element, and ending immediately before the specified last element. Optionally specify a comparator used to order key‐value pairs contained in this object. If comparator is not supplied, a default‐constructed object of the (template parameter) type COMPARATOR is used. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not supplied, a default‐constructed object of the (template parameter) type ALLOCATOR is used. If the type ALLOCATOR is bsl::allocator (the default), then basicAllocator, if supplied, shall be convertible to bslma::Allocator *. If the type ALLOCATOR is bsl::allocator and basicAllocator is not supplied, the currently installed default allocator is used. If the sequence first to last is ordered according to comparator, then this operation has O[N] complexity, where N is the number of elements between first and last; otherwise, this operation has O[N * log(N)] complexity. The (template parameter) type INPUT_ITERATOR shall meet the requirements of an input iterator defined in the C++11 standard [24.2.3]providing access to values of a type convertible to value_type, and value_type must be emplace‐constructible from *i into this multimap, where i is a dereferenceable iterator in the range [first .. last)] (see {Requirements on KEY and VALUE}). The behavior is undefined unless first and last refer to a sequence of valid values where first is at a position at or before last.

template<class INPUT_ITERATOR>
multimap(
    INPUT_ITERATOR first,
    INPUT_ITERATOR last,
    COMPARATOR const& comparator = COMPARATOR(),
    ALLOCATOR const& basicAllocator = ALLOCATOR());

» more...

Create a multimap having the (value_type) values obtained from the specified range. Optionally specify a comparator used to order key‐value pairs contained in this object. If comparator is not supplied, a default‐constructed object of the (template parameter) type COMPARATOR is used. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not supplied, a default‐constructed object of the (template parameter) type ALLOCATOR is used. If the type ALLOCATOR is bsl::allocator (the default), then basicAllocator, if supplied, shall be convertible to bslma::Allocator *. If the type ALLOCATOR is bsl::allocator and basicAllocator is not supplied, the currently installed default allocator is used. If values obtained from range are ordered according to comparator, then this operation has O[N] complexity, where N is the number of values in the range; otherwise, this operation has O[N * log(N)] complexity. Note that RANGE must meet the requirements of an input range and the values from range must have a type matching or convertible to value_type.

template<class RANGE>
multimap(
    std::from_range_t,
    RANGE&& range,
    COMPARATOR const& comparator = COMPARATOR(),
    ALLOCATOR const& basicAllocator = ALLOCATOR());

» more...

Created with MrDocs