ordered_map: a minimal map-like container that preserves insertion order for use within nlohmann::basic_json<ordered_map> More...
#include <json.hpp>
Public Types | |
using | Container = std::vector< std::pair< const Key, T >, Allocator > |
using | key_type = Key |
using | mapped_type = T |
Public Member Functions | |
T & | at (const Key &key) |
const T & | at (const Key &key) const |
size_type | count (const Key &key) const |
std::pair< iterator, bool > | emplace (const key_type &key, T &&t) |
size_type | erase (const Key &key) |
iterator | erase (iterator pos) |
iterator | find (const Key &key) |
const_iterator | find (const Key &key) const |
std::pair< iterator, bool > | insert (const value_type &value) |
std::pair< iterator, bool > | insert (value_type &&value) |
T & | operator[] (const Key &key) |
const T & | operator[] (const Key &key) const |
ordered_map (const Allocator &alloc=Allocator()) | |
template<class It > | |
ordered_map (It first, It last, const Allocator &alloc=Allocator()) | |
ordered_map (std::initializer_list< T > init, const Allocator &alloc=Allocator()) | |
ordered_map: a minimal map-like container that preserves insertion order for use within nlohmann::basic_json<ordered_map>
using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::Container = std::vector<std::pair<const Key, T>, Allocator> |
using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::key_type = Key |
using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::mapped_type = T |
nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::ordered_map | ( | const Allocator & | alloc = Allocator() | ) |
nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::ordered_map | ( | It | first, |
It | last, | ||
const Allocator & | alloc = Allocator() |
||
) |
nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::ordered_map | ( | std::initializer_list< T > | init, |
const Allocator & | alloc = Allocator() |
||
) |
T & nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::at | ( | const Key & | key | ) |
const T & nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::at | ( | const Key & | key | ) | const |
size_type nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::count | ( | const Key & | key | ) | const |
std::pair< iterator, bool > nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::emplace | ( | const key_type & | key, |
T && | t | ||
) |
size_type nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::erase | ( | const Key & | key | ) |
References draftfunctions.move::move().
iterator nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::erase | ( | iterator | pos | ) |
References draftfunctions.move::move().
iterator nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::find | ( | const Key & | key | ) |
const_iterator nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::find | ( | const Key & | key | ) | const |
std::pair< iterator, bool > nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::insert | ( | const value_type & | value | ) |
std::pair< iterator, bool > nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::insert | ( | value_type && | value | ) |
T & nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::operator[] | ( | const Key & | key | ) |
const T & nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::operator[] | ( | const Key & | key | ) | const |