RWTValOrderedVector< T, A > Class Template Reference
[STL-based Collections]

Maintains a collection of values implemented as a vector. More...

#include <rw/tvordvec.h>

Inherits RW_VSeq< std::vector< T,A >, RWTValOrderedVector< T,A > >.

List of all members.

Public Types
typedef std::vector< T,A >	container_type
typedef container_type::iterator	iterator
typedef container_type::const_iterator	const_iterator
typedef container_type::size_type	size_type
typedef container_type::value_type	value_type
typedef container_type::reference	reference
typedef container_type::const_reference	const_reference
Public Member Functions
container_type &	std ()
const container_type &	std () const
void	append (const_reference a)
void	append (value_type &&a)
void	apply (void(*fn)(reference, void *), void *d)
void	apply (void(*fn)(const_reference, void *), void *d) const
reference	at (size_type i)
const_reference	at (size_type i) const
iterator	begin ()
const_iterator	begin () const
void	clear ()
bool	contains (bool(*fn)(const_reference, void *), void *d) const
bool	contains (const_reference a) const
iterator	end ()
const_iterator	end () const
size_type	entries () const
bool	find (bool(*fn)(const_reference, void *), void *d, value_type &k) const
bool	find (const_reference a, value_type &k) const
reference	first ()
const_reference	first () const
size_type	index (const_reference a) const
size_type	index (bool(*fn)(const_reference, void *), void *d) const
bool	insert (const_reference a)
bool	insert (value_type &&a)
void	insertAt (size_type i, const_reference a)
void	insertAt (size_type i, value_type &&a)
bool	isEmpty () const
reference	minElement ()
const_reference	minElement () const
reference	maxElement ()
const_reference	maxElement () const
size_type	occurrencesOf (bool(*fn)(const_reference, void *), void *d) const
size_type	occurrencesOf (const_reference a) const
reference	operator() (size_type i)
const_reference	operator() (size_type i) const
bool	operator< (const container_type &vec) const
bool	operator< (const RWTValOrderedVector< T, A > &vec) const
bool	operator== (const container_type &vec) const
bool	operator== (const RWTValOrderedVector< T, A > &vec) const
bool	operator!= (const container_type &stdc) const
bool	operator!= (const RWTValOrderedVector< T, A > &rwc) const
reference	operator[] (size_type i)
const_reference	operator[] (size_type i) const
void	prepend (const_reference a)
void	prepend (value_type &&a)
bool	remove (const_reference a)
bool	remove (bool(*fn)(const_reference, void *), void *d)
size_type	removeAll (bool(*fn)(const_reference, void *), void *d)
size_type	removeAll (const_reference a)
value_type	removeAt (size_type i)
value_type	removeFirst ()
size_type	replaceAll (bool(*fn)(const value_type &, void *), void *d, const value_type &newVal)
size_type	replaceAll (const value_type &oldVal, const value_type &newVal)
RWSelectType< RWIsSameType < value_type, bool >::value, value_type, reference >::type	last ()
RWSelectType< RWIsSameType < value_type, bool >::value, value_type, const_reference > ::type	last () const
const T *	data () const
size_type	length () const
void	resize (size_t n)
void	sort ()
value_type	removeLast ()
RWTValOrderedVector< T,A > &	operator= (const RWTValOrderedVector< T, A > &vec)
RWTValOrderedVector< T,A > &	operator= (RWTValOrderedVector< T, A > &&vec)
RWTValOrderedVector< T,A > &	operator= (const container_type &vec)
	RWTValOrderedVector ()
	RWTValOrderedVector (const RWTValOrderedVector< T, A > &t)
	RWTValOrderedVector (RWTValOrderedVector< T, A > &&t)
	RWTValOrderedVector (const container_type &vec)
	RWTValOrderedVector (size_type n, const T &val)
	RWTValOrderedVector (const T *first, const T *last)
	RWTValOrderedVector (size_type n)
