Classes | Public Types | Public Member Functions | Static Public Member Functions | Private Types | Private Member Functions | Static Private Member Functions | Private Attributes | Friends | List of all members
google::protobuf::Map< Key, T >::InnerMap Class Reference
Inheritance diagram for google::protobuf::Map< Key, T >::InnerMap:
Inheritance graph
[legend]

Classes

class  iterator_base
 
struct  KeyCompare
 
struct  Node
 

Public Types

typedef iterator_base< const KeyValuePairconst_iterator
 
using const_iterator = iterator_base< const value_type >
 
typedef iterator_base< KeyValuePairiterator
 
using iterator = iterator_base< value_type >
 
typedef value_typeValue
 

Public Member Functions

Arenaarena () const
 
iterator begin ()
 
iterator begin ()
 
const_iterator begin () const
 
const_iterator begin () const
 
void clear ()
 
void clear ()
 
bool contains (const Key &k) const
 
bool empty () const
 
bool empty () const
 
iterator end ()
 
iterator end ()
 
const_iterator end () const
 
const_iterator end () const
 
void erase (iterator it)
 
void erase (iterator it)
 
template<typename K >
iterator find (const K &k)
 
template<typename K >
const_iterator find (const K &k) const
 
iterator find (const Key &k)
 
const_iterator find (const Key &k) const
 
const hasherhash_function () const
 
const hasherhash_function () const
 
constexpr InnerMap (Arena *arena)
 
 InnerMap (size_type n, hasher h, Allocator alloc)
 
std::pair< iterator, boolinsert (const Key &k)
 
std::pair< iterator, boolinsert (const KeyValuePair &kv)
 
template<typename K >
std::pair< iterator, boolinsert (K &&k)
 
Valueoperator[] (const Key &k)
 
template<typename K >
value_typeoperator[] (K &&k)
 
size_type size () const
 
size_type size () const
 
size_t SpaceUsedInternal () const
 
void Swap (InnerMap *other)
 
 ~InnerMap ()
 
 ~InnerMap ()
 

Static Public Member Functions

static size_type max_size ()
 
static size_type max_size ()
 

Private Types

enum  { kMinTableSize = 8 }
 
enum  { kMinTableSize = 8 }
 
using DestructorSkippable_ = void
 
using InternalArenaConstructable_ = void
 
typedef Allocator::template rebind< Key * >::other KeyPtrAllocator
 
typedef std::set< Key *, KeyCompare, KeyPtrAllocatorTree
 
using Tree = internal::TreeForMap< Key >
 
typedef Tree::iterator TreeIterator
 
using TreeIterator = typename Tree::iterator
 

Private Member Functions

template<typename U >
U * Alloc (size_type n)
 
template<typename U >
U * Alloc (size_type n)
 
template<typename K >
size_type BucketNumber (const K &k) const
 
size_type BucketNumber (const Key &k) const
 
size_type CopyListToTree (size_type b, Tree *tree)
 
size_type CopyListToTree (size_type b, Tree *tree)
 
void ** CreateEmptyTable (size_type n)
 
void ** CreateEmptyTable (size_type n)
 
template<typename U >
void Dealloc (U *t, size_type n)
 
template<typename U >
void Dealloc (U *t, size_type n)
 
void DestroyNode (Node *node)
 
void DestroyNode (Node *node)
 
void DestroyTree (Tree *tree)
 
void DestroyTree (Tree *tree)
 
NodeEraseFromLinkedList (Node *item, Node *head)
 
NodeEraseFromLinkedList (Node *item, Node *head)
 
const_iterator find (const Key &k, TreeIterator *it) const
 
const_iterator find (const Key &k, TreeIterator *it) const
 
template<typename K >
std::pair< const_iterator, size_typeFindHelper (const K &k) const
 
template<typename K >
std::pair< const_iterator, size_typeFindHelper (const K &k, TreeIterator *it) const
 
std::pair< const_iterator, size_typeFindHelper (const Key &k) const
 
