Data Structures & Algorithms in C++
Goodrich, Tamassia, Mount and Goldwasser
Loading...
Searching...
No Matches
Public Member Functions | Data Fields
dsac::search_tree::TreeMap< Key, Value, Compare >::iter_rep Class Reference

#include <tree_map.h>

Inheritance diagram for dsac::search_tree::TreeMap< Key, Value, Compare >::iter_rep:
Inheritance graph
Collaboration diagram for dsac::search_tree::TreeMap< Key, Value, Compare >::iter_rep:
Collaboration graph

Public Member Functions

 iter_rep (Node *nd)
 
const Entryentry () const
 
void advance ()
 
abstract_iter_repclone () const
 
bool equals (const abstract_iter_rep *other) const
 
- Public Member Functions inherited from dsac::map::AbstractMap< Key, Value >::abstract_iter_rep
virtual const Entryentry () const =0
 
virtual void advance ()=0
 
virtual bool equals (const abstract_iter_rep *other) const =0
 
virtual abstract_iter_repclone () const =0
 
virtual ~abstract_iter_rep ()
 

Data Fields

Nodenode
 

Constructor & Destructor Documentation

◆ iter_rep()

template<typename Key , typename Value , typename Compare = std::less<Key>>
dsac::search_tree::TreeMap< Key, Value, Compare >::iter_rep::iter_rep ( Node nd)
inline

Member Function Documentation

◆ advance()

template<typename Key , typename Value , typename Compare = std::less<Key>>
void dsac::search_tree::TreeMap< Key, Value, Compare >::iter_rep::advance ( )
inlinevirtual

Implements dsac::map::AbstractMap< Key, Value >::abstract_iter_rep.

Here is the call graph for this function:

◆ clone()

template<typename Key , typename Value , typename Compare = std::less<Key>>
abstract_iter_rep * dsac::search_tree::TreeMap< Key, Value, Compare >::iter_rep::clone ( ) const
inlinevirtual

◆ entry()

template<typename Key , typename Value , typename Compare = std::less<Key>>
const Entry & dsac::search_tree::TreeMap< Key, Value, Compare >::iter_rep::entry ( ) const
inlinevirtual

◆ equals()

template<typename Key , typename Value , typename Compare = std::less<Key>>
bool dsac::search_tree::TreeMap< Key, Value, Compare >::iter_rep::equals ( const abstract_iter_rep other) const
inlinevirtual

Field Documentation

◆ node

template<typename Key , typename Value , typename Compare = std::less<Key>>
Node* dsac::search_tree::TreeMap< Key, Value, Compare >::iter_rep::node

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