google::protobuf::Map< Key, T > Class Template Reference

#include <map.h>

Classes
class	const_iterator
class	iterator
class	iterator_base

Public Types
typedef Key	key_type
typedef T	mapped_type
typedef MapPair< Key, T >	value_type
typedef value_type *	pointer
typedef const value_type *	const_pointer
typedef value_type &	reference
typedef const value_type &	const_reference
typedef size_t	size_type
typedef hash< Key >	hasher

Public Member Functions
	Map (bool old_style=true)
	Map (Arena *arena, bool old_style=true)
	Map (const Map &other)
template<class InputIt >
	Map (const InputIt &first, const InputIt &last, bool old_style=true)
	~Map ()
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
const_iterator	cbegin () const
const_iterator	cend () const
size_type	size () const
bool	empty () const
T &	operator[] (const key_type &key)
const T &	at (const key_type &key) const
T &	at (const key_type &key)
size_type	count (const key_type &key) const
const_iterator	find (const key_type &key) const
iterator	find (const key_type &key)
std::pair< const_iterator, const_iterator >	equal_range (const key_type &key) const
std::pair< iterator, iterator >	equal_range (const key_type &key)
std::pair< iterator, bool >	insert (const value_type &value)
template<class InputIt >
void	insert (InputIt first, InputIt last)
size_type	erase (const key_type &key)
iterator	erase (iterator pos)
void	erase (iterator first, iterator last)
void	clear ()
Map &	operator= (const Map &other)
hasher	hash_function () const

Friends
class	::google::protobuf::Arena
template<typename K , typename V , internal::WireFormatLite::FieldType key_wire_type, internal::WireFormatLite::FieldType value_wire_type, int default_enum_value>
class	internal::MapFieldLite

Member Typedef Documentation

const_pointer

template<typename Key, typename T>

typedef const value_type* google::protobuf::Map< Key, T >::const_pointer

const_reference

template<typename Key, typename T>

typedef const value_type& google::protobuf::Map< Key, T >::const_reference

hasher

template<typename Key, typename T>

typedef hash<Key> google::protobuf::Map< Key, T >::hasher

key_type

template<typename Key, typename T>

typedef Key google::protobuf::Map< Key, T >::key_type

mapped_type

template<typename Key, typename T>

typedef T google::protobuf::Map< Key, T >::mapped_type

pointer

template<typename Key, typename T>

typedef value_type* google::protobuf::Map< Key, T >::pointer

reference

template<typename Key, typename T>

typedef value_type& google::protobuf::Map< Key, T >::reference

size_type

template<typename Key, typename T>

typedef size_t google::protobuf::Map< Key, T >::size_type

value_type

template<typename Key, typename T>

typedef MapPair<Key, T> google::protobuf::Map< Key, T >::value_type

Constructor & Destructor Documentation

Map() [1/4]

template<typename Key, typename T>

google::protobuf::Map< Key, T >::Map ( bool  old_style = true )

inline

Map() [2/4]

template<typename Key, typename T>

google::protobuf::Map< Key, T >::Map ( Arena *  arena, bool  old_style = true  )

inlineexplicit

Map() [3/4]

template<typename Key, typename T>

google::protobuf::Map< Key, T >::Map ( const Map< Key, T > &  other )

inline

Map() [4/4]

template<typename Key, typename T>

template<class InputIt >

google::protobuf::Map< Key, T >::Map ( const InputIt &  first, const InputIt &  last, bool  old_style = true  )

inline

~Map()

template<typename Key, typename T>

google::protobuf::Map< Key, T >::~Map ( )

inline

Member Function Documentation

at() [1/2]

template<typename Key, typename T>

const T& google::protobuf::Map< Key, T >::at ( const key_type &  key ) const

inline

at() [2/2]

template<typename Key, typename T>

T& google::protobuf::Map< Key, T >::at ( const key_type &  key )

inline

begin() [1/2]

template<typename Key, typename T>

iterator google::protobuf::Map< Key, T >::begin ( )

inline

begin() [2/2]

template<typename Key, typename T>

const_iterator google::protobuf::Map< Key, T >::begin ( ) const

inline

cbegin()

template<typename Key, typename T>

const_iterator google::protobuf::Map< Key, T >::cbegin ( ) const

inline

cend()

template<typename Key, typename T>

const_iterator google::protobuf::Map< Key, T >::cend ( ) const

inline

clear()

template<typename Key, typename T>

void google::protobuf::Map< Key, T >::clear ( )

inline

count()

template<typename Key, typename T>

size_type google::protobuf::Map< Key, T >::count ( const key_type &  key ) const

inline

empty()

template<typename Key, typename T>

bool google::protobuf::Map< Key, T >::empty ( ) const

inline

end() [1/2]

template<typename Key, typename T>

iterator google::protobuf::Map< Key, T >::end ( )

inline

end() [2/2]

template<typename Key, typename T>

const_iterator google::protobuf::Map< Key, T >::end ( ) const

inline

equal_range() [1/2]

template<typename Key, typename T>

std::pair<const_iterator, const_iterator> google::protobuf::Map< Key, T >::equal_range ( const key_type &  key ) const

inline

equal_range() [2/2]

template<typename Key, typename T>

std::pair<iterator, iterator> google::protobuf::Map< Key, T >::equal_range ( const key_type &  key )

inline

erase() [1/3]

template<typename Key, typename T>

size_type google::protobuf::Map< Key, T >::erase ( const key_type &  key )

inline

erase() [2/3]

template<typename Key, typename T>

iterator google::protobuf::Map< Key, T >::erase ( iterator  pos )

inline

erase() [3/3]

template<typename Key, typename T>

void google::protobuf::Map< Key, T >::erase ( iterator  first, iterator  last  )

inline

find() [1/2]

template<typename Key, typename T>

const_iterator google::protobuf::Map< Key, T >::find ( const key_type &  key ) const

inline

find() [2/2]

template<typename Key, typename T>

iterator google::protobuf::Map< Key, T >::find ( const key_type &  key )

inline

hash_function()

template<typename Key, typename T>

hasher google::protobuf::Map< Key, T >::hash_function ( ) const

inline

insert() [1/2]

template<typename Key, typename T>

std::pair<iterator, bool> google::protobuf::Map< Key, T >::insert ( const value_type &  value )

inline

insert() [2/2]

template<typename Key, typename T>

template<class InputIt >

void google::protobuf::Map< Key, T >::insert ( InputIt  first, InputIt  last  )

inline

operator=()

template<typename Key, typename T>

Map& google::protobuf::Map< Key, T >::operator= ( const Map< Key, T > &  other )

inline

operator[]()

template<typename Key, typename T>

T& google::protobuf::Map< Key, T >::operator[] ( const key_type &  key )

inline

size()

template<typename Key, typename T>

size_type google::protobuf::Map< Key, T >::size ( ) const

inline

Friends And Related Function Documentation

::google::protobuf::Arena

template<typename Key, typename T>

friend class ::google::protobuf::Arena

friend

internal::MapFieldLite

template<typename Key, typename T>

template<typename K , typename V , internal::WireFormatLite::FieldType key_wire_type, internal::WireFormatLite::FieldType value_wire_type, int default_enum_value>

friend class internal::MapFieldLite

friend

Member Data Documentation

deprecated_elements_

template<typename Key, typename T>

DeprecatedInnerMap* google::protobuf::Map< Key, T >::deprecated_elements_

elements_

template<typename Key, typename T>

InnerMap* google::protobuf::Map< Key, T >::elements_

---

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

• Source/ThirdParty/libwebrtc/Source/third_party/protobuf/src/google/protobuf/map.h