46 class fibonacci_heap;  variable
54   friend class fibonacci_heap<K,V>;
142 class fibonacci_heap
151   fibonacci_heap (K global_min_key, pool_allocator *allocator = NULL):
165   ~fibonacci_heap ()  in ~fibonacci_heap()
246   fibonacci_heap *union_with (fibonacci_heap *heapb);
357 fibonacci_heap<K,V>::insert (K key, V *data)  in insert()
370 fibonacci_heap<K,V>::insert (fibonacci_node_t *node, K key, V *data)  in insert()
383 fibonacci_heap<K,V>::insert_node (fibonacci_node_t *node)  in insert_node()
402 fibonacci_heap<K,V>::replace_key_data (fibonacci_node<K,V> *node, K key,  in replace_key_data()
452 fibonacci_heap<K,V>::extract_min (bool release)  in extract_min()
479 fibonacci_heap<K,V>::delete_node (fibonacci_node<K,V> *node, bool release)  in delete_node()
498 fibonacci_heap<K,V>*
499 fibonacci_heap<K,V>::union_with (fibonacci_heap<K,V> *heapb)  in union_with()
501   fibonacci_heap<K,V> *heapa = this;  in union_with()
541 fibonacci_heap<K,V>::insert_root (fibonacci_node_t *node)  in insert_root()
562 fibonacci_heap<K,V>::cut (fibonacci_node<K,V> *node,  in cut()
576 fibonacci_heap<K,V>::cascading_cut (fibonacci_node<K,V> *y)  in cascading_cut()
599 fibonacci_heap<K,V>::extract_minimum_node ()  in extract_minimum_node()
637 fibonacci_heap<K,V>::remove_root (fibonacci_node<K,V> *node)  in remove_root()
648 void fibonacci_heap<K,V>::consolidate ()  in consolidate()