DAS  3.0
Das Analysis System
SearchTree< T >::circulator
+ Collaboration diagram for SearchTree< T >::circulator:

Public Member Functions

 circulator ()
 
 circulator (Node *node)
 
const T * operator-> () const
 
T * operator-> ()
 
const T & operator* () const
 
T & operator* ()
 
circulatoroperator++ ()
 
circulator operator++ (int)
 
circulatoroperator-- ()
 
circulator operator-- (int)
 
circulator next () const
 
circulator previous () const
 
bool operator!= (const circulator &other) const
 
bool operator== (const circulator &other) const
 

Private Attributes

Node_node
 

Friends

class SearchTree< T >
 

Constructor & Destructor Documentation

◆ circulator() [1/2]

circulator ( )
inline
298 : _node(NULL) {}

◆ circulator() [2/2]

circulator ( Node node)
inline
299 : _node(node) {}

Member Function Documentation

◆ next()

circulator next ( ) const
inline
318  {
319  return circulator(_node->successor);}

◆ operator!=()

bool operator!= ( const circulator other) const
inline
322 {return other._node != _node;}

◆ operator*() [1/2]

T& operator* ( )
inline
303 {return _node->value;}

◆ operator*() [2/2]

const T& operator* ( ) const
inline
302 {return _node->value;}

◆ operator++() [1/2]

circulator& operator++ ( )
inline
304  {
305  _node = _node->successor;
306  return *this;}

◆ operator++() [2/2]

circulator operator++ ( int  )
inline
307  {
308  circulator tmp = *this;
309  _node = _node->successor;
310  return tmp;}

◆ operator--() [1/2]

circulator& operator-- ( )
inline
311  {
313  return *this;}

◆ operator--() [2/2]

circulator operator-- ( int  )
inline
314  {
315  circulator tmp = *this;
317  return tmp;}

◆ operator->() [1/2]

T* operator-> ( )
inline
301 {return &(_node->value);}

◆ operator->() [2/2]

const T* operator-> ( ) const
inline
300 {return &(_node->value);}

◆ operator==()

bool operator== ( const circulator other) const
inline
323 {return other._node == _node;}

◆ previous()

circulator previous ( ) const
inline
320  {
321  return circulator(_node->predecessor);}

Friends And Related Function Documentation

◆ SearchTree< T >

friend class SearchTree< T >
friend

Member Data Documentation

◆ _node

Node* _node
private

The documentation for this class was generated from the following file:
SearchTree::Node::successor
Node * successor
Definition: fjcore.cc:286
SearchTree::circulator::_node
Node * _node
Definition: fjcore.cc:325
SearchTree::Node::value
T value
Definition: fjcore.cc:282
SearchTree::Node::predecessor
Node * predecessor
Definition: fjcore.cc:287
SearchTree::circulator::circulator
circulator()
Definition: fjcore.cc:298