7 #include <mix/SortedAr.H>
19 DoubleAr (
unsigned quant = DEFAULT_QUANT,
20 unsigned volume = START_VOLUME);
22 double& fetch (
unsigned i);
23 double get (
unsigned i)
const;
25 void insert (
unsigned i,
double val);
27 void addh (
double val);
28 void addl (
double val);
34 DoubleAr& assign (
unsigned cnt,
double* vect);
36 double* vector ()
const;
39 double& operator[] (
unsigned i) {
return fetch(i);};
40 double operator() (
unsigned i)
const {
return get(i);};
44 virtual Compar compare (
const char* item1,
45 const char* item2)
const;
48 virtual void exchange (
unsigned i1,
unsigned i2);
51 int find_ascent (
double item)
const
52 {
return quick_find_ascent((
const char*)&item);}
53 int find_descent (
double item)
const
54 {
return quick_find_descent((
const char*)&item);}
55 int find (
double item)
const
56 {
return slow_find((
const char*)&item);}
60 Compar find_range_ascent (
double value,
61 unsigned& L,
unsigned& R)
const {
62 return SortedAr::find_range_ascent((
const char*)&value, L, R);
64 Compar find_range_descent (
double 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
Definition: DoubleAr.H:14