Insertion-ordered string->Json map with O(1) average lookup.
More...
#include <json.h>
Insertion-ordered string->Json map with O(1) average lookup.
Definition at line 73 of file json.h.
◆ storage
◆ value_type
◆ Object() [1/3]
| librats::Json::Object::Object |
( |
| ) |
|
|
default |
◆ Object() [2/3]
| librats::Json::Object::Object |
( |
const Object & |
| ) |
|
|
default |
◆ Object() [3/3]
| librats::Json::Object::Object |
( |
Object && |
| ) |
|
|
defaultnoexcept |
◆ begin() [1/2]
| storage::iterator librats::Json::Object::begin |
( |
| ) |
|
|
inline |
◆ begin() [2/2]
| storage::const_iterator librats::Json::Object::begin |
( |
| ) |
const |
|
inline |
◆ clear()
| void librats::Json::Object::clear |
( |
| ) |
|
|
inline |
◆ contains()
| bool librats::Json::Object::contains |
( |
const std::string & |
key | ) |
const |
|
inline |
◆ empty()
| bool librats::Json::Object::empty |
( |
| ) |
const |
|
inline |
◆ end() [1/2]
| storage::iterator librats::Json::Object::end |
( |
| ) |
|
|
inline |
◆ end() [2/2]
| storage::const_iterator librats::Json::Object::end |
( |
| ) |
const |
|
inline |
◆ erase()
| bool librats::Json::Object::erase |
( |
const std::string & |
key | ) |
|
◆ find() [1/2]
| Json * librats::Json::Object::find |
( |
const std::string & |
key | ) |
|
◆ find() [2/2]
| const Json * librats::Json::Object::find |
( |
const std::string & |
key | ) |
const |
◆ operator=() [1/2]
| Object & librats::Json::Object::operator= |
( |
const Object & |
| ) |
|
|
default |
◆ operator=() [2/2]
◆ operator==()
| bool librats::Json::Object::operator== |
( |
const Object & |
other | ) |
const |
◆ operator[]() [1/2]
| Json & librats::Json::Object::operator[] |
( |
const std::string & |
key | ) |
|
◆ operator[]() [2/2]
| Json & librats::Json::Object::operator[] |
( |
std::string && |
key | ) |
|
◆ size()
| std::size_t librats::Json::Object::size |
( |
| ) |
const |
|
inline |
The documentation for this class was generated from the following file: