rangeset_t Class Reference

Proxy of C++ rangeset_t class.

Inheritance diagram for rangeset_t:

Public Member Functions
	__init__ (self, *args)
	init(self) -> rangeset_t init(self, range) -> rangeset_t
"void"	swap (self, *args)
	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, *args)
	includes(self, range) -> bool Is every ea in 'range' contained in the rangeset?
"range_t const &"	getrange (self, *args)
	getrange(self, idx) -> range_t Get the range_t at index 'idx'.
"range_t const &"	lastrange (self, *args)
	lastrange(self) -> range_t Get the last range_t in the set.
"size_t"	nranges (self, *args)
	nranges(self) -> size_t Get the number of range_t elements in the set.
"bool"	empty (self, *args)
	empty(self) -> bool Does the set have zero elements.
"void"	clear (self, *args)
	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, *args)
	intersect(self, aset) -> bool Set the rangeset to its intersection with 'aset'.
"bool"	is_subset_of (self, *args)
	is_subset_of(self, aset) -> bool Is every element in the rangeset contained in an element of 'aset'?
"bool"	is_equal (self, *args)
	is_equal(self, aset) -> bool Do this rangeset and 'aset' have identical elements?
"bool"	__eq__ (self, *args)
	eq(self, aset) -> bool
"bool"	__ne__ (self, *args)
	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, *args)
	find_range(self, ea) -> range_t Get the element from the set that contains 'ea'.
"range_t const *"	cached_range (self, *args)
	cached_range(self) -> range_t When searching the rangeset, we keep a cached element to help speed up searches.
"ea_t"	next_addr (self, *args)
	next_addr(self, ea) -> ea_t Get the smallest ea_t value greater than 'ea' contained in the rangeset.
"ea_t"	prev_addr (self, *args)
	prev_addr(self, ea) -> ea_t Get the largest ea_t value less than 'ea' contained in the rangeset.
"ea_t"	next_range (self, *args)
	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, *args)
	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)

Protected Member Functions
"size_t"	_print (self, *args)
	_print(self) -> size_t

Properties
	thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")

Constructor & Destructor Documentation

__init__()

__init__	(		self,
		*	args )

Parameters

range

range_t const &

init(self, ivs) -> rangeset_t

Parameters

ivs	rangeset_t const &

Member Function Documentation

__eq__()

"bool" __eq__	(		self,
		*	args )

Parameters

aset	rangeset_t const &

__getitem__()

__getitem__	(		self,
			idx )

__ne__()

"bool" __ne__	(		self,
		*	args )

Parameters

aset	rangeset_t const &

_print()

"size_t" _print ( self, * args )

protected

add()

"bool" add	(		self,
		*	args )

Parameters

range

range_t const &

Returns

: false if no elements were added (the set was unchanged) add(self, start, _end) -> bool

Parameters

start	ea_t
_end	ea_t

add(self, aset) -> bool

Parameters

aset	rangeset_t const &

begin()

"rangeset_t.iterator" begin	(		self,
		*	args )

cached_range()

"range_t const *" cached_range	(		self,
		*	args )

Returns

: a pointer to the cached element

clear()

"void" clear	(		self,
		*	args )

See qvector::clear()

contains()

"bool" contains	(		self,
		*	args )

See range_t::contains(range_t)

Parameters

ea

ea_t

contains(self, aset) -> bool

Parameters

aset	rangeset_t const &

empty()

"bool" empty	(		self,
		*	args )

end()

"rangeset_t.iterator" end	(		self,
		*	args )

(This is NOT the last element)

find_range()

"range_t const *" find_range	(		self,
		*	args )

Parameters

ea	(C++: ea_t)

Returns

: nullptr if there is no such element

getrange()

"range_t const &" getrange	(		self,
		*	args )

Parameters

idx	(C++: int)

has_common()

"bool" has_common	(		self,
		*	args )

See range_t.overlaps()

Parameters

range

range_t const &

has_common(self, aset) -> bool

Parameters

aset	rangeset_t const &

includes()

"bool" includes	(		self,
		*	args )

Parameters

range

(C++: const range_t &) range_t const &

intersect()

"bool" intersect	(		self,
		*	args )

Parameters

aset	(C++: const rangeset_t &) rangeset_t const &

Returns

: false if the set was unchanged

is_equal()

"bool" is_equal	(		self,
		*	args )

Parameters

aset	(C++: const rangeset_t &) rangeset_t const &

is_subset_of()

"bool" is_subset_of	(		self,
		*	args )

Parameters

aset	(C++: const rangeset_t &) rangeset_t const &

lastrange()

"range_t const &" lastrange	(		self,
		*	args )

next_addr()

"ea_t" next_addr	(		self,
		*	args )

Parameters

ea	(C++: ea_t)

next_range()

"ea_t" next_range	(		self,
		*	args )

Parameters

ea	(C++: ea_t)

nranges()

"size_t" nranges	(		self,
		*	args )

prev_addr()

"ea_t" prev_addr	(		self,
		*	args )

Parameters

ea	(C++: ea_t)

prev_range()

"ea_t" prev_range	(		self,
		*	args )

Parameters

ea	(C++: ea_t)

sub()

"bool" sub	(		self,
		*	args )

Parameters

range

range_t const &

Returns

: false if nothing was subtracted (the set was unchanged) sub(self, ea) -> bool

Parameters

ea

ea_t

sub(self, aset) -> bool

Parameters

aset	rangeset_t const &

swap()

"void" swap	(		self,
		*	args )

See qvector::swap()

Parameters

r	(C++: rangeset_t &)

Property Documentation

thisown

thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")

static

---

The documentation for this class was generated from the following file:

• ida_range.py