RWTValSlist< T, A > Class Template Reference

Maintains a collection of values implemented as a singly-linked list. More...

#include <rw/tvslist.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 rw_slist< T, A >	container_type
typedef container_type::difference_type	difference_type
typedef container_type::iterator	iterator
typedef container_type::pointer	pointer
typedef container_type::reference	reference
typedef container_type::size_type	size_type
typedef container_type::value_type	value_type

Public Member Functions
	RWTValSlist ()
	RWTValSlist (const rw_slist< T, A > &lst)
	RWTValSlist (const RWTValSlist< T, A > &lst)
	RWTValSlist (container_type &&lst)
template<typename InputIterator >
	RWTValSlist (InputIterator first, InputIterator last)
	RWTValSlist (RWTValSlist< T, A > &&lst)
	RWTValSlist (size_type n, const value_type &val=value_type())
void	append (const value_type &a)
void	append (value_type &&a)
void	apply (void(*fn)(const_reference, void *), void *d) const
void	apply (void(*fn)(reference, void *), void *d)
template<typename InputIterator >
void	assign (InputIterator first, InputIterator last)
reference	at (size_type i)
const_reference	at (size_type i) const
iterator	begin ()
const_iterator	begin () 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
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
value_type	get ()
size_type	index (bool(*fn)(const_reference, void *), void *d) const
size_type	index (const value_type &a) const
bool	insert (const value_type &a)
iterator	insert (iterator pos, const value_type &val)
template<typename InputIterator >
void	insert (iterator pos, InputIterator first, InputIterator last)
void	insert (iterator pos, size_type n, const value_type &val)
iterator	insert (iterator pos, value_type &&val)
bool	insert (value_type &&a)
void	insertAt (size_type i, const value_type &a)
void	insertAt (size_type i, value_type &&a)
bool	isEmpty () const
reference	last ()
const_reference	last () const
reference	maxElement ()
const_reference	maxElement () const
reference	minElement ()
const_reference	minElement () const
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
RWTValSlist< T, A > &	operator= (const rw_slist< T, A > &rhs)
RWTValSlist< T, A > &	operator= (const RWTValSlist< T, A > &rhs)
RWTValSlist< T, A > &	operator= (container_type &&rhs)
RWTValSlist< T, A > &	operator= (RWTValSlist< T, A > &&rhs)
reference	operator[] (size_type i)
const_reference	operator[] (size_type i) const
void	prepend (const value_type &a)
void	prepend (value_type &&a)
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 ()
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)
void	sort ()
container_type &	std ()
const container_type &	std () const
void	swap (RWTValSlist< T, A > &rhs)

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

Detailed Description

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

This class maintains a collection of values, implemented as a singly-linked list. The value type must have operator== and operator< defined. This requirement is imposed by the C++ Standard Library.

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.

Synopsis

#include <rw/tvslist.h>
RWTValSlist<T, A> lst;

See also

Classes RWTValDeque, RWTValDlist, and RWTValOrderedVector also provide a Rogue Wave interface to C++ Standard Library sequence collections.

The Rogue Wave supplied, Standard Library-compliant class rw_slist is the collection that serves as the underlying implementation for this class.

Persistence

Isomorphic

Example

//
// tvslint.cpp
//
#include <rw/tvslist.h>
#include <iostream>
 
void div5(int& x, void*) { x /= 5; }
 
int main() {
  const int vec[10] = {45, 10, 5, 15, 25, 30, 35, 20, 40, 50};
 
  RWTValSlist<int> lst(vec, vec + 10);
  RWTValSlistIterator<int> itr(lst);
 
  lst.apply(div5, 0);
  lst.sort();
 
  for (; itr();) {
    std::cout << itr.key() << " ";
  }
 
  std::cout << std::endl;
 
  return 0;
}

Program Output:

1 2 3 4 5 6 7 8 9 10

Member Typedef Documentation

allocator_type

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

typedef container_type::allocator_type RWTValSlist< T, A >::allocator_type

A type representing the allocator type for the container.

const_iterator

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

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

A type that provides a const forward iterator over the elements in the container.

const_pointer

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

typedef container_type::const_pointer RWTValSlist< T, A >::const_pointer

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

const_reference

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

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

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

container_type

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

typedef rw_slist<T, A> RWTValSlist< T, A >::container_type

A type representing the underlying implementation container.

difference_type

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

typedef container_type::difference_type RWTValSlist< T, 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 A = std::allocator<T>>

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

A type that provides a forward iterator over the elements in the container.

pointer

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

typedef container_type::pointer RWTValSlist< T, A >::pointer

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

reference

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

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

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

size_type

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

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

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

value_type

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

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

A type representing the container's data type.

Constructor & Destructor Documentation

RWTValSlist() [1/7]

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

RWTValSlist< T, A >::RWTValSlist ( )

inline

Constructs an empty, singly-linked list.

RWTValSlist() [2/7]

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

RWTValSlist< T, A >::RWTValSlist ( const rw_slist< T, A > & lst )

