TCollection_BasicMapIterator.hxx File Reference

#include <Standard.hxx>
#include <Standard_Macro.hxx>
#include <Standard_Integer.hxx>
#include <Standard_Address.hxx>
#include <Standard_Boolean.hxx>
#include <TCollection_BasicMapIterator.lxx>

Data Structures
class	TCollection_BasicMapIterator
	This class provides basic services for the iterators on Maps. The iterators are inherited from this one. The iterator contains an array of pointers (buckets). Each bucket is a pointer on a node. A node contains a pointer on the next node. This class provides also basic services for the implementation of Maps. A map iterator provides a step by step exploration of all entries of a map. After initialization of a concrete derived iterator, use in a loop: the function More to know if there is a current entry for the iterator in the map, then the functions which read data on an entry of the map (these functions are provided by each type of map), then the function Next to set the iterator to the next entry of the map. Warning A map is a non-ordered data structure. The order in which entries of a map are explored by the iterator depends on its contents, and change when the map is edited. It is not recommended to modify the contents of a map during iteration: the result is unpredictable. More...