RWTValMultiSet< T, C, A > Class Template Reference

Maintains a collection of values ordered according to a comparison object. More...

#include <rw/tvmset.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::multiset< T, C, A >	container_type
typedef container_type::difference_type	difference_type
typedef container_type::iterator	iterator
typedef container_type::key_compare	key_compare
typedef container_type::key_type	key_type
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 container_type::value_compare	value_compare
typedef container_type::value_type	value_type

Public Member Functions
	RWTValMultiSet (const container_type &s)
	RWTValMultiSet (const key_compare &cmp=key_compare())
	RWTValMultiSet (const RWTValMultiSet< T, C, A > &rws)
	RWTValMultiSet (container_type &&rws)
template<typename InputIterator >
	RWTValMultiSet (InputIterator first, InputIterator last, const key_compare &cmp=key_compare())
	RWTValMultiSet (RWTValMultiSet< T, C, A > &&rws)
void	apply (void(*fn)(const_reference, void *), void *d) 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
const_reverse_iterator	crbegin () const
const_reverse_iterator	crend () const
void	difference (const container_type &s)
void	difference (const RWTValMultiSet< T, C, A > &s)
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
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)
void	intersection (const container_type &s)
void	intersection (const RWTValMultiSet< T, C, A > &s)
bool	isEmpty () const
bool	isEquivalent (const RWTValMultiSet< T, C, A > &s) const
bool	isProperSubsetOf (const RWTValMultiSet< T, C, A > &s) const
bool	isSubsetOf (const RWTValMultiSet< T, C, A > &s) const
size_type	occurrencesOf (bool(*fn)(const_reference, void *), void *d) const
size_type	occurrencesOf (const value_type &a) const
RWTValMultiSet< T, C, A > &	operator= (const container_type &rhs)
RWTValMultiSet< T, C, A > &	operator= (const RWTValMultiSet< T, C, A > &rhs)
RWTValMultiSet< T, C, A > &	operator= (container_type &&rhs)
RWTValMultiSet< T, C, A > &	operator= (RWTValMultiSet< T, C, A > &&rhs)
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)
reverse_iterator	rend ()
const_reverse_iterator	rend () const
container_type &	std ()
const container_type &	std () const
void	swap (RWTValMultiSet< T, C, A > &other)
void	symmetricDifference (const container_type &s)
void	symmetricDifference (const RWTValMultiSet< T, C, A > &s)
void	Union (const container_type &s)
void	Union (const RWTValMultiSet< T, C, A > &s)

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

Detailed Description

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

This class maintains a collection of values, which are ordered according to a comparison object of type C. 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.

C must induce a total ordering on elements of type T via a public member

bool operator()(const T& x, const T& y) const

which returns true if x should precede y within the collection. The structure std::less<T> from the C++ Standard Library header file <functional> is an example.

RWTValMultiSet may contain multiple items that compare equal to each other. (RWTValSet will not accept an item that compares equal to an item already in the collection.)

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

Synopsis

#include <rw/tvmset.h>
RWTValMultiSet<T, C, A>

See also

Class RWTValSet offers the same interface to a collection that will not accept multiple items that compare equal to each other. RWTValMultiMap maintains a collection of key-value pairs.

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

Persistence

Isomorphic.

Example

#include <rw/cstring.h>
#include <rw/tvmset.h>
#include <functional>
#include <iostream>
 
int main() {
  RWTValMultiSet<RWCString, std::less<RWCString> > set;
 
  set.insert("one");
  set.insert("two");
  set.insert("three");
  set.insert("one");  // OK, duplicates allowed
 
  std::cout << set.entries() << std::endl;  // Prints "4"
  return 0;
}

Program Output:

4

Member Typedef Documentation

allocator_type

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

typedef container_type::allocator_type RWTValMultiSet< 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 RWTValMultiSet< T, C, A >::const_iterator

A type that provides a const bidirectional 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 RWTValMultiSet< 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 RWTValMultiSet< 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 RWTValMultiSet< T, C, A >::const_reverse_iterator

A type that provides a const bidirectional, 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::multiset<T, C, A> RWTValMultiSet< 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 RWTValMultiSet< 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 RWTValMultiSet< T, C, A >::iterator

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

