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_ () 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_
P	priority_
fibonacci_heap_node< P, T > *	right_
T	value_

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

---

Constructor & Destructor Documentation

template<typename P , typename T >

mln::util::internal::fibonacci_heap_node< P, T >::fibonacci_heap_node

(

)

[inline]

Default constructor.

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.

template<typename P , typename T >

mln::util::internal::fibonacci_heap_node< P, T >::~fibonacci_heap_node

(

)

[inline]

---

Member Function Documentation

template<typename P , typename T >

fibonacci_heap_node< P, T > * mln::util::internal::fibonacci_heap_node< P, T >::child

(

)

const [inline]

References mln::util::internal::fibonacci_heap_node< P, T >::child_.

Referenced by mln::util::fibonacci_heap< P, T >::cut(), mln::util::fibonacci_heap< P, T >::link(), mln::util::fibonacci_heap< P, T >::pop_front(), and mln::util::fibonacci_heap< P, T >::print_().

template<typename P , typename T >

short mln::util::internal::fibonacci_heap_node< P, T >::degree

(

)

const [inline]

References mln::util::internal::fibonacci_heap_node< P, T >::degree_.

Referenced by mln::util::fibonacci_heap< P, T >::consolidate(), mln::util::fibonacci_heap< P, T >::cut(), and mln::util::fibonacci_heap< P, T >::link().

template<typename P , typename T >

fibonacci_heap_node< P, T > * mln::util::internal::fibonacci_heap_node< P, T >::left

(

)

const [inline]

References mln::util::internal::fibonacci_heap_node< P, T >::left_.

Referenced by mln::util::fibonacci_heap< P, T >::cut(), mln::util::fibonacci_heap< P, T >::insert(), mln::util::fibonacci_heap< P, T >::link(), mln::util::fibonacci_heap< P, T >::pop_front(), and mln::util::fibonacci_heap< P, T >::print_().

template<typename P , typename T >

short mln::util::internal::fibonacci_heap_node< P, T >::mark

(

)

const [inline]

References mln::util::internal::fibonacci_heap_node< P, T >::mark_.

Referenced by mln::util::fibonacci_heap< P, T >::add_to_root_list(), mln::util::fibonacci_heap< P, T >::cascading_cut(), mln::util::fibonacci_heap< P, T >::link(), and mln::util::fibonacci_heap< P, T >::pop_front().

template<typename P , typename T >

bool mln::util::internal::fibonacci_heap_node< P, T >::operator<

(

fibonacci_heap_node< P, T > &

rhs

)

[inline]

References mln::util::ord_strict(), mln::util::internal::fibonacci_heap_node< P, T >::priority(), mln::util::internal::fibonacci_heap_node< P, T >::priority_, mln::util::internal::fibonacci_heap_node< P, T >::value(), and mln::util::internal::fibonacci_heap_node< P, T >::value_.

template<typename P , typename T >

void mln::util::internal::fibonacci_heap_node< P, T >::operator=

(

fibonacci_heap_node< P, T > &

rhs

)

[inline]

References mln::util::internal::fibonacci_heap_node< P, T >::priority(), mln::util::internal::fibonacci_heap_node< P, T >::priority_, mln::util::internal::fibonacci_heap_node< P, T >::value(), and mln::util::internal::fibonacci_heap_node< P, T >::value_.

template<typename P , typename T >

bool mln::util::internal::fibonacci_heap_node< P, T >::operator==

(

fibonacci_heap_node< P, T > &

rhs

)

[inline]

References mln::util::internal::fibonacci_heap_node< P, T >::priority(), mln::util::internal::fibonacci_heap_node< P, T >::priority_, mln::util::internal::fibonacci_heap_node< P, T >::value(), and mln::util::internal::fibonacci_heap_node< P, T >::value_.

template<typename P , typename T >

fibonacci_heap_node< P, T > * mln::util::internal::fibonacci_heap_node< P, T >::parent

(

)

const [inline]

References mln::util::internal::fibonacci_heap_node< P, T >::parent_.

Referenced by mln::util::fibonacci_heap< P, T >::cascading_cut(), mln::util::fibonacci_heap< P, T >::decrease_key(), and mln::util::fibonacci_heap< P, T >::print_().

template<typename P , typename T >

void mln::util::internal::fibonacci_heap_node< P, T >::print_

(

)

const [inline]

References mln::util::internal::fibonacci_heap_node< P, T >::priority_, and mln::util::internal::fibonacci_heap_node< P, T >::value_.

Referenced by mln::util::operator<<(), and mln::util::fibonacci_heap< P, T >::print_().

template<typename P , typename T >

const P & mln::util::internal::fibonacci_heap_node< P, T >::priority

(

)

const [inline]

References mln::util::internal::fibonacci_heap_node< P, T >::priority_.

Referenced by mln::util::internal::fibonacci_heap_node< P, T >::operator<(), mln::util::internal::fibonacci_heap_node< P, T >::operator=(), and mln::util::internal::fibonacci_heap_node< P, T >::operator==().

template<typename P , typename T >

fibonacci_heap_node< P, T > * mln::util::internal::fibonacci_heap_node< P, T >::right

(

)

const [inline]

References mln::util::internal::fibonacci_heap_node< P, T >::right_.

Referenced by mln::util::fibonacci_heap< P, T >::consolidate(), mln::util::fibonacci_heap< P, T >::cut(), mln::util::fibonacci_heap< P, T >::insert(), mln::util::fibonacci_heap< P, T >::link(), mln::util::fibonacci_heap< P, T >::pop_front(), mln::util::fibonacci_heap< P, T >::print_(), and mln::util::fibonacci_heap< P, T >::push().

template<typename P , typename T >

void mln::util::internal::fibonacci_heap_node< P, T >::set_child

