Open CASCADE Technology Reference Manual 8.0.0
Loading...
Searching...
No Matches
Public Types | Public Member Functions
BRepGraph_Iterator< NodeType, TheFullTraverse > Class Template Reference

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_Iteratorbegin ()
 Returns an STL-compatible iterator for range-based for loops.
 
NCollection_ForwardRangeSentinel end () const
 Returns a sentinel marking the end of iteration.
 

Detailed Description

template<typename NodeType, bool TheFullTraverse = false>
class BRepGraph_Iterator< NodeType, TheFullTraverse >

Type-safe, allocation-free iterator over BRepGraph definition nodes.

Template Parameters
NodeTypeDefinition struct type (e.g. BRepGraphInc::FaceDef).
TheFullTraverseWhen true, removed nodes are NOT skipped (for special cases).

Member Typedef Documentation

◆ Traits

template<typename NodeType , bool TheFullTraverse = false>
using BRepGraph_Iterator< NodeType, TheFullTraverse >::Traits = BRepGraph_IteratorDetail::NodeTraits<NodeType>

◆ TypedId

template<typename NodeType , bool TheFullTraverse = false>
using BRepGraph_Iterator< NodeType, TheFullTraverse >::TypedId = typename Traits::TypedId

Constructor & Destructor Documentation

◆ BRepGraph_Iterator() [1/2]

template<typename NodeType , bool TheFullTraverse = false>
BRepGraph_Iterator< NodeType, TheFullTraverse >::BRepGraph_Iterator ( const BRepGraph & theGraph)
inline

◆ BRepGraph_Iterator() [2/2]

template<typename NodeType , bool TheFullTraverse = false>
BRepGraph_Iterator< NodeType, TheFullTraverse >::BRepGraph_Iterator ( const BRepGraph & theGraph,
const TypedId theStartId )
inline

Member Function Documentation

◆ begin()

template<typename NodeType , bool TheFullTraverse = false>
NCollection_ForwardRangeIterator< BRepGraph_Iterator > BRepGraph_Iterator< NodeType, TheFullTraverse >::begin ( )
inline

Returns an STL-compatible iterator for range-based for loops.

◆ Current()

template<typename NodeType , bool TheFullTraverse = false>
const NodeType & BRepGraph_Iterator< NodeType, TheFullTraverse >::Current ( ) const
inline

◆ CurrentId()

template<typename NodeType , bool TheFullTraverse = false>
TypedId BRepGraph_Iterator< NodeType, TheFullTraverse >::CurrentId ( ) const
inline

Current definition index as a typed NodeId.

◆ end()

template<typename NodeType , bool TheFullTraverse = false>
NCollection_ForwardRangeSentinel BRepGraph_Iterator< NodeType, TheFullTraverse >::end ( ) const
inline

Returns a sentinel marking the end of iteration.

◆ More()

template<typename NodeType , bool TheFullTraverse = false>
bool BRepGraph_Iterator< NodeType, TheFullTraverse >::More ( ) const
inline

◆ Next()

template<typename NodeType , bool TheFullTraverse = false>
void BRepGraph_Iterator< NodeType, TheFullTraverse >::Next ( )
inline

The documentation for this class was generated from the following file: