HeapOpenList

Declared in astar/structures/ads/OpenList.h; the same class on the site of Doxygen.

template<class NodeT, unsigned Arity = 4>
class HeapOpenList

the OPEN list on the DaryHeap of ADS

Public Functions

inline void push(NodeT *node)

pushes a node with its current f and g

inline void push(NodeT *node, Cost g)

pushes a node with the given g (and f = g + h), not reading node->g

inline OpenEntry<NodeT> top(void) const

the entry with the smallest f (and the largest g among those)

inline Cost top_f(void) const

the f of top()

inline OpenEntry<NodeT> pop(void)

removes and returns top()

inline bool empty(void) const noexcept

true if there is no entry

inline std::size_t size(void) const noexcept

the number of entries, the stale ones included