This group contains the map structures implemented in LEMON.
LEMON provides several special purpose maps and map adaptors that e.g. combine new maps from existing ones.
See also: Map Concepts.
| Classes | |
| class | MapBase< K, V > | 
| Base class of maps.  More... | |
| class | NullMap< K, V > | 
| Null map. (a.k.a. DoNothingMap)  More... | |
| class | ConstMap< K, V > | 
| Constant map.  More... | |
| class | ConstMap< K, Const< V, v > > | 
| Constant map with inlined constant value.  More... | |
| class | IdentityMap< T > | 
| Identity map.  More... | |
| class | RangeMap< V > | 
| Map for storing values for integer keys from the range [0..size-1].  More... | |
| class | SparseMap< K, V, Comp > | 
| Map type based on std::map.  More... | |
| class | TrueMap< K > | 
| Constant truemap.  More... | |
| class | FalseMap< K > | 
| Constant falsemap.  More... | |
| class | LoggerBoolMap< IT, KEY > | 
| Writable bool map for logging each trueassigned element.  More... | |
| Modules | |
| Graph Maps | |
| Special graph-related maps. | |
| Map Adaptors | |
| Tools to create new maps from existing ones. | |
| Files | |
| file | maps.h | 
| Miscellaneous property maps. | |
| Functions | |
| template<typename K , typename V > | |
| NullMap< K, V > | nullMap () | 
| Returns a NullMapclass.  More... | |
| template<typename K , typename V > | |
| ConstMap< K, V > | constMap (const V &v) | 
| Returns a ConstMapclass.  More... | |
| template<typename K , typename V , V v> | |
| ConstMap< K, Const< V, v > > | constMap () | 
| Returns a ConstMapclass with inlined constant value.  More... | |
| template<typename T > | |
| IdentityMap< T > | identityMap () | 
| Returns an IdentityMapclass.  More... | |
| template<typename V > | |
| RangeMap< V > | rangeMap (int size=0, const V &value=V()) | 
| Returns a RangeMapclass.  More... | |
| template<typename V > | |
| RangeMap< V > | rangeMap (const std::vector< V > &vector) | 
| Returns a RangeMapclass created from an appropriatestd::vector.  More... | |
| template<typename K , typename V , typename Compare > | |
| SparseMap< K, V, Compare > | sparseMap (const V &value=V()) | 
| Returns a SparseMapclass.  More... | |
| template<typename K , typename V , typename Compare > | |
| SparseMap< K, V, Compare > return | SparseMap (map, value) | 
| Returns a SparseMapclass created from an appropriatestd::map.  More... | |
| template<typename K > | |
| TrueMap< K > | trueMap () | 
| Returns a TrueMapclass.  More... | |
| template<typename K > | |
| FalseMap< K > | falseMap () | 
| Returns a FalseMapclass.  More... | |
| template<typename Iterator > | |
| LoggerBoolMap< Iterator > | loggerBoolMap (Iterator it) | 
| Returns a LoggerBoolMapclass.  More... | |
| 
 | related | 
This function just returns a NullMap class. 
| 
 | related | 
This function just returns a ConstMap class. 
| 
 | related | 
This function just returns a ConstMap class with inlined constant value. 
| 
 | related | 
This function just returns an IdentityMap class. 
| 
 | related | 
This function just returns a RangeMap class. 
| 
 | related | 
This function just returns a RangeMap class created from an appropriate std::vector. 
| 
 | related | 
This function just returns a SparseMap class with specified default value. 
| 
 | related | 
This function just returns a SparseMap class created from an appropriate std::map. 
| 
 | related | 
This function just returns a TrueMap class. 
| 
 | related | 
This function just returns a FalseMap class. 
| 
 | related | 
This function just returns a LoggerBoolMap class.
The most important usage of it is storing certain nodes or arcs that were marked true by an algorithm. For example, it makes easier to store the nodes in the processing order of Dfs algorithm, as the following examples show. 
ReachedMap for Bfs, Dfs and Dijkstra algorithms.  1.8.5
 1.8.5