sincerely
Singaporean
If you have not done so, read this full tutorial on how to use SGEXTN to build an application.
(no source file, everything inside header)
template ‹typename K, typename V, typename EqualityCheck, typename HashFunction› class SGLUnorderedMap::Iterator;
part of SGEXTN module SG_Containers
iterator for SGLUnorderedMap
list of all including inherited members
preprocessor file inclusion directive: #include ‹SGLUnorderedMap.h›
CMake target for BuildLah: SGEXTN::SG_Containers
see this link for more information about BuildLah
parent class: (none)
children classes: (none)
const K& key();
bool operator!=(SGLUnorderedMap::Iterator x);
SGLUnorderedMap::Iterator operator++(int);
SGLUnorderedMap::Iterator& operator++();
SGLUnorderedMap::Iterator operator--(int);
SGLUnorderedMap::Iterator& operator--();
bool operator==(SGLUnorderedMap::Iterator x);
V& value();
SGLUnorderedMap::Iterator is a iterator for SGLUnorderedMap and points towards a key value pair in the SGLUnorderedMap. This can be used to iterate over the SGLUnorderedMap sequentially. If you do not need to modify the SGLUnorderedMap while iterating, use SGLUnorderedMap::ConstIterator instead. This is a template based class with no separate source file.
SGLUnorderedMap::Iterator stores a pointer to the memory location where SGLUnorderedMap keeps all its data.
Returns the key in the key value pair that this iterator points to.
If this iterator is SGLUnorderedMap::end, using this function will crash.
Checks if this iterator points to a different key value pair from x.
Increments the iterator to point towards the next key value pair and returns the old iterator.
SGLUnorderedMap::Iterator is circular, incrementing SGLUnorderedMap::end gives SGLUnorderedMap::begin and decrementing SGLUnorderedMap::begin gives SGLUnorderedMap::end.
Increments the iterator to point towards the next key value pair and returns the new iterator.
SGLUnorderedMap::Iterator is circular, incrementing SGLUnorderedMap::end gives SGLUnorderedMap::begin and decrementing SGLUnorderedMap::begin gives SGLUnorderedMap::end.
Decrements the iterator to point towards the previous key value pair and returns the old iterator.
SGLUnorderedMap::Iterator is circular, incrementing SGLUnorderedMap::end gives SGLUnorderedMap::begin and decrementing SGLUnorderedMap::begin gives SGLUnorderedMap::end.
Decrements the iterator to point towards the previous key value pair and returns the new iterator.
SGLUnorderedMap::Iterator is circular, incrementing SGLUnorderedMap::end gives SGLUnorderedMap::begin and decrementing SGLUnorderedMap::begin gives SGLUnorderedMap::end.
Checks if this iterator points to the same key value pair as x.
Returns a reference to the value in the key value pair that this iterator points to.
This returns a reference and not a copy. Assigning to the returned reference (using it as a lvalue) modifies the SGLUnorderedMap.
If this iterator is SGLUnorderedMap::end, using this function will crash.
©2025 05524F.sg (Singapore)