_Graph | The graph type. | |
_Item | One of the graph's item type, the key of the map. |
#include <lemon/iterable_maps.h>
Classes | |
class | ItemIt |
Iterator for the keys with the same value. More... | |
class | Reference |
Refernce to the value of the map. More... | |
Public Types | |
typedef _Item | Key |
The key type. | |
typedef int | Value |
The value type. | |
typedef _Graph | Graph |
The graph type. | |
typedef True | ReferenceMapTag |
Indicates that the map if reference map. | |
typedef const Value & | ConstReference |
The const reference type. | |
Public Member Functions | |
IterableIntMap (const Graph &graph) | |
Constructor of the Map. | |
IterableIntMap (const Graph &graph, int value) | |
unsigned int | size () const |
void | set (const Key &key, const Value &value) |
const Value & | operator[] (const Key &key) const |
Reference | operator[] (const Key &key) |
IterableIntMap | ( | const Graph & | graph | ) | [inline, explicit] |
Constructor of the Map. It set all values -1.
IterableIntMap | ( | const Graph & | graph, | |
int | value | |||
) | [inline, explicit] |
Constructor of the Map with a given value.
unsigned int size | ( | ) | const [inline] |
Gives back the maximal value plus one.
Const subscript operator of the map.
Reimplemented from ArrayMap< _Graph, _Item, _Value >.
Subscript operator of the map.
Reimplemented from ArrayMap< _Graph, _Item, _Value >.