#include <json.hpp>
|
|
using | key_type = Key |
| |
|
using | mapped_type = T |
| |
|
using | Container = std::vector< std::pair< const Key, T >, Allocator > |
| |
|
|
| 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()) |
| |
|
std::pair< iterator, bool > | emplace (const key_type &key, T &&t) |
| |
|
T & | operator[] (const Key &key) |
| |
|
const T & | operator[] (const Key &key) const |
| |
|
T & | at (const Key &key) |
| |
|
const T & | at (const Key &key) const |
| |
|
size_type | erase (const Key &key) |
| |
|
iterator | erase (iterator pos) |
| |
|
size_type | count (const Key &key) const |
| |
|
iterator | find (const Key &key) |
| |
|
const_iterator | find (const Key &key) const |
| |
|
std::pair< iterator, bool > | insert (value_type &&value) |
| |
|
std::pair< iterator, bool > | insert (const value_type &value) |
| |
template<class Key, class T, class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
struct nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >
ordered_map: a minimal map-like container that preserves insertion order for use within nlohmann::basic_json<ordered_map>
The documentation for this struct was generated from the following file:
