1.1 --- a/src/lemon/default_map.h Sat Nov 13 12:53:28 2004 +0000
1.2 +++ b/src/lemon/default_map.h Sat Nov 13 17:07:10 2004 +0000
1.3 @@ -33,11 +33,11 @@
1.4
1.5 /** The ArrayMap template class is graph map structure what
1.6 * automatically updates the map when a key is added to or erased from
1.7 - * the map. This map uses the VectorMap if the ValueType is a primitive
1.8 + * the map. This map uses the VectorMap if the Value is a primitive
1.9 * type and the ArrayMap for the other cases.
1.10 *
1.11 * The template parameter is the MapRegistry that the maps
1.12 - * will belong to and the ValueType.
1.13 + * will belong to and the Value.
1.14 */
1.15
1.16
1.17 @@ -147,10 +147,10 @@
1.18 typedef DefaultMap<_Graph, _Item, _ItemIt, _Value> Map;
1.19
1.20 typedef typename Parent::Graph Graph;
1.21 - typedef typename Parent::ValueType ValueType;
1.22 + typedef typename Parent::Value Value;
1.23
1.24 DefaultMap(const Graph& _g) : Parent(_g) {}
1.25 - DefaultMap(const Graph& _g, const ValueType& _v) : Parent(_g, _v) {}
1.26 + DefaultMap(const Graph& _g, const Value& _v) : Parent(_g, _v) {}
1.27 };
1.28
1.29
1.30 @@ -180,11 +180,11 @@
1.31 typedef DefaultMap<Graph, Node, NodeIt, _Value> Parent;
1.32
1.33 //typedef typename Parent::Graph Graph;
1.34 - typedef typename Parent::ValueType ValueType;
1.35 + typedef typename Parent::Value Value;
1.36
1.37 NodeMap(const Graph& _g)
1.38 : Parent(_g) {}
1.39 - NodeMap(const Graph& _g, const ValueType& _v)
1.40 + NodeMap(const Graph& _g, const Value& _v)
1.41 : Parent(_g, _v) {}
1.42
1.43 };
1.44 @@ -200,11 +200,11 @@
1.45 typedef DefaultMap<Graph, Edge, EdgeIt, _Value> Parent;
1.46
1.47 //typedef typename Parent::Graph Graph;
1.48 - typedef typename Parent::ValueType ValueType;
1.49 + typedef typename Parent::Value Value;
1.50
1.51 EdgeMap(const Graph& _g)
1.52 : Parent(_g) {}
1.53 - EdgeMap(const Graph& _g, const ValueType& _v)
1.54 + EdgeMap(const Graph& _g, const Value& _v)
1.55 : Parent(_g, _v) {}
1.56
1.57 };