key_compare

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

typedef container_type::key_compare RWTValMultiSet< T, C, A >::key_compare

A type representing the comparison function.

key_type

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

typedef container_type::key_type RWTValMultiSet< T, C, A >::key_type

A type representing the key of the container.

pointer

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

typedef container_type::pointer RWTValMultiSet< 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 RWTValMultiSet< 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 RWTValMultiSet< T, C, A >::reverse_iterator

A type that provides a bidirectional, 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 RWTValMultiSet< 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 container_type::value_compare RWTValMultiSet< 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 RWTValMultiSet< T, C, A >::value_type

A type representing the container's data type.

Constructor & Destructor Documentation

RWTValMultiSet() [1/6]

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

RWTValMultiSet< T, C, A >::RWTValMultiSet ( const key_compare & cmp = key_compare() )

inline

Constructs an empty set.

RWTValMultiSet() [2/6]

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

RWTValMultiSet< T, C, A >::RWTValMultiSet ( const container_type & s )

inline

Constructs a set by copying all elements of s.

RWTValMultiSet() [3/6]

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

RWTValMultiSet< T, C, A >::RWTValMultiSet ( const RWTValMultiSet< T, C, A > & rws )

inline

Copy constructor.

RWTValMultiSet() [4/6]

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

RWTValMultiSet< T, C, A >::RWTValMultiSet ( RWTValMultiSet< T, C, A > && rws )

inline

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

Condition:

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

RWTValMultiSet() [5/6]

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

RWTValMultiSet< T, C, A >::RWTValMultiSet ( container_type && rws )

inline

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

Condition:

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

RWTValMultiSet() [6/6]

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

template<typename InputIterator >

RWTValMultiSet< T, C, A >::RWTValMultiSet ( InputIterator first, InputIterator last, const key_compare & cmp = key_compare() )

inline

Constructs a set 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

apply()

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

void RWTValMultiSet< 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.

begin() [1/2]

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

iterator RWTValMultiSet< 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 RWTValMultiSet< T, C, 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 C = std::less<T>, class A = std::allocator<T>>

