Public Member Functions | Private Attributes

mln::util::internal::fibonacci_heap_node< P, T > Class Template Reference

#include <fibonacci_heap.hh>

List of all members.

Public Member Functions

fibonacci_heap_node< P, T > * child () const
short degree () const
 fibonacci_heap_node (const P &priority, const T &value)
 Construct a new node with value as value.
 fibonacci_heap_node ()
 Default constructor.
fibonacci_heap_node< P, T > * left () const
short mark () const
bool operator< (fibonacci_heap_node< P, T > &rhs)
void operator= (fibonacci_heap_node< P, T > &rhs)
bool operator== (fibonacci_heap_node< P, T > &rhs)
fibonacci_heap_node< P, T > * parent () const
void print_ (std::ostream &ostr) const
const P & priority () const
fibonacci_heap_node< P, T > * right () const
void set_child (fibonacci_heap_node< P, T > *node)
void set_degree (short degree)
void set_left (fibonacci_heap_node< P, T > *node)
void set_mark (short mark)
void set_parent (fibonacci_heap_node< P, T > *node)
void set_right (fibonacci_heap_node< P, T > *node)
void set_value (const T &)
const T & value () const
 Return the node value.
 ~fibonacci_heap_node ()

Private Attributes

fibonacci_heap_node< P, T > * child_
short degree_
fibonacci_heap_node< P, T > * left_
short mark_
fibonacci_heap_node< P, T > * parent_
priority_
fibonacci_heap_node< P, T > * right_
value_

Detailed Description

template<typename P, typename T>
class mln::util::internal::fibonacci_heap_node< P, T >

Definition at line 51 of file fibonacci_heap.hh.


Constructor & Destructor Documentation

template<typename P , typename T >
mln::util::internal::fibonacci_heap_node< P, T >::fibonacci_heap_node (  )  [inline]

Default constructor.

Definition at line 266 of file fibonacci_heap.hh.

template<typename P , typename T >
mln::util::internal::fibonacci_heap_node< P, T >::fibonacci_heap_node ( const P &  priority,
const T &  value 
) [inline]

Construct a new node with value as value.

Definition at line 276 of file fibonacci_heap.hh.

template<typename P , typename T >
mln::util::internal::fibonacci_heap_node< P, T >::~fibonacci_heap_node (  )  [inline]

Definition at line 286 of file fibonacci_heap.hh.


Member Function Documentation

template<typename P , typename T >
fibonacci_heap_node< P, T > * mln::util::internal::fibonacci_heap_node< P, T >::child (  )  const [inline]
template<typename P , typename T >
short mln::util::internal::fibonacci_heap_node< P, T >::degree (  )  const [inline]
template<typename P , typename T >
fibonacci_heap_node< P, T > * mln::util::internal::fibonacci_heap_node< P, T >::left (  )  const [inline]
template<typename P , typename T >
short mln::util::internal::fibonacci_heap_node< P, T >::mark (  )  const [inline]
template<typename P , typename T >
bool mln::util::internal::fibonacci_heap_node< P, T >::operator< ( fibonacci_heap_node< P, T > &  rhs  )  [inline]
template<typename P , typename T >
void mln::util::internal::fibonacci_heap_node< P, T >::operator= ( fibonacci_heap_node< P, T > &  rhs  )  [inline]
template<typename P , typename T >
bool mln::util::internal::fibonacci_heap_node< P, T >::operator== ( fibonacci_heap_node< P, T > &  rhs  )  [inline]
template<typename P , typename T >
fibonacci_heap_node< P, T > * mln::util::internal::fibonacci_heap_node< P, T >::parent (  )  const [inline]
template<typename P , typename T >
void mln::util::internal::fibonacci_heap_node< P, T >::print_ ( std::ostream &  ostr  )  const [inline]
template<typename P , typename T >
const P & mln::util::internal::fibonacci_heap_node< P, T >::priority (  )  const [inline]
template<typename P , typename T >
fibonacci_heap_node< P, T > * mln::util::internal::fibonacci_heap_node< P, T >::right (  )  const [inline]
template<typename P , typename T >
void mln::util::internal::fibonacci_heap_node< P, T >::set_child ( fibonacci_heap_node< P, T > *  node  )  [inline]
template<typename P , typename T >
void mln::util::internal::fibonacci_heap_node< P, T >::set_degree ( short  degree  )  [inline]
template<typename P , typename T >
void mln::util::internal::fibonacci_heap_node< P, T >::set_left ( fibonacci_heap_node< P, T > *  node  )  [inline]
template<typename P , typename T >
void mln::util::internal::fibonacci_heap_node< P, T >::set_mark ( short  mark  )  [inline]
template<typename P , typename T >
void mln::util::internal::fibonacci_heap_node< P, T >::set_parent ( fibonacci_heap_node< P, T > *  node  )  [inline]
template<typename P , typename T >
void mln::util::internal::fibonacci_heap_node< P, T >::set_right ( fibonacci_heap_node< P, T > *  node  )  [inline]
template<typename P , typename T >
void mln::util::internal::fibonacci_heap_node< P, T >::set_value ( const T &  value  )  [inline]
template<typename P , typename T >
const T & mln::util::internal::fibonacci_heap_node< P, T >::value (  )  const [inline]

Member Data Documentation

template<typename P, typename T>
fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::child_ [private]
template<typename P, typename T>
short mln::util::internal::fibonacci_heap_node< P, T >::degree_ [private]
template<typename P, typename T>
fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::left_ [private]
template<typename P, typename T>
short mln::util::internal::fibonacci_heap_node< P, T >::mark_ [private]
template<typename P, typename T>
fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::parent_ [private]
template<typename P, typename T>
P mln::util::internal::fibonacci_heap_node< P, T >::priority_ [private]
template<typename P, typename T>
fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::right_ [private]
template<typename P, typename T>
T mln::util::internal::fibonacci_heap_node< P, T >::value_ [private]