Map class based on the STL map (containing serveral convenience functions) More...
#include <OpenMS/DATASTRUCTURES/Map.h>
 
  
 | Classes | |
| class | IllegalKey | 
| Map illegal key exception.  More... | |
| Public Types | |
| OpenMS style typedefs | |
| typedef std::map< Key, T > | Base | 
| typedef Base::value_type | ValueType | 
| typedef Key | KeyType | 
| typedef Base::value_type * | PointerType | 
| typedef Base::iterator | Iterator | 
| typedef Base::const_iterator | ConstIterator | 
| typedef Base::reverse_iterator | ReverseIterator | 
| typedef Base::const_reverse_iterator | ConstReverseIterator | 
| Public Member Functions | |
| bool | has (const Key &key) const | 
| Test whether the map contains the given key.  More... | |
| const T & | operator[] (const Key &key) const | 
| Return a constant reference to the element whose key is key.  More... | |
| T & | operator[] (const Key &key) | 
| Return a mutable reference to the element whose key is key. If an element with the keykeydoes not exist, it is inserted.  More... | |
| Additional Inherited Members | |
|  Public Attributes inherited from map< K, T > | |
| K | keys | 
| STL member.  More... | |
| T | elements | 
| STL member.  More... | |
Map class based on the STL map (containing serveral convenience functions)
| typedef std::map<Key, T> Base | 
| typedef Base::const_iterator ConstIterator | 
| typedef Base::const_reverse_iterator ConstReverseIterator | 
| typedef Base::iterator Iterator | 
| typedef Key KeyType | 
| typedef Base::value_type* PointerType | 
| typedef Base::reverse_iterator ReverseIterator | 
| typedef Base::value_type ValueType | 
| 
 | inline | 
Test whether the map contains the given key.
Referenced by MzMLHandler< MapType >::writeHeader_(), and MzDataHandler< MapType >::writeTo().
| const T & operator[] | ( | const Key & | key | ) | const | 
Return a constant reference to the element whose key is key. 
| IllegalKey | if the given key does not exist | 
| T & operator[] | ( | const Key & | key | ) | 
Return a mutable reference to the element whose key is key. If an element with the key key does not exist, it is inserted. 
| OpenMS / TOPP release 1.11.1 | Documentation generated on Thu Nov 14 2013 11:19:29 using doxygen 1.8.5 |