const_iterator RWTValMultiSet< 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 RWTValMultiSet< 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 RWTValMultiSet< 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 RWTValMultiSet< 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)(a, 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 RWTValMultiSet< T, C, A >::contains ( const value_type & a ) const

inline

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

crbegin()

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

const_reverse_iterator RWTValMultiSet< 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 RWTValMultiSet< 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.

difference() [1/2]

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

void RWTValMultiSet< T, C, A >::difference ( const container_type & s )

inline

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

difference() [2/2]

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

void RWTValMultiSet< T, C, A >::difference ( const RWTValMultiSet< T, C, A > & s )

inline

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

end() [1/2]

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

iterator RWTValMultiSet< 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 RWTValMultiSet< 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 RWTValMultiSet< 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 RWTValMultiSet< 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 RWTValMultiSet< 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 RWTValMultiSet< 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)(a, 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 RWTValMultiSet< T, C, A >::find ( const value_type & a, value_type & k ) const

inline

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

insert() [1/5]

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

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

inline

Adds the item a to the collection. Returns true.

insert() [2/5]

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

template<typename InputIterator >

void RWTValMultiSet< 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() [3/5]

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

iterator RWTValMultiSet< 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 container's comparison object.

insert() [4/5]

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

iterator RWTValMultiSet< 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 container's comparison object.

Condition:

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

insert() [5/5]

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

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

inline

Adds the item a to the collection. Returns true.

Condition:

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

intersection() [1/2]

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

void RWTValMultiSet< T, C, A >::intersection ( const container_type & s )

inline

Sets self to the intersection of self and s.

intersection() [2/2]

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

void RWTValMultiSet< T, C, A >::intersection ( const RWTValMultiSet< T, C, A > & s )

inline

Sets self to the intersection of self and s.

isEmpty()

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

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

inline

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

isEquivalent()

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

bool RWTValMultiSet< T, C, A >::isEquivalent ( const RWTValMultiSet< T, C, A > & s ) const

inline

Returns true if self and s are identical, otherwise returns false.

isProperSubsetOf()

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

bool RWTValMultiSet< T, C, A >::isProperSubsetOf ( const RWTValMultiSet< T, C, A > & s ) const

inline

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

isSubsetOf()

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

bool RWTValMultiSet< T, C, A >::isSubsetOf ( const RWTValMultiSet< T, C, A > & s ) const

inline

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

occurrencesOf() [1/2]

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

size_type RWTValMultiSet< 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)(a, 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 RWTValMultiSet< T, C, A >::occurrencesOf ( const value_type & a ) const

inline

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

operator=() [1/4]

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

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

inline

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

operator=() [2/4]

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

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

inline

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

operator=() [3/4]

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

RWTValMultiSet< T, C, A > & RWTValMultiSet< T, C, 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 C = std::less<T>, class A = std::allocator<T>>

RWTValMultiSet< T, C, A > & RWTValMultiSet< T, C, A >::operator= ( RWTValMultiSet< 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.

rbegin() [1/2]

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

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

inline

Removes the first element t in self such that the expression ((*fn)(a, 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 RWTValMultiSet< T, C, A >::remove ( const value_type & a )

inline

Removes the first element t in self that compares equal to a 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 RWTValMultiSet< T, C, A >::removeAll	(	bool(*	fn )(const_reference, void *),
		void *	d )

Removes all elements t in self such that the expression ((*fn)(a, 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 RWTValMultiSet< T, C, A >::removeAll ( const value_type & a )

inline

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

rend() [1/2]

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

reverse_iterator RWTValMultiSet< 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 RWTValMultiSet< 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.

std() [1/2]

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

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

inline

Returns a reference to the underlying C++ Standard Library 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 C = std::less<T>, class A = std::allocator<T>>

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

inline

Returns a reference to the underlying C++ Standard Library 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 C = std::less<T>, class A = std::allocator<T>>

void RWTValMultiSet< T, C, A >::swap ( RWTValMultiSet< T, C, A > & other )

inline

Swaps the data held by self with the data held by other, including the C object. This method does not copy or destroy any of the items swapped; rather, it swaps the underlying hash tables.

symmetricDifference() [1/2]

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

void RWTValMultiSet< T, C, A >::symmetricDifference ( const container_type & s )

inline

Sets self to the symmetric difference of self and s.

symmetricDifference() [2/2]

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

void RWTValMultiSet< T, C, A >::symmetricDifference ( const RWTValMultiSet< T, C, A > & s )

inline

Sets self to the symmetric difference of self and s.

Union() [1/2]

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

void RWTValMultiSet< T, C, A >::Union ( const container_type & s )

inline

Sets self to the union of self and s.

Note

The uppercase "U" in Union avoids conflict with the C++ reserved word.

Union() [2/2]

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

void RWTValMultiSet< T, C, A >::Union ( const RWTValMultiSet< T, C, A > & s )

inline

Sets self to the union of self and s.

Note

The uppercase "U" in Union avoids conflict with the C++ reserved word.

Friends And Related Symbol Documentation

operator!=() [1/3]

template<class T , class C , class A >

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

related

Equivalent to !(lhs == rhs).

operator!=() [2/3]

template<class T , class C , class A >

bool operator!= ( const RWTValMultiSet< T, C, A > & lhs, const typename RWTValMultiSet< 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 RWTValMultiSet< T, C, A >::container_type & lhs, const RWTValMultiSet< T, C, A > & rhs )

related

Equivalent to !(lhs == rhs).

operator<() [1/3]

template<class T , class C , class A >

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

related

Equivalent to !(rhs < lhs).

operator<=() [2/3]

template<class T , class C , class A >

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

related

Equivalent to !(rhs < lhs).

operator==() [1/3]

template<class T , class C , class A >

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

related

Equivalent to (rhs < lhs).

operator>() [2/3]

template<class T , class C , class A >

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

related

Equivalent to (rhs < lhs).

operator>=() [1/3]

template<class T , class C , class A >

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

related

Equivalent to !(lhs < rhs).

operator>=() [2/3]

template<class T , class C , class A >

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

related

Equivalent to !(lhs < rhs).

operator>>() [1/4]

template<class T , class C , class A >

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