Tools.h++ Class Reference

// using the comparison function 'compFun':
RWGSortedVector(int) avec(compFun);
// Do some insertions:
avec.insert(3); // 3
avec.insert(17); // 3 17
avec.insert(5); // 3 5 17
cout << avec(1); // Prints '5'
cout << avec.index(17); // Prints '2'
}
Public Constructors
RWGSortedVector(val)( int (*f)(const val*, const val*) );
Construct a sorted vector of elements of val val, using the comparison function pointed to
by f. The initial capacity of the vector will be set by the value RWDEFAULT_CAPACITY.
The capacity will automatically be increased should too many items be inserted.
RWGSortedVector(val)(int (*f)(const val*, const val*),
size_t N);
Construct a sorted vector of elements of val val, using the comparison function pointed to
by f. The initial capacity of the vector will be N. The capacity will automatically be
increased should too many items be inserted.
Public Member Functions
val
operator()(size_t i) const;
Return the ith value in the vector. The index i must be between 0 and the length of the
vector less one. No bounds checking is performed.
val
operator[](size_t i) const;
Return the ith value in the vector. The index i must be between 0 and the length of the
vector less one. Bounds checking is performed.
size_t
entries() const;
Returns the number of items currently in the collection.
size_t
index(val v);
Return the index of the item with value v. The value "RW_NPOS" is returned if the value
does not occur in the vector. A binary search, using the comparison function, is done to find