void	swap (RWTValOrderedVector< T, A > &rhs)
Related Functions
(Note that these are not member functions.)
template<class T , class A >
RWvostream &	operator<< (RWvostream &strm, const RWTValOrderedVector< T, A > &coll)
template<class T , class A >
RWFile &	operator<< (RWFile &strm, const RWTValOrderedVector< T, A > &coll)
template<class T , class A >
RWvistream &	operator>> (RWvistream &strm, RWTValOrderedVector< T, A > &coll)
template<class T , class A >
RWFile &	operator>> (RWFile &strm, RWTValOrderedVector< T, A > &coll)
template<class T , class A >
RWvistream &	operator>> (RWvistream &strm, RWTValOrderedVector< T, A > *&p)
template<class T , class A >
RWFile &	operator>> (RWFile &strm, RWTValOrderedVector< T, A > *&p)

---

Detailed Description

template<class T, class A = std:: allocator < T >>
class RWTValOrderedVector< T, A >

This class maintains a collection of values, implemented as a vector. Class T is the type of items in the collection. Class A is an allocator of objects of class T. For more information about using custom allocators, please see the Essential Tools Module User's Guide.

The value type must have operator== and operator< defined. This requirement is imposed by the C++ Standard Library.

Synopsis

 #include <rw/tvordvec.h>
 RWTValOrderedVector<T,A> ordvec;

Related Classes

Classes RWTValDeque<T,A>, RWTValSlist<T,A>, and RWTValDlist<T,A> also provide a Rogue Wave interface to C++ Standard sequence collections.

Class std::vector<T,A> is the C++ Standard collection that serves as the underlying implementation for this class.

Persistence

Isomorphic

Examples

 #include <iostream>
 #include <rw/tvordvec.h>
 
 int main ()
 {
     RWTValOrderedVector<double> vec;
 
     vec.insert(22.0);
     vec.insert(5.3);
     vec.insert(-102.5);
     vec.insert(15.0);
     vec.insert(5.3);
 
 
     std::cout << "There are " << vec.entries()
               << " entries, they are: \n\n"; // Prints "5"
 
     for (size_t i = 0; i < vec.length(); ++i)
         std::cout << vec[i] << std::endl;
 
     return 0;
 }

Program Output:

 There are 5 entries, they are:
 22
 5.3
 -102.5
 15
 5.3

---

Member Typedef Documentation

template<class T, class A = std:: allocator < T >>

typedef container_type::const_iterator RWTValOrderedVector< T, A >::const_iterator

Typedef for the const iterator.

template<class T, class A = std:: allocator < T >>

typedef container_type::const_reference RWTValOrderedVector< T, A >::const_reference

Typedef for a const reference to a value in this container.

template<class T, class A = std:: allocator < T >>

typedef std::vector<T ,A > RWTValOrderedVector< T, A >::container_type

A typedef for the C++ Standard collection that serves as the underlying implementation for this class.

template<class T, class A = std:: allocator < T >>

typedef container_type::iterator RWTValOrderedVector< T, A >::iterator

Typedef for the non-const iterator.

template<class T, class A = std:: allocator < T >>

typedef container_type::reference RWTValOrderedVector< T, A >::reference

Typedef for a non-const reference to a value in this container.

template<class T, class A = std:: allocator < T >>

typedef container_type::size_type RWTValOrderedVector< T, A >::size_type

Typedef for the type used to index into this container.

template<class T, class A = std:: allocator < T >>

typedef container_type::value_type RWTValOrderedVector< T, A >::value_type

Typedef for the type of elements in this container.

---

Constructor & Destructor Documentation

template<class T, class A = std:: allocator < T >>

RWTValOrderedVector< T, A >::RWTValOrderedVector

(

)

[inline]

Constructs an empty vector.

template<class T, class A = std:: allocator < T >>

RWTValOrderedVector< T, A >::RWTValOrderedVector

(

const RWTValOrderedVector< T, A > &

t

)

[inline]

Copy constructor.

template<class T, class A = std:: allocator < T >>

RWTValOrderedVector< T, A >::RWTValOrderedVector

(

RWTValOrderedVector< T, A > &&

t

)

[inline]

Move constructor. The constructed vector takes ownership of the data owned by t.

Condition:

This method is only available on platforms with rvalue reference support.

template<class T, class A = std:: allocator < T >>

RWTValOrderedVector< T, A >::RWTValOrderedVector

(

const container_type &

vec

)

[inline]

Constructs a vector by copying all elements of vec.

template<class T, class A = std:: allocator < T >>

RWTValOrderedVector< T, A >::RWTValOrderedVector	(	size_type	n,
		const T &	val
	)			[inline]

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

template<class T, class A = std:: allocator < T >>

