|
Open CASCADE Technology
7.7.0
|
this class contains the generic algorithm of computation of the bisecting locus. More...
#include <MAT2d_Mat2d.hxx>
Public Member Functions | |
| MAT2d_Mat2d (const Standard_Boolean IsOpenResult=Standard_False) | |
| Empty constructor. More... | |
| ~MAT2d_Mat2d () | |
| void | CreateMat (MAT2d_Tool2d &aTool) |
| Algorithm of computation of the bisecting locus. More... | |
| void | CreateMatOpen (MAT2d_Tool2d &aTool) |
| Algorithm of computation of the bisecting locus for open wire. More... | |
| Standard_Boolean | IsDone () const |
| Returns <TRUE> if CreateMat has succeeded. More... | |
| void | Init () |
| Initialize an iterator on the set of the roots of the trees of bisectors. More... | |
| Standard_Boolean | More () const |
| Return False if there is no more roots. More... | |
| void | Next () |
| Move to the next root. More... | |
| Handle< MAT_Bisector > | Bisector () const |
| Returns the current root. More... | |
| Standard_Boolean | SemiInfinite () const |
| Returns True if there are semi_infinite bisectors. So there is a tree for each semi_infinte bisector. More... | |
| Standard_Integer | NumberOfBisectors () const |
| Returns the total number of bisectors. More... | |
this class contains the generic algorithm of computation of the bisecting locus.
| MAT2d_Mat2d::MAT2d_Mat2d | ( | const Standard_Boolean | IsOpenResult = Standard_False | ) |
Empty constructor.
| MAT2d_Mat2d::~MAT2d_Mat2d | ( | ) |
| Handle< MAT_Bisector > MAT2d_Mat2d::Bisector | ( | ) | const |
Returns the current root.
| void MAT2d_Mat2d::CreateMat | ( | MAT2d_Tool2d & | aTool | ) |
Algorithm of computation of the bisecting locus.
| void MAT2d_Mat2d::CreateMatOpen | ( | MAT2d_Tool2d & | aTool | ) |
Algorithm of computation of the bisecting locus for open wire.
| void MAT2d_Mat2d::Init | ( | ) |
Initialize an iterator on the set of the roots of the trees of bisectors.
| Standard_Boolean MAT2d_Mat2d::IsDone | ( | ) | const |
Returns <TRUE> if CreateMat has succeeded.
| Standard_Boolean MAT2d_Mat2d::More | ( | ) | const |
Return False if there is no more roots.
| void MAT2d_Mat2d::Next | ( | ) |
Move to the next root.
| Standard_Integer MAT2d_Mat2d::NumberOfBisectors | ( | ) | const |
Returns the total number of bisectors.
| Standard_Boolean MAT2d_Mat2d::SemiInfinite | ( | ) | const |
Returns True if there are semi_infinite bisectors. So there is a tree for each semi_infinte bisector.
1.8.13