SourcePro C++ 12.0 |
SourcePro® C++ API Reference Guide |
SourcePro C++ Documentation Home |
Maintains a collection of keys, each with an associated item and ordered according to a comparison object. More...
#include <rw/tvmmap.h>
Inherits RW_VMapAssoc< std::multimap< K, T, C,A >, RWTValMultiMap< K, T, C,A >, K, T, std::less< K > >.
Public Types | |
typedef std::multimap< K, T, C,A > | container_type |
typedef container_type::iterator | iterator |
typedef container_type::const_iterator | const_iterator |
typedef container_type::size_type | size_type |
typedef container_type::value_type | value_type |
typedef container_type::reference | reference |
typedef container_type::const_reference | const_reference |
Public Member Functions | |
container_type & | std () |
const container_type & | std () const |
void | apply (void(*fn)(const K &, const T &, void *), void *d) const |
void | apply (void(*fn)(const K &, T &, void *), void *d) |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
bool | isEmpty () const |
size_type | entries () const |
bool | operator== (const container_type &m) const |
bool | operator== (const RWTValMultiMap< K, T, C, A > &m) const |
bool | operator!= (const container_type &stdc) const |
bool | operator!= (const RWTValMultiMap< K, T, C, A > &rwc) const |
bool | operator< (const container_type &m) const |
bool | operator< (const RWTValMultiMap< K, T, C, A > &m) const |
void | clear () |
bool | contains (bool(*fn)(const_reference, void *), void *d) const |
bool | contains (const K &key) const |
bool | find (bool(*fn)(const_reference, void *), void *d, std::pair< K, T > &r) const |
bool | find (const K &key, K &r) const |
bool | findValue (const K &key, T &r) const |
bool | findKeyAndValue (const K &key, K &kr, T &tr) const |
const K & | minElement () const |
const K & | maxElement () const |
size_type | occurrencesOf (bool(*fn)(const_reference, void *), void *d) const |
size_type | occurrencesOf (const K &key) const |
bool | remove (bool(*fn)(const_reference, void *), void *d) |
bool | remove (const K &key) |
size_type | removeAll (bool(*fn)(const_reference, void *), void *d) |
size_type | removeAll (const K &key) |
bool | insert (const K &key, const T &a) |
bool | insert (K &&key, T &&a) |
void | swap (RWTValMultiMap< K, T, C, A > &other) |
RWTValMultiMap< K, T, C,A > & | operator= (const RWTValMultiMap< K, T, C, A > &m) |
RWTValMultiMap< K, T, C,A > & | operator= (const container_type &m) |
RWTValMultiMap< K, T, C,A > & | operator= (RWTValMultiMap< K, T, C, A > &&rhs) |
RWTValMultiMap (const C &cmp=C()) | |
RWTValMultiMap (const container_type &m) | |
RWTValMultiMap (const RWTValMultiMap< K, T, C, A > &rws) | |
RWTValMultiMap (RWTValMultiMap< K, T, C, A > &&rws) | |
RWTValMultiMap (const value_type *first, const value_type *last, const C &cmp=C()) | |
Related Functions | |
(Note that these are not member functions.) | |
template<class K , class T , class C , class A > | |
RWvostream & | operator<< (RWvostream &strm, const RWTValMultiMap< K, T, C, A > &coll) |
template<class K , class T , class C , class A > | |
RWFile & | operator<< (RWFile &strm, const RWTValMultiMap< K, T, C, A > &coll) |
template<class K , class T , class C , class A > | |
RWvistream & | operator>> (RWvistream &strm, RWTValMultiMap< K, T, C, A > &coll) |
template<class K , class T , class C , class A > | |
RWFile & | operator>> (RWFile &strm, RWTValMultiMap< K, T, C, A > &coll) |
template<class K , class T , class C , class A > | |
RWvistream & | operator>> (RWvistream &strm, RWTValMultiMap< K, T, C, A > *&p) |
template<class K , class T , class C , class A > | |
RWFile & | operator>> (RWFile &strm, RWTValMultiMap< K, T, C, A > *&p) |
This class maintains a collection of keys, each with an associated item of type T
. 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.
Order is determined by the key according to a comparison object of type C
. C
must induce a total ordering on elements of type K
via a public member
bool operator()(const K& x, const K& y) const
which returns true
if x
and its partner should precede y
and its partner within the collection. The structure std::less<T>
from the C++ Standard header file <functional>
is an example.
RWTValMultiMap<K,T,C,A> may contain multiple keys that compare equal to each other. (RWTValMap<K,T,C,A> will not accept a key that compares equal to any key already in the collection.) Equality is based on the comparison object and not on the operator==. Given a comparison object comp
, keys a
and b
are equal if !comp(a,b) && !comp(b,a)
.
The value
type must have operator==
and operator<
defined. This requirement is imposed by the C++ Standard Library.
#include <rw/tvmmap.h> RWTValMultiMap<K,T,C,A> m;
Class RWTValMap<K,T,C,A> offers the same interface to a collection that will not accept multiple keys that compare equal to each other. RWTValMultiSet<T,C,A> maintains a collection of keys without the associated values.
Class std::multimap<K,T,C,A,std::pair<K const&,T> > is the C++ Standard collection that serves as the underlying implementation for this collection.
Isomorphic.
#include <iostream> #include <functional> #include <rw/tvmmap.h> #include <rw/cstring.h> #include <rw/tools/datetime.h> int main () { typedef RWTValMultiMap<RWCString, RWDateTime, std::less<RWCString> > RWMMap; RWMMap birthdays; birthdays.insert("John", RWDateTime("April 12, 1975", RWDateTime::setDate)); birthdays.insert("Ivan", RWDateTime("Nov 2, 1980", RWDateTime::setDate)); birthdays.insert("Mary", RWDateTime("Oct 22, 1987", RWDateTime::setDate)); birthdays.insert("Ivan", RWDateTime("June 19, 1971", RWDateTime::setDate)); birthdays.insert("Sally",RWDateTime("March 15, 1976", RWDateTime::setDate)); birthdays.insert("Ivan", RWDateTime("July 6, 1950", RWDateTime::setDate)); // How many "Ivan"s? RWMMap::size_type n = birthdays.occurrencesOf("Ivan"); RWMMap::size_type idx = 0; std::cout << "There are " << n << " Ivans:" << std::endl; RWMMap::iterator iter = birthdays.std().lower_bound("Ivan"); while (++idx <= n) std::cout << idx << ". " << (*iter++).second.asString('x') << std::endl; return 0; }
Program Output:
There are 3 Ivans: 1. 11/02/80 2. 06/19/71 3. 07/06/50
typedef container_type::const_iterator RWTValMultiMap< K, T, C, A >::const_iterator |
Typedef for the const
iterator.
typedef container_type::const_reference RWTValMultiMap< K, T, C, A >::const_reference |
Typedef for a const
reference to a value in this container.
typedef std::multimap<K,T,C ,A > RWTValMultiMap< K, T, C, A >::container_type |
Typedef for the C++ Standard collection that serves as the underlying implementation for this class.
typedef container_type::iterator RWTValMultiMap< K, T, C, A >::iterator |
Typedef for the non-const
iterator.
typedef container_type::reference RWTValMultiMap< K, T, C, A >::reference |
Typedef for a non-const
reference to a value in this container.
typedef container_type::size_type RWTValMultiMap< K, T, C, A >::size_type |
Typedef for the type used to index into this container.
typedef container_type::value_type RWTValMultiMap< K, T, C, A >::value_type |
Typedef for the type of elements in this container.
RWTValMultiMap< K, T, C, A >::RWTValMultiMap | ( | const C & | cmp = C() |
) | [inline] |
Constructs an empty map with comparator cmp.
RWTValMultiMap< K, T, C, A >::RWTValMultiMap | ( | const container_type & | m | ) | [inline] |
Constructs a map by copying all elements of m.
RWTValMultiMap< K, T, C, A >::RWTValMultiMap | ( | const RWTValMultiMap< K, T, C, A > & | rws | ) | [inline] |
Copy constructor.
RWTValMultiMap< K, T, C, A >::RWTValMultiMap | ( | RWTValMultiMap< K, T, C, A > && | rws | ) | [inline] |
Move constructor. The constructed map takes ownership of the data owned by rws.
RWTValMultiMap< K, T, C, A >::RWTValMultiMap | ( | const value_type * | first, | |
const value_type * | last, | |||
const C & | cmp = C() | |||
) | [inline] |
Constructs a map by copying elements from the array of T
s pointed to by first, up to, but not including, the element pointed to by last.
void RWTValMultiMap< K, T, C, A >::apply | ( | void(*)(const K &, T &, void *) | fn, | |
void * | d | |||
) | [inline] |
Applies the user-defined function pointed to by fn to every association in the collection. Client data may be passed through parameter d.
void RWTValMultiMap< K, T, C, A >::apply | ( | void(*)(const K &, const T &, void *) | fn, | |
void * | d | |||
) | const [inline] |
Applies the user-defined function pointed to by fn to every association in the collection. Client data may be passed through parameter d.
const_iterator RWTValMultiMap< K, T, C, A >::begin | ( | ) | const [inline] |
Returns an iterator positioned at the first pair in self.
iterator RWTValMultiMap< K, T, C, A >::begin | ( | ) | [inline] |
Returns an iterator positioned at the first pair in self.
void RWTValMultiMap< K, T, C, A >::clear | ( | void | ) | [inline] |
Clears the collection by removing all items from self. Each key and its associated item has its destructor called.
bool RWTValMultiMap< K, T, C, A >::contains | ( | const K & | key | ) | const [inline] |
Returns true
if there exists a key j
in self that compares equal to key, otherwise returns false
.
bool RWTValMultiMap< K, T, C, A >::contains | ( | bool(*)(const_reference, void *) | fn, | |
void * | d | |||
) | const [inline] |
Returns true
if there exists an association a
in self such that the expression ((*fn)(a, d))
is true
, otherwise returns false
. Client data may be passed through parameter d.
const_iterator RWTValMultiMap< K, T, C, A >::end | ( | ) | const [inline] |
Returns an iterator positioned "just past" the last association in self.
iterator RWTValMultiMap< K, T, C, A >::end | ( | ) | [inline] |
Returns an iterator positioned "just past" the last association in self.
size_type RWTValMultiMap< K, T, C, A >::entries | ( | void | ) | const [inline] |
Returns the number of associations in self.
bool RWTValMultiMap< K, T, C, A >::find | ( | const K & | key, | |
K & | r | |||
) | const [inline] |
If there exists a key j
in self that compares equal to key, assigns j
to r and returns true
. Otherwise, returns false
and leaves the value of r unchanged.
bool RWTValMultiMap< K, T, C, A >::find | ( | bool(*)(const_reference, void *) | fn, | |
void * | d, | |||
std::pair< K, T > & | r | |||
) | const [inline] |
If there exists an association a
in self such that the expression ((*fn)(a,d))
is true
, assigns a
to r and returns true
. Otherwise, returns false
and leaves the value of r unchanged. Client data may be passed through parameter d.
bool RWTValMultiMap< K, T, C, A >::findKeyAndValue | ( | const K & | key, | |
K & | kr, | |||
T & | tr | |||
) | const [inline] |
If there exists a key j
in self that compares equal to key, assigns j
to kr, assigns the item associated with j
to tr, and returns true
. Otherwise, returns false
and leaves the values of kr and tr unchanged.
bool RWTValMultiMap< K, T, C, A >::findValue | ( | const K & | key, | |
T & | r | |||
) | const [inline] |
If there exists a key j
in self that compares equal to key, assigns the item associated with j
to r and returns true
. Otherwise, returns false
and leaves the value of r unchanged.
bool RWTValMultiMap< K, T, C, A >::insert | ( | K && | key, | |
T && | a | |||
) | [inline] |
Adds key with associated item a to the collection. Returns true
.
bool RWTValMultiMap< K, T, C, A >::insert | ( | const K & | key, | |
const T & | a | |||
) | [inline] |
Adds key with associated item a to the collection. Returns true
.
bool RWTValMultiMap< K, T, C, A >::isEmpty | ( | ) | const [inline] |
Returns true
if there are no items in the collection, otherwise false
.
const K& RWTValMultiMap< K, T, C, A >::maxElement | ( | ) | const [inline] |
Returns a reference to the maximum key in the collection. Order is determined according to the comparison object C
.
const K& RWTValMultiMap< K, T, C, A >::minElement | ( | ) | const [inline] |
Returns a reference to the minimum key in the collection. Order is determined according to the comparison object C
.
size_type RWTValMultiMap< K, T, C, A >::occurrencesOf | ( | const K & | key | ) | const [inline] |
Returns the number of keys j
in self that compare equal to key.
size_type RWTValMultiMap< K, T, C, A >::occurrencesOf | ( | bool(*)(const_reference, void *) | fn, | |
void * | d | |||
) | const [inline] |
Returns the number of associations a
in self such that the expression ((*fn)(a,d))
is true
. Client data may be passed through parameter d.
bool RWTValMultiMap< K, T, C, A >::operator!= | ( | const RWTValMultiMap< K, T, C, A > & | rwc | ) | const [inline] |
Returns the negation of operator==().
bool RWTValMultiMap< K, T, C, A >::operator!= | ( | const container_type & | stdc | ) | const [inline] |
Returns the negation of operator==().
bool RWTValMultiMap< K, T, C, A >::operator< | ( | const RWTValMultiMap< K, T, C, A > & | m | ) | const [inline] |
Returns true
if self compares lexicographically less than m, otherwise returns false
. Assumes that type K
has well-defined less-than semantics (T::operator<(const K&)
or equivalent).
bool RWTValMultiMap< K, T, C, A >::operator< | ( | const container_type & | m | ) | const [inline] |
Returns true
if self compares lexicographically less than m, otherwise returns false
. Assumes that type K
has well-defined less-than semantics (T::operator<(const K&)
or equivalent).
RWTValMultiMap<K,T,C ,A >& RWTValMultiMap< K, T, C, A >::operator= | ( | RWTValMultiMap< K, T, C, A > && | rhs | ) | [inline] |
Move assignment. Self takes ownership of the data owned by rhs.
RWTValMultiMap<K,T,C ,A >& RWTValMultiMap< K, T, C, A >::operator= | ( | const container_type & | m | ) | [inline] |
Destroys all elements of self and replaces them by copying all associations from m.
RWTValMultiMap<K,T,C ,A >& RWTValMultiMap< K, T, C, A >::operator= | ( | const RWTValMultiMap< K, T, C, A > & | m | ) | [inline] |
Destroys all elements of self and replaces them by copying all associations from m.
bool RWTValMultiMap< K, T, C, A >::operator== | ( | const RWTValMultiMap< K, T, C, A > & | m | ) | const [inline] |
Returns true
if self compares equal to m, otherwise returns false
. Two collections are equal if both have the same number of entries, and iterating through both collections produces, in turn, individual pairs that compare equal to each other.
bool RWTValMultiMap< K, T, C, A >::operator== | ( | const container_type & | m | ) | const [inline] |
Returns true
if self compares equal to m, otherwise returns false
. Two collections are equal if both have the same number of entries, and iterating through both collections produces, in turn, individual pairs that compare equal to each other.
bool RWTValMultiMap< K, T, C, A >::remove | ( | const K & | key | ) | [inline] |
Removes the first association with key j
in self where j
compares equal to key and returns true
. Returns false
if there is no such association.
bool RWTValMultiMap< K, T, C, A >::remove | ( | bool(*)(const_reference, void *) | fn, | |
void * | d | |||
) | [inline] |
Removes the first association a
in self such that the expression ((*fn)(a,d))
is true
and returns true
. Returns false
if there is no such element. Client data may be passed through parameter d.
size_type RWTValMultiMap< K, T, C, A >::removeAll | ( | const K & | key | ) | [inline] |
Removes all associations in self that have a key j
that compares equal to key. Returns the number of items removed.
size_type RWTValMultiMap< K, T, C, A >::removeAll | ( | bool(*)(const_reference, void *) | fn, | |
void * | d | |||
) | [inline] |
Removes all associations a
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.
const container_type& RWTValMultiMap< K, T, C, A >::std | ( | ) | const [inline] |
Returns a reference to the underlying C++ Standard collection that serves as the implementation for self. This reference may be used freely, providing access to the C++ Standard interface as well as interoperability with other software components that make use of the C++ Standard collections.
container_type& RWTValMultiMap< K, T, C, A >::std | ( | ) | [inline] |
Returns a reference to the underlying C++ Standard collection that serves as the implementation for self. This reference may be used freely, providing access to the C++ Standard interface as well as interoperability with other software components that make use of the C++ Standard collections.
void RWTValMultiMap< K, T, C, A >::swap | ( | RWTValMultiMap< K, T, C, A > & | other | ) | [inline] |
Swaps the data held by self with the data held by other. This method does not copy or destroy any of the items swapped; rather, it swaps the underlying hash * tables.
RWFile & operator<< | ( | RWFile & | strm, | |
const RWTValMultiMap< K, T, C, A > & | coll | |||
) | [related] |
Saves the collection coll onto the RWFile strm, or a reference to it if it has already been saved.
RWvostream & operator<< | ( | RWvostream & | strm, | |
const RWTValMultiMap< K, 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.
RWFile & operator>> | ( | RWFile & | strm, | |
RWTValMultiMap< K, 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.
RWvistream & operator>> | ( | RWvistream & | strm, | |
RWTValMultiMap< K, 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.
RWFile & operator>> | ( | RWFile & | strm, | |
RWTValMultiMap< K, T, C, A > & | coll | |||
) | [related] |
Restores the contents of the collection coll from the RWFile strm.
RWvistream & operator>> | ( | RWvistream & | strm, | |
RWTValMultiMap< K, T, C, A > & | coll | |||
) | [related] |
Restores the contents of the collection coll from the input stream strm.
© Copyright Rogue Wave Software, Inc. All Rights Reserved.
Rogue Wave and SourcePro are registered trademarks of Rogue Wave Software, Inc. in the United States and other countries. All other trademarks are the property of their respective owners.
Contact Rogue Wave about documentation or support issues.