|
| __init__ (self, ida_idaapi.ea_t ea1=0, ida_idaapi.ea_t ea2=0) |
|
bool | __eq__ (self, 'range_t' r) |
|
bool | __ne__ (self, 'range_t' r) |
|
bool | __lt__ (self, 'range_t' r) |
|
bool | __gt__ (self, 'range_t' r) |
|
bool | __le__ (self, 'range_t' r) |
|
bool | __ge__ (self, 'range_t' r) |
|
int | compare (self, 'range_t' r) |
|
bool | contains (self, *args) |
|
bool | overlaps (self, 'range_t' r) |
|
None | clear (self) |
|
bool | empty (self) |
|
'asize_t' | size (self) |
|
None | intersect (self, 'range_t' r) |
|
None | extend (self, ida_idaapi.ea_t ea) |
|
◆ __init__()
◆ __eq__()
◆ __ge__()
◆ __gt__()
◆ __le__()
◆ __lt__()
◆ __ne__()
◆ _print()
'size_t' _print |
( |
| self, |
|
|
* | args ) |
|
protected |
◆ clear()
Set start_ea, end_ea to 0.
◆ compare()
◆ contains()
bool contains |
( |
| self, |
|
|
* | args ) |
This function has the following signatures:
0. contains(ea: ida_idaapi.ea_t) -> bool
1. contains(r: const range_t &) -> bool
# 0: contains(ea: ida_idaapi.ea_t) -> bool
Compare two range_t instances, based on the start_ea.
Is 'ea' in the address range?
# 1: contains(r: const range_t &) -> bool
Is every ea in 'r' also in this range_t?
◆ empty()
Is the size of the range_t <= 0?
◆ extend()
Ensure that the range_t includes 'ea'.
◆ intersect()
None intersect |
( |
| self, |
|
|
'range_t' | r ) |
Assign the range_t to the intersection between the range_t and 'r'.
◆ overlaps()
bool overlaps |
( |
| self, |
|
|
'range_t' | r ) |
Is there an ea in 'r' that is also in this range_t?
◆ size()
◆ end_ea
Initial value:= property(_ida_range.range_t_end_ea_get, _ida_range.
range_t_end_ea_set)
◆ start_ea
Initial value:= property(_ida_range.range_t_start_ea_get, _ida_range
.range_t_start_ea_set)
◆ 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: