Main Page | Namespace List | Class Hierarchy | Alphabetical List | Compound List | File List | Compound Members | File Members

LsMap< Key, T > Class Template Reference

#include <ls.h>

Inheritance diagram for LsMap< Key, T >:

Inheritance graph
[legend]
Collaboration diagram for LsMap< Key, T >:

Collaboration graph
[legend]
List of all members.

Public Types

typedef less< Key > less_key
typedef map< Key, T, less_key > baseMap
typedef map< Key, T, less<
Key > >::iterator 		iterator
typedef pair< iterator, bool > pair_iterator_bool

Public Member Functions

 LsMap ()
iterator insert (const Key &key, const T &item)
void eraseAll ()
T * findPtr (Key key)

template<class Key, class T>
class LsMap< Key, T >

Member Typedef Documentation

template<class Key, class T>
typedef map<Key, T, less_key> LsMap< Key, T >::baseMap
 

Definition at line 100 of file ls.h.

template<class Key, class T>
typedef map<Key, T, less<Key> >::iterator LsMap< Key, T >::iterator
 

Definition at line 104 of file ls.h.

template<class Key, class T>
typedef less<Key> LsMap< Key, T >::less_key
 

Definition at line 99 of file ls.h.

template<class Key, class T>
typedef pair<iterator, bool> LsMap< Key, T >::pair_iterator_bool
 

Definition at line 105 of file ls.h.

Referenced by LsMap< int, ns_addr_t >::insert().

Constructor & Destructor Documentation

template<class Key, class T>
LsMap< Key, T >::LsMap (   )  [inline]
 

Definition at line 101 of file ls.h. 

00101 : baseMap() {}

Member Function Documentation

template<class Key, class T>
void LsMap< Key, T >::eraseAll (   )  [inline]
 

Definition at line 112 of file ls.h. 

00112 { erase(begin(), end()); }

template<class Key, class T>
T* LsMap< Key, T >::findPtr (  Key  key  )  [inline]
 

Definition at line 113 of file ls.h. 

00113                             {
00114                 iterator it = baseMap::find(key);
00115                 return (it == baseMap::end()) ? (T *)NULL : &((*it).second);
00116         }

template<class Key, class T>
iterator LsMap< Key, T >::insert (  const Key &  key,
const T &  item
)  [inline]
 

Definition at line 106 of file ls.h. 

00106                                                          {
00107                 typename baseMap::value_type v(key, item);
00108                 pair_iterator_bool ib = baseMap::insert(v);
00109                 return ib.second ? ib.first : baseMap::end();
00110         }

The documentation for this class was generated from the following file:
Generated on Tue Apr 20 12:56:51 2004 for NS2.26SourcesOriginal by doxygen 1.3.3