BRepGraph_IteratorDetail Namespace Reference

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

Data Structures
struct	HasIsRemoved
	SFINAE helper: detect whether NodeType has an IsRemoved member (BaseDef types do). More...
struct	HasIsRemoved< T, std::void_t< decltype(std::declval< T >().IsRemoved)> >
struct	NodeTraits
	Compile-time traits mapping from definition type to typed NodeId, count accessor, and definition accessor. More...
struct	NodeTraits< BRepGraphInc::CoEdgeDef >
struct	NodeTraits< BRepGraphInc::CompoundDef >
struct	NodeTraits< BRepGraphInc::CompSolidDef >
struct	NodeTraits< BRepGraphInc::EdgeDef >
struct	NodeTraits< BRepGraphInc::FaceDef >
struct	NodeTraits< BRepGraphInc::OccurrenceDef >
struct	NodeTraits< BRepGraphInc::ProductDef >
struct	NodeTraits< BRepGraphInc::ShellDef >
struct	NodeTraits< BRepGraphInc::SolidDef >
struct	NodeTraits< BRepGraphInc::VertexDef >
struct	NodeTraits< BRepGraphInc::WireDef >

Detailed Description

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

See also

BRepGraph class comment "Iterator guide" for choosing between iterator types.

Provides sequential read-only access to definitions stored in BRepGraph. By default nodes with IsRemoved flag are skipped; set TheFullTraverse to true to include them (types without IsRemoved are unaffected).

Usage

for (BRepGraph_Iterator<BRepGraphInc::FaceDef> anIt(aGraph);
     anIt.More(); anIt.Next())
{
  const BRepGraphInc::FaceDef& aFace = anIt.Current();
}