|
faudes::TBaseSet< T, Cmp >::Iterator Class Reference Detailed Descriptiontemplate<class T, class Cmp = std::less<T>> class faudes::TBaseSet< T, Cmp >::Iterator Iterator class for high-level API to TBaseSet. This class is derived from STL iterators to additionally provide a reference of the container to iterate on. This feature is used to adjust iterators when the actual set gets reallocated due to a Detach() operation. Inheritance is private to ensure that all high-level api functions maintain iteretor refernces consistently. Currently, high-level api iterators support the operators -> ,*, =, ++, –, ==, !=. Technical detail: the private inheritance prohibits the direct use of stl algorithms on faudes Iterators. If you need direct access to stl algorithms from outside the faudes set class, you may turn to public inheritance. Make sure to Lock the relevant sets befor applying any stl algorithms. Definition at line 410 of file cfl_baseset.h.
Constructor & Destructor Documentation◆ Iterator() [1/3]
template<class T , class Cmp = std::less<T>>
Default constructor, container unknown Definition at line 413 of file cfl_baseset.h. ◆ Iterator() [2/3]
template<class T , class Cmp = std::less<T>>
Construct by members (used by TBaseSet to create temporary iterators) Definition at line 420 of file cfl_baseset.h. ◆ Iterator() [3/3]
template<class T , class Cmp = std::less<T>>
Copy constructor, copies container reference, incl attach Definition at line 435 of file cfl_baseset.h. ◆ ~Iterator()
template<class T , class Cmp = std::less<T>>
Destructor Definition at line 447 of file cfl_baseset.h. Member Function Documentation◆ Detach()
template<class T , class Cmp = std::less<T>>
Detach Definition at line 503 of file cfl_baseset.h. ◆ DStr()
template<class T , class Cmp = std::less<T>>
report (debugging) Definition at line 452 of file cfl_baseset.h. ◆ DValid()
template<class T , class Cmp = std::less<T>>
Check validity (provoke abort error) Definition at line 509 of file cfl_baseset.h. ◆ Invalidate()
template<class T , class Cmp = std::less<T>>
Invalidate Definition at line 497 of file cfl_baseset.h. ◆ operator!=()
template<class T , class Cmp = std::less<T>>
Reimplement != Definition at line 551 of file cfl_baseset.h. ◆ operator*()
template<class T , class Cmp = std::less<T>>
Reimplement derefernce Definition at line 529 of file cfl_baseset.h. ◆ operator++() [1/2]
template<class T , class Cmp = std::less<T>>
Reimplement postfix ++ Definition at line 562 of file cfl_baseset.h. ◆ operator++() [2/2]
template<class T , class Cmp = std::less<T>>
Reimplement prefix ++ Definition at line 575 of file cfl_baseset.h. ◆ operator--() [1/2]
template<class T , class Cmp = std::less<T>>
Reimplement postfix – Definition at line 587 of file cfl_baseset.h. ◆ operator--() [2/2]
template<class T , class Cmp = std::less<T>>
Reimplement prefix – Definition at line 600 of file cfl_baseset.h. ◆ operator->()
template<class T , class Cmp = std::less<T>>
Reimplement dereference Definition at line 518 of file cfl_baseset.h. ◆ operator=()
template<class T , class Cmp = std::less<T>>
Assigment, tracks container Definition at line 461 of file cfl_baseset.h. ◆ operator==()
template<class T , class Cmp = std::less<T>>
Reimplement == Definition at line 540 of file cfl_baseset.h. ◆ StlIterator() [1/2]
template<class T , class Cmp = std::less<T>>
Assign STL iterator only Definition at line 487 of file cfl_baseset.h. ◆ StlIterator() [2/2]
template<class T , class Cmp = std::less<T>>
Get STL iterator only Definition at line 492 of file cfl_baseset.h. Member Data Documentation◆ mAttached
template<class T , class Cmp = std::less<T>>
Indicate that this iterator is attached to some baseset Definition at line 623 of file cfl_baseset.h. ◆ pBaseSet
template<class T , class Cmp = std::less<T>>
Order by reference for containers of Iterators < Maintaine container reference Definition at line 620 of file cfl_baseset.h. The documentation for this class was generated from the following file: libFAUDES 2.33k --- 2025.09.16 --- c++ api documentaion by doxygen |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||