RWTPtrMap< K, T, C, A > Class Template Reference
[STL-based Collections]

A pointer-based collection of associations ordered according to a comparison object. More...

#include <rw/tpmap.h>

Inherits RW_PMapAssoc< std::map< K *, T *, rw_deref_compare< C, K >,A >, RWTPtrMap< K, T, C,A >, K, T, C >.

List of all members.

Public Types
typedef rw_deref_compare< C, K >	container_comp
typedef std::map< K *, T *, container_comp,A >	container_type
typedef container_type::size_type	size_type
typedef container_type::difference_type	difference_type
typedef container_type::iterator	iterator
typedef container_type::const_iterator	const_iterator
typedef container_type::value_type	value_type
typedef container_type::reference	reference
typedef container_type::const_reference	const_reference
typedef K *	value_type_key
typedef T *	value_type_data
typedef K *&	reference_key
typedef T *&	reference_data
typedef const K *const &	const_reference_key
typedef const T *const &	const_reference_data
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)
void	applyToKeyAndValue (void(*fn)(const K *, const T *, void *), void *d) const
void	applyToKeyAndValue (void(*fn)(const K *, T *&, void *), void *d)
iterator	begin ()
const_iterator	begin () const
void	clearAndDestroy ()
iterator	end ()
const_iterator	end () const
bool	isEmpty () const
size_type	entries () const
bool	operator== (const RWTPtrMap< K, T, C, A > &m) const
bool	operator< (const RWTPtrMap< K, T, C, A > &m) const
void	clear ()
bool	contains (bool(*fn)(value_type, void *), void *d) const
bool	contains (const K *key) const
value_type	find (bool(*fn)(value_type, void *), void *d) const
const K *	find (const K *key) const
T *	findValue (const K *key)
const T *	findValue (const K *key) const
const K *	findKeyAndValue (const K *key, T *&tr)
const K *	findKeyAndValue (const K *key, const T *&tr) const
const K *	minElement () const
const K *	maxElement () const
size_type	occurrencesOf (bool(*fn)(value_type, void *), void *d) const
size_type	occurrencesOf (const K *k) const
K *	remove (bool(*fn)(value_type, void *), void *d)
K *	remove (const K *key)
size_type	removeAll (bool(*fn)(value_type, void *), void *d)
size_type	removeAll (const K *key)
bool	insert (K *key, T *a)
bool	insertKeyAndValue (K *key, T *a)
T *&	operator[] (const K *key)
RWTPtrMap< K, T, C,A > &	operator= (const RWTPtrMap< K, T, C, A > &rhs)
RWTPtrMap< K, T, C,A > &	operator= (const container_type &rhs)
RWTPtrMap< K, T, C,A > &	operator= (RWTPtrMap< K, T, C, A > &&rhs)
	RWTPtrMap (const container_comp &comp=container_comp())
	RWTPtrMap (const container_type &m)
	RWTPtrMap (const RWTPtrMap< K, T, C, A > &rws)
	RWTPtrMap (RWTPtrMap< K, T, C, A > &&map)
	RWTPtrMap (value_type *first, value_type *last, const container_comp &cmp=container_comp())
void	swap (RWTPtrMap< K, T, C, A > &rhs)
Related Functions
(Note that these are not member functions.)
template<class K , class T , class C , class A >
RWvostream &	operator<< (RWvostream &strm, const RWTPtrMap< K, T, C, A > &coll)
template<class K , class T , class C , class A >
RWFile &	operator<< (RWFile &strm, const RWTPtrMap< K, T, C, A > &coll)
template<class K , class T , class C , class A >
RWvistream &	operator>> (RWvistream &strm, RWTPtrMap< K, T, C, A > &coll)
template<class K , class T , class C , class A >
RWFile &	operator>> (RWFile &strm, RWTPtrMap< K, T, C, A > &coll)
template<class K , class T , class C , class A >
RWvistream &	operator>> (RWvistream &strm, RWTPtrMap< K, T, C, A > *&p)
template<class K , class T , class C , class A >
RWFile &	operator>> (RWFile &strm, RWTPtrMap< K, T, C, A > *&p)

---

Detailed Description

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>
class RWTPtrMap< K, T, C, A >

This class maintains a pointer-based collection of associations of type pair<K* const, T*>. The first part of the association is a key of type K*, the second is its 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)

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 Library header file <functional> is an example. Note that keys will be dereferenced before being compared.