std::pair< const_iterator, size_typeFindHelper (const Key &k, TreeIterator *it) const
 
 GOOGLE_DISALLOW_EVIL_CONSTRUCTORS (InnerMap)
 
 GOOGLE_DISALLOW_EVIL_CONSTRUCTORS (InnerMap)
 
iterator InsertUnique (size_type b, Node *node)
 
iterator InsertUnique (size_type b, Node *node)
 
iterator InsertUniqueInList (size_type b, Node *node)
 
iterator InsertUniqueInList (size_type b, Node *node)
 
iterator InsertUniqueInTree (size_type b, Node *node)
 
iterator InsertUniqueInTree (size_type b, Node *node)
 
bool IsMatch (const Key &k0, const Key &k1) const
 
void Resize (size_t new_num_buckets)
 
void Resize (size_t new_num_buckets)
 
bool ResizeIfLoadIsOutOfRange (size_type new_size)
 
bool ResizeIfLoadIsOutOfRange (size_type new_size)
 
size_type Seed () const
 
size_type Seed () const
 
bool ShouldInsertAfterHead (void *node)
 
bool TableEntryIsEmpty (size_type b) const
 
bool TableEntryIsEmpty (size_type b) const
 
bool TableEntryIsList (size_type b) const
 
bool TableEntryIsList (size_type b) const
 
bool TableEntryIsNonEmptyList (size_type b) const
 
bool TableEntryIsNonEmptyList (size_type b) const
 
bool TableEntryIsTooLong (size_type b)
 
bool TableEntryIsTooLong (size_type b)
 
bool TableEntryIsTree (size_type b) const
 
bool TableEntryIsTree (size_type b) const
 
size_type TableSize (size_type n)
 
size_type TableSize (size_type n)
 
void TransferList (void *const *table, size_type index)
 
void TransferList (void *const *table, size_type index)
 
void TransferTree (void *const *table, size_type index)
 
void TransferTree (void *const *table, size_type index)
 
void TreeConvert (size_type b)
 
void TreeConvert (size_type b)
 

Static Private Member Functions

static Key * KeyPtrFromNodePtr (Node *node)
 
static NodeNodeFromTreeIterator (TreeIterator it)
 
static NodeNodePtrFromKeyPtr (Key *k)
 
static bool TableEntryIsEmpty (void *const *table, size_type b)
 
static bool TableEntryIsList (void *const *table, size_type b)
 
static bool TableEntryIsNonEmptyList (void *const *table, size_type b)
 
static bool TableEntryIsTree (void *const *table, size_type b)
 

Private Attributes

Allocator alloc_
 
size_type index_of_first_non_null_
 
size_type num_buckets_
 
size_type num_elements_
 
size_type seed_
 
void ** table_
 

Friends

class Arena
 

Detailed Description

template<typename Key, typename T>
class google::protobuf::Map< Key, T >::InnerMap

Definition at line 334 of file third_party/bloaty/third_party/protobuf/src/google/protobuf/map.h.

Member Typedef Documentation

◆ const_iterator [1/2]

template<typename Key , typename T >
typedef iterator_base<const KeyValuePair> google::protobuf::Map< Key, T >::InnerMap::const_iterator

◆ const_iterator [2/2]

template<typename Key , typename T >
using google::protobuf::Map< Key, T >::InnerMap::const_iterator = iterator_base<const value_type>

◆ DestructorSkippable_

template<typename Key , typename T >
using google::protobuf::Map< Key, T >::InnerMap::DestructorSkippable_ = void
private

◆ InternalArenaConstructable_

template<typename Key , typename T >
using google::protobuf::Map< Key, T >::InnerMap::InternalArenaConstructable_ = void
private

◆ iterator [1/2]

template<typename Key , typename T >
typedef iterator_base<KeyValuePair> google::protobuf::Map< Key, T >::InnerMap::iterator

◆ iterator [2/2]

template<typename Key , typename T >
using google::protobuf::Map< Key, T >::InnerMap::iterator = iterator_base<value_type>

◆ KeyPtrAllocator

template<typename Key , typename T >
typedef Allocator::template rebind<Key*>::other google::protobuf::Map< Key, T >::InnerMap::KeyPtrAllocator
private

◆ Tree [1/2]