RWTValOrderedVector< T, A >::RWTValOrderedVector	(	const T *	first,
		const T *	last
	)			[inline]

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.

template<class T, class A = std:: allocator < T >>

RWTValOrderedVector< T, A >::RWTValOrderedVector

(

size_type

n

)

[inline]

Constructs an empty vector with a capacity of n elements.

---

Member Function Documentation

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::append

(

value_type &&

a

)

[inline]

Adds the item a to the end of the collection.

Condition:

This method is only available on platforms with rvalue reference support.

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::append

(

const_reference

a

)

[inline]

Adds the item a to the end of the collection.

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::apply	(	void(*)(const_reference, void *)	fn,
		void *	d
	)			const [inline]

Applies the user-defined function pointed to by fn to every item in the collection. Client data may be passed through parameter d.

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::apply	(	void(*)(reference, void *)	fn,
		void *	d
	)			[inline]

Applies the user-defined function pointed to by fn to every item in the collection. Client data may be passed through parameter d.

template<class T, class A = std:: allocator < T >>

const_reference RWTValOrderedVector< T, A >::at

(

size_type

i

)

const [inline]

Returns a reference to the i ^th element of self.

Exceptions:

RWBoundsErr

Thrown if index i is not between 0 and one less than the number of entries in self.

template<class T, class A = std:: allocator < T >>

reference RWTValOrderedVector< T, A >::at

(

size_type

i

)

[inline]

Returns a reference to the i ^th element of self.

Exceptions:

RWBoundsErr

Thrown if index i is not between 0 and one less than the number of entries in self.

template<class T, class A = std:: allocator < T >>

const_iterator RWTValOrderedVector< T, A >::begin

(

)

const [inline]

Returns an iterator positioned at the first element of self.

template<class T, class A = std:: allocator < T >>

iterator RWTValOrderedVector< T, A >::begin

(

)

[inline]

Returns an iterator positioned at the first element of self.

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::clear

(

void

)

[inline]

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

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::contains

(

const_reference

a

)

const [inline]

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

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::contains	(	bool(*)(const_reference, void *)	fn,
		void *	d
	)			const [inline]

Returns true if there exists an element t in self such that the expression ((*fn)(t,d)) is true, otherwise returns false. Client data may be passed through parameter d.

template<class T, class A = std:: allocator < T >>

const T* RWTValOrderedVector< T, A >::data

(

void

)

const [inline]

Returns a pointer to the first element of the vector.

template<class T, class A = std:: allocator < T >>

const_iterator RWTValOrderedVector< T, A >::end

(

)

const [inline]

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

template<class T, class A = std:: allocator < T >>

iterator RWTValOrderedVector< T, A >::end

(

)

[inline]

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

template<class T, class A = std:: allocator < T >>

size_type RWTValOrderedVector< T, A >::entries

(

void

)

const [inline]

Returns the number of elements in self.

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::find	(	const_reference	a,
		value_type &	k
	)			const [inline]

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.

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::find	(	bool(*)(const_reference, void *)	fn,
		void *	d,
		value_type &	k
	)			const [inline]

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. Client data may be passed through parameter d.

template<class T, class A = std:: allocator < T >>

const_reference RWTValOrderedVector< T, A >::first

(

void

)

const [inline]

Returns a reference to the first element of self.

template<class T, class A = std:: allocator < T >>

reference RWTValOrderedVector< T, A >::first

(

void

)

[inline]

Returns a reference to the first element of self.

template<class T, class A = std:: allocator < T >>

size_type RWTValOrderedVector< T, A >::index	(	bool(*)(const_reference, void *)	fn,
		void *	d
	)			const [inline]

Returns the position of the first item t in self such that ((*fn)(t,d)) is true, or returns RW_NPOS if no such item exists. Client data may be passed through parameter d.

template<class T, class A = std:: allocator < T >>

size_type RWTValOrderedVector< T, A >::index

(

const_reference

a

)

const [inline]

Returns the position of the first item t in self such that (t == a), or returns RW_NPOS if no such item exists.

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::insert

(

value_type &&

a

)

[inline]

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

Condition:

This method is only available on platforms with rvalue reference support.

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::insert

(

const_reference

a

)

[inline]

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

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::insertAt	(	size_type	i,
		value_type &&	a
	)			[inline]

