EdgeToSort< T > Struct Template Reference

Public Member Functions
	EdgeToSort ()=default
	EdgeToSort (const EdgeToSort &other)
	EdgeToSort (EdgeToSort &&other) noexcept
	~EdgeToSort ()=default
EdgeToSort &	operator= (const EdgeToSort &other)
EdgeToSort &	operator= (EdgeToSort &&other)

Public Attributes
double	len_squared = 0.0
CDTEdge< T > *	e {nullptr}

Detailed Description

template<typename T>
struct EdgeToSort< T >

For sorting edges by decreasing length (squared).

Definition at line 2322 of file delaunay_2d.cc.

Constructor & Destructor Documentation

EdgeToSort() [1/3]

template<typename T >

EdgeToSort< T >::EdgeToSort ( )

default

EdgeToSort() [2/3]

template<typename T >

EdgeToSort< T >::EdgeToSort ( const EdgeToSort< T > & other )

inline

Definition at line 2327 of file delaunay_2d.cc.

EdgeToSort() [3/3]

template<typename T >

EdgeToSort< T >::EdgeToSort ( EdgeToSort< T > && other )

inlinenoexcept

Definition at line 2328 of file delaunay_2d.cc.

~EdgeToSort()

template<typename T >

EdgeToSort< T >::~EdgeToSort ( )

default

Member Function Documentation

operator=() [1/2]

template<typename T >

EdgeToSort & EdgeToSort< T >::operator= ( const EdgeToSort< T > & other )

inline

Definition at line 2332 of file delaunay_2d.cc.

References BMVert::e, e, EdgeToSort< T >::len_squared, and len_squared().

operator=() [2/2]

template<typename T >

EdgeToSort & EdgeToSort< T >::operator= ( EdgeToSort< T > && other )

inline

Definition at line 2340 of file delaunay_2d.cc.

References BMVert::e, e, and len_squared().

Member Data Documentation

e

template<typename T >

CDTEdge<T>* EdgeToSort< T >::e {nullptr}

Definition at line 2324 of file delaunay_2d.cc.

len_squared

template<typename T >

double EdgeToSort< T >::len_squared = 0.0

Definition at line 2323 of file delaunay_2d.cc.

Referenced by EdgeToSort< T >::operator=().

---

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

• delaunay_2d.cc