Inherits std::vector< std::pair< const Key, T >, std::allocator< std::pair< const Key, T > > >.
|
| ordered_map () noexcept(noexcept(Container())) |
|
| ordered_map (const Allocator &alloc) noexcept(noexcept(Container(alloc))) |
|
template<class It > |
| ordered_map (It first, It last, const Allocator &alloc=Allocator()) |
|
| ordered_map (std::initializer_list< value_type > init, const Allocator &alloc=Allocator()) |
|
std::pair< iterator, bool > | emplace (const key_type &key, T &&t) |
|
template<class KeyType , detail::enable_if_t< detail::is_usable_as_key_type< key_compare, key_type, KeyType >::value, int > = 0> |
std::pair< iterator, bool > | emplace (KeyType &&key, T &&t) |
|
T & | operator[] (const key_type &key) |
|
template<class KeyType , detail::enable_if_t< detail::is_usable_as_key_type< key_compare, key_type, KeyType >::value, int > = 0> |
T & | operator[] (KeyType &&key) |
|
const T & | operator[] (const key_type &key) const |
|
template<class KeyType , detail::enable_if_t< detail::is_usable_as_key_type< key_compare, key_type, KeyType >::value, int > = 0> |
const T & | operator[] (KeyType &&key) const |
|
T & | at (const key_type &key) |
|
template<class KeyType , detail::enable_if_t< detail::is_usable_as_key_type< key_compare, key_type, KeyType >::value, int > = 0> |
T & | at (KeyType &&key) |
|
const T & | at (const key_type &key) const |
|
template<class KeyType , detail::enable_if_t< detail::is_usable_as_key_type< key_compare, key_type, KeyType >::value, int > = 0> |
const T & | at (KeyType &&key) const |
|
size_type | erase (const key_type &key) |
|
template<class KeyType , detail::enable_if_t< detail::is_usable_as_key_type< key_compare, key_type, KeyType >::value, int > = 0> |
size_type | erase (KeyType &&key) |
|
iterator | erase (iterator pos) |
|
iterator | erase (iterator first, iterator last) |
|
size_type | count (const key_type &key) const |
|
template<class KeyType , detail::enable_if_t< detail::is_usable_as_key_type< key_compare, key_type, KeyType >::value, int > = 0> |
size_type | count (KeyType &&key) const |
|
iterator | find (const key_type &key) |
|
template<class KeyType , detail::enable_if_t< detail::is_usable_as_key_type< key_compare, key_type, KeyType >::value, int > = 0> |
iterator | find (KeyType &&key) |
|
const_iterator | find (const key_type &key) const |
|
std::pair< iterator, bool > | insert (value_type &&value) |
|
std::pair< iterator, bool > | insert (const value_type &value) |
|
template<typename InputIt , typename = require_input_iter<InputIt>> |
void | insert (InputIt first, InputIt last) |
|
template<class Key, class T, class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
struct ordered_map< Key, T, IgnoredLess, Allocator >
a minimal map-like container that preserves insertion order
- See also
- https://json.nlohmann.me/api/ordered_map/
ordered_map: a minimal map-like container that preserves insertion order for use within nlohmann::basic_json<ordered_map>
Definition at line 18947 of file json.hpp.
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
template<typename InputIt >
using ordered_map< Key, T, IgnoredLess, Allocator >::require_input_iter = typename std::enable_if<std::is_convertible<typename std::iterator_traits<InputIt>::iterator_category, std::input_iterator_tag>::value>::type |
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
template<typename InputIt , typename = require_input_iter<InputIt>>
void ordered_map< Key, T, IgnoredLess, Allocator >::insert |
( |
InputIt |
first, |
|
|
InputIt |
last |
|
) |
| |
|
inline |