lemon/bits/default_map.h
changeset 1686 a5b8e0fde2be
parent 1669 66ae78d29f1e
child 1703 eb90e3d6bddc
equal deleted inserted replaced
2:fbb8d8f5b109 3:2c3aa23b456f
   168 
   168 
   169       NodeMap(const Graph& _g) 
   169       NodeMap(const Graph& _g) 
   170 	: Parent(_g) {}
   170 	: Parent(_g) {}
   171       NodeMap(const Graph& _g, const _Value& _v) 
   171       NodeMap(const Graph& _g, const _Value& _v) 
   172 	: Parent(_g, _v) {}
   172 	: Parent(_g, _v) {}
       
   173 
       
   174       NodeMap& operator=(const NodeMap& cmap) {
       
   175 	return operator=<NodeMap>(cmap);
       
   176       }
       
   177 
   173 
   178 
   174       /// \brief Template assign operator.
   179       /// \brief Template assign operator.
   175       ///
   180       ///
   176       /// The given parameter should be conform to the ReadMap
   181       /// The given parameter should be conform to the ReadMap
   177       /// concecpt and could be indiced by the current item set of
   182       /// concecpt and could be indiced by the current item set of
   200       EdgeMap(const Graph& _g) 
   205       EdgeMap(const Graph& _g) 
   201 	: Parent(_g) {}
   206 	: Parent(_g) {}
   202       EdgeMap(const Graph& _g, const _Value& _v) 
   207       EdgeMap(const Graph& _g, const _Value& _v) 
   203 	: Parent(_g, _v) {}
   208 	: Parent(_g, _v) {}
   204 
   209 
       
   210       EdgeMap& operator=(const EdgeMap& cmap) {
       
   211 	return operator=<EdgeMap>(cmap);
       
   212       }
       
   213 
   205       template <typename CMap>
   214       template <typename CMap>
   206       EdgeMap& operator=(const CMap& cmap) {
   215       EdgeMap& operator=(const CMap& cmap) {
   207 	checkConcept<concept::ReadMap<Edge, _Value>, CMap>();
   216 	checkConcept<concept::ReadMap<Edge, _Value>, CMap>();
   208 	const typename Parent::Graph* graph = Parent::getGraph();
   217 	const typename Parent::Graph* graph = Parent::getGraph();
   209 	Edge it;
   218 	Edge it;
   238       UndirEdgeMap(const Graph& _g) 
   247       UndirEdgeMap(const Graph& _g) 
   239 	: Parent(_g) {}
   248 	: Parent(_g) {}
   240       UndirEdgeMap(const Graph& _g, const _Value& _v) 
   249       UndirEdgeMap(const Graph& _g, const _Value& _v) 
   241 	: Parent(_g, _v) {}
   250 	: Parent(_g, _v) {}
   242 
   251 
       
   252       UndirEdgeMap& operator=(const UndirEdgeMap& cmap) {
       
   253 	return operator=<UndirEdgeMap>(cmap);
       
   254       }
       
   255 
   243       template <typename CMap>
   256       template <typename CMap>
   244       UndirEdgeMap& operator=(const CMap& cmap) {
   257       UndirEdgeMap& operator=(const CMap& cmap) {
   245 	checkConcept<concept::ReadMap<UndirEdge, _Value>, CMap>();
   258 	checkConcept<concept::ReadMap<UndirEdge, _Value>, CMap>();
   246 	const typename Parent::Graph* graph = Parent::getGraph();
   259 	const typename Parent::Graph* graph = Parent::getGraph();
   247 	UndirEdge it;
   260 	UndirEdge it;