Tools.h++ Class Reference

well-defined less-than semantics (val::operator<(const val&) or equiv.)..●
To use this class you must declare and implement its base class as well as the class itself. For
example, here is how you declare and implement a sorted collection of doubles:
declare(RWGVector,double) // Declare base class
declare(RWGSortedVector,double) // Declare sorted vector
// In one and only one .cpp file you must put the following:
implement(RWGVector,double) // Implement base class
implement(RWGSortedVector,double) // Implement sorted vector
For each val of RWGSortedVector you must include one (and only one) call to the macro
implement somewhere in your code for both the RWGSortedVector itself and for its base class
RWGVector.
Insertions and retrievals are done using a binary search. Note that the constructor of an
RWGSortedVector(val) requires a pointer to a "comparison function." This function should have
protoval:
int comparisonFunction(const val* a, const val* b);
and should return an int less than, greater than, or equal to zero, depending on whether the item
pointed to by a is less than, greater than, or equal to the item pointed to by b. Candidates from the
collection will appear as a, the key as b.
Persistence
None
Example
Here's an example of a sorted vector of ints:
#include <rw/gsortvec.h>
#include <rw/rstream.h>
declare(RWGVector,int)
declare(RWGSortedVector,int)
implement(RWGVector,int)
implement(RWGSortedVector,int)
// Declare and define the "comparison function":
int compFun(const int* a, const int* b) {
return *a - *b;
}
main() {
// Declare and define an instance,