CDT  1.4.1
C++ library for constrained Delaunay triangulation
Loading...
Searching...
No Matches
Public Member Functions | List of all members
CDT::Edge Struct Reference

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

#include <CDTUtils.h>

Public Member Functions

 Edge (VertInd iV1, VertInd iV2)
 Constructor.
 
bool operator== (const Edge &other) const
 Equals operator.
 
bool operator!= (const Edge &other) const
 Not-equals operator.
 
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 208 of file CDTUtils.h.

Constructor & Destructor Documentation

◆ Edge()

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

Constructor.

Definition at line 42 of file CDTUtils.hpp.

Member Function Documentation

◆ operator!=()

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

Not-equals operator.

Definition at line 52 of file CDTUtils.hpp.

◆ operator==()

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

Equals operator.

Definition at line 47 of file CDTUtils.hpp.

◆ v1()

CDT_INLINE_IF_HEADER_ONLY VertInd CDT::Edge::v1 ( ) const

V1 getter.

Definition at line 57 of file CDTUtils.hpp.

◆ v2()

CDT_INLINE_IF_HEADER_ONLY VertInd CDT::Edge::v2 ( ) const

V2 getter.

Definition at line 62 of file CDTUtils.hpp.

◆ verts()

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

Edges' vertices.

Definition at line 67 of file CDTUtils.hpp.

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