Inserts the item a in front of the item at position i in self.

Exceptions:

RWBoundsErr

Thrown if this position is not between 0 and the number of entries in the collection.

Condition:

This method is only available on platforms with rvalue reference support.

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::insertAt	(	size_type	i,
		const_reference	a
	)			[inline]

Inserts the item a in front of the item at position i in self.

Exceptions:

RWBoundsErr

Thrown if this position is not between 0 and the number of entries in the collection.

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::isEmpty

(

)

const [inline]

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

template<class T, class A = std:: allocator < T >>

RWSelectType< RWIsSameType < value_type, bool >::value, value_type, const_reference >::type RWTValOrderedVector< T, A >::last

(

void

)

const [inline]

Returns a reference to the last item in the collection.

template<class T, class A = std:: allocator < T >>

RWSelectType< RWIsSameType < value_type, bool >::value, value_type, reference >::type RWTValOrderedVector< T, A >::last

(

void

)

[inline]

Returns a reference to the last item in the collection.

template<class T, class A = std:: allocator < T >>

size_type RWTValOrderedVector< T, A >::length

(

)

const [inline]

Returns the number of elements in self.

template<class T, class A = std:: allocator < T >>

const_reference RWTValOrderedVector< T, A >::maxElement

(

)

const [inline]

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

template<class T, class A = std:: allocator < T >>

reference RWTValOrderedVector< T, A >::maxElement

(

)

[inline]

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

template<class T, class A = std:: allocator < T >>

const_reference RWTValOrderedVector< T, A >::minElement

(

)

const [inline]

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

template<class T, class A = std:: allocator < T >>

reference RWTValOrderedVector< T, A >::minElement

(

)

[inline]

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

template<class T, class A = std:: allocator < T >>

size_type RWTValOrderedVector< T, A >::occurrencesOf

(

const_reference

a

)

const [inline]

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

template<class T, class A = std:: allocator < T >>

size_type RWTValOrderedVector< T, A >::occurrencesOf	(	bool(*)(const_reference, void *)	fn,
		void *	d
	)			const [inline]

Returns the number of elements t in self such that the expression ((*fn)(t,d)) is true. Client data may be passed through parameter d.

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::operator!=

(

const RWTValOrderedVector< T, A > &

rwc

)

const [inline]

Returns the negation of operator==().

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::operator!=

(

const container_type &

stdc

)

const [inline]

Returns the negation of operator==().

template<class T, class A = std:: allocator < T >>

const_reference RWTValOrderedVector< T, A >::operator()

(

size_type

i

)

const [inline]

Returns a reference to the i ^th element of self. Index i should be between 0 and one less than the number of entries, otherwise the results are undefined.

Note:

No bounds checking is performed.

template<class T, class A = std:: allocator < T >>

reference RWTValOrderedVector< T, A >::operator()

(

size_type

i

)

[inline]

Returns a reference to the i ^th element of self. Index i should be between 0 and one less than the number of entries, otherwise the results are undefined.

Note:

No bounds checking is performed.

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::operator<

(

const RWTValOrderedVector< T, A > &

vec

)

const [inline]

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

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::operator<

(

const container_type &

vec

)

const [inline]

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

template<class T, class A = std:: allocator < T >>

RWTValOrderedVector<T ,A >& RWTValOrderedVector< T, A >::operator=

(

const container_type &

vec

)

[inline]

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

template<class T, class A = std:: allocator < T >>

RWTValOrderedVector<T ,A >& RWTValOrderedVector< T, A >::operator=

(

RWTValOrderedVector< T, A > &&

vec

)

[inline]

Move assignment. Self takes ownership of the data owned by vec.

Condition:

This method is only available on platforms with rvalue reference support.

template<class T, class A = std:: allocator < T >>

RWTValOrderedVector<T ,A >& RWTValOrderedVector< T, A >::operator=

(

const RWTValOrderedVector< T, A > &

vec

)

[inline]

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

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::operator==

(

const RWTValOrderedVector< T, A > &

vec

)

const [inline]

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.

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::operator==

(

const container_type &

vec

)

const [inline]

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.

template<class T, class A = std:: allocator < T >>

const_reference RWTValOrderedVector< T, A >::operator[]

(

size_type

i

)

const [inline]

Returns a reference to the i ^th element of self.

Exceptions:

RWBoundsErr

