|
| | __init__ (self, *args) |
| | init(self) -> rangeset_t init(self, range) -> rangeset_t
|
| |
| "void" | swap (self, "rangeset_t" r) |
| | swap(self, r) Set this = 'r' and 'r' = this.
|
| |
| "bool" | add (self, *args) |
| | add(self, range) -> bool Add each element of 'aset' to the set.
|
| |
| "bool" | sub (self, *args) |
| | sub(self, range) -> bool Subtract each range in 'aset' from the set
|
| |
| "bool" | includes (self, "range_t" range) |
| | includes(self, range) -> bool Is every ea in 'range' contained in the rangeset?
|
| |
| "range_t const &" | getrange (self, "int" idx) |
| | getrange(self, idx) -> range_t Get the range_t at index 'idx'.
|
| |
| "range_t const &" | lastrange (self) |
| | lastrange(self) -> range_t Get the last range_t in the set.
|
| |
| "size_t" | nranges (self) |
| | nranges(self) -> size_t Get the number of range_t elements in the set.
|
| |
| "bool" | empty (self) |
| | empty(self) -> bool Does the set have zero elements.
|
| |
| "void" | clear (self) |
| | clear(self) Delete all elements from the set.
|
| |
| "bool" | has_common (self, *args) |
| | has_common(self, range) -> bool Does any element of 'aset' overlap with an element in this rangeset?.
|
| |
| "bool" | contains (self, *args) |
| | contains(self, ea) -> bool Is every element in 'aset' contained in an element of this rangeset?.
|
| |
| "bool" | intersect (self, "rangeset_t" aset) |
| | intersect(self, aset) -> bool Set the rangeset to its intersection with 'aset'.
|
| |
| "bool" | is_subset_of (self, "rangeset_t" aset) |
| | is_subset_of(self, aset) -> bool Is every element in the rangeset contained in an element of 'aset'?
|
| |
| "bool" | is_equal (self, "rangeset_t" aset) |
| | is_equal(self, aset) -> bool Do this rangeset and 'aset' have identical elements?
|
| |
| "bool" | __eq__ (self, "rangeset_t" aset) |
| | eq(self, aset) -> bool
|
| |
| "bool" | __ne__ (self, "rangeset_t" aset) |
| | ne(self, aset) -> bool
|
| |
| "rangeset_t::iterator" | begin (self, *args) |
| | begin(self) -> range_t Get an iterator that points to the first element in the set.
|
| |
| "rangeset_t::iterator" | end (self, *args) |
| | end(self) -> range_t Get an iterator that points to the end of the set.
|
| |
| "range_t const *" | find_range (self, "ea_t" ea) |
| | find_range(self, ea) -> range_t Get the element from the set that contains 'ea'.
|
| |
| "range_t const *" | cached_range (self) |
| | cached_range(self) -> range_t When searching the rangeset, we keep a cached element to help speed up searches.
|
| |
| "ea_t" | next_addr (self, "ea_t" ea) |
| | next_addr(self, ea) -> ea_t Get the smallest ea_t value greater than 'ea' contained in the rangeset.
|
| |
| "ea_t" | prev_addr (self, "ea_t" ea) |
| | prev_addr(self, ea) -> ea_t Get the largest ea_t value less than 'ea' contained in the rangeset.
|
| |
| "ea_t" | next_range (self, "ea_t" ea) |
| | next_range(self, ea) -> ea_t Get the smallest ea_t value greater than 'ea' that is not in the same range as 'ea'.
|
| |
| "ea_t" | prev_range (self, "ea_t" ea) |
| | prev_range(self, ea) -> ea_t Get the largest ea_t value less than 'ea' that is not in the same range as 'ea'.
|
| |
| | __getitem__ (self, idx) |
| |