#include <bit_vector.h>
Public Member Functions | |
void | set_all () |
void | reset_all () |
Bit_Vector () | |
Bit_Vector (unsigned n_bit, MemoryPool &mem, bool initial_state=false) | |
Bit_Vector (MemoryPool &mem, Bit_Vector *src) | |
Bit_Vector (unsigned n_bit, BV_word_type *_bv_mem, bool reset) | |
void * | operator new (size_t sz, MemoryPool &mem) |
void | operator delete (void *UNREF p, MemoryPool &UNREF men) |
unsigned | numbits () const |
unsigned | numwords () const |
void | init (unsigned n_bit, MemoryPool &mem) |
void | init_vector_memory (BV_word_type *_bv_mem) |
void | set (unsigned bit) |
void | reset (unsigned bit) |
void | clear (unsigned bit) |
bool | is_set (unsigned bit) |
bool | is_clear (unsigned bit) |
void | clear_all () |
void | copy_from (Bit_Vector *src) |
void | union_from (Bit_Vector *src) |
void | intersect_from (Bit_Vector *src) |
void | subtract (Bit_Vector *src) |
bool | is_empty () |
bool | equals (Bit_Vector *src) |
bool | is_subset_of (Bit_Vector *bv) |
bool | is_intersection_nonempty (Bit_Vector *bv) |
void | union_two (Bit_Vector *bv1, Bit_Vector *bv2) |
void | intersect_two (Bit_Vector *bv1, Bit_Vector *bv2) |
BV_word_type | first_word () |
unsigned | bits_set () |
unsigned | bits_set_without_regs () |
void | fill_in_index_array (unsigned *array) |
void | fill_in_index_array_no_regs (unsigned *array) |
void | fill_in_index_array_inverted (unsigned *array) |
void | print (ostream &cout, char *name=NULL) |
void | print_in_range (ostream &cout, char *name=NULL) |
BV_word_type | get_words (unsigned i) const |
Static Public Member Functions | |
static unsigned | mem_size (unsigned n_bit) |
Bit_Vector.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 | |||
) |
void Bit_Vector.set_all | ( | ) |
void Bit_Vector.reset_all | ( | ) |
void* Bit_Vector.operator new | ( | size_t | sz, | |
MemoryPool & | mem | |||
) |
void Bit_Vector.operator delete | ( | void *UNREF | p, | |
MemoryPool &UNREF | men | |||
) |
unsigned Bit_Vector.numbits | ( | ) | const |
unsigned Bit_Vector.numwords | ( | ) | const |
static unsigned Bit_Vector.mem_size | ( | unsigned | n_bit | ) | [static] |
void Bit_Vector.init | ( | unsigned | n_bit, | |
MemoryPool & | mem | |||
) |
void Bit_Vector.init_vector_memory | ( | BV_word_type * | _bv_mem | ) |
void Bit_Vector.set | ( | unsigned | bit | ) |
void Bit_Vector.reset | ( | unsigned | bit | ) |
void Bit_Vector.clear | ( | unsigned | bit | ) |
bool Bit_Vector.is_set | ( | unsigned | bit | ) |
bool Bit_Vector.is_clear | ( | unsigned | bit | ) |
void Bit_Vector.clear_all | ( | ) |
void Bit_Vector.copy_from | ( | Bit_Vector * | src | ) |
void Bit_Vector.union_from | ( | Bit_Vector * | src | ) |
void Bit_Vector.intersect_from | ( | Bit_Vector * | src | ) |
void Bit_Vector.subtract | ( | Bit_Vector * | src | ) |
bool Bit_Vector.is_empty | ( | ) |
bool Bit_Vector.equals | ( | Bit_Vector * | src | ) |
bool Bit_Vector.is_subset_of | ( | Bit_Vector * | bv | ) |
bool Bit_Vector.is_intersection_nonempty | ( | Bit_Vector * | bv | ) |
void Bit_Vector.union_two | ( | Bit_Vector * | bv1, | |
Bit_Vector * | bv2 | |||
) |
void Bit_Vector.intersect_two | ( | Bit_Vector * | bv1, | |
Bit_Vector * | bv2 | |||
) |
BV_word_type Bit_Vector.first_word | ( | ) |
unsigned Bit_Vector.bits_set | ( | ) |
unsigned Bit_Vector.bits_set_without_regs | ( | ) |
void Bit_Vector.fill_in_index_array | ( | unsigned * | array | ) |
void Bit_Vector.fill_in_index_array_no_regs | ( | unsigned * | array | ) |
void Bit_Vector.fill_in_index_array_inverted | ( | unsigned * | array | ) |
void Bit_Vector.print | ( | ostream & | cout, | |
char * | name = NULL | |||
) |
void Bit_Vector.print_in_range | ( | ostream & | cout, | |
char * | name = NULL | |||
) |
BV_word_type Bit_Vector.get_words | ( | unsigned | i | ) | const |
Genereated on Tue Mar 11 19:26:00 2008 by Doxygen.
(c) Copyright 2005, 2008 The Apache Software Foundation or its licensors, as applicable.