IDA SDK
Public Member Functions | List of all members
intseq_t Class Reference

Detailed Description

Ordered sequence of integer constants.

Inherits qvector< int >.

Public Member Functions

int idaapi index (int value) const
 
bool idaapi contains (int value) const
 
void idaapi add (int value)
 
bool idaapi add_unique (int value)
 
void idaapi add_unique (const intseq_t &s)
 
int idaapi get (void)
 
size_t idaapi print (char *buf, size_t bufsize) const
 
const char *idaapi dstr (void) const
 
void idaapi add_block (int nb)
 
void idaapi move_block (int from, int to)
 
void idaapi remove_block (int from, int to)
 
- Public Member Functions inherited from qvector< int >
 qvector (void)
 Constructor.
 
 qvector (const qvector< int > &x)
 Constructor - creates a new qvector identical to 'x'.
 
 ~qvector (void)
 Destructor.
 
void push_back (const int &x)
 Append a new element to the end the qvector.
 
int & push_back (void)
 Append a new empty element to the end of the qvector. More...
 
void pop_back (void)
 Remove the last element in the qvector.
 
size_t size (void) const
 Get the number of elements in the qvector.
 
bool empty (void) const
 Does the qvector have 0 elements?
 
const int & operator[] (size_t _idx) const
 Allows use of typical c-style array indexing for qvectors.
 
int & operator[] (size_t _idx)
 Allows use of typical c-style array indexing for qvectors.
 
const int & at (size_t _idx) const
 Get element at index '_idx'.
 
int & at (size_t _idx)
 Get element at index '_idx'.
 
const int & front (void) const
 Get the first element in the qvector.
 
int & front (void)
 Get the first element in the qvector.
 
const int & back (void) const
 Get the last element in the qvector.
 
int & back (void)
 Get the last element in the qvector.
 
void qclear (void)
 Destroy all elements but do not free memory.
 
void clear (void)
 Destroy all elements and free memory.
 
qvector< int > & operator= (const qvector< int > &x)
 Allow assignment of one qvector to another using '='.
 
void resize (size_t _newsize, const int &x)
 Resize to the given size. More...
 
void resize (size_t _newsize)
 Same as resize(size_t, const T &), but extra space is filled with empty elements.
 
void grow (const int &x=int())
 Add an element to the end of the qvector, which will be a new T() if x is not given.
 
size_t capacity (void) const
 Get the number of elements that this qvector can contain - not the same as the number of elements currently in the qvector (size())
 
void reserve (size_t cnt)
 Increase the capacity of the qvector. More...
 
void truncate (void)
 Shrink the capacity down to the current number of elements.
 
void swap (qvector< int > &r)
 Replace all attributes of this qvector with that of 'r', and vice versa. More...
 
int * extract (void)
 Empty the qvector and return a pointer to it's contents. More...
 
void inject (int *s, size_t len)
 Populate the qvector with dynamic memory. More...
 
bool operator== (const qvector< int > &r) const
 Allow ability to test the equality of two qvectors using '=='.
 
bool operator!= (const qvector< int > &r) const
 Allow ability to test equality of two qvectors using '!='.
 
iterator begin (void)
 Get an iterator that points to the first element in the qvector.
 
const_iterator begin (void) const
 Get a const iterator that points to the first element in the qvector.
 
iterator end (void)
 Get an iterator that points to the end of the qvector (NOT the last element)
 
const_iterator end (void) const
 Get a const iterator that points to the end of the qvector (NOT the last element)
 
iterator insert (iterator it, const int &x)
 Insert an element into the qvector at a specified position. More...
 
iterator insert (iterator it, it2 first, it2 last)
 Insert a several elements to the qvector at a specified position. More...
 
iterator erase (iterator it)
 Remove an element from the qvector. More...
 
iterator erase (iterator first, iterator last)
 Remove a subset of the qvector. More...
 
iterator find (const int &x)
 Find an element in the qvector. More...
 
const_iterator find (const int &x) const
 Find an element in the qvector. More...
 
bool has (const int &x) const
 Does the qvector contain x?
 
bool add_unique (const int &x)
 Add an element to the end of the qvector - only if it isn't already present. More...
 
bool del (const int &x)
 Find an element and remove it. More...
 

Additional Inherited Members

- Public Types inherited from qvector< int >
typedef int value_type
 the type of objects contained in this qvector
 
typedef int * iterator
 
typedef const int * const_iterator
 

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