libcuckoo  0.3.1
Public Types | Public Member Functions | Protected Member Functions | Static Protected Member Functions | Protected Attributes | Friends | List of all members
libcuckoo::cuckoohash_map< Key, T, Hash, KeyEqual, Allocator, SLOT_PER_BUCKET >::locked_table::const_iterator Class Reference

#include <cuckoohash_map.hh>

Inheritance diagram for libcuckoo::cuckoohash_map< Key, T, Hash, KeyEqual, Allocator, SLOT_PER_BUCKET >::locked_table::const_iterator:
Inheritance graph
[legend]
Collaboration diagram for libcuckoo::cuckoohash_map< Key, T, Hash, KeyEqual, Allocator, SLOT_PER_BUCKET >::locked_table::const_iterator:
Collaboration graph
[legend]

Public Types

using difference_type = typename locked_table::difference_type
 
using value_type = typename locked_table::value_type
 
using pointer = typename locked_table::const_pointer
 
using reference = typename locked_table::const_reference
 
using iterator_category = std::bidirectional_iterator_tag
 

Public Member Functions

bool operator== (const const_iterator &it) const
 
bool operator!= (const const_iterator &it) const
 
reference operator* () const
 
pointer operator-> () const
 
const_iteratoroperator++ ()
 
const_iterator operator++ (int)
 
const_iteratoroperator-- ()
 
const_iterator operator-- (int)
 

Protected Member Functions

 const_iterator (buckets_t &buckets, size_type index, size_type slot) noexcept
 

Static Protected Member Functions

static std::pair< size_type, size_type > end_pos (const buckets_t &buckets)
 

Protected Attributes

buckets_tbuckets_
 
size_type index_
 
size_type slot_
 

Friends

class locked_table
 

Detailed Description

template<class Key, class T, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<std::pair<const Key, T>>, std::size_t SLOT_PER_BUCKET = DEFAULT_SLOT_PER_BUCKET>
class libcuckoo::cuckoohash_map< Key, T, Hash, KeyEqual, Allocator, SLOT_PER_BUCKET >::locked_table::const_iterator

A constant iterator over a locked_table, which allows read-only access to the elements of the table. It fulfills the BidirectionalIterator concept.

Member Function Documentation

◆ operator--()

template<class Key , class T , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<std::pair<const Key, T>>, std::size_t SLOT_PER_BUCKET = DEFAULT_SLOT_PER_BUCKET>
const_iterator libcuckoo::cuckoohash_map< Key, T, Hash, KeyEqual, Allocator, SLOT_PER_BUCKET >::locked_table::const_iterator::operator-- ( int  )
inline

Move the iterator back to the previous item in the table. Returns the iterator at its old position. Behavior is undefined if the iterator is at the beginning.


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