a minimal map-like container that preserves insertion order More...
Inheritance diagram for nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >:
Collaboration diagram for nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >: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 first, iterator last) |
| 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) |
| template<typename InputIt , typename = require_input_iter<InputIt>> | |
| void | insert (InputIt first, InputIt last) |
| 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()) | |
a minimal map-like container that preserves insertion order
ordered_map: a minimal map-like container that preserves insertion order for use within nlohmann::basic_json<ordered_map>