decompiler
1.0.0
|
An iterator into the interval map container. More...
#include <rangemap.hh>
Public Member Functions | |
PartIterator (void) | |
Constructor. | |
PartIterator (typename std::multiset< AddrRange >::const_iterator i) | |
Construct given iterator. | |
_recordtype & | operator* (void) |
Dereference to the recordtype object. | |
PartIterator & | operator++ (void) |
Pre-increment the iterator. | |
PartIterator | operator++ (int i) |
Post-increment the iterator. | |
PartIterator & | operator-- (void) |
Pre-decrement the iterator. | |
PartIterator | operator-- (int i) |
Post-decrement the iterator. | |
PartIterator & | operator= (const PartIterator &op2) |
Assign to the iterator. | |
bool | operator== (const PartIterator &op2) const |
Test equality of iterators. | |
bool | operator!= (const PartIterator &op2) const |
Test inequality of iterators. | |
std::list< _recordtype >::iterator | getValueIter (void) const |
Get the recordtype iterator. | |
Private Attributes | |
std::multiset< AddrRange >::const_iterator | iter |
The underlying multiset iterator. | |
An iterator into the interval map container.
This is really an iterator to the underlying multiset, but dereferencing it returns the recordtype. Iteration occurs over the disjoint sub-ranges, thus the same recordtype may be visited multiple times by the iterator, depending on how much it overlaps other recordtypes. The sub-ranges are sorted in linear order, then depending on the subsorttype.