|
| | __init__ (self, *args) |
| |
| None | swap (self, 'rangeset_t' r) |
| |
| bool | add (self, *args) |
| |
| bool | sub (self, *args) |
| |
| bool | includes (self, 'range_t' range) |
| |
| 'range_t const &' | getrange (self, int idx) |
| |
| 'range_t const &' | lastrange (self) |
| |
| 'size_t' | nranges (self) |
| |
| bool | empty (self) |
| |
| None | clear (self) |
| |
| bool | has_common (self, *args) |
| |
| bool | contains (self, *args) |
| |
| bool | intersect (self, 'rangeset_t' aset) |
| |
| bool | is_subset_of (self, 'rangeset_t' aset) |
| |
| bool | is_equal (self, 'rangeset_t' aset) |
| |
| bool | __eq__ (self, 'rangeset_t' aset) |
| |
| bool | __ne__ (self, 'rangeset_t' aset) |
| |
| 'rangeset_t::iterator' | begin (self) |
| |
| 'rangeset_t::iterator' | end (self) |
| |
| 'range_t const *' | find_range (self, ida_idaapi.ea_t ea) |
| |
| 'range_t const *' | cached_range (self) |
| |
| ida_idaapi.ea_t | next_addr (self, ida_idaapi.ea_t ea) |
| |
| ida_idaapi.ea_t | prev_addr (self, ida_idaapi.ea_t ea) |
| |
| ida_idaapi.ea_t | next_range (self, ida_idaapi.ea_t ea) |
| |
| ida_idaapi.ea_t | prev_range (self, ida_idaapi.ea_t ea) |
| |
| | __getitem__ (self, idx) |
| |
◆ __init__()
| __init__ |
( |
| self, |
|
|
* | args ) |
◆ __eq__()
◆ __getitem__()
| __getitem__ |
( |
| self, |
|
|
| idx ) |
◆ __ne__()
◆ _print()
| 'size_t' _print |
( |
| self, |
|
|
* | args ) |
|
protected |
◆ add()
| bool add |
( |
| self, |
|
|
* | args ) |
This function has the following signatures:
0. add(range: const range_t &) -> bool
1. add(start: ida_idaapi.ea_t, _end: ida_idaapi.ea_t) -> bool
2. add(aset: const rangeset_t &) -> bool
# 0: add(range: const range_t &) -> bool
Add an address range to the set. If 'range' intersects an existing element e, then e is extended to include 'range', and any superfluous elements (subsets of e) are removed.
@returns false if 'range' was not added (the set was unchanged)
# 1: add(start: ida_idaapi.ea_t, _end: ida_idaapi.ea_t) -> bool
Create a new range_t from 'start' and 'end' and add it to the set.
# 2: add(aset: const rangeset_t &) -> bool
Add each element of 'aset' to the set.
@returns false if no elements were added (the set was unchanged)
◆ begin()
| 'rangeset_t.iterator' begin |
( |
| self | ) |
|
Get an iterator that points to the first element in the set.
◆ cached_range()
| 'range_t const *' cached_range |
( |
| self | ) |
|
When searching the rangeset, we keep a cached element to help speed up searches.
@returns a pointer to the cached element
◆ clear()
Delete all elements from the set. See qvector::clear()
◆ contains()
| bool contains |
( |
| self, |
|
|
* | args ) |
This function has the following signatures:
0. contains(ea: ida_idaapi.ea_t) -> bool
1. contains(aset: const rangeset_t &) -> bool
# 0: contains(ea: ida_idaapi.ea_t) -> bool
Does an element of the rangeset contain 'ea'? See range_t::contains(ea_t)
# 1: contains(aset: const rangeset_t &) -> bool
Is every element in 'aset' contained in an element of this rangeset?. See range_t::contains(range_t)
◆ empty()
Does the set have zero elements.
◆ end()
| 'rangeset_t.iterator' end |
( |
| self | ) |
|
Get an iterator that points to the end of the set. (This is NOT the last element)
◆ find_range()
Get the element from the set that contains 'ea'.
@returns nullptr if there is no such element
◆ getrange()
| 'range_t const &' getrange |
( |
| self, |
|
|
int | idx ) |
Get the range_t at index 'idx'.
◆ has_common()
| bool has_common |
( |
| self, |
|
|
* | args ) |
This function has the following signatures:
0. has_common(range: const range_t &) -> bool
1. has_common(aset: const rangeset_t &) -> bool
# 0: has_common(range: const range_t &) -> bool
Is there an ea in 'range' that is also in the rangeset?
# 1: has_common(aset: const rangeset_t &) -> bool
Does any element of 'aset' overlap with an element in this rangeset?. See range_t::overlaps()
◆ includes()
| bool includes |
( |
| self, |
|
|
'range_t' | range ) |
Is every ea in 'range' contained in the rangeset?
◆ intersect()
Set the rangeset to its intersection with 'aset'.
@returns false if the set was unchanged
◆ is_equal()
Do this rangeset and 'aset' have identical elements?
◆ is_subset_of()
Is every element in the rangeset contained in an element of 'aset'?
◆ lastrange()
| 'range_t const &' lastrange |
( |
| self | ) |
|
Get the last range_t in the set.
◆ next_addr()
Get the smallest ea_t value greater than 'ea' contained in the rangeset.
◆ next_range()
Get the smallest ea_t value greater than 'ea' that is not in the same range as 'ea'.
◆ nranges()
Get the number of range_t elements in the set.
◆ prev_addr()
Get the largest ea_t value less than 'ea' contained in the rangeset.
◆ prev_range()
Get the largest ea_t value less than 'ea' that is not in the same range as 'ea'.
◆ sub()
| bool sub |
( |
| self, |
|
|
* | args ) |
This function has the following signatures:
0. sub(range: const range_t &) -> bool
1. sub(ea: ida_idaapi.ea_t) -> bool
2. sub(aset: const rangeset_t &) -> bool
# 0: sub(range: const range_t &) -> bool
Subtract an address range from the set. All subsets of 'range' will be removed, and all elements that intersect 'range' will be truncated/split so they do not include 'range'.
@returns false if 'range' was not subtracted (the set was unchanged)
# 1: sub(ea: ida_idaapi.ea_t) -> bool
Subtract an ea (an range of size 1) from the set. See sub(const range_t &)
# 2: sub(aset: const rangeset_t &) -> bool
Subtract each range in 'aset' from the set
@returns false if nothing was subtracted (the set was unchanged)
◆ swap()
Set this = 'r' and 'r' = this. See qvector::swap()
◆ thisown
Initial value:= property(lambda x: x.this.own(), lambda x, v: x.this.own(v),
doc='The membership flag')
The documentation for this class was generated from the following file:
1.12.0