Zero-allocation iterator over populated cache kinds on a node or reference. More...

#include <BRepGraph_CacheKindIterator.hxx>

Public Member Functions
bool	More () const
	True if the iterator has a current element.

void	Next ()
	Advance to the next populated cache kind.

occ::handle< BRepGraph_CacheKind >	Value () const
	Return the current cache kind descriptor.

int	KindSlot () const
	Return the current cache-kind slot index (for fast slot-based access).

int	NbKinds () const
	Number of populated cache kinds found.

NCollection_ForwardRangeIterator< BRepGraph_CacheKindIterator >	begin ()
	STL range-for support.

NCollection_ForwardRangeSentinel	end () const
	Sentinel marking end of iteration.

Detailed Description

template<typename TKeyId>
class BRepGraph_CacheKindIterator< TKeyId >

Zero-allocation iterator over populated cache kinds on a node or reference.

Template parameter TKeyId is either BRepGraph_NodeId or BRepGraph_RefId. Supports OCCT More()/Next()/Value() pattern and STL range-for via begin()/end().

Constructed by BRepGraph::CacheView::CacheKindIter(). Stores populated kind slot indices in a fixed-size stack buffer (no heap allocation).

// Range-for:
for (const occ::handle<BRepGraph_CacheKind>& aKind : aGraph.Cache().CacheKindIter(aNode))
  doSomething(aKind);
 
// Traditional:
for (auto anIt = aGraph.Cache().CacheKindIter(aNode); anIt.More(); anIt.Next())
  doSomething(anIt.Value());