inline

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

RWTValSlist() [3/7]

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

RWTValSlist< T, A >::RWTValSlist ( const RWTValSlist< T, A > & lst )

inline

Copy constructor.

RWTValSlist() [4/7]

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

RWTValSlist< T, A >::RWTValSlist ( RWTValSlist< T, A > && lst )

inline

Move constructor. The constructed list takes ownership of the data owned by lst.

Condition:

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

RWTValSlist() [5/7]

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

RWTValSlist< T, A >::RWTValSlist ( container_type && lst )

inline

Move constructor. The constructed list takes ownership of the data owned by lst.

Condition:

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

RWTValSlist() [6/7]

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

RWTValSlist< T, A >::RWTValSlist ( size_type n, const value_type & val = value_type() )

inline

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

RWTValSlist() [7/7]

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

template<typename InputIterator >

RWTValSlist< T, A >::RWTValSlist ( InputIterator first, InputIterator last )

inline

Constructs a double-ended queue 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.

Member Function Documentation

append() [1/2]

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

void RWTValSlist< T, A >::append ( const value_type & a )

inline

Adds the item a to the end of the collection.

append() [2/2]

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

void RWTValSlist< T, A >::append ( value_type && a )

inline

Adds the item a to the end of the collection.

Condition:

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

apply() [1/2]

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

void RWTValSlist< T, 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.

apply() [2/2]

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

void RWTValSlist< T, A >::apply ( void(* fn )(reference, void *), void * d )

inline

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

assign()

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

template<typename InputIterator >

void RWTValSlist< T, A >::assign ( InputIterator first, InputIterator last )

inline

Copies each element in the range [first, last) into self, replacing any existing items.

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

Note

first and last must not be iterators into self.

at() [1/2]

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

reference RWTValSlist< 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.

at() [2/2]

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

const_reference RWTValSlist< 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.

begin() [1/2]

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

iterator RWTValSlist< T, 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 A = std::allocator<T>>

const_iterator RWTValSlist< T, A >::begin ( ) const

inline

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

If the container is empty, returns end().

cbegin()

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

const_iterator RWTValSlist< T, 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 A = std::allocator<T>>

const_iterator RWTValSlist< T, 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 A = std::allocator<T>>

void RWTValSlist< T, 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 A = std::allocator<T>>

bool RWTValSlist< T, 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 A = std::allocator<T>>

bool RWTValSlist< T, 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.

end() [1/2]

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

iterator RWTValSlist< T, 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 A = std::allocator<T>>

const_iterator RWTValSlist< T, 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 A = std::allocator<T>>

size_type RWTValSlist< T, A >::entries ( ) const

inline

Returns the number of elements in self.

erase() [1/2]

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

iterator RWTValSlist< T, 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 A = std::allocator<T>>

iterator RWTValSlist< T, 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 A = std::allocator<T>>

bool RWTValSlist< T, 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 A = std::allocator<T>>

bool RWTValSlist< T, 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 A = std::allocator<T>>

reference RWTValSlist< T, 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 A = std::allocator<T>>

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

get()

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

value_type RWTValSlist< T, A >::get ( )

inline

Removes and returns the first item in the collection.

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

index() [1/2]

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

size_type RWTValSlist< T, A >::index	(	bool(*	fn )(const_reference, void *),
		void *	d ) const

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

index() [2/2]

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

size_type RWTValSlist< T, A >::index

(

const value_type &

a

)

const

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 A = std::allocator<T>>

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

inline

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

insert() [2/6]

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

iterator RWTValSlist< T, A >::insert ( iterator pos, const value_type & val )

inline

Inserts val into self before the element at position pos. Returns an iterator for the newly inserted element.

insert() [3/6]

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

template<typename InputIterator >

void RWTValSlist< T, A >::insert ( iterator pos, InputIterator first, InputIterator last )

inline

Inserts the elements in the range [first, last) into self before the element at position pos.

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

insert() [4/6]

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

void RWTValSlist< T, A >::insert ( iterator pos, size_type n, const value_type & val )

inline

Inserts n instances of val into self before the element at position pos.

insert() [5/6]

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

iterator RWTValSlist< T, A >::insert ( iterator pos, value_type && val )

inline

Inserts val into self before the element at position pos. Returns an iterator for the newly inserted element.

Condition:

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

insert() [6/6]

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

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

inline

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

Condition:

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

insertAt() [1/2]

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

