 |
Open CASCADE Technology Reference Manual 8.0.0
|
Loading...
Searching...
No Matches
|
Open CASCADE Technology Reference Manual 8.0.0
|
The Class Graph permits the exploration of the Bisector Locus. More...
#include <MAT_Graph.hxx>
Public Member Functions | |
| MAT_Graph () | |
| Empty constructor. | |
| void | Perform (const bool SemiInfinite, const occ::handle< MAT_ListOfBisector > &TheRoots, const int NbBasicElts, const int NbArcs) |
| Construct <me> from the result of the method <CreateMat> of the class <MAT> from <MAT>. | |
| occ::handle< MAT_Arc > | Arc (const int Index) const |
| Return the Arc of index <Index> in <theArcs>. | |
| occ::handle< MAT_BasicElt > | BasicElt (const int Index) const |
| Return the BasicElt of index <Index> in <theBasicElts>. | |
| occ::handle< MAT_Node > | Node (const int Index) const |
| Return the Node of index <Index> in <theNodes>. | |
| int | NumberOfArcs () const |
| Return the number of arcs of <me>. | |
| int | NumberOfNodes () const |
| Return the number of nodes of <me>. | |
| int | NumberOfBasicElts () const |
| Return the number of basic elements of <me>. | |
| int | NumberOfInfiniteNodes () const |
| Return the number of infinites nodes of <me>. | |
| void | FusionOfBasicElts (const int IndexElt1, const int IndexElt2, bool &MergeArc1, int &GeomIndexArc1, int &GeomIndexArc2, bool &MergeArc2, int &GeomIndexArc3, int &GeomIndexArc4) |
| Merge two BasicElts. The End of the BasicElt Elt1 of IndexElt1 becomes The End of the BasicElt Elt2 of IndexElt2. Elt2 is replaced in the arcs by Elt1, Elt2 is eliminated. | |
| void | CompactArcs () |
| void | CompactNodes () |
| void | ChangeBasicElts (const NCollection_DataMap< int, occ::handle< MAT_BasicElt > > &NewMap) |
| occ::handle< MAT_BasicElt > | ChangeBasicElt (const int Index) |
 Public Member Functions inherited from Standard_Transient | |
