a minimal map-like container that preserves insertion order More...

#include <json.hpp>

Inheritance diagram for nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >:

Collaboration diagram for nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >:

Public Types
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

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())

Detailed Description

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 17039 of file json.hpp.

Member Typedef Documentation

◆ const_iterator

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::const_iterator = typename Container::const_iterator

Definition at line 17045 of file json.hpp.

◆ Container

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::Container = std::vector<std::pair<const Key, T>, Allocator>

Definition at line 17043 of file json.hpp.

◆ iterator

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::iterator = typename Container::iterator

Definition at line 17044 of file json.hpp.

◆ key_type

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::key_type = Key

Definition at line 17041 of file json.hpp.

◆ mapped_type

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::mapped_type = T

Definition at line 17042 of file json.hpp.

◆ 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

Definition at line 17234 of file json.hpp.

◆ size_type

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::size_type = typename Container::size_type

Definition at line 17046 of file json.hpp.

◆ value_type

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

using nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::value_type = typename Container::value_type

Definition at line 17047 of file json.hpp.

Constructor & Destructor Documentation

◆ ordered_map() [1/3]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::ordered_map ( const Allocator & alloc = Allocator() )

inline

Definition at line 17051 of file json.hpp.

◆ 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 >

nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::ordered_map	(	It	first,
		It	last,
		const Allocator &	alloc = `Allocator()`
	)

inline

Definition at line 17053 of file json.hpp.

◆ ordered_map() [3/3]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::ordered_map	(	std::initializer_list< T >	init,
		const Allocator &	alloc = `Allocator()`
	)

inline

Definition at line 17055 of file json.hpp.

Member Function Documentation

◆ at() [1/2]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

T& nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::at ( const Key & key )

inline

Definition at line 17081 of file json.hpp.

References JSON_THROW.

Referenced by nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::operator[]().

Here is the caller graph for this function:

◆ at() [2/2]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

const T& nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::at ( const Key & key ) const

inline

Definition at line 17094 of file json.hpp.

References JSON_THROW.

◆ count()

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

size_type nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::count ( const Key & key ) const

inline

Definition at line 17179 of file json.hpp.

◆ emplace()

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

std::pair<iterator, bool> nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::emplace	(	const key_type &	key,
		T &&	t
	)

inline

Definition at line 17058 of file json.hpp.

Referenced by nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::insert(), and nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::operator[]().

Here is the caller graph for this function:

◆ erase() [1/3]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

size_type nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::erase ( const Key & key )

inline

Definition at line 17107 of file json.hpp.

Referenced by nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::erase().

Here is the caller graph for this function:

◆ erase() [2/3]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

iterator nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::erase	(	iterator	first,
		iterator	last
	)

inline

Definition at line 17131 of file json.hpp.

◆ erase() [3/3]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

iterator nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::erase ( iterator pos )

inline

Definition at line 17126 of file json.hpp.

References nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::erase().

◆ find() [1/2]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

iterator nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::find ( const Key & key )

inline

Definition at line 17191 of file json.hpp.

◆ find() [2/2]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

const_iterator nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::find ( const Key & key ) const

inline

Definition at line 17203 of file json.hpp.

◆ insert() [1/3]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

std::pair<iterator, bool> nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::insert ( const value_type & value )

inline

Definition at line 17220 of file json.hpp.

◆ 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>>

void nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::insert	(	InputIt	first,
		InputIt	last
	)

inline

Definition at line 17238 of file json.hpp.

References nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::insert().

◆ insert() [3/3]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

std::pair<iterator, bool> nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::insert ( value_type && value )

inline

Definition at line 17215 of file json.hpp.

References nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::emplace().

Referenced by nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::insert().

Here is the caller graph for this function:

◆ operator[]() [1/2]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

T& nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::operator[] ( const Key & key )

inline

Definition at line 17071 of file json.hpp.

References nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::emplace().

◆ operator[]() [2/2]

template<class Key , class T , class IgnoredLess = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>

const T& nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::operator[] ( const Key & key ) const

inline

Definition at line 17076 of file json.hpp.

References nlohmann::ordered_map< Key, T, IgnoredLess, Allocator >::at().

The documentation for this struct was generated from the following file:

json.hpp

Public Types

Public Member Functions

Detailed Description

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 >

Member Typedef Documentation

◆ const_iterator

◆ Container

◆ iterator

◆ key_type

◆ mapped_type

◆ require_input_iter

◆ size_type

◆ value_type

Constructor & Destructor Documentation

◆ ordered_map() [1/3]

◆ ordered_map() [2/3]

◆ ordered_map() [3/3]

Member Function Documentation

◆ at() [1/2]

◆ at() [2/2]

◆ count()

◆ emplace()

◆ erase() [1/3]

◆ erase() [2/3]

◆ erase() [3/3]

◆ find() [1/2]

◆ find() [2/2]

◆ insert() [1/3]

◆ insert() [2/3]

◆ insert() [3/3]

◆ operator[]() [1/2]

◆ operator[]() [2/2]

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 >