#include <hexrays.hpp>
|
| | node_bitset_t () |
| | node_bitset_t (int node) |
| | bitset_t () |
| hexapi | bitset_t (const bitset_t &m) |
| | ~bitset_t () |
| void | swap (bitset_t &r) |
| bitset_t & | operator= (const bitset_t &m) |
| bitset_t &hexapi | copy (const bitset_t &m) |
| bool hexapi | add (int bit) |
| bool hexapi | add (int bit, int width) |
| bool hexapi | add (const bitset_t &ml) |
| bool hexapi | sub (int bit) |
| bool hexapi | sub (int bit, int width) |
| bool hexapi | sub (const bitset_t &ml) |
| bool hexapi | cut_at (int maxbit) |
| void hexapi | shift_down (int shift) |
| bool hexapi | has (int bit) const |
| bool hexapi | has_all (int bit, int width) const |
| bool hexapi | has_any (int bit, int width) const |
| void | print (qstring *vout, int(*get_bit_name)(qstring *out, int bit, int width, void *ud)=nullptr, void *ud=nullptr) const |
| const char *hexapi | dstr () const |
| bool hexapi | empty () const |
| int hexapi | count () const |
| int hexapi | count (int bit) const |
| int hexapi | last () const |
| void | clear () |
| void hexapi | fill_with_ones (int maxbit) |
| bool hexapi | fill_gaps (int total_nbits) |
| bool hexapi | has_common (const bitset_t &ml) const |
| bool hexapi | intersect (const bitset_t &ml) |
| bool hexapi | is_subset_of (const bitset_t &ml) const |
| bool | includes (const bitset_t &ml) const |
| void | extract (intvec_t &out) const |
| | DECLARE_COMPARISONS (bitset_t) |
| | HEXRAYS_MEMORY_ALLOCATION_FUNCS () class iterator |
| iterator | itat (int n) const |
| iterator | begin () const |
| iterator | end () const |
| int | front () const |
| int | back () const |
| void | inc (iterator &p, int n=1) const |
◆ node_bitset_t() [1/2]
| node_bitset_t::node_bitset_t |
( |
| ) |
|
|
inline |
◆ node_bitset_t() [2/2]
| node_bitset_t::node_bitset_t |
( |
int | node | ) |
|
|
inline |
The documentation for this class was generated from the following file:
