Container for sorting intersections. More...
#include <meshTools/pointHitSort.H>
Container for sorting intersections.
Definition at line 51 of file pointHitSort.H.
Public Member Functions | |
pointHitSort () | |
Construct null.
| |
pointHitSort (const pointHit &inter, const label index) | |
Construct from intersection, index.
| |
const pointHit & | inter () const |
label | index () const |
bool | operator== (const pointHitSort &rhs) const |
bool | operator< (const pointHitSort &rhs) const |
pointHitSort | ( | ) | [inline]
|
Construct null.
Definition at line 66 of file pointHitSort.H.
pointHitSort | ( | const pointHit & | inter, |
const label | index | ||
) | [inline]
|
Construct from intersection, index.
Definition at line 73 of file pointHitSort.H.
const pointHit& inter | ( | ) | const [inline]
|
Definition at line 82 of file pointHitSort.H.
Referenced by pointHitSort::operator<(), and pointHitSort::operator==().
label index | ( | ) | const [inline]
|
Definition at line 87 of file pointHitSort.H.
bool operator== | ( | const pointHitSort & | rhs ) | const [inline]
|
Definition at line 94 of file pointHitSort.H.
References PointHit< Point >::distance(), and pointHitSort::inter().
bool operator< | ( | const pointHitSort & | rhs ) | const [inline]
|
Definition at line 99 of file pointHitSort.H.
References PointHit< Point >::distance(), and pointHitSort::inter().