RWTPtrMap<K,T,C,A> will not accept a key that compares equal to any key already in the collection. (RWTPtrMultiMap<K,T,C,A> may contain multiple keys that compare equal to each other.) 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.

Synopsis

 #include <rw/tpmap.h>
 RWTPtrMap<K,T,C,A> m;

Related Classes

Class RWTPtrMultiMap<K,T,C,A> offers the same interface to a pointer-based collection that accepts multiple keys that compare equal to each other. RWTPtrSet<T,C,A> maintains a pointer-based collection of keys without the associated items.

Class map<K*,T*,deref_compare<C,K,A> > is the C++ Standard Library collection that serves as the underlying implementation for this collection.

Persistence

Isomorphic

Examples

 //
 // tpmap.cpp
 //
 #include <iostream>
 #include <functional>
 
 #include <rw/tpmap.h>
 #include <rw/cstring.h>
 #include <rw/tools/datetime.h>
 
 int main ()
 {
     RWTPtrMap<RWCString, RWDateTime, std::less<RWCString> > birthdays;
 
     birthdays.insert (new RWCString("John"),
                       new RWDateTime("April 12, 1975", RWDateTime::setDate));
 
     birthdays.insert (new RWCString("Ivan"),
                       new RWDateTime("Nov 2, 1980", RWDateTime::setDate));
 
     // Alternative syntax:
     birthdays[new RWCString("Susan")] = new RWDateTime("June 30, 1955", RWDateTime::setDate);
     birthdays[new RWCString("Gene")]  = new RWDateTime("Jan 5, 1981", RWDateTime::setDate);
 
     // Print a birthday:
     RWCString key("John");
     std::cout << birthdays[&key]->asString('x') << std::endl;
 
     return 0;
 }

Program Output:

 04/12/75

---

Member Typedef Documentation

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef container_type::const_iterator RWTPtrMap< K, T, C, A >::const_iterator

Typedef for the const iterator.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef container_type::const_reference RWTPtrMap< K, T, C, A >::const_reference

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

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef const T* const& RWTPtrMap< K, T, C, A >::const_reference_data

Typedef for a const reference to the type of data in this container.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef const K* const& RWTPtrMap< K, T, C, A >::const_reference_key

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

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef rw_deref_compare<C,K> RWTPtrMap< K, T, C, A >::container_comp

Typedef for the comparison object.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef std::map<K*,T*,container_comp ,A > RWTPtrMap< K, T, C, A >::container_type

Typedef for the C++ Standard Library collection that serves as the underlying implementation for this class.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef container_type::difference_type RWTPtrMap< K, T, C, A >::difference_type

Typedef for the type of difference between iterators.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef container_type::iterator RWTPtrMap< K, T, C, A >::iterator

Typedef for the non-const iterator.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef container_type::reference RWTPtrMap< K, T, C, A >::reference

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

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef T*& RWTPtrMap< K, T, C, A >::reference_data

Typedef for a non-const reference to the type of data in this container.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef K*& RWTPtrMap< K, T, C, A >::reference_key

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

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef container_type::size_type RWTPtrMap< K, T, C, A >::size_type

Typedef for the type used to index into this container.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef container_type::value_type RWTPtrMap< K, T, C, A >::value_type

Typedef for the type of elements in this container.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef T* RWTPtrMap< K, T, C, A >::value_type_data

Typedef for the type of data.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

typedef K* RWTPtrMap< K, T, C, A >::value_type_key

Typedef for the type of key.

---

Constructor & Destructor Documentation

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

RWTPtrMap< K, T, C, A >::RWTPtrMap

(

const container_comp &

comp = container_comp()

)

[inline]

Constructs an empty map with comparator comp.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

RWTPtrMap< K, T, C, A >::RWTPtrMap

(

const container_type &

m

)

[inline]

Constructs a map by copying all elements from m.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

RWTPtrMap< K, T, C, A >::RWTPtrMap

(

const RWTPtrMap< K, T, C, A > &

rws

)

[inline]

Copy constructor.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

RWTPtrMap< K, T, C, A >::RWTPtrMap

(

RWTPtrMap< K, T, C, A > &&

map

)

[inline]

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

Condition:

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

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