(

fibonacci_heap_node< P, T > *

node

)

[inline]

References mln::util::internal::fibonacci_heap_node< P, T >::child_.

Referenced by mln::util::fibonacci_heap< P, T >::link(), and mln::util::fibonacci_heap< P, T >::pop_front().

template<typename P , typename T >

void mln::util::internal::fibonacci_heap_node< P, T >::set_degree

(

short

degree

)

[inline]

References mln::util::internal::fibonacci_heap_node< P, T >::degree_.

Referenced by mln::util::fibonacci_heap< P, T >::cut(), mln::util::fibonacci_heap< P, T >::link(), and mln::util::fibonacci_heap< P, T >::pop_front().

template<typename P , typename T >

void mln::util::internal::fibonacci_heap_node< P, T >::set_left

(

fibonacci_heap_node< P, T > *

node

)

[inline]

References mln::util::internal::fibonacci_heap_node< P, T >::left_.

Referenced by mln::util::fibonacci_heap< P, T >::insert(), mln::util::fibonacci_heap< P, T >::link(), mln::util::fibonacci_heap< P, T >::pop_front(), and mln::util::fibonacci_heap< P, T >::push().

template<typename P , typename T >

void mln::util::internal::fibonacci_heap_node< P, T >::set_mark

(

short

mark

)

[inline]

References mln::util::internal::fibonacci_heap_node< P, T >::mark_.

Referenced by mln::util::fibonacci_heap< P, T >::add_to_root_list(), mln::util::fibonacci_heap< P, T >::link(), and mln::util::fibonacci_heap< P, T >::pop_front().

template<typename P , typename T >

void mln::util::internal::fibonacci_heap_node< P, T >::set_parent

(

fibonacci_heap_node< P, T > *

node

)

[inline]

References mln::util::internal::fibonacci_heap_node< P, T >::parent_.

Referenced by mln::util::fibonacci_heap< P, T >::insert(), mln::util::fibonacci_heap< P, T >::link(), and mln::util::fibonacci_heap< P, T >::pop_front().

template<typename P , typename T >

void mln::util::internal::fibonacci_heap_node< P, T >::set_right

(

fibonacci_heap_node< P, T > *

node

)

[inline]

References mln::util::internal::fibonacci_heap_node< P, T >::right_.

Referenced by mln::util::fibonacci_heap< P, T >::insert(), mln::util::fibonacci_heap< P, T >::link(), mln::util::fibonacci_heap< P, T >::pop_front(), and mln::util::fibonacci_heap< P, T >::push().

template<typename P , typename T >

void mln::util::internal::fibonacci_heap_node< P, T >::set_value

(

const T &

value

)

[inline]

References mln::util::internal::fibonacci_heap_node< P, T >::value_.

template<typename P , typename T >

const T & mln::util::internal::fibonacci_heap_node< P, T >::value

(

)

const [inline]

Return the node value.

References mln::util::internal::fibonacci_heap_node< P, T >::value_.

Referenced by mln::util::internal::fibonacci_heap_node< P, T >::operator<(), mln::util::internal::fibonacci_heap_node< P, T >::operator=(), mln::util::internal::fibonacci_heap_node< P, T >::operator==(), mln::util::fibonacci_heap< P, T >::pop_front(), and mln::util::fibonacci_heap< P, T >::print_().

---

Member Data Documentation

template<typename P, typename T>

fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::child_ [private]

Referenced by mln::util::internal::fibonacci_heap_node< P, T >::child(), and mln::util::internal::fibonacci_heap_node< P, T >::set_child().

template<typename P, typename T>

short mln::util::internal::fibonacci_heap_node< P, T >::degree_ [private]

Referenced by mln::util::internal::fibonacci_heap_node< P, T >::degree(), and mln::util::internal::fibonacci_heap_node< P, T >::set_degree().

template<typename P, typename T>

fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::left_ [private]

Referenced by mln::util::internal::fibonacci_heap_node< P, T >::left(), and mln::util::internal::fibonacci_heap_node< P, T >::set_left().

template<typename P, typename T>

short mln::util::internal::fibonacci_heap_node< P, T >::mark_ [private]

Referenced by mln::util::internal::fibonacci_heap_node< P, T >::mark(), and mln::util::internal::fibonacci_heap_node< P, T >::set_mark().

template<typename P, typename T>

fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::parent_ [private]

Referenced by mln::util::internal::fibonacci_heap_node< P, T >::parent(), and mln::util::internal::fibonacci_heap_node< P, T >::set_parent().

template<typename P, typename T>

P mln::util::internal::fibonacci_heap_node< P, T >::priority_ [private]

Referenced by mln::util::internal::fibonacci_heap_node< P, T >::operator<(), mln::util::internal::fibonacci_heap_node< P, T >::operator=(), mln::util::internal::fibonacci_heap_node< P, T >::operator==(), mln::util::internal::fibonacci_heap_node< P, T >::print_(), and mln::util::internal::fibonacci_heap_node< P, T >::priority().

template<typename P, typename T>

fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::right_ [private]

Referenced by mln::util::internal::fibonacci_heap_node< P, T >::right(), and mln::util::internal::fibonacci_heap_node< P, T >::set_right().

template<typename P, typename T>

T mln::util::internal::fibonacci_heap_node< P, T >::value_ [private]

Referenced by mln::util::internal::fibonacci_heap_node< P, T >::operator<(), mln::util::internal::fibonacci_heap_node< P, T >::operator=(), mln::util::internal::fibonacci_heap_node< P, T >::operator==(), mln::util::internal::fibonacci_heap_node< P, T >::print_(), mln::util::internal::fibonacci_heap_node< P, T >::set_value(), and mln::util::internal::fibonacci_heap_node< P, T >::value().