|
fastjet 2.4.3
|
#include <SearchTree.hh>

Public Member Functions | |
| circulator () | |
| circulator (Node *node) | |
| const T * | operator-> () const |
| T * | operator-> () |
| const T & | operator* () const |
| T & | operator* () |
| circulator & | operator++ () |
| prefix increment (structure copied from stl_bvector.h) | |
| circulator | operator++ (int) |
| postfix increment ["int" argument tells compiler it's postfix] (structure copied from stl_bvector.h) | |
| circulator & | operator-- () |
| prefix decrement (structure copied from stl_bvector.h) | |
| circulator | operator-- (int) |
| postfix decrement ["int" argument tells compiler it's postfix] (structure copied from stl_bvector.h) | |
| circulator | next () const |
| return a circulator referring to the next node | |
| circulator | previous () const |
| return a circulator referring to the previous node | |
| bool | operator!= (const circulator &other) const |
| bool | operator== (const circulator &other) const |
Private Attributes | |
| Node * | _node |
Friends | |
| class | SearchTree< T > |
Definition at line 173 of file SearchTree.hh.
| SearchTree< T >::circulator::circulator | ( | ) | [inline] |
Definition at line 180 of file SearchTree.hh.
: _node(NULL) {}
| SearchTree< T >::circulator::circulator | ( | Node * | node | ) | [inline] |
Definition at line 182 of file SearchTree.hh.
: _node(node) {}
| circulator SearchTree< T >::circulator::next | ( | ) | const [inline] |
return a circulator referring to the next node
Definition at line 214 of file SearchTree.hh.
Referenced by ClosestPair2D::_remove_from_search_tree().
{
return circulator(_node->successor);}
| bool SearchTree< T >::circulator::operator!= | ( | const circulator & | other | ) | const [inline] |
Definition at line 221 of file SearchTree.hh.
References SearchTree< T >::circulator::_node.
{return other._node != _node;}
| T& SearchTree< T >::circulator::operator* | ( | ) | [inline] |
Definition at line 187 of file SearchTree.hh.
{return _node->value;}
| const T& SearchTree< T >::circulator::operator* | ( | ) | const [inline] |
Definition at line 186 of file SearchTree.hh.
{return _node->value;}
| circulator& SearchTree< T >::circulator::operator++ | ( | ) | [inline] |
prefix increment (structure copied from stl_bvector.h)
Definition at line 190 of file SearchTree.hh.
| circulator SearchTree< T >::circulator::operator++ | ( | int | ) | [inline] |
postfix increment ["int" argument tells compiler it's postfix] (structure copied from stl_bvector.h)
Definition at line 196 of file SearchTree.hh.
{
circulator tmp = *this;
_node = _node->successor;
return tmp;}
| circulator SearchTree< T >::circulator::operator-- | ( | int | ) | [inline] |
postfix decrement ["int" argument tells compiler it's postfix] (structure copied from stl_bvector.h)
Definition at line 208 of file SearchTree.hh.
{
circulator tmp = *this;
_node = _node->predecessor;
return tmp;}
| circulator& SearchTree< T >::circulator::operator-- | ( | ) | [inline] |
prefix decrement (structure copied from stl_bvector.h)
Definition at line 202 of file SearchTree.hh.
| T* SearchTree< T >::circulator::operator-> | ( | ) | [inline] |
Definition at line 185 of file SearchTree.hh.
{return &(_node->value);}
| const T* SearchTree< T >::circulator::operator-> | ( | ) | const [inline] |
Definition at line 184 of file SearchTree.hh.
{return &(_node->value);}
| bool SearchTree< T >::circulator::operator== | ( | const circulator & | other | ) | const [inline] |
Definition at line 222 of file SearchTree.hh.
References SearchTree< T >::circulator::_node.
{return other._node == _node;}
| circulator SearchTree< T >::circulator::previous | ( | ) | const [inline] |
return a circulator referring to the previous node
Definition at line 218 of file SearchTree.hh.
{
return circulator(_node->predecessor);}
friend class SearchTree< T > [friend] |
Definition at line 178 of file SearchTree.hh.
Node* SearchTree< T >::circulator::_node [private] |
Definition at line 225 of file SearchTree.hh.
Referenced by SearchTree< T >::circulator::operator!=(), SearchTree< T >::circulator::operator==(), and SearchTree< T >::remove().
1.7.3