RWTValSortedVector< T, C, A > Class Template Reference

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

#include <rw/tvsrtvec.h>

Public Types
typedef container_type::allocator_type	allocator_type
typedef container_type::const_iterator	const_iterator
typedef container_type::const_pointer	const_pointer
typedef container_type::const_reference	const_reference
typedef container_type::const_reverse_iterator	const_reverse_iterator
typedef std::vector< T, A >	container_type
typedef container_type::difference_type	difference_type
typedef container_type::iterator	iterator
typedef C	key_compare
typedef container_type::pointer	pointer
typedef container_type::reference	reference
typedef container_type::reverse_iterator	reverse_iterator
typedef container_type::size_type	size_type
typedef C	value_compare
typedef container_type::value_type	value_type

Public Member Functions
	RWTValSortedVector ()
	RWTValSortedVector (const container_type &vec)
	RWTValSortedVector (const RWTValSortedVector< T, C, A > &t)
	RWTValSortedVector (container_type &&rhs)
template<typename InputIterator >
	RWTValSortedVector (InputIterator first, InputIterator last)
	RWTValSortedVector (RWTValSortedVector &&rhs)
	RWTValSortedVector (size_type n)
	RWTValSortedVector (size_type n, const value_type &val)
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
size_type	capacity () const
const_iterator	cbegin () const
const_iterator	cend () const
void	clear ()
bool	contains (bool(*fn)(const_reference, void *), void *d) const
bool	contains (const value_type &a) const
const_reverse_iterator	crbegin () const
const_reverse_iterator	crend () const
const_pointer	data () const
iterator	end ()
const_iterator	end () const
size_type	entries () const
iterator	erase (iterator first, iterator last)
iterator	erase (iterator pos)
bool	find (bool(*fn)(const_reference, void *), void *d, value_type &k) const
bool	find (const value_type &a, value_type &k) const
reference	first ()
const_reference	first () const
size_type	index (bool(*fn)(const_reference, void *), void *d) const
size_type	index (const value_type &a) const
size_type	insert (const container_type &a)
bool	insert (const value_type &a)
template<typename InputIterator >
void	insert (InputIterator first, InputIterator last)
iterator	insert (iterator hint, const value_type &val)
iterator	insert (iterator hint, value_type &&val)
bool	insert (value_type &&a)
bool	isEmpty () const
bool	isSorted () const
reference	last ()
const_reference	last () const
size_type	length () const
size_type	merge (const RWTValSortedVector< T, C, A > &coll)
size_type	occurrencesOf (bool(*fn)(const_reference, void *), void *d) const
size_type	occurrencesOf (const value_type &a) const
reference	operator() (size_type i)
const_reference	operator() (size_type i) const
RWTValSortedVector &	operator= (const container_type &rhs)
RWTValSortedVector &	operator= (const RWTValSortedVector &rhs)
RWTValSortedVector &	operator= (container_type &&rhs)
RWTValSortedVector &	operator= (RWTValSortedVector &&rhs)
reference	operator[] (size_type i)
const_reference	operator[] (size_type i) const
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
bool	remove (bool(*fn)(const_reference, void *), void *d)
bool	remove (const value_type &a)
size_type	removeAll (bool(*fn)(const_reference, void *), void *d)
size_type	removeAll (const value_type &a)
value_type	removeAt (size_type i)
value_type	removeFirst ()
value_type	removeLast ()
reverse_iterator	rend ()
const_reverse_iterator	rend () const
void	resize (size_t n)
container_type &	std ()
const container_type &	std () const
void	swap (RWTValSortedVector< T, C, A > &rhs)