template<typename Key , typename T >
typedef std::set<Key*, KeyCompare, KeyPtrAllocator> google::protobuf::Map< Key, T >::InnerMap::Tree
private

◆ Tree [2/2]

template<typename Key , typename T >
using google::protobuf::Map< Key, T >::InnerMap::Tree = internal::TreeForMap<Key>
private

◆ TreeIterator [1/2]

template<typename Key , typename T >
typedef Tree::iterator google::protobuf::Map< Key, T >::InnerMap::TreeIterator
private

◆ TreeIterator [2/2]

template<typename Key , typename T >
using google::protobuf::Map< Key, T >::InnerMap::TreeIterator = typename Tree::iterator
private

◆ Value

template<typename Key , typename T >
typedef value_type* google::protobuf::Map< Key, T >::InnerMap::Value

Member Enumeration Documentation

◆ anonymous enum

template<typename Key , typename T >
anonymous enum
private
Enumerator
kMinTableSize 

Definition at line 357 of file third_party/bloaty/third_party/protobuf/src/google/protobuf/map.h.

◆ anonymous enum

template<typename Key , typename T >
anonymous enum
private
Enumerator
kMinTableSize 

Definition at line 475 of file third_party/protobuf/src/google/protobuf/map.h.

Constructor & Destructor Documentation

◆ InnerMap() [1/2]

template<typename Key , typename T >
google::protobuf::Map< Key, T >::InnerMap::InnerMap ( size_type  n,
hasher  h,
Allocator  alloc 
)
inline

◆ ~InnerMap() [1/2]

template<typename Key , typename T >
google::protobuf::Map< Key, T >::InnerMap::~InnerMap ( )
inline

◆ InnerMap() [2/2]

template<typename Key , typename T >
constexpr google::protobuf::Map< Key, T >::InnerMap::InnerMap ( Arena arena)
inlineexplicitconstexpr

◆ ~InnerMap() [2/2]

template<typename Key , typename T >
google::protobuf::Map< Key, T >::InnerMap::~InnerMap ( )
inline

Member Function Documentation

◆ Alloc() [1/2]

template<typename Key , typename T >
template<typename U >
U* google::protobuf::Map< Key, T >::InnerMap::Alloc ( size_type  n)
inlineprivate

◆ Alloc() [2/2]

template<typename Key , typename T >
template<typename U >
U* google::protobuf::Map< Key, T >::InnerMap::Alloc ( size_type  n)
inlineprivate

◆ arena()

template<typename Key , typename T >
Arena* google::protobuf::Map< Key, T >::InnerMap::arena ( ) const
inline

◆ begin() [1/4]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::begin ( )
inline

◆ begin() [2/4]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::begin ( )
inline

◆ begin() [3/4]

template<typename Key , typename T >
const_iterator google::protobuf::Map< Key, T >::InnerMap::begin ( ) const
inline

◆ begin() [4/4]

template<typename Key , typename T >
const_iterator google::protobuf::Map< Key, T >::InnerMap::begin ( ) const
inline

◆ BucketNumber() [1/2]

template<typename Key , typename T >
template<typename K >
size_type google::protobuf::Map< Key, T >::InnerMap::BucketNumber ( const K &  k) const
inlineprivate

◆ BucketNumber() [2/2]

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::BucketNumber ( const Key &  k) const
inlineprivate