RWTPtrMap< K, T, C, A >::RWTPtrMap	(	value_type *	first,
		value_type *	last,
		const container_comp &	cmp = container_comp()
	)			[inline]

Constructs a map by copying elements from the array of pairs pointed to by first, up to, but not including, the pair pointed to by last.

---

Member Function Documentation

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

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

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

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

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

void RWTPtrMap< K, T, C, A >::applyToKeyAndValue	(	void(*)(const K *, T *&, void *)	fn,
		void *	d
	)			[inline]

Deprecated:

This method is deprecated, and is no longer supported. Be aware that it may be removed in a future release. Instead, use the apply() member, which behaves exactly the same as this method.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

void RWTPtrMap< K, T, C, A >::applyToKeyAndValue	(	void(*)(const K *, const T *, void *)	fn,
		void *	d
	)			const [inline]

Deprecated:

This method is deprecated, and is no longer supported. Be aware that it may be removed in a future release. Instead, use the apply() member, which behaves exactly the same as this method.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

const_iterator RWTPtrMap< K, T, C, A >::begin

(

)

const [inline]

Returns an iterator positioned at the first pair in self.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

iterator RWTPtrMap< K, T, C, A >::begin

(

)

[inline]

Returns an iterator positioned at the first pair in self.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

void RWTPtrMap< K, T, C, A >::clear

(

void

)

[inline]

Clears the collection by removing all items from self.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

void RWTPtrMap< K, T, C, A >::clearAndDestroy

(

void

)

[inline]

Removes all associations from the collection and uses operator delete to destroy the objects pointed to by the keys and their associated items. Do not use this method if multiple pointers to the same object are stored. (This could happen even if keys all compare different, since items are not considered during comparison.)

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

bool RWTPtrMap< 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.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

