1.1 --- a/src/lemon/vector_map.h	Thu Dec 16 12:15:02 2004 +0000
     1.2 +++ b/src/lemon/vector_map.h	Thu Dec 16 12:26:57 2004 +0000
     1.3 @@ -20,7 +20,7 @@
     1.4  #include <vector>
     1.5  #include <algorithm>
     1.6  
     1.7 -#include <lemon/alteration_observer_registry.h>
     1.8 +#include <lemon/alteration_notifier.h>
     1.9  
    1.10  ///\ingroup graphmaps
    1.11  ///\file
    1.12 @@ -37,7 +37,7 @@
    1.13    /// the container functionality. This map factory
    1.14    /// uses the std::vector to implement the container function.
    1.15    ///
    1.16 -  /// \param Registry The AlterationObserverRegistry that will notify this map.
    1.17 +  /// \param Registry The AlterationNotifier that will notify this map.
    1.18    /// \param IdMap The IdMap type of the graph items.
    1.19    /// \param Value The value type of the map.
    1.20    /// 
    1.21 @@ -47,7 +47,7 @@
    1.22    template <typename _Graph, 
    1.23  	    typename _Item,
    1.24  	    typename _Value>
    1.25 -  class VectorMap : public AlterationObserverRegistry<_Item>::ObserverBase {
    1.26 +  class VectorMap : public AlterationNotifier<_Item>::ObserverBase {
    1.27    public:
    1.28  		
    1.29      /// The graph type of the map. 
    1.30 @@ -55,7 +55,7 @@
    1.31      /// The key type of the map.
    1.32      typedef _Item Key;
    1.33      /// The id map type of the map.
    1.34 -    typedef AlterationObserverRegistry<_Item> Registry;
    1.35 +    typedef AlterationNotifier<_Item> Registry;
    1.36      /// The value type of the map.
    1.37      typedef _Value Value;
    1.38  
    1.39 @@ -89,7 +89,7 @@
    1.40      /// It adds all the items of the graph to the map.
    1.41       
    1.42      VectorMap(const Graph& _g) : graph(&_g) {
    1.43 -      attach(_g.getObserverRegistry(_Item()));
    1.44 +      attach(_g.getNotifier(_Item()));
    1.45        build();
    1.46      }
    1.47  
    1.48 @@ -99,7 +99,7 @@
    1.49      /// It adds all the items of the graph to the map.
    1.50       
    1.51      VectorMap(const Graph& _g, const Value& _v) : graph(&_g) { 
    1.52 -      attach(_g.getObserverRegistry(_Item()));
    1.53 +      attach(_g.getNotifier(_Item()));
    1.54        container.resize(graph->maxId(_Item()) + 1, _v);
    1.55      }
    1.56  
    1.57 @@ -224,12 +224,12 @@
    1.58      typedef typename Parent::Node Node;
    1.59      typedef typename Parent::NodeIt NodeIt;
    1.60      typedef typename Parent::NodeIdMap NodeIdMap;
    1.61 -    typedef typename Parent::NodeObserverRegistry NodeObserverRegistry;
    1.62 +    typedef typename Parent::NodeNotifier NodeObserverRegistry;
    1.63  
    1.64      typedef typename Parent::Edge Edge;
    1.65      typedef typename Parent::EdgeIt EdgeIt;
    1.66      typedef typename Parent::EdgeIdMap EdgeIdMap;
    1.67 -    typedef typename Parent::EdgeObserverRegistry EdgeObserverRegistry;
    1.68 +    typedef typename Parent::EdgeNotifier EdgeObserverRegistry;
    1.69  
    1.70      
    1.71