7 #include <mix/SortedAr.H>
19 BoolAr (
unsigned quant = DEFAULT_QUANT,
20 unsigned volume = START_VOLUME);
22 bool& fetch (
unsigned i);
23 bool get (
unsigned i)
const;
25 void insert (
unsigned i,
bool val);
30 void addh (
const BoolAr& boolar);
31 void addl (
const BoolAr& boolar);
34 BoolAr& assign (
unsigned cnt,
bool* vect);
37 bool* vector ()
const;
40 bool& operator[] (
unsigned i) {
return fetch(i);};
41 bool operator() (
unsigned i)
const {
return get(i);};
45 virtual Compar compare (
const char* item1,
const char* item2)
const;
48 virtual void exchange (
unsigned i1,
unsigned i2);
51 int find_ascent (
int item)
const
52 {
return quick_find_ascent((
const char*)&item);}
53 int find_descent (
int item)
const
54 {
return quick_find_descent((
const char*)&item);}
55 int find (
int item)
const
56 {
return slow_find((
const char*)&item);}
60 Compar find_range_ascent (
int value,
61 unsigned& L,
unsigned& R)
const {
62 return SortedAr::find_range_ascent((
const char*)&value, L, R);
64 Compar find_range_descent (
int value,
65 unsigned& L,
unsigned& R)
const {
66 return SortedAr::find_range_descent((
const char*)&value, L, R);
70 virtual void print_item (
unsigned i)
const;
71 virtual void print_contents ()
const;
Definition: SortedAr.H:14