HeapOpenList< NodeT, Arity > Class Template Reference

the OPEN list on the DaryHeap of ADS More...

#include <PBeFS/astar/structures/ads/OpenList.h>

Public Member Functions
void	push (NodeT *node)
	pushes a node with its current f and g
void	push (NodeT *node, Cost g)
	pushes a node with the given g (and f = g + h), not reading node->g
OpenEntry< NodeT >	top (void) const
	the entry with the smallest f (and the largest g among those)
Cost	top_f (void) const
	the f of top()
OpenEntry< NodeT >	pop (void)
	removes and returns top()
bool	empty (void) const noexcept
	true if there is no entry
std::size_t	size (void) const noexcept
	the number of entries, the stale ones included

Detailed Description

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

the OPEN list on the DaryHeap of ADS

Member Function Documentation

empty()

template<class NodeT, unsigned Arity = 4>

bool empty ( void ) const

inlinenodiscardnoexcept

true if there is no entry

pop()

template<class NodeT, unsigned Arity = 4>

OpenEntry< NodeT > pop ( void )

inline

removes and returns top()

push() [1/2]

template<class NodeT, unsigned Arity = 4>

void push ( NodeT * node )

inline

pushes a node with its current f and g

push() [2/2]

template<class NodeT, unsigned Arity = 4>

void push ( NodeT * node, Cost g )

inline

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

size()

template<class NodeT, unsigned Arity = 4>

std::size_t size ( void ) const

inlinenodiscardnoexcept

the number of entries, the stale ones included

top()

template<class NodeT, unsigned Arity = 4>

OpenEntry< NodeT > top ( void ) const

inlinenodiscard

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

top_f()

template<class NodeT, unsigned Arity = 4>

Cost top_f ( void ) const

inlinenodiscard

the f of top()

---

The documentation for this class was generated from the following file:

• PBeFS/astar/structures/ads/OpenList.h