physx::Cm::PriorityQueueBase< Element, Comparator > Class Template Reference

Inheritance diagram for physx::Cm::PriorityQueueBase< Element, Comparator >:

Collaboration diagram for physx::Cm::PriorityQueueBase< Element, Comparator >:

Public Member Functions
	PriorityQueueBase (const Comparator &less, Element *elements)
PX_FORCE_INLINE const Element	top () const
	Get the element with the highest priority.
PX_FORCE_INLINE Element	top ()
	Get the element with the highest priority.
PX_FORCE_INLINE bool	empty () const
	Check to whether the priority queue is empty.
PX_FORCE_INLINE void	clear ()
	Empty the priority queue.
PX_FORCE_INLINE void	push (const Element &value)
	Insert a new element into the priority queue. Only valid when size() is less than Capacity.
PX_FORCE_INLINE Element	pop ()
	Delete the highest priority element. Only valid when non-empty.
bool	valid () const
	Make sure the priority queue sort all elements correctly.
PxU32	size () const
	Return number of elements in the priority queue.

Protected Member Functions
PX_FORCE_INLINE bool	compare (const Element &a, const Element &b) const
Protected Member Functions inherited from physx::PxLess< A >
bool	operator() (const A &a, const A &b) const

Static Protected Member Functions
static PX_FORCE_INLINE PxU32	left (PxU32 nodeIndex)
static PX_FORCE_INLINE PxU32	parent (PxU32 nodeIndex)

Protected Attributes
PxU32	mHeapSize
Element *	mDataPtr

---

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

• RavEngine/deps/physx/physx/source/common/src/CmPriorityQueue.h