bitset_t Class Reference

Inheritance diagram for bitset_t:

Public Member Functions
	__init__ (self, *args)
None	swap (self, 'bitset_t' r)
'bitset_t &'	copy (self, 'bitset_t' m)
bool	add (self, *args)
bool	sub (self, *args)
bool	cut_at (self, int maxbit)
None	shift_down (self, int shift)
bool	has (self, int bit)
bool	has_all (self, int bit, int width)
bool	has_any (self, int bit, int width)
str	dstr (self)
bool	empty (self)
int	count (self, *args)
int	last (self)
None	clear (self)
None	fill_with_ones (self, int maxbit)
bool	has_common (self, 'bitset_t' ml)
bool	intersect (self, 'bitset_t' ml)
bool	is_subset_of (self, 'bitset_t' ml)
bool	includes (self, 'bitset_t' ml)
bool	__eq__ (self, 'bitset_t' r)
bool	__ne__ (self, 'bitset_t' r)
bool	__lt__ (self, 'bitset_t' r)
bool	__gt__ (self, 'bitset_t' r)
bool	__le__ (self, 'bitset_t' r)
bool	__ge__ (self, 'bitset_t' r)
int	compare (self, 'bitset_t' r)
'bitset_t::iterator'	itat (self, int n)
'bitset_t::iterator'	begin (self)
'bitset_t::iterator'	end (self)
int	front (self)
int	back (self)
None	inc (self, 'iterator' p, int n=1)
int	itv (self, 'iterator' it)
	__iter__ (self)

Properties
	thisown

Constructor & Destructor Documentation

__init__()

__init__	(		self,
		*	args )

Reimplemented in node_bitset_t, and rlist_t.

Member Function Documentation

__eq__()

bool __eq__	(		self,
		'bitset_t'	r )

__ge__()

bool __ge__	(		self,
		'bitset_t'	r )

__gt__()

bool __gt__	(		self,
		'bitset_t'	r )

__iter__()

__iter__

(

self

)

__le__()

bool __le__	(		self,
		'bitset_t'	r )

__lt__()

bool __lt__	(		self,
		'bitset_t'	r )

__ne__()

bool __ne__	(		self,
		'bitset_t'	r )

add()

bool add	(		self,
		*	args )

This function has the following signatures:

0. add(bit: int) -> bool
1. add(bit: int, width: int) -> bool
2. add(ml: const bitset_t &) -> bool

# 0: add(bit: int) -> bool


# 1: add(bit: int, width: int) -> bool


# 2: add(ml: const bitset_t &) -> bool

back()

int back

(

self

)

begin()

'bitset_t.iterator' begin

(

self

)

clear()

None clear

(

self

)

compare()

int compare	(		self,
		'bitset_t'	r )

copy()

'bitset_t &' copy	(		self,
		'bitset_t'	m )

count()

int count	(		self,
		*	args )

This function has the following signatures:

0. count() -> int
1. count(bit: int) -> int

# 0: count() -> int


# 1: count(bit: int) -> int

cut_at()

bool cut_at	(		self,
		int	maxbit )

dstr()

str dstr

(

self

)

Reimplemented in rlist_t.

empty()

bool empty

(

self

)

end()

'bitset_t.iterator' end

(

self

)

fill_with_ones()

None fill_with_ones	(		self,
		int	maxbit )

front()

int front

(

self

)

has()

bool has	(		self,
		int	bit )

has_all()

bool has_all	(		self,
		int	bit,
		int	width )

has_any()

bool has_any	(		self,
		int	bit,
		int	width )

has_common()

bool has_common	(		self,
		'bitset_t'	ml )

inc()

None inc	(		self,
		'iterator'	p,
		int	n = 1 )

includes()

bool includes	(		self,
		'bitset_t'	ml )

intersect()

bool intersect	(		self,
		'bitset_t'	ml )

is_subset_of()

bool is_subset_of	(		self,
		'bitset_t'	ml )

itat()

'bitset_t.iterator' itat	(		self,
		int	n )

itv()

int itv	(		self,
		'iterator'	it )

last()

int last

(

self

)

shift_down()

None shift_down	(		self,
		int	shift )

sub()

bool sub	(		self,
		*	args )

This function has the following signatures:

0. sub(bit: int) -> bool
1. sub(bit: int, width: int) -> bool
2. sub(ml: const bitset_t &) -> bool

# 0: sub(bit: int) -> bool


# 1: sub(bit: int, width: int) -> bool


# 2: sub(ml: const bitset_t &) -> bool

swap()

None swap	(		self,
		'bitset_t'	r )

Property Documentation

thisown

thisown

static

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:

• ida_hexrays.py