GCC Middle and Back End API Reference
fibonacci_node< K, V > Class Template Reference

#include <fibonacci_heap.h>

Inheritance diagram for fibonacci_node< K, V >:
Inheritance graph
[legend]
Collaboration diagram for fibonacci_node< K, V >:
Collaboration graph
[legend]

Public Member Functions

 fibonacci_node ()
 fibonacci_node (K key, V *data=NULL)
int compare (fibonacci_node_t *other)
int compare_data (K key)
fibonacci_node_t * remove ()
void link (fibonacci_node_t *parent)
K get_key ()
V * get_data ()

Private Types

typedef fibonacci_node< K, V > fibonacci_node_t

Private Member Functions

void insert_after (fibonacci_node_t *b)
void insert_before (fibonacci_node_t *b)

Private Attributes

fibonacci_node * m_parent
fibonacci_node * m_child
fibonacci_node * m_left
fibonacci_node * m_right
K m_key
V * m_data
unsigned int m_degree: 31
unsigned int m_mark: 1

Friends

class fibonacci_heap< K, V >

Detailed Description

template<class K, class V>
class fibonacci_node< K, V >
Fibonacci heap node class.

Member Typedef Documentation

◆ fibonacci_node_t

template<class K, class V>
typedef fibonacci_node<K,V> fibonacci_node< K, V >::fibonacci_node_t
private

Constructor & Destructor Documentation

◆ fibonacci_node() [1/2]

template<class K, class V>
fibonacci_node< K, V >::fibonacci_node ( )
inline

Referenced by insert_after(), link(), and remove().

◆ fibonacci_node() [2/2]

template<class K, class V>
fibonacci_node< K, V >::fibonacci_node ( K key,
V * data = NULL )
inline

Member Function Documentation

◆ compare()

template<class K, class V>
int fibonacci_node< K, V >::compare ( fibonacci_node_t * other)
inline

Referenced by fibonacci_heap< K, V >::consolidate(), and fibonacci_heap< K, V >::union_with().

◆ compare_data()

template<class K, class V>
int fibonacci_node< K, V >::compare_data ( K key)
inline

◆ get_data()

template<class K, class V>
V * fibonacci_node< K, V >::get_data ( )
inline

◆ get_key()

template<class K, class V>
K fibonacci_node< K, V >::get_key ( )
inline

◆ insert_after()

template<class K, class V>
void fibonacci_node< K, V >::insert_after ( fibonacci_node_t * b)
private 
Put node B after this node.

References a, b, and fibonacci_node().

◆ insert_before()

template<class K, class V>
void fibonacci_node< K, V >::insert_before ( fibonacci_node_t * b)
inlineprivate

Referenced by link().

◆ link()

template<class K, class V>
void fibonacci_node< K, V >::link ( fibonacci_node_t * parent) 
Link the node with PARENT.

References fibonacci_node(), insert_before(), m_child, m_degree, m_mark, m_parent, and NULL.

◆ remove()

template<class K, class V>
fibonacci_node< K, V > * fibonacci_node< K, V >::remove ( ) 
Remove fibonacci heap node.

References fibonacci_node(), m_left, m_parent, m_right, and NULL.

◆ fibonacci_heap< K, V >

template<class K, class V>
friend class fibonacci_heap< K, V >
friend

Field Documentation

◆ m_child

template<class K, class V>
fibonacci_node* fibonacci_node< K, V >::m_child
private

Referenced by fibonacci_heap< K, V >::extract_minimum_node(), and link().

◆ m_data

template<class K, class V>
V* fibonacci_node< K, V >::m_data
private

Referenced by fibonacci_heap< K, V >::extract_min().

◆ m_degree

template<class K, class V>
unsigned int fibonacci_node< K, V >::m_degree
private

Referenced by fibonacci_heap< K, V >::consolidate(), fibonacci_heap< K, V >::cut(), and link().

◆ m_key

template<class K, class V>
K fibonacci_node< K, V >::m_key
private

Referenced by fibonacci_node< long, basic_block_def >::compare().

◆ m_left

template<class K, class V>
fibonacci_node* fibonacci_node< K, V >::m_left
private

Referenced by remove(), and fibonacci_heap< K, V >::union_with().

◆ m_mark

template<class K, class V>
unsigned int fibonacci_node< K, V >::m_mark
private

Referenced by link().

◆ m_parent

template<class K, class V>
fibonacci_node* fibonacci_node< K, V >::m_parent
private

Referenced by fibonacci_heap< K, V >::extract_minimum_node(), link(), and remove().

◆ m_right

template<class K, class V>
fibonacci_node* fibonacci_node< K, V >::m_right
private

Referenced by fibonacci_heap< K, V >::extract_minimum_node(), remove(), and fibonacci_heap< K, V >::union_with().

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