Dip
0.92.4
|
#include <AlpsPriorityQueue.h>
Public Member Functions | |
AlpsPriorityQueue () | |
AlpsPriorityQueue (AlpsSearchStrategy< T > &compare) | |
const std::vector< T > & | getContainer () const |
Return a const reference to the container. More... | |
void | setComparison (AlpsSearchStrategy< T > &c) |
Set comparison function and resort heap. More... | |
T | top () const |
Return the top element of the heap. More... | |
void | push (T x) |
Add a element to the heap. More... | |
void | pop () |
Remove the top element from the heap. More... | |
bool | empty () const |
Return true for an empty vector. More... | |
size_t | size () const |
Return the size of the vector. More... | |
void | clear () |
Remove all elements from the vector. More... | |
Private Member Functions | |
AlpsPriorityQueue (const AlpsPriorityQueue &) | |
AlpsPriorityQueue & | operator= (const AlpsPriorityQueue &) |
Private Attributes | |
std::vector< T > | vec_ |
AlpsCompare< T > | comparison_ |
Definition at line 34 of file AlpsPriorityQueue.h.
|
private |
|
inline |
Definition at line 44 of file AlpsPriorityQueue.h.
|
inline |
Definition at line 45 of file AlpsPriorityQueue.h.
|
private |
|
inline |
Return a const reference to the container.
Definition at line 50 of file AlpsPriorityQueue.h.
Referenced by AlpsSubTreePool::deleteGuts(), AlpsNodePool::deleteGuts(), AlpsNodePool::getBestKnowledgeValue(), AlpsNodePool::getBestNode(), and AlpsSubTreePool::getBestQuality().
|
inline |
Set comparison function and resort heap.
Definition at line 53 of file AlpsPriorityQueue.h.
Referenced by AlpsPriorityQueue< AlpsSubTree * >::AlpsPriorityQueue(), AlpsSubTreePool::setComparison(), and AlpsNodePool::setNodeSelection().
|
inline |
Return the top element of the heap.
Definition at line 59 of file AlpsPriorityQueue.h.
Referenced by AlpsSubTreePool::getKnowledge(), and AlpsNodePool::getKnowledge().
|
inline |
Add a element to the heap.
Definition at line 62 of file AlpsPriorityQueue.h.
Referenced by AlpsSubTreePool::addKnowledge(), and AlpsNodePool::addKnowledge().
|
inline |
Remove the top element from the heap.
Definition at line 68 of file AlpsPriorityQueue.h.
Referenced by AlpsSubTreePool::popKnowledge(), and AlpsNodePool::popKnowledge().
|
inline |
Return true for an empty vector.
Definition at line 74 of file AlpsPriorityQueue.h.
Referenced by AlpsSubTreePool::hasKnowledge(), AlpsNodePool::hasKnowledge(), AlpsNodePool::~AlpsNodePool(), and AlpsSubTreePool::~AlpsSubTreePool().
|
inline |
Return the size of the vector.
Definition at line 79 of file AlpsPriorityQueue.h.
Referenced by AlpsSubTreePool::deleteGuts(), AlpsNodePool::deleteGuts(), AlpsSubTreePool::getNumKnowledges(), and AlpsNodePool::getNumKnowledges().
|
inline |
Remove all elements from the vector.
But not delete them.
Definition at line 84 of file AlpsPriorityQueue.h.
Referenced by AlpsNodePool::clear(), AlpsSubTreePool::deleteGuts(), and AlpsNodePool::deleteGuts().
|
private |
Definition at line 40 of file AlpsPriorityQueue.h.
Referenced by AlpsPriorityQueue< AlpsSubTree * >::clear(), AlpsPriorityQueue< AlpsSubTree * >::empty(), AlpsPriorityQueue< AlpsSubTree * >::getContainer(), AlpsPriorityQueue< AlpsSubTree * >::pop(), AlpsPriorityQueue< AlpsSubTree * >::push(), AlpsPriorityQueue< AlpsSubTree * >::setComparison(), AlpsPriorityQueue< AlpsSubTree * >::size(), and AlpsPriorityQueue< AlpsSubTree * >::top().
|
private |
Definition at line 41 of file AlpsPriorityQueue.h.
Referenced by AlpsPriorityQueue< AlpsSubTree * >::pop(), AlpsPriorityQueue< AlpsSubTree * >::push(), and AlpsPriorityQueue< AlpsSubTree * >::setComparison().