◆ clear() [1/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::clear ( )
inline

◆ clear() [2/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::clear ( )
inline

◆ contains()

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::contains ( const Key &  k) const
inline

◆ CopyListToTree() [1/2]

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::CopyListToTree ( size_type  b,
Tree tree 
)
inlineprivate

◆ CopyListToTree() [2/2]

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::CopyListToTree ( size_type  b,
Tree tree 
)
inlineprivate

◆ CreateEmptyTable() [1/2]

template<typename Key , typename T >
void** google::protobuf::Map< Key, T >::InnerMap::CreateEmptyTable ( size_type  n)
inlineprivate

◆ CreateEmptyTable() [2/2]

template<typename Key , typename T >
void** google::protobuf::Map< Key, T >::InnerMap::CreateEmptyTable ( size_type  n)
inlineprivate

◆ Dealloc() [1/2]

template<typename Key , typename T >
template<typename U >
void google::protobuf::Map< Key, T >::InnerMap::Dealloc ( U *  t,
size_type  n 
)
inlineprivate

◆ Dealloc() [2/2]

template<typename Key , typename T >
template<typename U >
void google::protobuf::Map< Key, T >::InnerMap::Dealloc ( U *  t,
size_type  n 
)
inlineprivate

◆ DestroyNode() [1/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::DestroyNode ( Node node)
inlineprivate

◆ DestroyNode() [2/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::DestroyNode ( Node node)
inlineprivate

◆ DestroyTree() [1/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::DestroyTree ( Tree tree)
inlineprivate

◆ DestroyTree() [2/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::DestroyTree ( Tree tree)
inlineprivate

◆ empty() [1/2]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::empty ( ) const
inline

◆ empty() [2/2]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::empty ( ) const
inline

◆ end() [1/4]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::end ( )
inline

◆ end() [2/4]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::end ( )
inline

◆ end() [3/4]

template<typename Key , typename T >
const_iterator google::protobuf::Map< Key, T >::InnerMap::end ( ) const
inline

◆ end() [4/4]

template<typename Key , typename T >
const_iterator google::protobuf::Map< Key, T >::InnerMap::end ( ) const
inline

◆ erase() [1/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::erase ( iterator  it)
inline

◆ erase() [2/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::erase ( iterator  it)
inline

◆ EraseFromLinkedList() [1/2]

template<typename Key , typename T >
Node* google::protobuf::Map< Key, T >::InnerMap::EraseFromLinkedList ( Node item,
Node head 
)
inlineprivate

◆ EraseFromLinkedList() [2/2]

template<typename Key , typename T >
Node* google::protobuf::Map< Key, T >::InnerMap::EraseFromLinkedList ( Node item,
Node head 
)
inlineprivate

◆ find() [1/6]

template<typename Key , typename T >
template<typename K >
iterator google::protobuf::Map< Key, T >::InnerMap::find ( const K &  k)
inline

◆ find() [2/6]

template<typename Key , typename T >
template<typename K >
const_iterator google::protobuf::Map< Key, T >::InnerMap::find ( const K &  k) const
inline

◆ find() [3/6]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::find ( const Key &  k)
inline

◆ find() [4/6]

template<typename Key , typename T >
const_iterator google::protobuf::Map< Key, T >::InnerMap::find ( const Key &  k) const
inline

◆ find() [5/6]

template<typename Key , typename T >
const_iterator google::protobuf::Map< Key, T >::InnerMap::find ( const Key &  k,
TreeIterator it 
) const
inlineprivate

◆ find() [6/6]

template<typename Key , typename T >
const_iterator google::protobuf::Map< Key, T >::InnerMap::find ( const Key &  k,
TreeIterator it 
) const
inlineprivate

◆ FindHelper() [1/4]

template<typename Key , typename T >
template<typename K >
std::pair<const_iterator, size_type> google::protobuf::Map< Key, T >::InnerMap::FindHelper ( const K &  k) const
inlineprivate

◆ FindHelper() [2/4]

template<typename Key , typename T >
template<typename K >
std::pair<const_iterator, size_type> google::protobuf::Map< Key, T >::InnerMap::FindHelper ( const K &  k,
TreeIterator it 
) const
inlineprivate

◆ FindHelper() [3/4]

template<typename Key , typename T >
std::pair<const_iterator, size_type> google::protobuf::Map< Key, T >::InnerMap::FindHelper ( const Key &  k) const
inlineprivate

◆ FindHelper() [4/4]

template<typename Key , typename T >
std::pair<const_iterator, size_type> google::protobuf::Map< Key, T >::InnerMap::FindHelper ( const Key &  k,
TreeIterator it 
) const
inlineprivate

◆ GOOGLE_DISALLOW_EVIL_CONSTRUCTORS() [1/2]

template<typename Key , typename T >
google::protobuf::Map< Key, T >::InnerMap::GOOGLE_DISALLOW_EVIL_CONSTRUCTORS ( InnerMap  )
private

◆ GOOGLE_DISALLOW_EVIL_CONSTRUCTORS() [2/2]

template<typename Key , typename T >
google::protobuf::Map< Key, T >::InnerMap::GOOGLE_DISALLOW_EVIL_CONSTRUCTORS ( InnerMap  )
private

◆ hash_function() [1/2]

template<typename Key , typename T >
const hasher& google::protobuf::Map< Key, T >::InnerMap::hash_function ( ) const
inline

◆ hash_function() [2/2]

template<typename Key , typename T >
const hasher& google::protobuf::Map< Key, T >::InnerMap::hash_function ( ) const
inline

◆ insert() [1/3]

template<typename Key , typename T >
std::pair<iterator, bool> google::protobuf::Map< Key, T >::InnerMap::insert ( const Key &  k)
inline

◆ insert() [2/3]

template<typename Key , typename T >
std::pair<iterator, bool> google::protobuf::Map< Key, T >::InnerMap::insert ( const KeyValuePair kv)
inline

◆ insert() [3/3]

template<typename Key , typename T >
template<typename K >
std::pair<iterator, bool> google::protobuf::Map< Key, T >::InnerMap::insert ( K &&  k)
inline

◆ InsertUnique() [1/2]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::InsertUnique ( size_type  b,
Node node 
)
inlineprivate

◆ InsertUnique() [2/2]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::InsertUnique ( size_type  b,
Node node 
)
inlineprivate

◆ InsertUniqueInList() [1/2]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::InsertUniqueInList ( size_type  b,
Node node 
)
inlineprivate

◆ InsertUniqueInList() [2/2]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::InsertUniqueInList ( size_type  b,
Node node 
)
inlineprivate

◆ InsertUniqueInTree() [1/2]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::InsertUniqueInTree ( size_type  b,
Node node 
)
inlineprivate

◆ InsertUniqueInTree() [2/2]

template<typename Key , typename T >
iterator google::protobuf::Map< Key, T >::InnerMap::InsertUniqueInTree ( size_type  b,
Node node 
)
inlineprivate

◆ IsMatch()

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::IsMatch ( const Key &  k0,
const Key &  k1 
) const
inlineprivate

◆ KeyPtrFromNodePtr()

template<typename Key , typename T >
static Key* google::protobuf::Map< Key, T >::InnerMap::KeyPtrFromNodePtr ( Node node)
inlinestaticprivate

◆ max_size() [1/2]

template<typename Key , typename T >
static size_type google::protobuf::Map< Key, T >::InnerMap::max_size ( )
inlinestatic

◆ max_size() [2/2]

template<typename Key , typename T >
static size_type google::protobuf::Map< Key, T >::InnerMap::max_size ( )
inlinestatic

◆ NodeFromTreeIterator()

template<typename Key , typename T >
static Node* google::protobuf::Map< Key, T >::InnerMap::NodeFromTreeIterator ( TreeIterator  it)
inlinestaticprivate

◆ NodePtrFromKeyPtr()

template<typename Key , typename T >
static Node* google::protobuf::Map< Key, T >::InnerMap::NodePtrFromKeyPtr ( Key *  k)
inlinestaticprivate

◆ operator[]() [1/2]

template<typename Key , typename T >
Value& google::protobuf::Map< Key, T >::InnerMap::operator[] ( const Key &  k)
inline

◆ operator[]() [2/2]

template<typename Key , typename T >
template<typename K >
value_type& google::protobuf::Map< Key, T >::InnerMap::operator[] ( K &&  k)
inline

◆ Resize() [1/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::Resize ( size_t  new_num_buckets)
inlineprivate

◆ Resize() [2/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::Resize ( size_t  new_num_buckets)
inlineprivate

◆ ResizeIfLoadIsOutOfRange() [1/2]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::ResizeIfLoadIsOutOfRange ( size_type  new_size)
inlineprivate

◆ ResizeIfLoadIsOutOfRange() [2/2]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::ResizeIfLoadIsOutOfRange ( size_type  new_size)
inlineprivate

◆ Seed() [1/2]

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::Seed ( ) const
inlineprivate

◆ Seed() [2/2]

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::Seed ( ) const
inlineprivate

◆ ShouldInsertAfterHead()

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::ShouldInsertAfterHead ( void *  node)
inlineprivate

◆ size() [1/2]

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::size ( ) const
inline

◆ size() [2/2]

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::size ( ) const
inline

◆ SpaceUsedInternal()

template<typename Key , typename T >
size_t google::protobuf::Map< Key, T >::InnerMap::SpaceUsedInternal ( ) const
inline

◆ Swap()

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::Swap ( InnerMap other)
inline

◆ TableEntryIsEmpty() [1/3]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsEmpty ( size_type  b) const
inlineprivate

◆ TableEntryIsEmpty() [2/3]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsEmpty ( size_type  b) const
inlineprivate

◆ TableEntryIsEmpty() [3/3]

template<typename Key , typename T >
static bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsEmpty ( void *const table,
size_type  b 
)
inlinestaticprivate

◆ TableEntryIsList() [1/3]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsList ( size_type  b) const
inlineprivate

◆ TableEntryIsList() [2/3]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsList ( size_type  b) const
inlineprivate

◆ TableEntryIsList() [3/3]

template<typename Key , typename T >
static bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsList ( void *const table,
size_type  b 
)
inlinestaticprivate

◆ TableEntryIsNonEmptyList() [1/3]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsNonEmptyList ( size_type  b) const
inlineprivate

◆ TableEntryIsNonEmptyList() [2/3]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsNonEmptyList ( size_type  b) const
inlineprivate

◆ TableEntryIsNonEmptyList() [3/3]

template<typename Key , typename T >
static bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsNonEmptyList ( void *const table,
size_type  b 
)
inlinestaticprivate

◆ TableEntryIsTooLong() [1/2]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsTooLong ( size_type  b)
inlineprivate

◆ TableEntryIsTooLong() [2/2]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsTooLong ( size_type  b)
inlineprivate

◆ TableEntryIsTree() [1/3]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsTree ( size_type  b) const
inlineprivate

◆ TableEntryIsTree() [2/3]

template<typename Key , typename T >
bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsTree ( size_type  b) const
inlineprivate

◆ TableEntryIsTree() [3/3]

template<typename Key , typename T >
static bool google::protobuf::Map< Key, T >::InnerMap::TableEntryIsTree ( void *const table,
size_type  b 
)
inlinestaticprivate

◆ TableSize() [1/2]

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::TableSize ( size_type  n)
inlineprivate

◆ TableSize() [2/2]

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::TableSize ( size_type  n)
inlineprivate

◆ TransferList() [1/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::TransferList ( void *const table,
size_type  index 
)
inlineprivate

◆ TransferList() [2/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::TransferList ( void *const table,
size_type  index 
)
inlineprivate

◆ TransferTree() [1/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::TransferTree ( void *const table,
size_type  index 
)
inlineprivate

◆ TransferTree() [2/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::TransferTree ( void *const table,
size_type  index 
)
inlineprivate

◆ TreeConvert() [1/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::TreeConvert ( size_type  b)
inlineprivate

◆ TreeConvert() [2/2]

template<typename Key , typename T >
void google::protobuf::Map< Key, T >::InnerMap::TreeConvert ( size_type  b)
inlineprivate

Friends And Related Function Documentation

◆ Arena

template<typename Key , typename T >
friend class Arena
friend

Member Data Documentation

◆ alloc_

template<typename Key , typename T >
Allocator google::protobuf::Map< Key, T >::InnerMap::alloc_
private

◆ index_of_first_non_null_

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::index_of_first_non_null_
private

◆ num_buckets_

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::num_buckets_
private

◆ num_elements_

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::num_elements_
private

◆ seed_

template<typename Key , typename T >
size_type google::protobuf::Map< Key, T >::InnerMap::seed_
private

◆ table_

template<typename Key , typename T >
void ** google::protobuf::Map< Key, T >::InnerMap::table_
private

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


grpc
Author(s):
autogenerated on Fri May 16 2025 03:03:15