equal
deleted
inserted
replaced
27 #include <lemon/error.h> |
27 #include <lemon/error.h> |
28 |
28 |
29 #include <lemon/bits/alteration_notifier.h> |
29 #include <lemon/bits/alteration_notifier.h> |
30 |
30 |
31 #include <lemon/concept_check.h> |
31 #include <lemon/concept_check.h> |
32 #include <lemon/concept/maps.h> |
32 #include <lemon/concepts/maps.h> |
33 |
33 |
34 ///\ingroup graphbits |
34 ///\ingroup graphbits |
35 /// |
35 /// |
36 ///\file |
36 ///\file |
37 ///\brief Vector based graph maps for debugging. |
37 ///\brief Vector based graph maps for debugging. |
184 /// concecpt and could be indiced by the current item set of |
184 /// concecpt and could be indiced by the current item set of |
185 /// the NodeMap. In this case the value for each item |
185 /// the NodeMap. In this case the value for each item |
186 /// is assigned by the value of the given ReadMap. |
186 /// is assigned by the value of the given ReadMap. |
187 template <typename CMap> |
187 template <typename CMap> |
188 DebugMap& operator=(const CMap& cmap) { |
188 DebugMap& operator=(const CMap& cmap) { |
189 checkConcept<concept::ReadMap<Key, _Value>, CMap>(); |
189 checkConcept<concepts::ReadMap<Key, _Value>, CMap>(); |
190 const typename Parent::Notifier* notifier = Parent::getNotifier(); |
190 const typename Parent::Notifier* notifier = Parent::getNotifier(); |
191 Item it; |
191 Item it; |
192 for (notifier->first(it); it != INVALID; notifier->next(it)) { |
192 for (notifier->first(it); it != INVALID; notifier->next(it)) { |
193 set(it, cmap[it]); |
193 set(it, cmap[it]); |
194 } |
194 } |