IDAPython 9.0
Loading...
Searching...
No Matches
array_of_bitsets Class Reference
Inheritance diagram for array_of_bitsets:

Public Member Functions

 __init__ (self, *args)
 
'bitset_t &' push_back (self, *args)
 
None pop_back (self)
 
'size_t' size (self)
 
bool empty (self)
 
'bitset_t const &' at (self, 'size_t' _idx)
 
None qclear (self)
 
None clear (self)
 
None resize (self, *args)
 
None grow (self, *args)
 
'size_t' capacity (self)
 
None reserve (self, 'size_t' cnt)
 
None truncate (self)
 
None swap (self, 'array_of_bitsets' r)
 
'bitset_t *' extract (self)
 
None inject (self, 'bitset_t' s, 'size_t' len)
 
bool __eq__ (self, 'array_of_bitsets' r)
 
bool __ne__ (self, 'array_of_bitsets' r)
 
'qvector< bitset_t >::const_iterator' begin (self, *args)
 
'qvector< bitset_t >::const_iterator' end (self, *args)
 
'qvector< bitset_t >::iterator' insert (self, 'bitset_t' it, 'bitset_t' x)
 
'qvector< bitset_t >::iterator' erase (self, *args)
 
'qvector< bitset_t >::const_iterator' find (self, *args)
 
bool has (self, 'bitset_t' x)
 
bool add_unique (self, 'bitset_t' x)
 
'size_t' __len__ (self)
 
'bitset_t const &' __getitem__ (self, 'size_t' i)
 
None __setitem__ (self, 'size_t' i, 'bitset_t' v)
 
None append (self, 'bitset_t' x)
 
None extend (self, 'array_of_bitsets' x)
 

Static Public Attributes

 front = ida_idaapi._qvector_front
 
 back = ida_idaapi._qvector_back
 

Protected Member Functions

bool _del (self, 'bitset_t' x)
 

Properties

 thisown
 

Constructor & Destructor Documentation

◆ __init__()

__init__ ( self,
* args )

Member Function Documentation

◆ __eq__()

bool __eq__ ( self,
'array_of_bitsets' r )

◆ __getitem__()

'bitset_t const &' __getitem__ ( self,
'size_t' i )

◆ __len__()

'size_t' __len__ ( self)

◆ __ne__()

bool __ne__ ( self,
'array_of_bitsets' r )

◆ __setitem__()

None __setitem__ ( self,
'size_t' i,
'bitset_t' v )

◆ _del()

bool _del ( self,
'bitset_t' x )
protected

◆ add_unique()

bool add_unique ( self,
'bitset_t' x )

◆ append()

None append ( self,
'bitset_t' x )

◆ at()

'bitset_t const &' at ( self,
'size_t' _idx )

◆ begin()

'qvector< bitset_t >.const_iterator' begin ( self,
* args )

◆ capacity()

'size_t' capacity ( self)

◆ clear()

None clear ( self)

◆ empty()

bool empty ( self)

◆ end()

'qvector< bitset_t >.const_iterator' end ( self,
* args )

◆ erase()

'qvector< bitset_t >.iterator' erase ( self,
* args )

◆ extend()

None extend ( self,
'array_of_bitsets' x )

◆ extract()

'bitset_t *' extract ( self)

◆ find()

'qvector< bitset_t >.const_iterator' find ( self,
* args )

◆ grow()

None grow ( self,
* args )

◆ has()

bool has ( self,
'bitset_t' x )

◆ inject()

None inject ( self,
'bitset_t' s,
'size_t' len )

◆ insert()

'qvector< bitset_t >.iterator' insert ( self,
'bitset_t' it,
'bitset_t' x )

◆ pop_back()

None pop_back ( self)

◆ push_back()

'bitset_t &' push_back ( self,
* args )

◆ qclear()

None qclear ( self)

◆ reserve()

None reserve ( self,
'size_t' cnt )

◆ resize()

None resize ( self,
* args )

◆ size()

'size_t' size ( self)

◆ swap()

None swap ( self,
'array_of_bitsets' r )

◆ truncate()

None truncate ( self)

Member Data Documentation

◆ back

back = ida_idaapi._qvector_back
static

◆ front

front = ida_idaapi._qvector_front
static

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: