CEdgeKey class, which is used for sorting edges.
More...
#include <Edge.h>
List of all members.
Detailed Description
CEdgeKey class, which is used for sorting edges.
Definition at line 82 of file Edge.h.
Constructor & Destructor Documentation
MeshLib::CEdgeKey::CEdgeKey |
( |
int |
id1, |
|
|
int |
id2 | |
|
) |
| | [inline] |
CEdgeKey constructor
- Parameters:
-
| id1 | source vertex id |
| id2 | target vertex id |
Definition at line 90 of file Edge.h.
{
assert( id1 != id2 );
m_id[0] = (id1 < id2)?id1:id2;
m_id[1] = (id1 < id2)?id2:id1;
};
MeshLib::CEdgeKey::~CEdgeKey |
( |
|
) |
[inline] |
Member Function Documentation
bool MeshLib::CEdgeKey::operator< |
( |
const CEdgeKey & |
key |
) |
const [inline] |
Comparision
- Parameters:
-
Definition at line 100 of file Edge.h.
{
if( m_id[0] < key.m_id[0] ) return true;
if( m_id[0] > key.m_id[0] ) return false;
if( m_id[1] < key.m_id[1] ) return true;
if( m_id[1] > key.m_id[1] ) return false;
return false;
};
bool MeshLib::CEdgeKey::operator== |
( |
const CEdgeKey & |
key |
) |
const [inline] |
Comparision
- Parameters:
-
Definition at line 113 of file Edge.h.
{
if( m_id[0] != key.m_id[0] ) return false;
if( m_id[1] != key.m_id[1] ) return false;
return true;
}
Member Data Documentation
Two vertex ids.
Definition at line 123 of file Edge.h.
The documentation for this class was generated from the following file: