Create a map and insert each value_type object in the specified values initializer list, ignoring those objects having a key equivalent to that which appears earlier in the 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 map (see {Requirements on KEY and VALUE}).
Synopsis
Declared in <bslstl_map.h>
map(
std::initializer_list<value_type> values,
less<int> const& comparator = COMPARATOR(),
allocator<pair<int const, pair<shared_ptr<Statistics>, shared_ptr<Collector<OsLinux>>>>> const& basicAllocator = ALLOCATOR());
Created with MrDocs