equal
  deleted
  inserted
  replaced
  
    
    
    26 #include <lemon/bits/utility.h>  | 
    26 #include <lemon/bits/utility.h>  | 
    27   | 
    27   | 
    28 #include <lemon/bits/alteration_notifier.h>  | 
    28 #include <lemon/bits/alteration_notifier.h>  | 
    29   | 
    29   | 
    30 #include <lemon/concept_check.h>  | 
    30 #include <lemon/concept_check.h>  | 
    31 #include <lemon/concept/maps.h>  | 
    31 #include <lemon/concepts/maps.h>  | 
    32   | 
    32   | 
    33 ///\ingroup graphbits  | 
    33 ///\ingroup graphbits  | 
    34 ///  | 
    34 ///  | 
    35 ///\file  | 
    35 ///\file  | 
    36 ///\brief Vector based graph maps.  | 
    36 ///\brief Vector based graph maps.  | 
   131     /// concecpt and could be indiced by the current item set of  | 
   131     /// concecpt and could be indiced by the current item set of  | 
   132     /// the NodeMap. In this case the value for each item  | 
   132     /// the NodeMap. In this case the value for each item  | 
   133     /// is assigned by the value of the given ReadMap.   | 
   133     /// is assigned by the value of the given ReadMap.   | 
   134     template <typename CMap>  | 
   134     template <typename CMap>  | 
   135     VectorMap& operator=(const CMap& cmap) { | 
   135     VectorMap& operator=(const CMap& cmap) { | 
   136       checkConcept<concept::ReadMap<Key, _Value>, CMap>();  | 
   136       checkConcept<concepts::ReadMap<Key, _Value>, CMap>();  | 
   137       const typename Parent::Notifier* notifier = Parent::getNotifier();  | 
   137       const typename Parent::Notifier* notifier = Parent::getNotifier();  | 
   138       Item it;  | 
   138       Item it;  | 
   139       for (notifier->first(it); it != INVALID; notifier->next(it)) { | 
   139       for (notifier->first(it); it != INVALID; notifier->next(it)) { | 
   140         set(it, cmap[it]);  | 
   140         set(it, cmap[it]);  | 
   141       }  | 
   141       }  |