cgma
|
#include <PST_Data.hpp>
Public Member Functions | |
PST_CoEdge * | next () |
PST_Edge * | edge () |
PST_Face * | face () |
CubitSense | sense () |
PST_Point * | start_point () |
PST_Point * | end_point () |
PST_Point * | common (PST_CoEdge *coedge) |
PST_Point * | other (PST_Point *point) |
const CubitVector & | start_coord () |
const CubitVector & | end_coord () |
CubitVector | direction () |
PST_CoEdge * | other () |
PST_CoEdge * | previous () |
int | validate (CubitBoolean print=CUBIT_FALSE) |
Private Member Functions | |
PST_CoEdge () | |
PST_CoEdge (PST_Edge *owner) | |
~PST_CoEdge () | |
Private Attributes | |
PST_CoEdge * | next_ |
PST_Edge * | edge_ |
PST_Face * | face_ |
Friends | |
class | PST_Edge |
Definition at line 121 of file PST_Data.hpp.
PST_CoEdge::PST_CoEdge | ( | ) | [inline, private] |
Definition at line 155 of file PST_Data.hpp.
PST_CoEdge::PST_CoEdge | ( | PST_Edge * | owner | ) | [inline, private] |
Definition at line 159 of file PST_Data.hpp.
PST_CoEdge::~PST_CoEdge | ( | ) | [inline, private] |
Definition at line 163 of file PST_Data.hpp.
{ assert( !face_ ); }
PST_Point* PST_CoEdge::common | ( | PST_CoEdge * | coedge | ) | [inline] |
CubitVector PST_CoEdge::direction | ( | ) | [inline] |
Definition at line 501 of file PST_Data.hpp.
{ return sense() == CUBIT_FORWARD ? edge_->end_coord() - edge_->start_coord() : edge_->start_coord() - edge_->end_coord() ; }
PST_Edge* PST_CoEdge::edge | ( | ) | [inline] |
Definition at line 130 of file PST_Data.hpp.
{ return edge_; }
const CubitVector & PST_CoEdge::end_coord | ( | ) | [inline] |
Definition at line 496 of file PST_Data.hpp.
{ return sense() == CUBIT_FORWARD ? edge_->end_coord() : edge_->start_coord(); }
PST_Point * PST_CoEdge::end_point | ( | ) | [inline] |
Definition at line 481 of file PST_Data.hpp.
{ return sense() == CUBIT_FORWARD ? edge_->end_point() : edge_->start_point(); }
PST_Face* PST_CoEdge::face | ( | ) | [inline] |
Definition at line 133 of file PST_Data.hpp.
{ return face_; }
PST_CoEdge* PST_CoEdge::next | ( | ) | [inline] |
Definition at line 127 of file PST_Data.hpp.
{ return next_; }
PST_Point * PST_CoEdge::other | ( | PST_Point * | point | ) | [inline] |
Definition at line 486 of file PST_Data.hpp.
PST_CoEdge * PST_CoEdge::other | ( | ) | [inline] |
Definition at line 508 of file PST_Data.hpp.
Definition at line 226 of file PST_Data.cpp.
{ if( !next_ ) return 0; PST_CoEdge* coedge = this; #ifndef NDEBUG int debug = 0; #endif while( coedge->next_ != this ) { coedge = coedge->next_; #ifndef NDEBUG assert( ++debug < PST_MAX_LIST_LEN ); #endif } return coedge; }
CubitSense PST_CoEdge::sense | ( | ) | [inline] |
Definition at line 471 of file PST_Data.hpp.
const CubitVector & PST_CoEdge::start_coord | ( | ) | [inline] |
Definition at line 491 of file PST_Data.hpp.
{ return sense() == CUBIT_FORWARD ? edge_->start_coord() : edge_->end_coord(); }
PST_Point * PST_CoEdge::start_point | ( | ) | [inline] |
Definition at line 476 of file PST_Data.hpp.
{ return sense() == CUBIT_FORWARD ? edge_->start_point() : edge_->end_point(); }
int PST_CoEdge::validate | ( | CubitBoolean | print = CUBIT_FALSE | ) |
Definition at line 1123 of file PST_Data.cpp.
{ int result = 0; if( ! edge_ ) { if( print ) PRINT_ERROR("Coedge %p has null edge.\n", (void*)this); result++; } else { if( ! edge_->other( this ) ) { if( print ) PRINT_ERROR( "Inconsistent coedge->edge link. CoEdge: %p Edge: %p\n", (void*)edge_, (void*)this ); result++; } result += edge_->validate(print); } return result; }
friend class PST_Edge [friend] |
Definition at line 123 of file PST_Data.hpp.
PST_Edge* PST_CoEdge::edge_ [private] |
Definition at line 167 of file PST_Data.hpp.
PST_Face* PST_CoEdge::face_ [private] |
Definition at line 168 of file PST_Data.hpp.
PST_CoEdge* PST_CoEdge::next_ [private] |
Definition at line 166 of file PST_Data.hpp.