a minimal map‐like container that preserves insertion order

Synopsis

Declared in <nlohmann/ordered_map.hpp>

template<
    class Key,
    class T,
    class IgnoredLess,
    class Allocator>
struct ordered_map
    : std::vector<std::pair<Key const, T>, Allocator>

Base Classes

Name

Description

std::vector<std::pair<Key const, T>, Allocator>

Types

Name

Container

const_iterator

iterator

key_compare

key_type

mapped_type

require_input_iter

size_type

value_type

Member Functions

Name

Description

ordered_map [constructor]

Constructors

at

count

emplace

erase

find

insert

operator[]

Subscript operators

Description

ordered_map: a minimal map‐like container that preserves insertion order for use within nlohmann::basic_json<ordered_map>

Created with MrDocs