Bit_Vector() | Bit_Vector | |
Bit_Vector(unsigned n_bit, MemoryPool &mem, bool initial_state=false) | Bit_Vector | |
Bit_Vector(MemoryPool &mem, Bit_Vector *src) | Bit_Vector | |
Bit_Vector(unsigned n_bit, BV_word_type *_bv_mem, bool reset) | Bit_Vector | |
bits_set() | Bit_Vector | |
bits_set_without_regs() | Bit_Vector | |
clear(unsigned bit) | Bit_Vector | |
clear_all() | Bit_Vector | |
copy_from(Bit_Vector *src) | Bit_Vector | |
equals(Bit_Vector *src) | Bit_Vector | |
fill_in_index_array(unsigned *array) | Bit_Vector | |
fill_in_index_array_inverted(unsigned *array) | Bit_Vector | |
fill_in_index_array_no_regs(unsigned *array) | Bit_Vector | |
first_word() | Bit_Vector | |
get_words(unsigned i) const | Bit_Vector | |
init(unsigned n_bit, MemoryPool &mem) | Bit_Vector | |
init_vector_memory(BV_word_type *_bv_mem) | Bit_Vector | |
intersect_from(Bit_Vector *src) | Bit_Vector | |
intersect_two(Bit_Vector *bv1, Bit_Vector *bv2) | Bit_Vector | |
is_clear(unsigned bit) | Bit_Vector | |
is_empty() | Bit_Vector | |
is_intersection_nonempty(Bit_Vector *bv) | Bit_Vector | |
is_set(unsigned bit) | Bit_Vector | |
is_subset_of(Bit_Vector *bv) | Bit_Vector | |
mem_size(unsigned n_bit) | Bit_Vector | [static] |
numbits() const | Bit_Vector | |
numwords() const | Bit_Vector | |
operator delete(void *UNREF p, MemoryPool &UNREF men) | Bit_Vector | |
operator new(size_t sz, MemoryPool &mem) | Bit_Vector | |
print(ostream &cout, char *name=NULL) | Bit_Vector | |
print_in_range(ostream &cout, char *name=NULL) | Bit_Vector | |
reset(unsigned bit) | Bit_Vector | |
reset_all() | Bit_Vector | |
set(unsigned bit) | Bit_Vector | |
set_all() | Bit_Vector | |
subtract(Bit_Vector *src) | Bit_Vector | |
union_from(Bit_Vector *src) | Bit_Vector | |
union_two(Bit_Vector *bv1, Bit_Vector *bv2) | Bit_Vector | |