#include <rw/tvsrtvec.h> RWTValSortedVector<T,C> srtvec;
If you have the Standard C++ Library, use the interface described here. Otherwise, use the restricted interface to RWTValSortedVector described in Appendix A.
This class maintains an always-sorted collection of values, implemented as a vector.
The value type must have operator== and operator< defined. This requirement is imposed by the Standard C++ Library.
Isomorphic
In this example, a sorted vector of RWDates is exercised.
//
// tvsvcdat.cpp
//
#include <rw/tvsrtvec.h>
#include <rw/rwdate.h>
#include <iostream.h>
main(){
RWTValSortedVector<RWDate, less<RWDate> > vec;
vec.insert(RWDate(10, "Aug", 1991));
vec.insert(RWDate(9, "Aug", 1991));
vec.insert(RWDate(1, "Sep", 1991));
vec.insert(RWDate(14, "May", 1990));
vec.insert(RWDate(1, "Sep", 1991)); // Add a duplicate
vec.insert(RWDate(2, "June", 1991));
for (int i=0; i<vec.entries(); i++)
cout << vec[i] << endl;
return 0;
}
Program Output:
05/14/90
06/02/91
08/09/91
08/10/91
09/01/91
09/01/91
RWTValSortedDlist<T,C> is an alternative always-sorted collection. RWTValOrderedVector<T> is an unsorted vector of values.
Class vector<T,allocator> is the C++-standard collection that serves as the underlying implementation for this class.
typedef:vector<T,allocator> container_type; typedef:container_type::const_iterator iterator; typedef:container_type::const_iterator const_iterator; typedef:container_type::size_type size_type; typedef:T value_type; typedef:const T& reference; typedef:const T& const_reference;
RWTValSortedVector<T,C>();
Constructs an empty vector.
RWTValSortedVector<T,C>(const vector<T,allocator>& vec);
Constructs a vector by copying and sorting all elements of vec.
RWTValSortedVector<T,C>(const RWTValSortedVector<T,C>& rwvec);
Copy constructor.
RWTValSortedVector<T,C>(size_type n, const T& val);
Constructs a vector with n elements, each initialized to val.
RWTValSortedVector<T,C>(size_type n);
Constructs an empty vector with a capacity of n elements.
RWTValSortedVector<T,C>(const T* first, const T* last);
Constructs a vector by copying and sorting elements from the array of Ts pointed to by first, up to, but not including, the element pointed to by last.
bool operator<(const RWTValSortedVector<T,C>& vec) const; bool operator<(const vector<T,allocator>& vec) const;
Returns true if self compares lexicographically less than vec, otherwise returns false. Assumes that type T has well-defined less-than semantics (T::operator<(const T&) or equivalent).
bool operator==(const RWTValSortedVector<T,C>& vec) const; bool operator==(const vector<T,allocator>& vec) const;
Returns true if self compares equal to vec, otherwise returns false. Two collections are equal if both have the same number of entries, and iterating through both collections produces, in turn, individual elements that compare equal to each other.
reference operator()(size_type i); const_reference operator()(size_type i) const;
Returns a reference to the ith element of self. Index i should be between 0 and one less then the number of entries, otherwise the results are undefined--no bounds checking is performed.
reference operator[](size_type i); const_reference operator[](size_type i) const;
Returns a reference to the ith element of self. Index i must be between 0 and one less then the number of entries in self, otherwise the function throws an exception of type RWBoundsErr.
void apply(void (*fn)(const_reference,void*), void* d) const;
Applies the user-defined function pointed to by fn to every item in the collection. This function must have the prototype:
void yourfun(const_reference a, void* d);
Client data may be passed through parameter d.
reference at(size_type i); const_reference at(size_type i) const;
Returns a reference to the ith element of self. Index i must be between 0 and one less then the number of entries in self, otherwise the function throws an exception of type RWBoundsErr.
iterator begin(); const_iterator begin() const;
Returns an iterator positioned at the first element of self.
void clear();
Clears the collection by removing all items from self. Each item will have its destructor called.
bool contains(const_reference a) const;
Returns true if there exists an element t in self such that the expression(t==a) is true, otherwise returns false.
bool contains(bool (*fn)(const_reference,void*), void* d) const;
Returns true if there exists an element t in self such that the expression ((*fn)(t,d)) is true, otherwise returns false. fn points to a user-defined tester function which must have prototype:
bool yourTester(const_reference a, void* d);
Client data may be passed through parameter d.
const T* data();
Returns a pointer to the first element of the vector.
iterator end(); const_iterator end() const;
Returns an iterator positioned "just past" the last element in self.
size_type entries() const;
Returns the number of items in self.
bool find(const_reference a, value_type& k) const;
If there exists an element t in self such that the expression (t == a) is true, assigns t to k and returns true. Otherwise, returns false and leaves the value of k unchanged.
bool
find(bool (*fn)(const_reference,void*), void* d,
value_type& k) const;
If there exists an element t in self such that the expression ((*fn)(t,d)) is true, assigns t to k and returns true. Otherwise, returns false and leaves the value of k unchanged. fn points to a user-defined tester function which must have prototype:
bool yourTester(const_reference a, void* d);
Client data may be passed through parameter d.
reference first(); const_reference first() const;
Returns a reference to the first element of self.
size_type index(const_reference a) const;
Returns the position of the first item t in self such that (t == a), or returns the static member npos if no such item exists.
size_type index(bool (*fn)(const_reference,void*), void* d) const;
Returns the position of the first item t in self such that((*fn)(t,d)) is true, or returns the static member npos if no such item exists. fn points to a user-defined tester function which must have prototype:
bool yourTester(const_reference a, void* d);
Client data may be passed through parameter d.
bool insert(const_reference a);
Adds the item a to self. The collection remains sorted. Returns true.
size_type insert(const vector<T,allocator>& a);
Inserts all elements of a into self. The collection remains sorted. Returns the number of items inserted.
bool isEmpty() const;
Returns true if there are no items in the collection, false otherwise.
bool isSorted() const;
Returns true if the collection is sorted relative to the supplied comparator object, false otherwise.
const_reference last() const;
Returns a reference to the last item in the collection.
size_type length() const;
Returns the maximum number of elements which can be stored in self without first resizing.
size_type merge(const RWTValSortedVector<T,C>& dl);
Inserts all elements of dl into self, preserving sorted order.
size_type occurrencesOf(const_reference a) const;
Returns the number of elements t in self such that the expression (t == a) is true.
size_type
occurrencesOf(bool (*fn)(const_reference,void*),
void* d) const;
Returns the number of elements t in self such that the expression((*fn)(t,d)) is true. fn points to a user-defined tester function which must have prototype:
bool yourTester(const_reference a, void* d);
Client data may be passed through parameter d.
bool remove(const_reference a);
Removes the first element t in self such that the expression (t == a) is true and returns true. Returns false if there is no such element.
bool remove(bool (*fn)(const_reference,void*), void* d);
Removes the first element t in self such that the expression ((*fn)(t,d)) is true and returns true. Returns false if there is no such element. fn points to a user-defined tester function which must have prototype:
bool yourTester(const_reference a, void* d);
Client data may be passed through parameter d.
size_type removeAll(const_reference a);
Removes all elements t in self such that the expression (t == a) is true. Returns the number of items removed.
size_type removeAll(bool (*fn)(const_reference,void*), void* d);
Removes all elements t in self such that the expression ((*fn)(t,d))is true. Returns the number of items removed. fn points to a user-defined tester function which must have prototype:
bool yourTester(const_reference a, void* d);
Client data may be passed through parameter d.
value_type removeAt(size_type i);
Removes and returns the item at position i in self. This position must be between zero and one less then the number of entries in the collection, otherwise the function throws an exception of type RWBoundsErr.
value_type removeFirst();
Removes and returns the first item in the collection.
value_type removeLast();
Removes and returns the last item in the collection.
void resize(size_type n);
Modify, if necessary, the capacity of the vector to be at least as large as n.
vector<T,allocator>& std(); const vector<T,allocator>& std() const;
Returns a reference to the underlying C++-standard collection that serves as the implementation for self. It is your responsibility not to violate the ordering of the elements within the collection.
const size_type npos;
This is the value returned by member functions such as index to indicate a non-position. The value is equal to ~(size_type)0.
RWvostream&
operator<<(RWvostream& strm,
const RWTValSortedVector<T,C>& coll);
RWFile&
operator<<(RWFile& strm, const RWTValSortedVector<T,C>& coll);
Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.
RWvistream& operator>>(RWvistream& strm, RWTValSortedVector<T,C>& coll); RWFile& operator>>(RWFile& strm, RWTValSortedVector<T,C>& coll);
Restores the contents of the collection coll from the input stream strm.
RWvistream& operator>>(RWvistream& strm, RWTValSortedVector<T,C>*& p); RWFile& operator>>(RWFile& strm, RWTValSortedVector<T,C>*& p);
Looks at the next object on the input stream strm and either creates a new collection off the heap and sets p to point to it, or sets p to point to a previously read instance. If a collection is created off the heap, then you are responsible for deleting it.