a minimal map-like container that preserves insertion order
<nlohmann/ordered_map.hpp>
template<
class Key,
class T,
class IgnoredLess,
class Allocator>
struct ordered_map
: std::vector<std::pair<Key const, T>, Allocator>
| Name | Description |
|---|---|
std::vector<std::pair<Key const, T>, Allocator> |
| Name |
|---|
Container |
const_iterator |
iterator |
key_compare |
key_type |
mapped_type |
require_input_iter |
size_type |
value_type |
| Name | Description |
|---|---|
ordered_map [constructor] | Constructors |
at | |
count | |
emplace | |
erase | |
find | |
insert | |
operator[] | Subscript operators |
ordered_map: a minimal map-like container that preserves insertion order for use within nlohmann::basic_json<ordered_map>