![]() |
Open CASCADE Technology Reference Manual 8.0.0
|
Type-safe, allocation-free iterator over BRepGraph definition nodes. More...
#include <BRepGraph_Iterator.hxx>
Public Types | |
| using | Traits = BRepGraph_IteratorDetail::NodeTraits<NodeType> |
| using | TypedId = typename Traits::TypedId |
Public Member Functions | |
| BRepGraph_Iterator (const BRepGraph &theGraph) | |
| BRepGraph_Iterator (const BRepGraph &theGraph, const TypedId theStartId) | |
| bool | More () const |
| void | Next () |
| const NodeType & | Current () const |
| TypedId | CurrentId () const |
| Current definition index as a typed NodeId. | |
| NCollection_ForwardRangeIterator< BRepGraph_Iterator > | begin () |
| Returns an STL-compatible iterator for range-based for loops. | |
| NCollection_ForwardRangeSentinel | end () const |
| Returns a sentinel marking the end of iteration. | |
Type-safe, allocation-free iterator over BRepGraph definition nodes.
| NodeType | Definition struct type (e.g. BRepGraphInc::FaceDef). |
| TheFullTraverse | When true, removed nodes are NOT skipped (for special cases). |
| using BRepGraph_Iterator< NodeType, TheFullTraverse >::Traits = BRepGraph_IteratorDetail::NodeTraits<NodeType> |
| using BRepGraph_Iterator< NodeType, TheFullTraverse >::TypedId = typename Traits::TypedId |
|
inline |
|
inline |
|
inline |
Returns an STL-compatible iterator for range-based for loops.
|
inline |
|
inline |
Current definition index as a typed NodeId.
|
inline |
Returns a sentinel marking the end of iteration.
|
inline |
|
inline |