Related Symbols
(Note that these are not member symbols.)
template<class T , class C , class A >
bool	operator!= (const RWTValSortedVector< T, C, A > &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
bool	operator!= (const RWTValSortedVector< T, C, A > &lhs, const typename RWTValSortedVector< T, C, A >::container_type &rhs)
template<class T , class C , class A >
bool	operator!= (const typename RWTValSortedVector< T, C, A >::container_type &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
bool	operator< (const RWTValSortedVector< T, C, A > &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
bool	operator< (const RWTValSortedVector< T, C, A > &lhs, const typename RWTValSortedVector< T, C, A >::container_type &rhs)
template<class T , class C , class A >
bool	operator< (const typename RWTValSortedVector< T, C, A >::container_type &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
RWFile &	operator<< (RWFile &strm, const RWTValSortedVector< T, C, A > &coll)
template<class T , class C , class A >
RWvostream &	operator<< (RWvostream &strm, const RWTValSortedVector< T, C, A > &coll)
template<class T , class C , class A >
bool	operator<= (const RWTValSortedVector< T, C, A > &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
bool	operator<= (const RWTValSortedVector< T, C, A > &lhs, const typename RWTValSortedVector< T, C, A >::container_type &rhs)
template<class T , class C , class A >
bool	operator<= (const typename RWTValSortedVector< T, C, A >::container_type &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
bool	operator== (const RWTValSortedVector< T, C, A > &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
bool	operator== (const RWTValSortedVector< T, C, A > &lhs, const typename RWTValSortedVector< T, C, A >::container_type &rhs)
template<class T , class C , class A >
bool	operator== (const typename RWTValSortedVector< T, C, A >::container_type &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
bool	operator> (const RWTValSortedVector< T, C, A > &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
bool	operator> (const RWTValSortedVector< T, C, A > &lhs, const typename RWTValSortedVector< T, C, A >::container_type &rhs)
template<class T , class C , class A >
bool	operator> (const typename RWTValSortedVector< T, C, A >::container_type &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
bool	operator>= (const RWTValSortedVector< T, C, A > &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
bool	operator>= (const RWTValSortedVector< T, C, A > &lhs, const typename RWTValSortedVector< T, C, A >::container_type &rhs)
template<class T , class C , class A >
bool	operator>= (const typename RWTValSortedVector< T, C, A >::container_type &lhs, const RWTValSortedVector< T, C, A > &rhs)
template<class T , class C , class A >
RWFile &	operator>> (RWFile &strm, RWTValSortedVector< T, C, A > &coll)
template<class T , class C , class A >
RWFile &	operator>> (RWFile &strm, RWTValSortedVector< T, C, A > *&p)
template<class T , class C , class A >
RWvistream &	operator>> (RWvistream &strm, RWTValSortedVector< T, C, A > &coll)
template<class T , class C , class A >
RWvistream &	operator>> (RWvistream &strm, RWTValSortedVector< T, C, A > *&p)

Detailed Description

template<class T, class C = std::less<T>, class A = std::allocator<T>>
class RWTValSortedVector< T, C, A >

This class maintains an always-sorted 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/tvsrtvec.h>
RWTValSortedVector<T, C, A> srtvec;

See also

RWTValSortedDlist is an alternative always-sorted collection. RWTValOrderedVector is an unsorted vector of values.

Class RWTValSortedVector<bool,C,A> provides a space-efficient vector of boolean values.

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

Persistence

Isomorphic

Example

//
// tvsvcdat.cpp
//
#include <functional>
#include <iostream>
 
#include <rw/tools/datetime.h>
#include <rw/tvsrtvec.h>
 
int main() {
  RWTValSortedVector<RWDateTime, std::less<RWDateTime> > vec;
 
  vec.insert(RWDateTime("Aug 10, 1991", RWDateTime::setDate));
  vec.insert(RWDateTime("Aug 9, 1991", RWDateTime::setDate));
  vec.insert(RWDateTime("Sep 1, 1991", RWDateTime::setDate));
  vec.insert(RWDateTime("May 14, 1990", RWDateTime::setDate));
  // Add a duplicate
  vec.insert(RWDateTime("Sep 1, 1991", RWDateTime::setDate));
  vec.insert(RWDateTime("June 2, 1991", RWDateTime::setDate));
 
  for (size_t i = 0; i < vec.entries(); ++i) {
    std::cout << vec[i].asString('x') << "\n";
  }
 
  return 0;
}

Program Output:

05/14/90
06/02/91
08/09/91
08/10/91
09/01/91
09/01/91

Member Typedef Documentation

allocator_type

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

typedef container_type::allocator_type RWTValSortedVector< T, C, A >::allocator_type

A type representing the allocator type for the container.

const_iterator

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

typedef container_type::const_iterator RWTValSortedVector< T, C, A >::const_iterator

A type that provides a const random-access iterator over the elements in the container.

const_pointer

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

typedef container_type::const_pointer RWTValSortedVector< T, C, A >::const_pointer

A type that provides a const pointer to an element in the container.

const_reference

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

typedef container_type::const_reference RWTValSortedVector< T, C, A >::const_reference

A type that provides a const reference to an element in the container.

const_reverse_iterator

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

typedef container_type::const_reverse_iterator RWTValSortedVector< T, C, A >::const_reverse_iterator

A type that provides a const random-access, reverse-order iterator over the elements in the container.

container_type

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

typedef std::vector<T, A> RWTValSortedVector< T, C, A >::container_type

A type representing the underlying implementation container.

difference_type

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

typedef container_type::difference_type RWTValSortedVector< T, C, A >::difference_type

A signed integral type used to indicate the distance between two valid iterators on the same container.

iterator

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

typedef container_type::iterator RWTValSortedVector< T, C, A >::iterator

A type that provides a random-access iterator over the elements in the container.

key_compare

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

typedef C RWTValSortedVector< T, C, A >::key_compare

A type representing the comparison function.

pointer

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

typedef container_type::pointer RWTValSortedVector< T, C, A >::pointer

A type that provides a pointer to an element in the container.

reference

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

typedef container_type::reference RWTValSortedVector< T, C, A >::reference

A type that provides a reference to an element in the container.

reverse_iterator

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

typedef container_type::reverse_iterator RWTValSortedVector< T, C, A >::reverse_iterator

A type that provides a random-access, reverse-order iterator over the elements in the container.

size_type

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

typedef container_type::size_type RWTValSortedVector< T, C, A >::size_type

An unsigned integral type used for counting the number of elements in the container.

value_compare

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

typedef C RWTValSortedVector< T, C, A >::value_compare

A type representing the comparison function.

value_type

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

typedef container_type::value_type RWTValSortedVector< T, C, A >::value_type

A type representing the container's data type.

Constructor & Destructor Documentation

RWTValSortedVector() [1/8]

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

RWTValSortedVector< T, C, A >::RWTValSortedVector ( )

inline

Constructs an empty vector.

RWTValSortedVector() [2/8]

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

RWTValSortedVector< T, C, A >::RWTValSortedVector ( const RWTValSortedVector< T, C, A > & t )

inline

Copy constructor.

RWTValSortedVector() [3/8]

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

RWTValSortedVector< T, C, A >::RWTValSortedVector ( const container_type & vec )

inline

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

RWTValSortedVector() [4/8]

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

RWTValSortedVector< T, C, A >::RWTValSortedVector ( size_type n, const value_type & val )

inline

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

RWTValSortedVector() [5/8]

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

template<typename InputIterator >

RWTValSortedVector< T, C, A >::RWTValSortedVector ( InputIterator first, InputIterator last )

inline

Constructs a vector by copying elements from the range [first, last).

InputIterator is an input iterator type that points to elements that are convertible to value_type objects.

RWTValSortedVector() [6/8]

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

RWTValSortedVector< T, C, A >::RWTValSortedVector ( size_type n )

inline

Constructs an empty vector with a capacity of n elements.

RWTValSortedVector() [7/8]

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

RWTValSortedVector< T, C, A >::RWTValSortedVector ( RWTValSortedVector< T, C, A > && rhs )

inline

Move constructor. The constructed instance takes ownership of the data owned by rhs.

Condition:

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

RWTValSortedVector() [8/8]

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

RWTValSortedVector< T, C, A >::RWTValSortedVector ( container_type && rhs )

inline

Move constructor. The constructed instance sorts and takes ownership of the data owned by rhs.

Condition:

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

Member Function Documentation

apply()

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

void RWTValSortedVector< T, C, A >::apply ( void(* fn )(const_reference, void *), void * d ) const

inline

Invokes the function pointer fn on each item in the collection. Client data may be passed through parameter d.

at() [1/2]

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

reference RWTValSortedVector< T, C, 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.

at() [2/2]

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

const_reference RWTValSortedVector< T, C, 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.

begin() [1/2]

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

iterator RWTValSortedVector< T, C, A >::begin ( )

inline

Returns an iterator referring to the first element in the container.

If the container is empty, returns end().

begin() [2/2]

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

const_iterator RWTValSortedVector< T, C, A >::begin ( ) const

inline

Returns an iterator referring to the first element in the container.

If the container is empty, returns end().

capacity()

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

size_type RWTValSortedVector< T, C, A >::capacity ( ) const

inline

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

cbegin()

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

const_iterator RWTValSortedVector< T, C, A >::cbegin ( ) const

inline

Returns an iterator referring to the first element in the container.

If the container is empty, returns end().

cend()

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

const_iterator RWTValSortedVector< T, C, A >::cend ( ) const

inline

Returns an iterator referring to the element after the last element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

clear()

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

void RWTValSortedVector< T, C, A >::clear ( )

inline

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

contains() [1/2]

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

bool RWTValSortedVector< T, C, A >::contains ( bool(* fn )(const_reference, void *), 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.

contains() [2/2]

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

bool RWTValSortedVector< T, C, A >::contains ( const value_type & a ) const

inline

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

crbegin()

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

const_reverse_iterator RWTValSortedVector< T, C, A >::crbegin ( ) const

inline

Returns an iterator referring to the last element in the container.

If the container is empty, returns rend().

crend()

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

const_reverse_iterator RWTValSortedVector< T, C, A >::crend ( ) const

inline

Returns an iterator referring to the element before the first element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

data()

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

const_pointer RWTValSortedVector< T, C, A >::data ( ) const

inline

Returns a pointer to the first element of the vector. The value returned is undefined if the vector is empty.

end() [1/2]

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

iterator RWTValSortedVector< T, C, A >::end ( )

inline

Returns an iterator referring to the element after the last element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

end() [2/2]

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

const_iterator RWTValSortedVector< T, C, A >::end ( ) const

inline

Returns an iterator referring to the element after the last element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

entries()

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

size_type RWTValSortedVector< T, C, A >::entries ( ) const

inline

Returns the number of elements in self.

erase() [1/2]

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

iterator RWTValSortedVector< T, C, A >::erase ( iterator first, iterator last )

inline

Removes the items in the range [first, last) from the collection. Returns an iterator that points to the next item in the collection, or end() if the last item in the collection was removed.

erase() [2/2]

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

iterator RWTValSortedVector< T, C, A >::erase ( iterator pos )

inline

Removes the item pointed to by pos from the collection. Returns an iterator that points to the next item in the collection, or end() if the last item in the collection was removed.

find() [1/2]

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

bool RWTValSortedVector< T, C, A >::find ( bool(* fn )(const_reference, void *), 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.

find() [2/2]

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

bool RWTValSortedVector< T, C, A >::find ( const value_type & 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.

first() [1/2]

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

reference RWTValSortedVector< T, C, A >::first ( )

inline

Returns a reference to the first item in the collection.

Calling this function on an empty collection results in undefined behavior.

first() [2/2]

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

const_reference RWTValSortedVector< T, C, A >::first ( ) const

inline

Returns a reference to the first item in the collection.

Calling this function on an empty collection results in undefined behavior.

index() [1/2]

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

size_type RWTValSortedVector< T, C, A >::index ( bool(* fn )(const_reference, void *), 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.

index() [2/2]

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

size_type RWTValSortedVector< T, C, A >::index ( const value_type & 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.

insert() [1/6]

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

size_type RWTValSortedVector< T, C, A >::insert

(

const container_type &

a

)

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

insert() [2/6]

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

bool RWTValSortedVector< T, C, A >::insert ( const value_type & a )

inline

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

insert() [3/6]

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

template<typename InputIterator >

void RWTValSortedVector< T, C, A >::insert ( InputIterator first, InputIterator last )

inline

Inserts the elements in the range [first, last) into self.

InputIterator is an input iterator type that points to elements that are convertible to value_type objects.

insert() [4/6]

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

iterator RWTValSortedVector< T, C, A >::insert ( iterator hint, const value_type & val )

inline

Inserts val into self. Returns an iterator to the new item.

The hint parameter indicates where in the collection the new value should be inserted. This value is only a hint, and will be ignored if the value should be inserted at a different location according to the containers comparison object.

insert() [5/6]

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

iterator RWTValSortedVector< T, C, A >::insert ( iterator hint, value_type && val )

inline

Inserts val into self. Returns an iterator to the new item.

The hint parameter indicates where in the collection the new value should be inserted. This value is only a hint, and will be ignored if the value should be inserted at a different location according to the containers comparison object.

Condition:

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

insert() [6/6]

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

bool RWTValSortedVector< T, C, A >::insert ( value_type && a )

inline

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

Condition:

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

isEmpty()

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

bool RWTValSortedVector< T, C, A >::isEmpty ( ) const

inline

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

isSorted()

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

bool RWTValSortedVector< T, C, A >::isSorted ( ) const

inline

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

last() [1/2]

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

reference RWTValSortedVector< T, C, A >::last ( )

inline

Returns a reference to the last item in the collection.

Calling this function on an empty collection results in undefined behavior.

last() [2/2]

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

const_reference RWTValSortedVector< T, C, A >::last ( ) const

inline

Returns a reference to the last item in the collection.

Calling this function on an empty collection results in undefined behavior.

length()

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

size_type RWTValSortedVector< T, C, A >::length ( ) const

inline

Returns the number of elements in self.

Deprecated

As of SourcePro 13, use entries() instead.

merge()

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

size_type RWTValSortedVector< T, C, A >::merge

(

const RWTValSortedVector< T, C, A > &

coll

)

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

occurrencesOf() [1/2]

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

size_type RWTValSortedVector< T, C, A >::occurrencesOf ( bool(* fn )(const_reference, void *), 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.

occurrencesOf() [2/2]

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

size_type RWTValSortedVector< T, C, A >::occurrencesOf ( const value_type & a ) const

inline

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

operator()() [1/2]

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

reference RWTValSortedVector< T, C, 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.

operator()() [2/2]

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

const_reference RWTValSortedVector< T, C, 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.

operator=() [1/4]

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

RWTValSortedVector & RWTValSortedVector< T, C, A >::operator= ( const container_type & rhs )

inline

Assignment operator. Copies and sorts elements from the data in rhs.

operator=() [2/4]

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

RWTValSortedVector & RWTValSortedVector< T, C, A >::operator= ( const RWTValSortedVector< T, C, A > & rhs )

inline

Assignment operator.

operator=() [3/4]

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

RWTValSortedVector & RWTValSortedVector< T, C, A >::operator= ( container_type && rhs )

inline

Move assignment. Self sorts and takes ownership of the data owned by rhs.

Condition:

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

operator=() [4/4]

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

RWTValSortedVector & RWTValSortedVector< T, C, A >::operator= ( RWTValSortedVector< T, C, A > && rhs )

inline

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

Condition:

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

operator[]() [1/2]

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

reference RWTValSortedVector< T, C, 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.

operator[]() [2/2]

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

const_reference RWTValSortedVector< T, C, 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.

rbegin() [1/2]

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

reverse_iterator RWTValSortedVector< T, C, A >::rbegin ( )

inline

Returns an iterator referring to the last element in the container.

If the container is empty, returns rend().

rbegin() [2/2]

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

const_reverse_iterator RWTValSortedVector< T, C, A >::rbegin ( ) const

inline

Returns an iterator referring to the last element in the container.

If the container is empty, returns rend().

remove() [1/2]

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

bool RWTValSortedVector< T, C, A >::remove ( bool(* fn )(const_reference, void *), 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.

remove() [2/2]

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

bool RWTValSortedVector< T, C, A >::remove ( const value_type & 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.

removeAll() [1/2]

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

size_type RWTValSortedVector< T, C, A >::removeAll ( bool(* fn )(const_reference, void *), 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.

removeAll() [2/2]

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

size_type RWTValSortedVector< T, C, A >::removeAll

(

const value_type &

a

)

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

removeAt()

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

value_type RWTValSortedVector< T, C, A >::removeAt

(

size_type

i

)

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.

removeFirst()

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

value_type RWTValSortedVector< T, C, A >::removeFirst ( )

inline

Removes and returns the first item in the collection.

Calling this function on an empty collection results in undefined behavior.

removeLast()

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

value_type RWTValSortedVector< T, C, A >::removeLast ( )

inline

Removes and returns the last item in the collection.

Calling this function on an empty collection results in undefined behavior.

rend() [1/2]

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

reverse_iterator RWTValSortedVector< T, C, A >::rend ( )

inline

Returns an iterator referring to the element before the first element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

rend() [2/2]

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

const_reverse_iterator RWTValSortedVector< T, C, A >::rend ( ) const

inline

Returns an iterator referring to the element before the first element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

resize()

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

void RWTValSortedVector< T, C, A >::resize ( size_t n )

inline

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

std() [1/2]

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

container_type & RWTValSortedVector< T, C, A >::std ( )

inline

Returns a reference to the underlying C++ Standard Library collection that serves as the implementation for self. It is the application's responsibility to not violate the ordering of the elements within the collection.

std() [2/2]

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

const container_type & RWTValSortedVector< T, C, A >::std ( ) const

inline

Returns a reference to the underlying C++ Standard Library collection that serves as the implementation for self. It is the application's responsibility to not violate the ordering of the elements within the collection.

swap()

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

void RWTValSortedVector< T, C, A >::swap ( RWTValSortedVector< T, C, A > & rhs )

inline

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

Friends And Related Symbol Documentation

operator!=() [1/3]

template<class T , class C , class A >

bool operator!= ( const RWTValSortedVector< T, C, A > & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Equivalent to !(lhs == rhs).

operator!=() [2/3]

template<class T , class C , class A >

bool operator!= ( const RWTValSortedVector< T, C, A > & lhs, const typename RWTValSortedVector< T, C, A >::container_type & rhs )

related

Equivalent to !(lhs == rhs).

operator!=() [3/3]

template<class T , class C , class A >

bool operator!= ( const typename RWTValSortedVector< T, C, A >::container_type & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Equivalent to !(lhs == rhs).

operator<() [1/3]

template<class T , class C , class A >

bool operator< ( const RWTValSortedVector< T, C, A > & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Returns true if lhs is lexicographically less than rhs, otherwise false. Assumes that type T has well-defined less-than semantics.

operator<() [2/3]

template<class T , class C , class A >

bool operator< ( const RWTValSortedVector< T, C, A > & lhs, const typename RWTValSortedVector< T, C, A >::container_type & rhs )

related

Returns true if lhs is lexicographically less than rhs, otherwise false. Assumes that type T has well-defined less-than semantics.

operator<() [3/3]

template<class T , class C , class A >

bool operator< ( const typename RWTValSortedVector< T, C, A >::container_type & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Returns true if lhs is lexicographically less than rhs, otherwise false. Assumes that type T has well-defined less-than semantics.

operator<<() [1/2]

template<class T , class C , class A >

RWFile & operator<< ( RWFile & strm, const RWTValSortedVector< T, C, A > & coll )

related

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

operator<<() [2/2]

template<class T , class C , class A >

RWvostream & operator<< ( RWvostream & strm, const RWTValSortedVector< T, C, A > & coll )

related

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

operator<=() [1/3]

template<class T , class C , class A >

bool operator<= ( const RWTValSortedVector< T, C, A > & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Equivalent to !(rhs < lhs).

operator<=() [2/3]

template<class T , class C , class A >

bool operator<= ( const RWTValSortedVector< T, C, A > & lhs, const typename RWTValSortedVector< T, C, A >::container_type & rhs )

related

Equivalent to !(rhs < lhs).

operator<=() [3/3]

template<class T , class C , class A >

bool operator<= ( const typename RWTValSortedVector< T, C, A >::container_type & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Equivalent to !(rhs < lhs).

operator==() [1/3]

template<class T , class C , class A >

bool operator== ( const RWTValSortedVector< T, C, A > & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Returns true if lhs and rhs are equal, otherwise false. Two collections are equal if both have the same number of entries, and iterating through both collections produces individual elements that, in turn, compare equal to each other.

operator==() [2/3]

template<class T , class C , class A >

bool operator== ( const RWTValSortedVector< T, C, A > & lhs, const typename RWTValSortedVector< T, C, A >::container_type & rhs )

related

Returns true if lhs and rhs are equal, otherwise false. Two collections are equal if both have the same number of entries, and iterating through both collections produces individual elements that, in turn, compare equal to each other.

operator==() [3/3]

template<class T , class C , class A >

bool operator== ( const typename RWTValSortedVector< T, C, A >::container_type & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Returns true if lhs and rhs are equal, otherwise false. Two collections are equal if both have the same number of entries, and iterating through both collections produces individual elements that, in turn, compare equal to each other.

operator>() [1/3]

template<class T , class C , class A >

bool operator> ( const RWTValSortedVector< T, C, A > & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Equivalent to (rhs < lhs).

operator>() [2/3]

template<class T , class C , class A >

bool operator> ( const RWTValSortedVector< T, C, A > & lhs, const typename RWTValSortedVector< T, C, A >::container_type & rhs )

related

Equivalent to (rhs < lhs).

operator>() [3/3]

template<class T , class C , class A >

bool operator> ( const typename RWTValSortedVector< T, C, A >::container_type & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Equivalent to (rhs < lhs).

operator>=() [1/3]

template<class T , class C , class A >

bool operator>= ( const RWTValSortedVector< T, C, A > & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Equivalent to !(lhs < rhs).

operator>=() [2/3]

template<class T , class C , class A >

bool operator>= ( const RWTValSortedVector< T, C, A > & lhs, const typename RWTValSortedVector< T, C, A >::container_type & rhs )

related

Equivalent to !(lhs < rhs).

operator>=() [3/3]

template<class T , class C , class A >

bool operator>= ( const typename RWTValSortedVector< T, C, A >::container_type & lhs, const RWTValSortedVector< T, C, A > & rhs )

related

Equivalent to !(lhs < rhs).

operator>>() [1/4]

template<class T , class C , class A >

RWFile & operator>> ( RWFile & strm, RWTValSortedVector< T, C, A > & coll )

related

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

operator>>() [2/4]

template<class T , class C , class A >

RWFile & operator>> ( RWFile & strm, RWTValSortedVector< T, C, 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.

operator>>() [3/4]

template<class T , class C , class A >

RWvistream & operator>> ( RWvistream & strm, RWTValSortedVector< T, C, A > & coll )

related

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

operator>>() [4/4]

template<class T , class C , class A >

RWvistream & operator>> ( RWvistream & strm, RWTValSortedVector< T, C, 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.