bool RWTPtrMap< K, T, C, A >::contains	(	bool(*)(value_type, 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.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

const_iterator RWTPtrMap< K, T, C, A >::end

(

)

const [inline]

Returns an iterator positioned "just past" the last association in self.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

iterator RWTPtrMap< K, T, C, A >::end

(

)

[inline]

Returns an iterator positioned "just past" the last association in self.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

size_type RWTPtrMap< K, T, C, A >::entries

(

void

)

const [inline]

Returns the number of associations in self.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

const K* RWTPtrMap< K, T, C, A >::find

(

const K *

key

)

const [inline]

If there exists a key j in self that compares equal to *key, then returns j. Otherwise, returns rwnil.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

value_type RWTPtrMap< K, T, C, A >::find	(	bool(*)(value_type, void *)	fn,
		void *	d
	)			const [inline]

If there exists an association a in self such that the expression ((*fn)(a,d)) is true, then returns a. Otherwise, returns pair<rwnil,rwnil>. Client data may be passed through parameter d.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

const K* RWTPtrMap< K, T, C, A >::findKeyAndValue	(	const K *	key,
		const T *&	tr
	)			const [inline]

If there exists a key j in self that compares equal to *key, assigns the item associated with j to tr, and returns j. Otherwise, returns rwnil and leaves the value of tr unchanged.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

const K* RWTPtrMap< K, T, C, A >::findKeyAndValue	(	const K *	key,
		T *&	tr
	)			[inline]

If there exists a key j in self that compares equal to *key, assigns the item associated with j to tr, and returns j. Otherwise, returns rwnil and leaves the value of tr unchanged.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

const T* RWTPtrMap< K, T, C, A >::findValue

(

const K *

key

)

const [inline]

If there exists a key j in self that compares equal to *key, returns the item associated with j. Otherwise, returns rwnil.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

T* RWTPtrMap< K, T, C, A >::findValue

(

const K *

key

)

[inline]

If there exists a key j in self that compares equal to *key, returns the item associated with j. Otherwise, returns rwnil.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

bool RWTPtrMap< K, T, C, A >::insert	(	K *	key,
		T *	a
	)			[inline]

Adds key with associated item a to the collection. Returns true if the insertion is successful, otherwise returns false. Insertion will fail if the collection already holds an assocation with an equivalent key.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

bool RWTPtrMap< K, T, C, A >::insertKeyAndValue	(	K *	key,
		T *	a
	)			[inline]

Deprecated:

This method is deprecated, and is no longer supported. Be aware that it may be removed in a future release. Instead, use the insert() member, which behaves exactly the same as this method.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

bool RWTPtrMap< K, T, C, A >::isEmpty

(

)

const [inline]

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

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

const K* RWTPtrMap< K, T, C, A >::maxElement

(

)

const [inline]

Returns a pointer to the maximum key in the collection. Order is determined according to the comparison object described by the template parameter C.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

const K* RWTPtrMap< K, T, C, A >::minElement

(

)

const [inline]

Returns a pointer to the minimum key in the collection. Order is determined according to the comparison object described by the template parameter C.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

size_type RWTPtrMap< K, T, C, A >::occurrencesOf

(

const K *

k

)

const [inline]

Returns the number of keys j in self that compare equal to *key.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

size_type RWTPtrMap< K, T, C, A >::occurrencesOf	(	bool(*)(value_type, 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.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

bool RWTPtrMap< K, T, C, A >::operator<

(

const RWTPtrMap< K, T, C, A > &

m

)

const [inline]

Returns true if self compares lexicographically less than m, otherwise returns false. Keys in each collection are dereferenced before being compared. Assumes that type K has well-defined less-than semantics.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

RWTPtrMap<K,T,C ,A >& RWTPtrMap< K, T, C, A >::operator=

(

RWTPtrMap< K, T, C, A > &&

rhs

)

[inline]

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

Condition:

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

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

RWTPtrMap<K,T,C ,A >& RWTPtrMap< K, T, C, A >::operator=

(

const container_type &

rhs

)

[inline]

Destroys all associations in self and replaces them by copying all associations from rhs.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

RWTPtrMap<K,T,C ,A >& RWTPtrMap< K, T, C, A >::operator=

(

const RWTPtrMap< K, T, C, A > &

rhs

)

[inline]

Destroys all associations in self and replaces them by copying all associations from rhs.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

bool RWTPtrMap< K, T, C, A >::operator==

(

const RWTPtrMap< 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 keys that compare equal to each other. Keys are dereferenced before being compared.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

T*& RWTPtrMap< K, T, C, A >::operator[]

(

const K *

key

)

[inline]

Looks up key and returns a reference to its associated item. If the key is not in the dictionary, then it will be added with an associated uninitialized pointer of type T*. Because of this, if there is a possibility that a key will not be in the dictionary, then this operator should be used only as an lvalue.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

K* RWTPtrMap< K, T, C, A >::remove

(

const K *

key

)

[inline]

Removes the first association with key j in self that compares equal to *key and returns j. Returns rwnil if there is no such association.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

K* RWTPtrMap< K, T, C, A >::remove	(	bool(*)(value_type, void *)	fn,
		void *	d
	)			[inline]

Removes the first association a in self such that the expression ((*fn)(a,d)) is true and returns its key. Returns rwnil if there is no such association. Client data may be passed through parameter d.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

size_type RWTPtrMap< K, T, C, A >::removeAll

(

const K *

key

)

[inline]

Removes all associations with key j in self that compares equal to *key. Returns the number of associations removed.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

size_type RWTPtrMap< K, T, C, A >::removeAll	(	bool(*)(value_type, void *)	fn,
		void *	d
	)			[inline]

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

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

const container_type& RWTPtrMap< K, T, C, A >::std

(

)

const [inline]

Returns a reference to the underlying C++ Standard Library collection that serves as the implementation for self.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

container_type& RWTPtrMap< K, T, C, A >::std

(

)

[inline]

Returns a reference to the underlying C++ Standard Library collection that serves as the implementation for self.

template<class K, class T, class C, class A = std:: allocator < std::pair<K* const, T*> >>

void RWTPtrMap< K, T, C, A >::swap

(

RWTPtrMap< K, T, C, A > &

rhs

)

[inline]

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

---

Friends And Related Function Documentation

template<class K , class T , class C , class A >

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

template<class K , class T , class C , class A >

RWvostream & operator<<	(	RWvostream &	strm,
		const RWTPtrMap< 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.

template<class K , class T , class C , class A >

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

template<class K , class T , class C , class A >

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

template<class K , class T , class C , class A >

RWFile & operator>>	(	RWFile &	strm,
		RWTPtrMap< K, T, C, A > &	coll
	)			[related]

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

template<class K , class T , class C , class A >

RWvistream & operator>>	(	RWvistream &	strm,
		RWTPtrMap< K, T, C, A > &	coll
	)			[related]

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