carl  24.04
Computer ARithmetic Library
Public Member Functions | Data Fields | Static Public Attributes | Friends
carl::CompactTree< Entry, FastIndex >::Node Class Reference

#include <CompactTree.h>

Public Member Functions

 Node ()
 
Node parent () const
 
Node left () const
 
Node right () const
 
Node sibling () const
 
Node leftSibling () const
 
Node next (size_t count=1) const
 
Node prev () const
 
Node & operator++ ()
 
bool isRoot () const
 
bool isLeft () const
 
bool isRight () const
 
bool operator< (Node node) const
 
bool operator<= (Node node) const
 
bool operator> (Node node) const
 
bool operator>= (Node node) const
 
bool operator== (Node node) const
 
bool operator!= (Node node) const
 
 Node (size_t i)
 
size_t getNormalIndex () const
 

Data Fields

size_t _index
 

Static Public Attributes

static const bool fi = FastIndex
 
static const size_t S = sizeof(Entry)
 

Friends

class CompactTree< Entry, FastIndex >
 

Detailed Description

template<class Entry, bool FastIndex>
class carl::CompactTree< Entry, FastIndex >::Node

Definition at line 84 of file CompactTree.h.

Constructor & Destructor Documentation

◆ Node() [1/2]

template<class Entry , bool FastIndex>
carl::CompactTree< Entry, FastIndex >::Node::Node ( )
inline

Definition at line 87 of file CompactTree.h.

◆ Node() [2/2]

template<class Entry , bool FastIndex>
carl::CompactTree< Entry, FastIndex >::Node::Node ( size_t  i)
inlineexplicit

Definition at line 155 of file CompactTree.h.

Member Function Documentation

◆ getNormalIndex()

template<class Entry , bool FastIndex>
size_t carl::CompactTree< Entry, FastIndex >::Node::getNormalIndex ( ) const
inline

Definition at line 158 of file CompactTree.h.

◆ isLeft()

template<class Entry , bool FastIndex>
bool carl::CompactTree< Entry, FastIndex >::Node::isLeft ( ) const
inline

Definition at line 110 of file CompactTree.h.

◆ isRight()

template<class Entry , bool FastIndex>
bool carl::CompactTree< Entry, FastIndex >::Node::isRight ( ) const
inline

Definition at line 115 of file CompactTree.h.

◆ isRoot()

template<class Entry , bool FastIndex>
bool carl::CompactTree< Entry, FastIndex >::Node::isRoot ( ) const
inline

Definition at line 105 of file CompactTree.h.

◆ left()

template<class E , bool FI>
CompactTree< E, FI >::Node carl::CompactTree< E, FI >::Node::left

Definition at line 300 of file CompactTree.h.

◆ leftSibling()

template<class E , bool FI>
CompactTree< E, FI >::Node carl::CompactTree< E, FI >::Node::leftSibling

Definition at line 318 of file CompactTree.h.

◆ next()

template<class E , bool FI>
CompactTree< E, FI >::Node carl::CompactTree< E, FI >::Node::next ( size_t  count = 1) const

Definition at line 325 of file CompactTree.h.

Here is the caller graph for this function:

◆ operator!=()

template<class Entry , bool FastIndex>
bool carl::CompactTree< Entry, FastIndex >::Node::operator!= ( Node  node) const
inline

Definition at line 145 of file CompactTree.h.

◆ operator++()

template<class Entry , bool FastIndex>
Node& carl::CompactTree< Entry, FastIndex >::Node::operator++ ( )
inline

Definition at line 99 of file CompactTree.h.

◆ operator<()

template<class Entry , bool FastIndex>
bool carl::CompactTree< Entry, FastIndex >::Node::operator< ( Node  node) const
inline

Definition at line 120 of file CompactTree.h.

◆ operator<=()

template<class Entry , bool FastIndex>
bool carl::CompactTree< Entry, FastIndex >::Node::operator<= ( Node  node) const
inline

Definition at line 125 of file CompactTree.h.

◆ operator==()

template<class Entry , bool FastIndex>
bool carl::CompactTree< Entry, FastIndex >::Node::operator== ( Node  node) const
inline

Definition at line 140 of file CompactTree.h.

◆ operator>()

template<class Entry , bool FastIndex>
bool carl::CompactTree< Entry, FastIndex >::Node::operator> ( Node  node) const
inline

Definition at line 130 of file CompactTree.h.

◆ operator>=()

template<class Entry , bool FastIndex>
bool carl::CompactTree< Entry, FastIndex >::Node::operator>= ( Node  node) const
inline

Definition at line 135 of file CompactTree.h.

◆ parent()

template<class E , bool FI>
CompactTree< E, FI >::Node carl::CompactTree< E, FI >::Node::parent

Definition at line 294 of file CompactTree.h.

◆ prev()

template<class E , bool FI>
CompactTree< E, FI >::Node carl::CompactTree< E, FI >::Node::prev

Definition at line 331 of file CompactTree.h.

◆ right()

template<class E , bool FI>
CompactTree< E, FI >::Node carl::CompactTree< E, FI >::Node::right

Definition at line 306 of file CompactTree.h.

◆ sibling()

template<class E , bool FI>
CompactTree< E, FI >::Node carl::CompactTree< E, FI >::Node::sibling

Definition at line 312 of file CompactTree.h.

Friends And Related Function Documentation

◆ CompactTree< Entry, FastIndex >

template<class Entry , bool FastIndex>
friend class CompactTree< Entry, FastIndex >
friend

Definition at line 145 of file CompactTree.h.

Field Documentation

◆ _index

template<class Entry , bool FastIndex>
size_t carl::CompactTree< Entry, FastIndex >::Node::_index

Definition at line 163 of file CompactTree.h.

◆ fi

template<class Entry , bool FastIndex>
const bool carl::CompactTree< Entry, FastIndex >::Node::fi = FastIndex
static

Definition at line 152 of file CompactTree.h.

◆ S

template<class Entry , bool FastIndex>
const size_t carl::CompactTree< Entry, FastIndex >::Node::S = sizeof(Entry)
static

Definition at line 153 of file CompactTree.h.

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