Constructs an empty map with comparator comp.

Constructs a map by copying all elements of m.

Copy constructor.

Constructs a map by copying elements from the array of value_type pairs pointed to by first, up to, but not including, the pair pointed to by last.

Destroys all elements of self and replaces them by copying all associations from m.

Returns true if self compares lexicographically less than m, otherwise returns false. Assumes that type K has well-defined less-than semantics (T::operator<(const K&) or equivalent).

Returns true if self compares equal to m, otherwise returns false. Two collections are equal if both have the same number of entries, and iterating through both collections produces, in turn, individual pairs that compare equal to each other.

Looks up key and returns a reference to its associated item. If the key is not in the dictionary, then it will be added with an associated item provided by the default constructor for type T.

Applies the user-defined function pointed to by fn to every association in the collection. This function must have one of the prototypes:

void yourfun(const K& key, T& a, void* d);

void yourfun(const K& key, const T& a,void* d);

Client data may be passed through parameter d.

This is a deprecated version of the apply member above. It behaves exactly the same as apply.

Returns an iterator positioned at the first pair in self.

Clears the collection by removing all items from self. Each key and its associated item will have its destructor called.

Returns true if there exists a key j in self that compares equal to key, otherwise returns false.

Returns true if there exists an association a in self such that the expression ((*fn)(a,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.

Returns an iterator positioned "just past" the last association in self.

Returns the number of associations in self.

If there exists a key j in self that compares equal to key, assigns j to r and returns true. Otherwise, returns false and leaves the value of r unchanged.

If there exists an association a in self such that the expression ((*fn)(a,d)) is true, assigns a to r 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.

If there exists a key j in self that compares equal to key, assigns the item associated with j to r and returns true. Otherwise, returns false and leaves the value of r unchanged.

If there exists a key j in self that compares equal to key, assigns j to kr, assigns the item associated with j to tr, and returns true. Otherwise, returns false and leaves the values of kr and tr unchanged.

Adds key with associated item a to the collection. Returns true if the insertion is successful, otherwise returns false. The function will return true unless the collection already holds an association with the equivalent key.

This is a deprecated version of the insert member above. It behaves exactly the same as insert.

Returns true if there are no items in the collection, false otherwise.

Returns the number of keys j in self that compare equal to key.

Returns the number of associations a in self such that the expression((*fn)(a,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.

Removes the first association with key j in self such that j compares equal to key and returns true. Returns false if there is no such association.

Removes the first association a in self such that the expression ((*fn)(a,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.

Removes all associations with key j in self such that j compares equal to key. Returns the number of items removed.

Removes all associations a in self such that the expression ((*fn)(a,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.

Returns a reference to the underlying C++-standard collection that serves as the implementation for self. This reference may be used freely, providing access to the C++-standard interface as well as interoperability with other software components that make use of the C++-standard collections.

Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.

Restores the contents of the collection coll from the input stream strm.

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.

Creates an iterator for the map h. The iterator begins in an undefined state and must be advanced before the first association will be accessible.

Advances self to the next element. If the iterator has advanced past the last element in the collection, false will be returned. Otherwise, true will be returned.

Advances self to the next element. If the iterator has been reset or just created self will now reference the first element. If, before iteration, self pointed to the last association in the map, self will now reference an undefined value and false will be returned. Otherwise, true is returned. Note: no postincrement operator is provided.

Returns a pointer to the collection being iterated over.

Returns the key portion of the association currently referenced by self.

Resets the iterator so that after being advanced it will reference the first element of the collection. Using reset() with no argument will reset the iterator on the current container. Supplying a RWTValMap with reset() will reset the iterator on that container.

Returns the value portion of the association referenced by self.

Constructs an empty map with comparator comp.

Constructs a map by copying all elements of m.

Copy constructor.

Constructs a map by copying elements from the array of Ts pointed to by first, up to, but not including, the element pointed to by last.

Destroys all elements of self and replaces them by copying all associations from m.

Returns true if self compares lexicographically less than m, otherwise returns false. Assumes that type K has well-defined less-than semantics (T::operator<(const K&) or equivalent).

Returns true if self compares equal to m, otherwise returns false. Two collections are equal if both have the same number of entries, and iterating through both collections produces, in turn, individual pairs that compare equal to each other.

Applies the user-defined function pointed to by fn to every association in the collection. This function must have one of the prototypes:

void yourfun(const K& key, T& a, void* d);

void yourfun(const K& key, const T& a,void* d);

Client data may be passed through parameter d.

This is a deprecated version of the apply member above. It behaves exactly the same as apply.

Returns an iterator positioned at the first pair in self.

Clears the collection by removing all items from self. Each key and its associated item will have its destructor called.

Returns true if there exists a key j in self that compares equal to key, otherwise returns false.

Returns true if there exists an association a in self such that the expression ((*fn)(a,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.

Returns an iterator positioned "just past" the last association in self.

Returns the number of associations in self.

If there exists a key j in self that compares equal to key, assigns j to r and returns true. Otherwise, returns false and leaves the value of r unchanged.

If there exists an association a in self such that the expression ((*fn)(a,d)) is true, assigns a to r 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.

If there exists a key j in self that compares equal to key, assigns the item associated with j to r and returns true. Otherwise, returns false and leaves the value of r unchanged.

If there exists a key j in self that compares equal to key, assigns j to kr, assigns the item associated with j to tr, and returns true. Otherwise, returns false and leaves the values of kr and tr unchanged.

Adds key with associated item a to the collection. Returns true.

This is a deprecated version of the insert member above. It behaves exactly the same as insert.

Returns true if there are no items in the collection, false otherwise.

Returns the number of keys j in self that compare equal to key.

Returns the number of associations a in self such that the expression((*fn)(a,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.

Removes the first association with key j in self where j compares equal to key and returns true. Returns false if there is no such association.

Removes the first association a in self such that the expression ((*fn)(a,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.

Removes all associations in self that have a key j that compares equal to key. Returns the number of items removed.

Removes all associations a in self such that the expression ((*fn)(a,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.

Returns a reference to the underlying C++-standard collection that serves as the implementation for self. This reference may be used freely, providing access to the C++-standard interface as well as interoperability with other software components that make use of the C++-standard collections.

Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.

Restores the contents of the collection coll from the input stream strm.

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.

Creates an iterator for the multi-map m. The iterator begins in an undefined state and must be advanced before the first association will be accessible.

Advances self to the next element. If the iterator has advanced past the last item in the collection, returns false. Otherwise, returns true.

Advances self to the next element. If the iterator has been reset or just created self will now reference the first element. If, before iteration, self referenced the last association in the multi-map, self will now reference an undefined value and false will be returned. Otherwise, true is returned. Note: no postincrement operation is provided.

Returns a pointer to the collection being iterated over.

Returns the key portion of the association currently referenced by self.

Resets the iterator so that after being advanced it will reference the first element of the collection. Using reset() with no argument will reset the iterator on the current container. Supplying a RWTValMultiMap to reset() will reset the iterator on the new container.

Returns the value portion of the association referenced by self.

Constructs an empty set.

Constructs a set by copying all elements of s.

Copy constructor.

Constructs a set by copying elements from the array of Ts pointed to by first, up to, but not including, the element pointed to by last.

Destroys all elements of self and replaces them by copying all elements of s.

Returns true if self compares lexicographically less than s, otherwise returns false. Assumes that type T has well-defined less-than semantics (T::operator<(const T&) or equivalent).

Returns true if self compares equal to s, 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.

Applies the user-defined function pointed to by fn to every item in the collection. This function must have prototype:

void yourfun(const_reference a, void* d);

Client data may be passed through parameter d.

Returns an iterator positioned at the first element of self.

Clears the collection by removing all items from self. Each item will have its destructor called.

Returns true if there exists an element t in self that compares equal to a, otherwise returns false.

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.

Sets self to the set-theoretic difference given by (self - s).

Returns an iterator positioned "just past" the last element in self.

Returns the number of items in self.

If there exists an element t in self that compares equal to a, assigns t to k and returns true. Otherwise, returns false and leaves the value of k unchanged.

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.

Sets self to the intersection of self and s.

Adds the item a to the collection. Returns true.

Returns true if there are no items in the collection, false otherwise.

Returns true if there is set equivalence between self and s, and returns false otherwise.

Returns true if self is a proper subset of s, and returns false otherwise.

Returns true if self is a subset of s or if self is set equivalent to rhs, false otherwise.

Returns the number of elements t in self that compare equal to a.

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.

Removes the first element t in self that compares equal to a and returns true. Returns false if there is no such element.

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.

Removes all elements t in self that compare equal to a. Returns the number of items removed.

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.

Returns a reference to the underlying C++-standard collection that serves as the implementation for self. This reference may be used freely, providing access to the C++-standard interface as well as interoperability with other software components that make use of the C++-standard collections.

Sets self to the symmetric difference of self and s.

Sets self to the union of self and s. Note the use of the uppercase "U"in Union to avoid conflict with the C++ reserved word.

Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.

Restores the contents of the collection coll from the input stream strm.

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.

Creates an iterator for the multi-set h. The iterator begins in an undefined state and must be advanced before the first element will be accessible

Advances self to the next element. If the iterator has advanced past the last element in the collection, false will be returned. Otherwise, true will be returned.

Advances self to the next element. If the iterator has been reset or just created self will now reference the first element. If, before iteration, self referenced the last association in the multi-set, self will now reference an undefined value and false will be returned. Otherwise, true is returned. Note: no postincrement operator is provided.

Returns a pointer to the collection being iterated over.

Returns the value pointed to by self.

Resets the iterator so that after being advanced it will point to the first element of the collection. Using reset() with no argument will reset the iterator on the current container. Supplying a RWTValMultiSet to reset() will reset the iterator on that container.

Constructs an empty vector.

Constructs a vector by copying all elements of vec.

Copy constructor.

Constructs a vector with n elements, each initialized to val.

Constructs an empty vector with a capacity of n elements.

Constructs a vector by copying elements from the array of Ts pointed to by first, up to, but not including, the element pointed to by last.

Calls the destructor on all elements of self and replaces them by copying all elements of vec.

Returns true if self compares lexicographically less than vec, otherwise returns false. Type T must have well-defined less-than semantics (T::operator<(const T&) or equivalent).

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.

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.

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.

Adds the item a to the end of the collection.

Applies the user-defined function pointed to by fn to every item in the collection. This function must have one of the prototypes:

void yourfun(const_reference a, void* d);

void yourfun(reference a, void* d);

Client data may be passed through parameter d.

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.

Returns an iterator positioned at the first element of self.

Clears the collection by removing all items from self. Each item will have its destructor called.

Returns true if there exists an element t in self such that the expression(t == a) is true, otherwise returns false.

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.

Returns a pointer to the first element of the vector.

Returns a past-the-end valued iterator of self.

Returns the number of elements in self.

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.

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 T& a, void* d);

Client data may be passed through parameter d.

Returns a reference to the first element of self.

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.

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.

Adds the item a to the end of the collection. Returns true.

Inserts the item a in front of the item at position i in self. This position must be between 0 and the number of entries in the collection, otherwise the function throws an exception of type RWBoundsErr.

Returns true if there are no items in the collection, false otherwise.

Returns a reference to the last item in the collection.

Returns the number of elements in self.

Returns a reference to the minimum or maximum element in the collection. Type T must have well-defined less-than semantics (T::operator<(const T&) or equivalent).

Returns the number of elements t in self such that the expression (t == a) is true.

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.

Adds the item a to the beginning of the collection.

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.

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.

Removes all elements t in self such that the expression (t == a) is true. Returns the number of items removed.

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.

Removes and returns the item at position i in self. This position must be between 0 and one less then the number of entries in the collection, otherwise the function throws an exception of type RWBoundsErr.

Removes and returns the first item in the collection.

Removes and returns the first item in the collection.

Replaces all elements t in self such that the expression (t == oldVal) is true with newVal. Returns the number of items replaced.

Replaces all elements t in self such that the expression ((*fn)(t,d))is true. Returns the number of items replaced. 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.

Modify the capacity of the vector to be at least as large as n. The function has no effect if the capacity is already as large as n.

Sorts the collection using the less-than operator to compare elements.

Returns a reference to the underlying C++-standard collection that serves as the implementation for self. This reference may be used freely, providing access to the C++-standard interface as well as interoperability with other software components that make use of the C++-standard collections.

This is the value returned by member functions such as index to indicate a non-position. The value is equal to ~(size_type)0.

Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.

Restores the contents of the collection coll from the input stream strm.

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.

Constructs an empty set.

Constructs a set by copying all elements of s.

Copy constructor.

Constructs a set by copying elements from the array of Ts pointed to by first, up to, but not including, the element pointed to by last.

Destroys all elements of self and replaces them by copying all elements of s.

Returns true if self compares lexicographically less than s, otherwise returns false. Assumes that type T has well-defined less-than semantics (T::operator<(const T&) or equivalent).

Returns true if self compares equal to s, 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.

Applies the user-defined function pointed to by fn to every item in the collection. This function must have prototype:

void yourfun(const_reference a, void* d);

Client data may be passed through parameter d.

Returns an iterator positioned at the first element of self.

Clears the collection by removing all items from self. Each item will have its destructor called.

Returns true if there exists an element t in self that compares equal to a, otherwise returns false.

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.

Sets self to the set-theoretic difference given by (self - s).

Returns an iterator positioned "just past" the last element in self.

Returns the number of items in self.

If there exists an element t in self that compares equal to a, assigns t to k and returns true. Otherwise, returns false and leaves the value of k unchanged.

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.

Adds the item a to the collection. Returns true if the insertion is successful, otherwise returns false. The function will return true unless the collection already holds an element with the equivalent key.

Sets self to the intersection of self and s.

Returns true if there are no items in the collection, false otherwise.

Returns true if there is set equivalence between self and s, and returns false otherwise.

Returns true if self is a proper subset of s, and returns false otherwise.

Returns true if self is a subset of s; false otherwise.

Returns the number of elements t in self that compare equal to a.

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.

Removes the first element t in self that compares equal to a and returns true. Returns false if there is no such element.

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.

Removes all elements t in self that compare equal to a. Returns the number of items removed.

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.

Returns a reference to the underlying C++-standard collection that serves as the implementation for self. This reference may be used freely, providing access to the C++-standard interface as well as interoperability with other software components that make use of the C++-standard collections.

Sets self to the symmetric difference of self and s.

Sets self to the union of self and s. Note the use of the uppercase "U"in Union to avoid conflict with the C++ reserved word.

Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.

Restores the contents of the collection coll from the input stream strm.

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.

Creates an iterator for the set s. The iterator begins in an undefined state and must be advanced before the first element will be accessible

Advances self to the next element. If the iterator has advanced past the last element in the collection, false will be returned. Otherwise, true will be returned.

Advances self to the next element. If the iterator has been reset or just created self will now reference the first element. If, before iteration, self referenced the last association in the set, self will now reference an undefined value and false will be returned. Otherwise, true is returned. Note: no postincrement operator is provided.

Returns a pointer to the collection being iterated over.

Returns the value referenced by self.

Resets the iterator so that after being advanced it will reference the first element of the collection. Using reset() with no argument will reset the iterator on the current container. Supplying a RWTValSet to reset() will reset the iterator on that container.

Constructs an empty, singly-linked list.

Constructs a singly-linked list by copying all elements of lst.

Copy constructor.

Constructs a singly-linked list with n elements, each initialized to val.

Constructs a singly-linked list by copying elements from the array of Ts pointed to by first, up to, but not including, the element pointed to by last.

Calls the destructor on all elements of self and replaces them by copying all elements of lst.

Returns true if self compares lexicographically less than lst, otherwise returns false. Type T must have well-defined less-than semantics (T::operator<(const T&) or equivalent).

Returns true if self compares equal to lst, 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.

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.

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.

Adds the item a to the end of the collection.

Applies the user-defined function pointed to by fn to every item in the collection. This function must have one of the prototypes:

void yourfun(const_reference a, void* d);

void yourfun(reference a, void* d);

Client data may be passed through parameter d.

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.

Returns an iterator positioned at the first element of self.

Clears the collection by removing all items from self. Each item will have its destructor called.

Returns true if there exists an element t in self such that the expression(t == a) is true, otherwise returns false.

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 T& a, void* d);

Client data may be passed through parameter d.

Returns a past-the-end valued iterator of self.

Returns the number of elements in self.

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.

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.

Returns a reference to the first element of self.

Removes and returns the first element in the collection. This method is identical to removeFirst and is included to provide compatibility with previous versions.

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.

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.

Adds the item a to the end of the collection. Returns true.

Inserts the item a in front of the item at position i in self. This position must be between 0 and the number of entries in the collection, otherwise the function throws an exception of type RWBoundsErr.

Returns true if there are no items in the collection, false otherwise.

Returns a reference to the last item in the collection.

Returns a reference to the minimum or maximum element in the collection. Type T must have well-defined less-than semantics (T::operator<(const T&) or equivalent).

Returns the number of elements t in self such that the expression (t == a) is true.

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.

Adds the item a to the beginning of the collection.

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.

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.

Removes all elements t in self such that the expression (t == a) is true. Returns the number of items removed.

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.

Removes and returns the item at position i in self. This position must be between 0 and one less then the number of entries in the collection, otherwise the function throws an exception of type RWBoundsErr.

Removes and returns the first item in the collection.

Removes and returns the first item in the collection.

Replaces all elements t in self such that the expression (t == oldVal) is true with newVal. Returns the number of items replaced.

Replaces all elements t in self such that the expression ((*fn)(t,d))is true with the value nv. Returns the number of items replaced. 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.

Sorts the collection using the less-than operator to compare elements.

Returns a reference to the underlying C++-standard collection that serves as the implementation for self. This reference may be used freely, providing access to the C++-standard interface as well as interoperability with other software components that make use of the C++-standard collections.

This is the value returned by member functions such as index to indicate a non-position. The value is equal to ~(size_type)0.

Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.

Restores the contents of the collection coll from the input stream strm.

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.

Creates an iterator for the singly linked list s. The iterator begins in an undefined state and must be advanced before the first element will be accessible

Advances self to the next element. If the iterator has advanced past the last element in the collection, false will be returned. Otherwise, true will be returned.

Advances self to the next element. If the iterator has been reset or just created, self will reference the first element. If, before iteration, self referenced the last value in the list, self will now reference an undefined value distinct from the reset value and false will be returned. Otherwise, true is returned. Note: no postincrement operator is provided.

Behaves as if the operator++ member function had been applied n times

Moves self back to the immediately previous element. If the iterator has been reset or just created, this operator will return false, otherwise it will return true. If self references the the first element, it will now be in the reset state. If self has been iterated past the last value in the list, it will now reference the last item in the list. Note: no postdecrement operator is provided.

Behaves as if the operator-- member function had been applied n times

Returns a pointer to the collection being iterated over.

Advances self to the first element t encountered by iterating forward, such that the expression (t == a) is true. Returns true if an element was found, returns false otherwise.

Advances self to the first element t encountered by iterating forward 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. Returns true if an element was found, returns false otherwise.

Inserts the pointer p into the container directly after the element referenced by self.

Returns the stored value referenced by self.

Removes the value referenced by self from the collection. true is returned if the removal is successful, false is returned otherwise.

Removes the first element t, encountered by iterating self forward, such that the expression (t == a) is true. Returns true if an element was found and removed, returns false otherwise.

Removes the first element t, encountered by iterating self forward, such that the expression((*fn)(t,d)) is true. fn points to a user-defined tester function which must have prototype:

bool yourTester(const T a, void* d);

Client data may be passed through parameter d. Returns true if an element was found and removed, returns false otherwise.

Resets the iterator so that after being advanced it will reference the first element of the collection. Using reset() with no argument will reset the iterator on the current container. Supplying a RWTValSlist to reset() will reset the iterator on the new container.

Constructs an empty doubly-linked list.

Constructs a doubly-linked list by copying and sorting all elements of lst.

Copy constructor.

Constructs a doubly-linked list with n elements, each initialized to val.

Constructs a doubly-linked list 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.

Destroys all elements of self and replaces them by copying (and sorting, if necessary) all elements of lst.

Returns true if self compares lexicographically less than lst, otherwise returns false. Assumes that type T has well-defined less-than semantics (T::operator<(const T&) or equivalent).

Returns true if self compares equal to lst, 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.

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.

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.

Applies the user-defined function pointed to by fn to every item in the collection. This function must have prototype:

void yourfun(const_reference a, void* d);

Client data may be passed through parameter d.

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.

Returns an iterator positioned at the first element of self.

Clears the collection by removing all items from self. Each item will have its destructor called.

Returns true if there exists an element t in self such that the expression(t==a) is true, otherwise returns false.

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.

Returns an iterator positioned "just past" the last element in self.

Returns the number of items in self.

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.

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.

Returns a reference to the first element of self.

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.

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.

Adds the items from a to self in an order preserving manner. Returns the number of items inserted into self.

Adds the item a to self. The collection remains sorted. Returns true.

Returns true if there are no items in the collection, false otherwise.

Returns true if the collection is sorted relative to the supplied comparator object, false otherwise.

Returns a reference to the last item in the collection.

Inserts all elements of dl into self, preserving sorted order.

Returns the number of elements t in self such that the expression (t == a) is true.

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.

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.

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.

Removes all elements t in self such that the expression (t == a) is true. Returns the number of items removed.

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.

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.

Removes and returns the first item in the collection.

Removes and returns the first item in the collection.

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.

This is the value returned by member functions such as index to indicate a non-position. The value is equal to ~(size_type)0.

Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.

Restores the contents of the collection coll from the input stream strm.

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.

Creates an iterator for the sorted dlist s. The iterator begins in an undefined state and must be advanced before the first element will be accessible.

Advances self to the next element. If the iterator has advanced past the last item in the container, the element returned will be a nil pointer equivalent to boolean false.

Advances self to the next element. If the iterator has been reset or just created, self will reference the first element. If, before iteration, self referenced the last value in the list, self will now point to an undefined value distinct from the reset value and false will be returned. Otherwise, true is returned. Note: no postincrement operator is provided.

Behaves as if the operator++ member function had been applied n times

Moves self back to the immediately previous element. If the iterator has been reset or just created, this operator will return false, otherwise it will return true. If self references the the first element, it will now be in the reset state. If self has been iterated past the last value in the list, it will now point to the last item in the list. Note: no postdecrement operator is provided.

Behaves as if the operator-- member function had been applied n times

Returns a pointer to the collection being iterated over.

Advances self to the first element t encountered by iterating forward, such that the expression (t == a) is true. Returns true if such an element if found, false otherwise.

Advances self to the first element t encountered by iterating forward, such that the expression((*fn)(t,d)) is true. fn points to a user-defined tester function which must have prototype:

bool yourTester(const T a, void* d);

Client data may be passed through parameter d. Returns true if such an element if found, false otherwise.

Returns the stored value referenced by self.

Removes the stored value referenced by self from the collection. Returns true if the value was successfully removed, false otherwise.

Removes the first element t, encountered by iterating self forward, such that the expression (t == a) is true. Returns true if such an element is successfully removed, false otherwise.

Removes the first element t, encountered by iterating self forward, such that the expression((*fn)(t,d)) is true. fn points to a user-defined tester function which must have prototype:

bool yourTester(const T a, void* d);

Client data may be passed through parameter d. Returns true if such an element is successfully removed, false otherwise.

Resets the iterator so that after being advanced it will reference the first element of the collection. Using reset() with no argument will reset the iterator on the current container. Supplying a RWTValSortedDlist to reset() will reset the iterator on the new container.

Constructs an empty vector.

Constructs a vector by copying and sorting all elements of vec.

Copy constructor.

Constructs a vector with n elements, each initialized to val.

Constructs an empty vector with a capacity of n elements.

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.

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).

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.

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.

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.

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.

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.

Returns an iterator positioned at the first element of self.

Clears the collection by removing all items from self. Each item will have its destructor called.

Returns true if there exists an element t in self such that the expression(t==a) is true, otherwise returns false.

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.

Returns a pointer to the first element of the vector.

Returns an iterator positioned "just past" the last element in self.

Returns the number of items in self.

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.

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.

Returns a reference to the first element of self.

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.

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.

Adds the item a to self. The collection remains sorted. Returns true.

Inserts all elements of a into self. The collection remains sorted. Returns the number of items inserted.

Returns true if there are no items in the collection, false otherwise.

Returns true if the collection is sorted relative to the supplied comparator object, false otherwise.

Returns a reference to the last item in the collection.

Returns the maximum number of elements which can be stored in self without first resizing.

Inserts all elements of dl into self, preserving sorted order.

Returns the number of elements t in self such that the expression (t == a) is true.

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.

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.

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.

Removes all elements t in self such that the expression (t == a) is true. Returns the number of items removed.

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.

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.

Removes and returns the first item in the collection.

Removes and returns the first item in the collection.

Modify, if necessary, the capacity of the vector to be at least as large as n.

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.

This is the value returned by member functions such as index to indicate a non-position. The value is equal to ~(size_type)0.

Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.

Restores the contents of the collection coll from the input stream strm.

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.

Constructs an empty vector of length zero.

Constructs a vector of length n. The values of the elements will be set by the default constructor of class T. For a built in type this can (and probably will) be garbage.

Constructs a vector of length n, with each element initialized to the value ival.

Constructs self as a copy of v. Each element in v will be copied into self.

Calls the destructor for every element in self.

Sets self to the same length as v and then copies all elements of v into self.

Sets all elements in self to the value ival.

Returns a reference to 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.

Returns a reference to the ith value in the vector. The index i must be between 0 and the length of the vector less one. Bounds checking will be performed.

Returns a pointer to the raw data of self. Should be used with care.

Returns the length of the vector.

Changes the length of the vector to N. If this results in the vector being lengthened, then the initial value of the additional elements is set by the default constructor of T.

Construct a vector of length size. The pages for the vector will be allocated from the page heap given by heap which can be of any type.

Constructs a vector as a copy of v. The resultant vector will use the same heap and have the same length as v. The actual copy will not be made until a write, minimizing the amount of heap allocations and copying that must be done.

Constructs a vector from a slice of another vector. The resultant vector will use the same heap as the vector whose slice is being taken. Its length will be given by the length of the slice. The copy will be made immediately.

Releases all pages allocated by the vector.

Sets self to a copy of v. The resultant vector will use the same heap and have the same length as v. The actual copy will not be made until a write, minimizing the amount of heap allocations and copying that must be done.

Sets self equal to a slice of another vector. The resultant vector will use the same heap as the vector whose slice is being taken. Its length will be given by the length of the slice. The copy will be made immediately.

Sets all elements in self equal to val. This operator is actually quite efficient because it can work with many elements on a single page at once. A copy of val is returned.

Returns a copy of the value at index i. The index i must be between zero and the length of the vector less one or an exception of type TOOL_LONGINDEX will occur.

Returns a reference to the value at index i. The results can be used as an lvalue. The index i must be between zero and the length of the vector less one or an exception of type TOOL_LONGINDEX will occur.

Returns the length of the vector.

Returns a copy of the value at index i. The index i must be between zero and the length of the vector less one or an exception of type TOOL_LONGINDEX will occur.

Sets the value at the index i to v. The index i must be between zero and the length of the vector less one or an exception of type TOOL_LONGINDEX will occur.

Returns a reference to a slice of self. The value start is the starting index of the slice, the value length its extent. The results can be used as an lvalue.

Change the length of the vector to newLength. If this results in the vector being lengthened then the value of the new elements is undefined.

Returns a pointer to the heap from which the vector is getting its pages.

Sets the size of a page.

The destructor has been made virtual to give specializing classes a chance to deallocate any resources that they may have allocated.

Returns the page size for this abstract page heap.

Allocates a page off the abstract heap and returns a handle for it. If the specializing class is unable to honor the request, then it should return a zero handle.

Deallocate the page associated with handle h. It is not an error to deallocate a zero handle.

Declare the page associated with handle h to be "dirty." That is, it has changed since it was last locked. The page must be locked before calling this function.

Lock the page, swapping it into physical memory, and return an address for it. A nil pointer will be returned if the specializing class is unable to honor the lock. The returned pointer should be regarded as pointing to a buffer of the page size.

Unlock a page. A page must be locked before calling this function. After calling this function the address returned by lock() is no longer valid.

Returns a nonzero integer if an EOF has been encountered.

Returns a nonzero integer if the fail or bad bit has been set. Normally, this indicates that some storage or retrieval has failed but that the stream is still in a usable state.

Returns a nonzero integer if the bad bit has been set. Normally this indicates that a severe error has occurred from which recovery is probably impossible.

Returns a nonzero integer if no error bits have been set.

Returns the current error state.

Sets the current error state to v. If v is zero, then this clears the error state.

If fail() then return 0 else return self.

This virtual destructor allows specializing classes to deallocate any resources that they may have allocated.

Get the next char from the input stream and store it in c.

Get the next wchar_t from the input stream and store it in wc.

Get the next double from the input stream and store it in d.

Get the next float from the input stream and store it in f.

Get the next int from the input stream and store it in i.

Get the next long from the input stream and store it in l.

Get the next short from the input stream and store it in s.

Get the next unsigned char from the input stream and store it in c.

Get the next unsigned short from the input stream and store it in s.

Get the next unsigned int from the input stream and store it in i.

Get the next unsigned long from the input stream and store it in l.

Inherited from RWvios.

Get and return the next byte from the input stream, returning its value. Returns EOF if end of file is encountered.

Get the next char from the input stream, returning its value in c.

Get the next wchar_t from the input stream, returning its value in wc.

Get the next unsignedchar from the input stream, returning its value in c.

Get a vector of chars and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason, get stores what has already been retrieved from the stream into v, and sets the failbit. Note that get retrieves raw characters and does not perform any conversions on speical characters such as "\n".

Get a vector of wide characterss and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason, get stores what has already been retrieved from the stream into v, and sets the failbit. Note that get retrieves raw characters and does not perform any conversions on speical characters such as "\n".

Get a vector of Ndoubles and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason, get stores what has already been retrieved from the stream into v, and sets the failbit.

Get a vector of Nfloats and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason, get stores what has already been retrieved from the stream into v, and sets the failbit.

Get a vector of Nints and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason, get stores what has already been retrieved from the stream into v, and sets the failbit.

Get a vector of Nlongs and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason,get stores what has already been retrieved from the stream into v, and sets the failbit.

Get a vector of Nshorts and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason,get stores what has already been retrieved from the stream into v, and sets the failbit.

Get a vector of Nunsigned chars and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason, get stores what has already been retrieved from the stream into v, and sets the failbit. Note that this member preserves ASCII numerical codes, not their corresponding character values. If you wish to restore a character string, use the function getString(char*, size_t).

Get a vector of Nunsigned shorts and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason, get stores what has already been retrieved from the stream into v, and sets the failbit.

Get a vector of Nunsigned ints and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason, get stores what has already been retrieved from the stream into v, and sets the failbit.

Get a vector of N unsigned longs and store them in the array beginning at v. If the restore operation stops prematurely because there are no more data available on the stream, because an exception is thrown, or for some other reason, get stores what has already been retrieved from the stream into v, and sets the failbit.

Restores a character string from the input stream that was stored to the output stream with RWvostream::putstring and stores it in the array beginning at s. The function stops reading at the end of the string or after N-1 characters, whichever comes first. If N-1 characters have been read and the Nth character is not the string terminator, then the failbit of the stream will be set. In either case, the string will be terminated with a null byte.

Restores a wide character string from the input stream that was stored to the output stream with RWvostream::putstring and stores it in the array beginning at ws. The function stops reading at the end of the string or after N-1 characters, whichever comes first. If N-1 characters have been read and the Nth character is not the string terminator, then the failbit of the stream will be set. In either case, the string will be terminated with a null byte.

This virtual destructor allows specializing classes to deallocate any resources that they may have allocated.

Store the character string starting at s to the output stream. The character string is expected to be null terminated.

Store the wide character string starting at ws to the output stream. The character string is expected to be null terminated.

Store the charc to the output stream. Note that c is treated as a character, not a number.

Store the wchar_t wc to the output stream. Note that wc is treated as a character, not a number.

Store the unsignedcharc to the output stream. Note that c is treated as a character, not a number.

Store the doubled to the output stream.

Store the floatf to the output stream.

Store the inti to the output stream.

Store the unsigned inti to the output stream.

Store the longl to the output stream.

Store the unsigned long l to the output stream.

Store the shorts to the output stream.

Store the unsigned short s to the output stream.

Inherited from RWvios.

Send the contents of the stream buffer to output immediately.

Store the charc to the output stream, preserving its value.

Store the wchar_t wc to the output stream, preserving its value.

Store the charc to the output stream, preserving its value.

Store the vector of N chars starting at p to the output stream. The chars should be treated as literal numbers (i.e., not as a character string).

Store the vector of Nwchar_ts starting at p to the output stream. The chars should be treated as literal numbers (i.e., not as a character string).

Store the vector of Nunsigned chars starting at p to the output stream. The chars should be treated as literal numbers (i.e., not as a character string).

Store the vector of Nshorts starting at p to the output stream.

Store the vector of Nunsigned shorts starting at p to the output stream.

Store the vector of Nints starting at p to the output stream.

Store the vector of Nunsigned ints starting at p to the output stream.

Store the vector of Nlongs starting at p to the output stream.

Store the vector of Nunsigned longs starting at p to the output stream.

Store the vector of Nfloats starting at p to the output stream.

Store the vector of Ndoubles starting at p to the output stream.

Store the character string, including embedded nulls, starting at s to the output string.

Used to specify whether comparisons, searches, and hashing functions should use case sensitive (exact) or case-insensitive (ignoreCase) semantics..

Allow conversion from multibyte character strings to wide character strings. See constructor below.

Allow conversion from ASCII character strings to wide character strings. See constructor below.

Creates a string of length zero (the null string).

Creates a string from the wide character string cs. The created string will copy the data pointed to by cs, up to the first terminating null.

Constructs a string from the character string cs. The created string will copy the data pointed to by cs. Exactly N characters are copied, including any embedded nulls. Hence, the buffer pointed to by cs must be at least N* sizeof(wchar_t) bytes or N wide characters long.

Creates a string of length zero (the null string). The string's capacity (that is, the size it can grow to without resizing) is given by the parameter ic.

Copy constructor. The created string will copystr's data.

Conversion from sub-string. The created string will copy the substring represented by ss.

Constructs a string containing the single character c.

Constructs a string containing the character c repeated N times.

Construct a wide character string from the multibyte character string contained in mbcs. The conversion is done using the Standard C library function ::mbstowcs(). This constructor can be used as follows:

RWWString a("\306\374\315\313\306\374", multiByte);

Construct a wide character string from the ASCII character string contained in acs. The conversion is done by simply stripping the high-order bit and, hence, is much faster than the more general constructor given immediately above. For this conversion to be successful, you must be certain that the string contains only ASCII characters. This can be confirmed (if necessary) using RWCString::isAscii(). This constructor can be used as follows:

RWWString a("An ASCII character string", ascii);

RWWString(const char* cs, size_t N, multiByte_ mb);

RWWString(const char* cs, size_t N, ascii__ asc);

These two constructors are similar to the two constructors immediately above except that they copy exactly N characters, including any embedded nulls. Hence, the buffer pointed to by cs must be at least N bytes long.

Access to the RWWString's data as a null terminated wide string. This datum is owned by the RWWString and may not be deleted or changed. If the RWWString object itself changes or goes out of scope, the pointer value previously returned will become invalid. While the string is null-terminated, note that its length is still given by the member function length(). That is, it may contain embedded nulls.

Assignment operator. Copies the null-terminated character string pointed to by cs into self. Returns a reference to self.

Assignment operator. The string will copystr's data. Returns a reference to self.

Assignment operator. The string will copysub's data. Returns a reference to self.

Append the null-terminated character string pointed to by cs to self. Returns a reference to self.

Append the string str to self. Returns a reference to self.

Return the ith character. The first variant can be used as an lvalue. The index i must be between 0 and the length of the string less one. Bounds checking is performed — if the index is out of range then an exception of type RWBoundsErr will be thrown.

Return the ith character. The first variant can be used as an lvalue. The index i must be between 0 and the length of the string less one. Bounds checking is performed if the pre-processor macro RWBOUNDS_CHECK has been defined before including <rw/wstring.h>. In this case, if the index is out of range, then an exception of type RWBoundsErr will be thrown.

Substring operator. Returns an RWWSubString of self with length len, starting at index start. The first variant can be used as an lvalue. The sum of start plus len must be less than or equal to the string length. If the library was built using the RWDEBUG flag, and start and len are out of range, then an exception of type RWBoundsErr will be thrown.

Append a copy of the null-terminated wide character string pointed to by cs to self. Returns a reference to self.

Append a copy of the wide character string cs to self. Exactly N wide characters are copied, including any embedded nulls. Hence, the buffer pointed to by cs must be at least N*sizeof(wchar_t) bytes long. Returns a reference to self.

Append a copy of the string cstr to self. Returns a reference to self.

Append the first N characters or the length of cstr (whichever is less) of cstr to self. Returns a reference to self.

Returns the number of bytes necessary to store the object using the global function:

Return the current capacity of self. This is the number of characters the string can hold without resizing.

Hint to the implementation to change the capacity of self to capac. Returns the actual capacity.

Returns an int less then, greater than, or equal to zero, according to the result of calling the POSIX function ::wscoll() on self and the argument str. This supports locale-dependent collation.

Returns an int less than, greater than, or equal to zero, according to the result of calling the Standard C library function ::memcmp() on self and the argument str. Case sensitivity is according to the caseCompare argument, and may be RWWString::exact or RWWString::ignoreCase.

Pattern matching. Returns TRUE if cs occurs in self. Case sensitivity is according to the caseCompare argument, and may be RWWString::exact or RWWString::ignoreCase.

Access to the RWWString's data as a null terminated string. This datum is owned by the RWWString and may not be deleted or changed. If the RWWString object itself changes or goes out of scope, the pointer value previously returned will become invalid. While the string is null-terminated, note that its length is still given by the member function length(). That is, it may contain embedded nulls.

Returns the index of the first occurrence of the wide character c in self. Returns RW_NPOS if there is no such character or if there is an embedded null prior to finding c.

Returns the index of the first occurrence of the wide character c in self. Continues to search past embedded nulls. Returns RW_NPOS if there is no such character.

Returns the index of the first occurrence in self of any character in str. Returns RW_NPOS if there is no match or if there is an embedded null prior to finding any character from str.

Returns the index of the first occurrence in self of any character in str. Exactly N characters in str are checked including any embedded nulls so str must point to a buffer containing at least N wide characters. Returns RW_NPOS if there is no match.

Returns a suitable hash value.

Pattern matching. Starting with index i, searches for the first occurrence of pat in self and returns the index of the start of the match. Returns RW_NPOS if there is no such pattern. Case sensitivity is according to the caseCompare argument; it defaults to RWWString::exact.

Pattern matching. Starting with index i, searches for the first occurrence of the first patlen characters from pat in self and returns the index of the start of the match. Returns RW_NPOS if there is no such pattern. Case sensitivity is according to the caseCompare argument.

Insert a copy of the null-terminated string cs into self at position pos. Returns a reference to self.

Insert a copy of the first N wide characters of cs into self at position pos. Exactly N wide characters are copied, including any embedded nulls. Hence, the buffer pointed to by cs must be at least N*sizeof(wchar_t) bytes long. Returns a reference to self.

Insert a copy of the string str into self at position pos. Returns a reference to self.

Insert a copy of the first N wide characters or the length of str (whichever is less) of str into self at position pos. Returns a reference to self.

Returns TRUE if it is safe to perform the conversion toAscii() (that is, if all characters of self are ASCII characters).

Returns TRUE if this string has zero length (i.e., the null string).

Returns the index of the last occurrence in the string of the wide character c. Returns RW_NPOS if there is no such character.

Return the number of characters in self.

Prepend a copy of the null-terminated wide character string pointed to by cs to self. Returns a reference to self.

Prepend a copy of the character string cs to self. Exactly N characters are copied, including any embedded nulls. Hence, the buffer pointed to by cs must be at least N*sizeof(wchart_t) bytes long. Returns a reference to self.

Prepends a copy of the string str to self. Returns a reference to self.

Prepend the first N wide characters or the length of cstr (whichever is less) of cstr to self. Returns a reference to self.

Reads characters from the input stream s, replacing the previous contents of self, until EOF is reached. The input stream is treated as a sequence of multibyte characters, each of which is converted to a wide character (using the Standard C library function mbtowc()) before storing. Null characters are treated the same as other characters.

Reads characters from the input stream s, replacing the previous contents of self, until a newline (or an EOF) is encountered. The newline is removed from the input stream but is not stored. The input stream is treated as a sequence of multibyte characters, each of which is converted to a wide character (using the Standard C library function mbtowc()) before storing. Null characters are treated the same as other characters. If the skipWhite argument is TRUE, then whitespace is skipped (using the iostream library manipulator ws) before saving characters.

Reads characters from the input stream s, replacing the previous contents of self, until an EOF or null terminator is encountered. The input stream is treated as a sequence of multibyte characters, each of which is converted to a wide character (using the Standard C library function mbtowc()) before storing.

Reads characters from the input stream s, replacing the previous contents of self, until an EOF or the delimiting character delim is encountered. The delimiter is removed from the input stream but is not stored. The input stream is treated as a sequence of multibyte characters, each of which is converted to a wide character (using the Standard C library function mbtowc()) before storing. Null characters are treated the same as other characters.

Whitespace is skipped before storing characters into wide string. Characters are then read from the input stream s, replacing previous contents of self, until trailing whitespace or an EOF is encountered. The trailing whitespace is left on the input stream. Only ASCII whitespace characters are recognized, as defined by the standard C library function isspace(). The input stream is treated as a sequence of multibyte characters, each of which is converted to a wide character (using the Standard C library function mbtowc()) before storing.

Removes the characters from the position pos, which must be no greater than length(), to the end of string. Returns a reference to self.

Removes N wide characters or to the end of string (whichever comes first) starting at the position pos, which must be no greater than length(). Returns a reference to self.

Replaces N wide characters or to the end of string (whichever comes first) starting at position pos, which must be no greater than length(), with a copy of the null-terminated string cs. Returns a reference to self.

Replaces N1 characters or to the end of string (whichever comes first) starting at position pos, which must be no greater than length(), with a copy of the string cs. Exactly N2 characters are copied, including any embedded nulls. Hence, the buffer pointed to by cs must be at least N2*sizeof(wchart_t) bytes long. Returns a reference to self.

Replaces N characters or to the end of string (whichever comes first) starting at position pos, which must be no greater than length(), with a copy of the string str. Returns a reference to self.

Replaces N1 characters or to the end of string (whichever comes first) starting at position pos, which must be no greater than length(), with a copy of the first N2 characters, or the length of str (whichever is less), from str. Returns a reference to self.

Changes the length of self, adding blanks (i.e., L' ') or truncating as necessary.

Returns a substring of self where the character c has been stripped off the beginning, end, or both ends of the string. The first variant can be used as an lvalue. The enum stripType can take values:

Returns a substring representing the first occurrence of the null-terminated string pointed to by "cs". Case sensitivity is according to the caseCompare argument; it defaults to RWWString::exact. The first variant can be used as an lvalue.

Returns an RWCString object of the same length as self, containing only ASCII characters. Any non-ASCII characters in self simply have the high bits stripped off. Use isAscii() to determine whether this function is safe to use.