CDT::Edge Struct Reference

Edge connecting two vertices: vertex with smaller index is always first. More...

#include <CDTUtils.h>

Public Member Functions
	Edge (const VertInd iV1, const VertInd iV2)
	Constructor.
bool	operator== (const Edge &other) const
	Equals operator.
bool	operator!= (const Edge &other) const
	Not-equals operator.
bool	operator< (const Edge &other) const
	Less-than operator: orders by (v1, v2); used to get a deterministic order out of hash-set iteration (which is platform-dependent)
VertInd	v1 () const
	V1 getter.
VertInd	v2 () const
	V2 getter.
const std::pair< VertInd, VertInd > &	verts () const
	Edges' vertices.

Detailed Description

Edge connecting two vertices: vertex with smaller index is always first.

Note

: hash Edge is specialized at the bottom

Definition at line 333 of file CDTUtils.h.

Constructor & Destructor Documentation

Edge()

CDT::Edge::Edge ( const VertInd iV1, const VertInd iV2 )

inline

Constructor.

Definition at line 336 of file CDTUtils.h.

Member Function Documentation

operator!=()

bool CDT::Edge::operator!= ( const Edge & other ) const

inline

Not-equals operator.

Definition at line 348 of file CDTUtils.h.

operator<()

bool CDT::Edge::operator< ( const Edge & other ) const

inline

Less-than operator: orders by (v1, v2); used to get a deterministic order out of hash-set iteration (which is platform-dependent)

Definition at line 355 of file CDTUtils.h.

operator==()

bool CDT::Edge::operator== ( const Edge & other ) const

inline

Equals operator.

Definition at line 342 of file CDTUtils.h.

v1()

VertInd CDT::Edge::v1 ( ) const

inline

V1 getter.

Definition at line 361 of file CDTUtils.h.

v2()

VertInd CDT::Edge::v2 ( ) const

inline

V2 getter.

Definition at line 367 of file CDTUtils.h.

verts()

const std::pair< VertInd, VertInd > & CDT::Edge::verts ( ) const

inline

Edges' vertices.

Definition at line 373 of file CDTUtils.h.

---

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

• include/CDTUtils.h