|
| | HLRBRep_Data (const int NV, const int NE, const int NF) |
| | Create an empty data structure of <NV> vertices, <NE> edges and <NF> faces.
|
| |
| void | Write (const occ::handle< HLRBRep_Data > &DS, const int dv, const int de, const int df) |
| | Write <DS> in me with a translation of <dv>,<de>,<df>.
|
| |
| NCollection_Array1< HLRBRep_EdgeData > & | EDataArray () |
| |
| NCollection_Array1< HLRBRep_FaceData > & | FDataArray () |
| |
| void | Tolerance (const float tol) |
| | Set the tolerance for the rejections during the exploration.
|
| |
| float | Tolerance () const |
| | returns the tolerance for the rejections during the exploration
|
| |
| void | Update (const HLRAlgo_Projector &P) |
| | end of building of the Data and updating all the information linked to the projection.
|
| |
| HLRAlgo_Projector & | Projector () |
| |
| int | NbVertices () const |
| |
| int | NbEdges () const |
| |
| int | NbFaces () const |
| |
| NCollection_IndexedMap< TopoDS_Shape, TopTools_ShapeMapHasher > & | EdgeMap () |
| |
| NCollection_IndexedMap< TopoDS_Shape, TopTools_ShapeMapHasher > & | FaceMap () |
| |
| void | InitBoundSort (const HLRAlgo_EdgesBlock::MinMaxIndices &MinMaxTot, const int e1, const int e2) |
| | to compare with only non rejected edges.
|
| |
| void | InitEdge (const int FI, NCollection_DataMap< TopoDS_Shape, BRepTopAdaptor_Tool, TopTools_ShapeMapHasher > &MST) |
| | Begin an iteration only on visible Edges crossing the face number <FI>.
|
| |
| bool | MoreEdge () |
| |
| void | NextEdge (const bool skip=true) |
| |
| int | Edge () const |
| | Returns the current Edge.
|
| |
| bool | HidingTheFace () const |
| | Returns true if the current edge to be hidden belongs to the hiding face.
|
| |
| bool | SimpleHidingFace () const |
| | Returns true if the current hiding face is not an auto-intersected one.
|
| |
| void | InitInterference () |
| | Intersect the current Edge with the boundary of the hiding face. The interferences are given by the More, Next, and Value methods.
|
| |
| bool | MoreInterference () const |
| |
| void | NextInterference () |
| |
| bool | RejectedInterference () |
| | Returns True if the interference is rejected.
|
| |
| bool | AboveInterference () |
| | Returns True if the rejected interference is above the face.
|
| |
| HLRAlgo_Interference & | Interference () |
| |
| void | LocalLEGeometry2D (const double Param, gp_Dir2d &Tg, gp_Dir2d &Nm, double &Cu) |
| | Returns the local description of the projection of the current LEdge at parameter .
|
| |
| void | LocalFEGeometry2D (const int FE, const double Param, gp_Dir2d &Tg, gp_Dir2d &Nm, double &Cu) |
| | Returns the local description of the projection of the current FEdge at parameter .
|
| |
| void | EdgeState (const double p1, const double p2, TopAbs_State &stbef, TopAbs_State &staf) |
| | Returns the local 3D state of the intersection between the current edge and the current face at the <p1> and <p2> parameters.
|
| |
| bool | EdgeOfTheHidingFace (const int E, const HLRBRep_EdgeData &ED) const |
| | Returns the true if the Edge <ED> belongs to the Hiding Face.
|
| |
| int | HidingStartLevel (const int E, const HLRBRep_EdgeData &ED, const NCollection_List< HLRAlgo_Interference > &IL) |
| | Returns the number of levels of hiding face above the first point of the edge <ED>. The InterferenceList is given to compute far away of the Interferences and then come back.
|
| |
| TopAbs_State | Compare (const int E, const HLRBRep_EdgeData &ED) |
| | Returns the state of the Edge <ED> after classification.
|
| |
| TopAbs_State | SimplClassify (const int E, const HLRBRep_EdgeData &ED, const int Nbp, const double p1, const double p2) |
| | Simple classification of part of edge [p1, p2]. Returns OUT if at least 1 of Nbp points of edge is out; otherwise returns IN. It is used to check "suspicion" hidden part of edge.
|
| |
| TopAbs_State | Classify (const int E, const HLRBRep_EdgeData &ED, const bool LevelFlag, int &Level, const double param) |
| | Classification of an edge.
|
| |
| bool | IsBadFace () const |
| | Returns true if the current face is bad.
|
| |
| void | Destroy () |
| |
| | ~HLRBRep_Data () override |
| |
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.
|
| |