QueueElement       14 ompi/mca/topo/treematch/treematch/PriorityQueue.c     ( ( ((QueueElement*)(node1))->key > ((QueueElement*)(node2))->key ) ? -1 : 1); 
QueueElement       21 ompi/mca/topo/treematch/treematch/PriorityQueue.c   q->elements = malloc(sizeof(QueueElement *) * size);
QueueElement       60 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_insertElement(PriorityQueue * const q, QueueElement * const e)
QueueElement       69 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_deleteElement(PriorityQueue * const q, QueueElement * const e)
QueueElement       80 ompi/mca/topo/treematch/treematch/PriorityQueue.c       QueueElement * e = malloc(sizeof(QueueElement));
QueueElement       89 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = q->elements[val];
QueueElement       94 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * PQ_findMaxElement(PriorityQueue * const q)
QueueElement       96 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = (QueueElement *)(fiboTreeMin((FiboTree *)q));
QueueElement       99 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * PQ_deleteMaxElement(PriorityQueue * const q)
QueueElement      101 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = (QueueElement *)(fiboTreeMin((FiboTree *)q));
QueueElement      111 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = PQ_findMaxElement(q);
QueueElement      119 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = PQ_deleteMaxElement(q);
QueueElement      127 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_increaseElementKey(PriorityQueue * const q, QueueElement * const e, double i)
QueueElement      136 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_decreaseElementKey(PriorityQueue * const q, QueueElement * const e, double i)
QueueElement      145 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_adjustElementKey(PriorityQueue * const q, QueueElement * const e, double i)
QueueElement      157 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = q->elements[val];
QueueElement      164 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = q->elements[val];
QueueElement      171 ompi/mca/topo/treematch/treematch/PriorityQueue.c   QueueElement * e = q->elements[val];
QueueElement       21 ompi/mca/topo/treematch/treematch/PriorityQueue.h   QueueElement ** elements; /*a vector of element with their value as key so we can easily retreive an element from its value */
QueueElement       48 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_insertElement(PriorityQueue * const, QueueElement * const); 
QueueElement       52 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_deleteElement(PriorityQueue * const, QueueElement * const);
QueueElement       67 ompi/mca/topo/treematch/treematch/PriorityQueue.h QueueElement * PQ_findMaxElement(PriorityQueue * const);
QueueElement       71 ompi/mca/topo/treematch/treematch/PriorityQueue.h QueueElement * PQ_deleteMaxElement(PriorityQueue * const);
QueueElement       85 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_increaseElementKey(PriorityQueue * const, QueueElement * const, double i);
QueueElement       89 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_decreaseElementKey(PriorityQueue * const, QueueElement * const, double i);
QueueElement       93 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_adjustElementKey(PriorityQueue * const, QueueElement * const, double i);