equal
deleted
inserted
replaced
22 #include <memory> |
22 #include <memory> |
23 |
23 |
24 #include <lemon/bits/traits.h> |
24 #include <lemon/bits/traits.h> |
25 #include <lemon/bits/alteration_notifier.h> |
25 #include <lemon/bits/alteration_notifier.h> |
26 #include <lemon/concept_check.h> |
26 #include <lemon/concept_check.h> |
27 #include <lemon/concept/maps.h> |
27 #include <lemon/concepts/maps.h> |
28 |
28 |
29 /// \ingroup graphbits |
29 /// \ingroup graphbits |
30 /// \file |
30 /// \file |
31 /// \brief Graph map based on the array storage. |
31 /// \brief Graph map based on the array storage. |
32 |
32 |
139 /// concecpt and could be indiced by the current item set of |
139 /// concecpt and could be indiced by the current item set of |
140 /// the NodeMap. In this case the value for each item |
140 /// the NodeMap. In this case the value for each item |
141 /// is assigned by the value of the given ReadMap. |
141 /// is assigned by the value of the given ReadMap. |
142 template <typename CMap> |
142 template <typename CMap> |
143 ArrayMap& operator=(const CMap& cmap) { |
143 ArrayMap& operator=(const CMap& cmap) { |
144 checkConcept<concept::ReadMap<Key, _Value>, CMap>(); |
144 checkConcept<concepts::ReadMap<Key, _Value>, CMap>(); |
145 const typename Parent::Notifier* notifier = Parent::getNotifier(); |
145 const typename Parent::Notifier* notifier = Parent::getNotifier(); |
146 Item it; |
146 Item it; |
147 for (notifier->first(it); it != INVALID; notifier->next(it)) { |
147 for (notifier->first(it); it != INVALID; notifier->next(it)) { |
148 set(it, cmap[it]); |
148 set(it, cmap[it]); |
149 } |
149 } |