 |
IDA C++ SDK 9.2
|
|
IDA C++ SDK 9.2
|
#include <hexrays.hpp>
Additional Inherited Members | |
| Public Types inherited from qvector< node_bitset_t > | |
| typedef node_bitset_t | value_type |
| the type of objects contained in this qvector | |
| typedef node_bitset_t * | iterator |
| typedef const node_bitset_t * | const_iterator |
| Public Member Functions inherited from qvector< node_bitset_t > | |
| qvector (void) | |
| Constructor. | |
| ~qvector (void) | |
| Destructor. | |
| DEFINE_MEMORY_ALLOCATION_FUNCS () void push_back(const node_bitset_t &x) | |
| Append a new element to the end the qvector. | |
| void | push_back (node_bitset_t &&x) |
| Append a new element to the end the qvector with a move semantics. | |
| void | emplace_back (Args &&... args) |
| Construct and append a new element to the end the qvector with a forwarding semantics. | |
| 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 node_bitset_t & | operator[] (size_t _idx) const |
| Allows use of typical c-style array indexing for qvectors. | |
| const node_bitset_t & | at (size_t _idx) const |
| Get element at index '_idx'. | |
| const node_bitset_t & | front (void) const |
| Get the first element in the qvector. | |
| const node_bitset_t & | back (void) const |
| 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< node_bitset_t > & | operator= (const qvector< node_bitset_t > &x) |
| Allow assignment of one qvector to another using '='. | |
| void | resize (size_t _newsize, const node_bitset_t &x) |
| Resize to the given size. | |
| void | resize_noinit (size_t _newsize) |
| void | grow (const node_bitset_t &x=node_bitset_t()) |
| 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. | |
| void | truncate (void) |
| Shrink the capacity down to the current number of elements. | |
| void | swap (qvector< node_bitset_t > &r) noexcept |
| Replace all attributes of this qvector with that of 'r', and vice versa. | |
| node_bitset_t * | extract (void) |
| Empty the qvector and return a pointer to it's contents. | |
| void | inject (node_bitset_t *s, size_t len) |
| Populate the qvector with dynamic memory. | |
| bool | operator== (const qvector< node_bitset_t > &r) const |
| Allow ability to test the equality of two qvectors using '=='. | |
| bool | operator!= (const qvector< node_bitset_t > &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. | |
| iterator | end (void) |
| Get an iterator that points to the end of the qvector (NOT the last element) | |
| iterator | insert (iterator it, const node_bitset_t &x) |
| Insert an element into the qvector at a specified position. | |
| iterator | erase (iterator it) |
| Remove an element from the qvector. | |
| iterator | find (const node_bitset_t &x) |
| Find an element in the qvector. | |
| ssize_t | index (const node_bitset_t &x) const |
| Find index of the specified value or return -1. | |
| void | add (const node_bitset_t &x) |
| Add an element to the end of the qvector. | |
| bool | has (const node_bitset_t &x) const |
| Does the qvector contain x? | |
| bool | add_unique (const node_bitset_t &x) |
| Add an element to the end of the qvector - only if it isn't already present. | |
| bool | del (const node_bitset_t &x) |
| Find an element and remove it. | |
| const char * | dstr (void) const |