halcheck 1.0
Loading...
Searching...
No Matches
halcheck::lib::trie< K, V, Hash >::iterator Class Reference

Represents a pointer to a child trie. More...

#include <trie.hpp>

Inheritance diagram for halcheck::lib::trie< K, V, Hash >::iterator:
halcheck::lib::iterator_interface< iterator >

Public Types

using value_type = typename std::unordered_map<K, trie, Hash>::value_type
 
using difference_type = typename std::unordered_map<K, trie, Hash>::difference_type
 
using reference = typename std::unordered_map<K, trie, Hash>::const_reference
 
using pointer = typename std::unordered_map<K, trie, Hash>::const_pointer
 
using iterator_category = std::forward_iterator_tag
 

Public Member Functions

 iterator (typename std::unordered_map< K, trie, Hash >::const_iterator base)
 
iteratoroperator++ ()
 
reference operator* () const
 
pointer operator-> () const
 
constexpr lib::iter_reference_t< I > operator[] (lib::iter_difference_t< I > n) const
 Access the element at the specified index.
 
operator++ (int)
 Advances this iterator.
 
operator-- (int)
 Advances this iterator a step backwards.
 
void operator-- (int)
 Advances this iterator a step backwards.
 
I & operator-= (lib::iter_difference_t< I > n)
 Advances this iterator the specified number of steps backwards.
 

Friends

bool operator== (const iterator &lhs, const iterator &rhs)
 

Detailed Description

template<typename K, typename V, typename Hash = std::hash<K>>
class halcheck::lib::trie< K, V, Hash >::iterator

Represents a pointer to a child trie.


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