EPAConvexHullBuilder::TriangleQueue Class Reference

Specialized triangles list that keeps them sorted on closest distance to origin. More...

#include <EPAConvexHullBuilder.h>

Inheritance diagram for EPAConvexHullBuilder::TriangleQueue:

Public Member Functions
void	push_back (Triangle *inT)
	Add triangle to the list. More...
Triangle *	PeekClosest ()
	Peek the next closest triangle without removing it. More...
Triangle *	PopClosest ()
	Get next closest triangle. More...
Public Member Functions inherited from StaticArray< T, N >
	StaticArray ()=default
	Default constructor. More...
	StaticArray (std::initializer_list< T > inList)
	Constructor from initializer list. More...
	StaticArray (const StaticArray< T, N > &inRHS)
	Copy constructor. More...
	~StaticArray ()
	Destruct all elements. More...
void	clear ()
	Destruct all elements and set length to zero. More...
void	push_back (const T &inElement)
	Add element to the back of the array. More...
template<class... A>
void	emplace_back (A &&... inElement)
	Construct element at the back of the array. More...
void	pop_back ()
	Remove element from the back of the array. More...
bool	empty () const
	Returns true if there are no elements in the array. More...
size_type	size () const
	Returns amount of elements in the array. More...
size_type	capacity () const
	Returns maximum amount of elements the array can hold. More...
void	resize (size_type inNewSize)
	Resize array to new length. More...
const_iterator	begin () const
	Iterators. More...
const_iterator	end () const
iterator	begin ()
iterator	end ()
const T *	data () const
T *	data ()
T &	operator[] (size_type inIdx)
	Access element. More...
const T &	operator[] (size_type inIdx) const
const T &	front () const
	First element in the array. More...
T &	front ()
const T &	back () const
	Last element in the array. More...
T &	back ()
void	erase (const_iterator inIter)
	Remove one element from the array. More...
void	erase (const_iterator inBegin, const_iterator inEnd)
	Remove multiple element from the array. More...
StaticArray< T, N > &	operator= (const StaticArray< T, N > &inRHS)
	Assignment operator. More...
template<uint M>
StaticArray< T, N > &	operator= (const StaticArray< T, M > &inRHS)
	Assignment operator with static array of different max length. More...
bool	operator== (const StaticArray< T, N > &inRHS) const
	Comparing arrays. More...
bool	operator!= (const StaticArray< T, N > &inRHS) const

Static Public Member Functions
static bool	sTriangleSorter (const Triangle *inT1, const Triangle *inT2)
	Function to sort triangles on closest distance to origin. More...

Additional Inherited Members
Public Types inherited from StaticArray< T, N >
using	value_type = T
using	size_type = uint
using	const_iterator = const T *
using	iterator = T *
Static Public Attributes inherited from StaticArray< T, N >
static constexpr uint	Capacity = N
Protected Attributes inherited from StaticArray< T, N >
size_type	mSize = 0
Storage	mElements [N]

Detailed Description

Specialized triangles list that keeps them sorted on closest distance to origin.

Member Function Documentation

PeekClosest()

Triangle * EPAConvexHullBuilder::TriangleQueue::PeekClosest ( )

inline

Peek the next closest triangle without removing it.

PopClosest()

Triangle * EPAConvexHullBuilder::TriangleQueue::PopClosest ( )

inline

Get next closest triangle.

push_back()

void EPAConvexHullBuilder::TriangleQueue::push_back ( Triangle *  inT )

inline

Add triangle to the list.

sTriangleSorter()

static bool EPAConvexHullBuilder::TriangleQueue::sTriangleSorter ( const Triangle *  inT1, const Triangle *  inT2  )

inlinestatic

Function to sort triangles on closest distance to origin.

---

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

• Jolt/Geometry/EPAConvexHullBuilder.h