void RWTValSlist< T, A >::insertAt ( size_type i, const 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.

insertAt() [2/2]

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

void RWTValSlist< 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 available only on platforms with rvalue reference support.

isEmpty()

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

bool RWTValSlist< T, A >::isEmpty ( ) const

inline

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

last() [1/2]

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

reference RWTValSlist< T, 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 A = std::allocator<T>>

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

maxElement() [1/2]

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

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

maxElement() [2/2]

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

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

minElement() [1/2]

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

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

minElement() [2/2]

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

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

occurrencesOf() [1/2]

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

size_type RWTValSlist< T, 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 A = std::allocator<T>>

size_type RWTValSlist< T, 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 A = std::allocator<T>>

reference RWTValSlist< 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.

operator()() [2/2]

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

const_reference RWTValSlist< 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.

operator=() [1/4]

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

RWTValSlist< T, A > & RWTValSlist< T, A >::operator= ( const rw_slist< T, A > & rhs )

inline

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

operator=() [2/4]

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

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

inline

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

operator=() [3/4]

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

RWTValSlist< T, A > & RWTValSlist< T, A >::operator= ( container_type && 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=() [4/4]

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

RWTValSlist< T, A > & RWTValSlist< T, A >::operator= ( RWTValSlist< T, 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 A = std::allocator<T>>

reference RWTValSlist< 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.

operator[]() [2/2]

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

const_reference RWTValSlist< 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.

prepend() [1/2]

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

void RWTValSlist< T, A >::prepend ( const value_type & a )

inline

Adds the item a to the beginning of the collection.

prepend() [2/2]

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

void RWTValSlist< T, A >::prepend ( value_type && a )

inline

Adds the item a to the beginning of the collection.

Condition:

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

remove() [1/2]

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

bool RWTValSlist< T, 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 A = std::allocator<T>>

bool RWTValSlist< T, 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 A = std::allocator<T>>

size_type RWTValSlist< T, 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 A = std::allocator<T>>

size_type RWTValSlist< T, A >::removeAll ( const value_type & a )

inline

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 A = std::allocator<T>>

value_type RWTValSlist< T, A >::removeAt

(

size_type

i

)

Removes and returns the item at position i in self.

Exceptions

RWBoundsErr

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

removeFirst()

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

value_type RWTValSlist< T, 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 A = std::allocator<T>>

value_type RWTValSlist< T, A >::removeLast ( )

inline

Removes and returns the last item in the collection.

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

replaceAll() [1/2]

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

size_type RWTValSlist< T, A >::replaceAll ( bool(* fn )(const value_type &, void *), void * d, const value_type & newVal )

inline

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

replaceAll() [2/2]

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

size_type RWTValSlist< T, A >::replaceAll ( const value_type & oldVal, const value_type & newVal )

inline

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

sort()

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

void RWTValSlist< T, A >::sort ( )

inline

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

std() [1/2]

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

container_type & RWTValSlist< T, A >::std ( )

inline

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

std() [2/2]

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

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

inline

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

swap()

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

void RWTValSlist< T, A >::swap ( RWTValSlist< T, 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 A >

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

related

Equivalent to !(lhs == rhs).

operator!=() [2/3]

template<class T , class A >

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

related

Equivalent to !(lhs == rhs).

operator!=() [3/3]

template<class T , class A >

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

related

Equivalent to !(lhs == rhs).

operator<() [1/3]

template<class T , class A >

bool operator< ( const RWTValSlist< T, A > & lhs, const RWTValSlist< T, 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 A >

bool operator< ( const RWTValSlist< T, A > & lhs, const typename RWTValSlist< T, 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 A >

bool operator< ( const typename RWTValSlist< T, A >::container_type & lhs, const RWTValSlist< T, 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 A >

RWFile & operator<< ( RWFile & strm, const RWTValSlist< T, 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 A >

RWvostream & operator<< ( RWvostream & strm, const RWTValSlist< T, 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 A >

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

related

Equivalent to !(rhs < lhs).

operator<=() [2/3]

template<class T , class A >

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

related

Equivalent to !(rhs < lhs).

operator<=() [3/3]

template<class T , class A >

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

related

Equivalent to !(rhs < lhs).

operator==() [1/3]

template<class T , class A >

bool operator== ( const RWTValSlist< T, A > & lhs, const RWTValSlist< T, 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 A >

bool operator== ( const RWTValSlist< T, A > & lhs, const typename RWTValSlist< T, 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 A >

bool operator== ( const typename RWTValSlist< T, A >::container_type & lhs, const RWTValSlist< T, 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 A >

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

related

Equivalent to (rhs < lhs).

operator>() [2/3]

template<class T , class A >

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

related

Equivalent to (rhs < lhs).

operator>() [3/3]

template<class T , class A >

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

related

Equivalent to (rhs < lhs).

operator>=() [1/3]

template<class T , class A >

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

related

Equivalent to !(lhs < rhs).

operator>=() [2/3]

template<class T , class A >

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

related

Equivalent to !(lhs < rhs).

operator>=() [3/3]

template<class T , class A >

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

related

Equivalent to !(lhs < rhs).

operator>>() [1/4]

template<class T , class A >

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

related

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

operator>>() [2/4]

template<class T , class A >

RWFile & operator>> ( RWFile & strm, RWTValSlist< 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.

operator>>() [3/4]

template<class T , class A >

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

related

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

operator>>() [4/4]

template<class T , class A >

RWvistream & operator>> ( RWvistream & strm, RWTValSlist< 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.