|
| rangeset_t (void) |
| Constructor.
|
|
| rangeset_t (const range_t &range) |
| Constructor - Initialize set with 'range'.
|
|
| rangeset_t (const rangeset_t &ivs) |
| Constructor - Initialize set with 'ivs'.
|
|
rangeset_t & | operator= (const rangeset_t &ivs) |
|
void | swap (rangeset_t &r) |
| Set this = 'r' and 'r' = this. See qvector::swap()
|
|
bool | add (const range_t &range) |
| Add an address range to the set. More...
|
|
bool | add (ea_t start, ea_t _end) |
| Create a new range_t from 'start' and 'end' and add it to the set.
|
|
bool | add (const rangeset_t &aset) |
| Add each element of 'aset' to the set. More...
|
|
bool | sub (const range_t &range) |
| Subtract an address range from the set. More...
|
|
bool | sub (ea_t ea) |
| Subtract an ea (an range of size 1) from the set. See sub(const range_t &)
|
|
bool | sub (const rangeset_t &aset) |
| Subtract each range in 'aset' from the set. More...
|
|
bool | has_common (const range_t &range) const |
| Is there an ea in 'range' that is also in the rangeset?
|
|
bool | includes (const range_t &range) const |
| Is every ea in 'range' contained in the rangeset?
|
|
size_t | print (char *buf, size_t bufsize) const |
| Print each range_t in the rangeset.
|
|
asize_t | count (void) const |
| Size in bytes.
|
|
const range_t & | getrange (int idx) const |
| Get the range_t at index 'idx'.
|
|
const range_t & | lastrange (void) const |
| Get the last range_t in the set.
|
|
size_t | nranges (void) const |
| Get the number of range_t elements in the set.
|
|
bool | empty (void) const |
| Does the set have zero elements.
|
|
void | clear (void) |
| Delete all elements from the set. See qvector::clear()
|
|
bool | has_common (const rangeset_t &aset) const |
| Does any element of 'aset' overlap with an element in this rangeset?. See range_t::overlaps()
|
|
bool | contains (ea_t ea) const |
| Does an element of the rangeset contain 'ea'? See range_t::contains(ea_t)
|
|
bool | contains (const rangeset_t &aset) const |
| Is every element in 'aset' contained in an element of this rangeset?. See range_t::contains(range_t)
|
|
bool | intersect (const rangeset_t &aset) |
| Set the rangeset to its intersection with 'aset'. More...
|
|
bool | is_subset_of (const rangeset_t &aset) const |
| Is every element in the rangeset contained in an element of 'aset'?
|
|
bool | is_equal (const rangeset_t &aset) const |
| Do this rangeset and 'aset' have identical elements?
|
|
bool | operator== (const rangeset_t &aset) const |
| Compare two rangesets with '=='.
|
|
bool | operator!= (const rangeset_t &aset) const |
| Compare two rangesets with '!='.
|
|
const_iterator | begin (void) const |
| Get an iterator that points to the first element in the set.
|
|
const_iterator | end (void) const |
| Get an iterator that points to the end of the set. (This is NOT the last element)
|
|
iterator | begin (void) |
| Get an iterator that points to the first element in the set. More...
|
|
iterator | end (void) |
| Get an iterator that points to the end of the set. (This is NOT the last element) More...
|
|
const_iterator | lower_bound (ea_t ea) const |
| Get the first range that contains at least one ea_t value greater than 'ea'.
|
|
const_iterator | upper_bound (ea_t ea) const |
| Get the first range such that every ea_t value in this range is strictly greater than 'ea'.
|
|
const range_t * | find_range (ea_t ea) const |
| Get the element from the set that contains 'ea'. More...
|
|
const range_t * | cached_range (void) const |
| When searching the rangeset, we keep a cached element to help speed up searches. More...
|
|
ea_t | next_addr (ea_t ea) const |
| Get the smallest ea_t value greater than 'ea' contained in the rangeset.
|
|
ea_t | prev_addr (ea_t ea) const |
| Get the largest ea_t value less than 'ea' contained in the rangeset.
|
|
ea_t | next_range (ea_t ea) const |
| Get the smallest ea_t value greater than 'ea' that is not in the same range as 'ea'.
|
|
ea_t | prev_range (ea_t ea) const |
| Get the largest ea_t value less than 'ea' that is not in the same range as 'ea'.
|
|
int | move_chunk (ea_t from, ea_t to, asize_t size) |
| Subtract the address range (from, from+size) and add the range (to, to+size)
|
|
int | check_move_args (ea_t from, ea_t to, asize_t size) |
| Check if the intended move_chunk() arguments are correct.
|
|
An ordered set of non-overlapping address ranges.