Home | History | Annotate | Download | only in gcc

Lines Matching defs:fibonacci_node

51 class fibonacci_node
53   typedef fibonacci_node<K,V> fibonacci_node_t;
58   fibonacci_node (): m_parent (NULL), m_child (NULL), m_left (this),
64   fibonacci_node (K key, V *data = NULL): m_parent (NULL), m_child (NULL),
115   fibonacci_node *m_parent;
117   fibonacci_node *m_child;
119   fibonacci_node *m_left;
121   fibonacci_node *m_right;
144   typedef fibonacci_node<K,V> fibonacci_node_t;
145   friend class fibonacci_node<K,V>;
291 fibonacci_node<K,V> *
292 fibonacci_node<K,V>::remove ()
294   fibonacci_node<K,V> *ret;
318 fibonacci_node<K,V>::link (fibonacci_node<K,V> *parent)
333 fibonacci_node<K,V>::insert_after (fibonacci_node<K,V> *b)
335   fibonacci_node<K,V> *a = this;
356 fibonacci_node<K,V>*
360   fibonacci_node<K,V> *node = new (m_allocator->allocate ())
369 fibonacci_node<K,V>*
382 fibonacci_node<K,V>*
402 fibonacci_heap<K,V>::replace_key_data (fibonacci_node<K,V> *node, K key,
406   fibonacci_node<K,V> *y;
454   fibonacci_node<K,V> *z;
479 fibonacci_heap<K,V>::delete_node (fibonacci_node<K,V> *node, bool release)
503   fibonacci_node<K,V> *a_root, *b_root;
562 fibonacci_heap<K,V>::cut (fibonacci_node<K,V> *node,
563 			  fibonacci_node<K,V> *parent)
576 fibonacci_heap<K,V>::cascading_cut (fibonacci_node<K,V> *y)
578   fibonacci_node<K,V> *z;
598 fibonacci_node<K,V>*
601   fibonacci_node<K,V> *ret = m_min;
602   fibonacci_node<K,V> *x, *y, *orig;
637 fibonacci_heap<K,V>::remove_root (fibonacci_node<K,V> *node)
651   fibonacci_node<K,V> *a[D];
652   fibonacci_node<K,V> *w, *x, *y;