| Standard_Transient () | |
| Empty constructor. | |
| Standard_Transient (const Standard_Transient &) | |
| Copy constructor – does nothing. | |
| Standard_Transient & | operator= (const Standard_Transient &) |
| Assignment operator, needed to avoid copying reference counter. | |
| virtual | ~Standard_Transient ()=default |
| Destructor must be virtual. | |
| virtual const opencascade::handle< Standard_Type > & | DynamicType () const |
| Returns a type descriptor about this object. | |
| bool | IsInstance (const opencascade::handle< Standard_Type > &theType) const |
| Returns a true value if this is an instance of Type. | |
| bool | IsInstance (const char *const theTypeName) const |
| Returns a true value if this is an instance of TypeName. | |
| bool | IsKind (const opencascade::handle< Standard_Type > &theType) const |
| Returns true if this is an instance of Type or an instance of any class that inherits from Type. Note that multiple inheritance is not supported by OCCT RTTI mechanism. | |
| bool | IsKind (const char *const theTypeName) const |
| Returns true if this is an instance of TypeName or an instance of any class that inherits from TypeName. Note that multiple inheritance is not supported by OCCT RTTI mechanism. | |
| Standard_Transient * | This () const |
| Returns non-const pointer to this object (like const_cast). For protection against creating handle to objects allocated in stack or call from constructor, it will raise exception Standard_ProgramError if reference counter is zero. | |
| int | GetRefCount () const noexcept |
| Get the reference counter of this object. | |
| void | IncrementRefCounter () noexcept |
| Increments the reference counter of this object. Uses relaxed memory ordering since incrementing only requires atomicity, not synchronization with other memory operations. | |
| int | DecrementRefCounter () noexcept |
| Decrements the reference counter of this object; returns the decremented value. Uses release ordering for the decrement to ensure all writes to the object are visible before the count reaches zero. An acquire fence is added only when the count reaches zero, ensuring proper synchronization before deletion. This is more efficient than using acq_rel for every decrement. | |
| virtual void | Delete () const |
| Memory deallocator for transient classes. | |
Additional Inherited Members | |
| Public Types inherited from Standard_Transient | |
| typedef void | base_type |
| Returns a type descriptor about this object. | |
| Static Public Member Functions inherited from Standard_Transient | |
| static constexpr const char * | get_type_name () |
| Returns a type descriptor about this object. | |
| static const opencascade::handle< Standard_Type > & | get_type_descriptor () |
| Returns type descriptor of Standard_Transient class. | |
The Class Graph permits the exploration of the Bisector Locus.
| MAT_Graph::MAT_Graph | ( | ) |
Empty constructor.
| occ::handle< MAT_Arc > MAT_Graph::Arc | ( | const int | Index | ) | const |
Return the Arc of index <Index> in <theArcs>.
| occ::handle< MAT_BasicElt > MAT_Graph::BasicElt | ( | const int | Index | ) | const |
Return the BasicElt of index <Index> in <theBasicElts>.
| occ::handle< MAT_BasicElt > MAT_Graph::ChangeBasicElt | ( | const int | Index | ) |
| void MAT_Graph::ChangeBasicElts | ( | const NCollection_DataMap< int, occ::handle< MAT_BasicElt > > & | NewMap | ) |
| void MAT_Graph::CompactArcs | ( | ) |
| void MAT_Graph::CompactNodes | ( | ) |
| void MAT_Graph::FusionOfBasicElts | ( | const int | IndexElt1, |
| const int | IndexElt2, | ||
| bool & | MergeArc1, | ||
| int & | GeomIndexArc1, | ||
| int & | GeomIndexArc2, | ||
| bool & | MergeArc2, | ||
| int & | GeomIndexArc3, | ||
| int & | GeomIndexArc4 ) |
Merge two BasicElts. The End of the BasicElt Elt1 of IndexElt1 becomes The End of the BasicElt Elt2 of IndexElt2. Elt2 is replaced in the arcs by Elt1, Elt2 is eliminated.
<MergeArc1> is True if the fusion of the BasicElts => a fusion of two Arcs which separated the same elements. In this case <GeomIndexArc1> and <GeomIndexArc2> are the Geometric Index of this arcs.
If the BasicElt corresponds to a close line, the StartArc and the EndArc of Elt1 can separate the same elements. In this case there is a fusion of this arcs, <MergeArc2> is true and <GeomIndexArc3> and <GeomIndexArc4> are the Geometric Index of this arcs.
| occ::handle< MAT_Node > MAT_Graph::Node | ( | const int | Index | ) | const |
Return the Node of index <Index> in <theNodes>.
| int MAT_Graph::NumberOfArcs | ( | ) | const |
Return the number of arcs of <me>.
| int MAT_Graph::NumberOfBasicElts | ( | ) | const |
Return the number of basic elements of <me>.
| int MAT_Graph::NumberOfInfiniteNodes | ( | ) | const |
Return the number of infinites nodes of <me>.
| int MAT_Graph::NumberOfNodes | ( | ) | const |
Return the number of nodes of <me>.
| void MAT_Graph::Perform | ( | const bool | SemiInfinite, |
| const occ::handle< MAT_ListOfBisector > & | TheRoots, | ||
| const int | NbBasicElts, | ||
| const int | NbArcs ) |
Construct <me> from the result of the method <CreateMat> of the class <MAT> from <MAT>.
<SemiInfinite> : if some bisector are infinites. <TheRoots> : Set of the bisectors. <NbBasicElts> : Number of Basic Elements. <NbArcs> : Number of Arcs = Number of Bisectors.
1.10.0