GMapImpl< K, TI > Class Template Reference

Inheritance diagram for GMapImpl< K, TI >:

GSetImpl< K > GSetBase GCont GMapTemplate< KTYPE, GP< VTYPE >, GPBase > GMapTemplate< KTYPE, VTYPE, VTYPE > GPMap< KTYPE, VTYPE > GMap< KTYPE, VTYPE > List of all members.

Detailed Description

template<class K, class TI>
class GMapImpl< K, TI >

Definition at line 1101 of file GContainer.h.


Protected Types

typedef GCONT MapNode< K, TI > MNode

Protected Member Functions

Associative Maps
These template classes implements a associative maps. The associative map contains an arbitrary number of entries. Each entry is a pair containing one element of type KTYPE# (named the "key") and one element of type VTYPE# (named the "value"). All entries have distinct keys. These template class must be able to access the following functions: {itemize} a VTYPE# default constructor VTYPE::VTYPE()#, a VTYPE# copy constructor VTYPE::VTYPE(const VTYPE &)#, optionally a VTYPE# destructor VTYPE::~VTYPE()#, a KTYPE# default constructor KTYPE::KTYPE()#, a KTYPE# copy constructor KTYPE::KTYPE(const KTYPE &)#, optionally a KTYPE# destructor KTYPE::~KTYPE()#, a KTYPE# comparison operator ::KTYPE::operator==(const KTYPE &)#, and a KTYPE# hashing function hash(const KTYPE&)#. {itemize} The hashing function must return an unsigned int# number. Multiple invocations of the hashing function with equal arguments (in the sense of KTYPE::operator==#) must always return the same number. Position objects (see GPosition}) may be used to iterate over the entries contained by an associative map. Associative maps.

 GMapImpl ()
 GMapImpl (const GCONT Traits &traits)
GCONT HNode * get_or_create (const K &key)

The documentation for this class was generated from the following file:
KDE Home | KDE Accessibility Home | Description of Access Keys