Thrown if index i is not between 0 and one less than the number of entries in self.

template<class T, class A = std:: allocator < T >>

reference RWTValOrderedVector< T, A >::operator[]

(

size_type

i

)

[inline]

Returns a reference to the i ^th element of self.

Exceptions:

RWBoundsErr

Thrown if index i is not between 0 and one less than the number of entries in self.

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::prepend

(

value_type &&

a

)

[inline]

Adds the item a to the beginning of the collection.

Condition:

This method is only available on platforms with rvalue reference support.

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::prepend

(

const_reference

a

)

[inline]

Adds the item a to the beginning of the collection.

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::remove	(	bool(*)(const_reference, void *)	fn,
		void *	d
	)			[inline]

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. Client data may be passed through parameter d.

template<class T, class A = std:: allocator < T >>

bool RWTValOrderedVector< T, A >::remove

(

const_reference

a

)

[inline]

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.

template<class T, class A = std:: allocator < T >>

size_type RWTValOrderedVector< T, A >::removeAll

(

const_reference

a

)

[inline]

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

template<class T, class A = std:: allocator < T >>

size_type RWTValOrderedVector< T, A >::removeAll	(	bool(*)(const_reference, void *)	fn,
		void *	d
	)			[inline]

Removes all elements t in self such that the expression ((*fn)(t,d)) is true. Returns the number of items removed. Client data may be passed through parameter d.

template<class T, class A = std:: allocator < T >>

value_type RWTValOrderedVector< T, A >::removeAt

(

size_type

i

)

[inline]

Removes and returns the item at position i in self.

Exceptions:

RWBoundsErr

Thrown if this position is not between 0 and one less than the number of entries in the collection.

template<class T, class A = std:: allocator < T >>

value_type RWTValOrderedVector< T, A >::removeFirst

(

)

[inline]

Removes and returns the first item in the collection.

template<class T, class A = std:: allocator < T >>

value_type RWTValOrderedVector< T, A >::removeLast

(

)

[inline]

Removes and returns the last item in the collection.

template<class T, class A = std:: allocator < T >>

size_type RWTValOrderedVector< T, A >::replaceAll	(	const value_type &	oldVal,
		const value_type &	newVal
	)			[inline]

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

template<class T, class A = std:: allocator < T >>

size_type RWTValOrderedVector< T, A >::replaceAll	(	bool(*)(const value_type &, void *)	fn,
		void *	d,
		const value_type &	newVal
	)			[inline]

Replaces all elements t in self such that the expression ((*fn)(t,d)) is true. Returns the number of items replaced. Client data may be passed through parameter d.

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::resize

(

size_t

n

)

[inline]

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

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::sort

(

)

[inline]

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

template<class T, class A = std:: allocator < T >>

const container_type& RWTValOrderedVector< T, A >::std

(

)

const [inline]

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.

template<class T, class A = std:: allocator < T >>

container_type& RWTValOrderedVector< T, A >::std

(

)

[inline]

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.

template<class T, class A = std:: allocator < T >>

void RWTValOrderedVector< T, A >::swap

(

RWTValOrderedVector< T, A > &

rhs

)

[inline]

Swaps the data owned by self with the data owned by rhs.

---

Friends And Related Function Documentation

template<class T , class A >

RWFile & operator<<	(	RWFile &	strm,
		const RWTValOrderedVector< T, A > &	coll
	)			[related]

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

template<class T , class A >

RWvostream & operator<<	(	RWvostream &	strm,
		const RWTValOrderedVector< T, A > &	coll
	)			[related]

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

template<class T , class A >

RWFile & operator>>	(	RWFile &	strm,
		RWTValOrderedVector< T, A > *&	p
	)			[related]

Looks at the next object on the RWFile 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 the application is responsible for deleting it.

template<class T , class A >

RWvistream & operator>>	(	RWvistream &	strm,
		RWTValOrderedVector< T, A > *&	p
	)			[related]

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 the application is responsible for deleting it.

template<class T , class A >

RWFile & operator>>	(	RWFile &	strm,
		RWTValOrderedVector< T, A > &	coll
	)			[related]

Restores the contents of the collection coll from the RWFile strm.

template<class T , class A >

RWvistream & operator>>	(	RWvistream &	strm,
		RWTValOrderedVector< T, A > &	coll
	)			[related]

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