Tools.h++ Class Reference

Stores a copy of the inserted item into the collection according to an ordering determined by the
less-than (<) operator.
The class T must have:
well-defined copy semantics (T::T(const T&) or equivalent);●
well-defined assignment semantics (T::operator=(const T&) or equivalent);●
well-defined equality semantics (T::operator==(const T&));●
well-defined less-than semantics (T::operator<(const T&));●
a default constructor.●
Note that a sorted vector has a length (the number of items returned by length() or entries()) and a
capacity. Necessarily, the capacity is always greater than or equal to the length. Although elements
beyond the collection's length are not used, nevertheless, in a value-based collection, they are occupied.
If each instance of class T requires considerable resources, then you should ensure that the collection's
capacity is not much greater than its length, otherwise unnecessary resources will be tied up.
Although it is possible to alter objects that are contained in aTValSortedVector<T>, it is dangerous
since the changes may affect the way that operator<() and operator==() behave, causing the
RWTValSortedVector<T> to become unsorted.
Persistence
Isomorphic
Example
This example inserts a set of dates into a sorted vector in no particular order, then prints them out in
order.
#include <rw/tvsrtvec.h>
#include <rw/rwdate.h>
#include <rw/rstream.h>
{
RWTValSortedVector<RWDate> vec;
vec.insert(RWDate(10, "Aug", 1999));
vec.insert(RWDate(9, "Aug", 1999));
vec.insert(RWDate(1, "Sept", 1999));
vec.insert(RWDate(14, "May", 1999));
vec.insert(RWDate(1, "Sept", 1999)); // Add a duplicate
vec.insert(RWDate(2, "June", 1999));
for (int i=0; i<vec.length(); i++)
cout << vec[i] << endl;
return 0;
}