a minimal map-like container that preserves insertion order
More...
#include <json.hpp>
|
using | const_iterator = typename Container::const_iterator |
|
using | Container = std::vector< std::pair< const Key, T >, Allocator > |
|
using | iterator = typename Container::iterator |
|
using | key_type = Key |
|
using | mapped_type = T |
|
template<typename InputIt > |
using | require_input_iter = typename std::enable_if< std::is_convertible< typename std::iterator_traits< InputIt >::iterator_category, std::input_iterator_tag >::value >::type |
|
using | size_type = typename Container::size_type |
|
using | value_type = typename Container::value_type |
|
|
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()) |
|
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 >
a minimal map-like container that preserves insertion order
- See also
- https://json.nlohmann.me/api/ordered_map/
ordered_map: a minimal map-like container that preserves insertion order for use within nlohmann::basic_json<ordered_map>
Definition at line 3342 of file json.hpp.
◆ const_iterator
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ Container
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ iterator
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ key_type
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ mapped_type
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ require_input_iter
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
template<typename InputIt >
using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::require_input_iter = typename std::enable_if<std::is_convertible<typename std::iterator_traits<InputIt>::iterator_category, std::input_iterator_tag>::value>::type |
◆ size_type
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ value_type
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ ordered_map() [1/3]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ ordered_map() [2/3]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
template<class It >
◆ ordered_map() [3/3]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ at() [1/2]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ at() [2/2]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ count()
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ emplace()
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ erase() [1/3]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ erase() [2/3]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ erase() [3/3]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ find() [1/2]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ find() [2/2]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ insert() [1/3]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ insert() [2/3]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
template<typename InputIt , typename = require_input_iter<InputIt>>
◆ insert() [3/3]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ operator[]() [1/2]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
◆ operator[]() [2/2]
template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
The documentation for this struct was generated from the following file: