Searched refs:PairNode (Results 1 - 3 of 3) sorted by relevance

/inkscape/src/libvpsc/pairingheap/
H A DPairingHeap.h21 // PairNode & insert( x ) --> Insert x
27 // void decreaseKey( PairNode p, newVal )
42 class PairNode class
46 PairNode *leftChild;
47 PairNode *nextSibling;
48 PairNode *prev;
50 PairNode( const T & theElement ) : function in class:PairNode
84 PairNode<T> *insert( const T & x );
93 void decreaseKey( PairNode<T> *p, const T & newVal );
96 PairNode<
[all...]
H A DPairingHeap.cpp66 PairNode<T> *
69 PairNode<T> *newNode = new PairNode<T>( x );
103 PairNode<T> *oldRoot = root;
164 void PairingHeap<T>::reclaimMemory( PairNode<T> * t ) const
182 void PairingHeap<T>::decreaseKey( PairNode<T> *p,
212 compareAndLink( PairNode<T> * & first,
213 PairNode<T> *second ) const
248 PairNode<T> *
249 PairingHeap<T>::combineSiblings( PairNode<
[all...]
/inkscape/src/libcola/
H A Dshortest_paths.h6 class PairNode;
15 PairNode<Node*> *qnode;

Completed in 661 milliseconds