#define MAP_REGISTRY_H

 #define MAP_REGISTRY_H

 #include <vector>

 #include <vector>

 using namespace std;

 using namespace std;

 /** 

 /** 

     Registry class to register edge or node maps in the graph. The

     Registry class to register edge or node maps in the graph. The

     registry helps you to implement an observer pattern. If you add

     registry helps you to implement an observer pattern. If you add

     or erase an edge or node you must notify all the maps about the

     or erase an edge or node you must notify all the maps about the

     event.

     event.

 */

 */

   template <typename G, typename K, typename KIt>

   template <typename G, typename K, typename KIt>

   class MapRegistry {

   class MapRegistry {

   public:

   public:

     typedef G Graph;

     typedef G Graph;

     typedef K Key;

     typedef K Key;

     typedef KIt KeyIt;

     typedef KIt KeyIt;

     class MapBase {

     class MapBase {

     public:

     public:

       typedef G Graph;

       typedef G Graph;

       typedef MapRegistry<G, K, KIt> Registry;

       typedef MapRegistry<G, K, KIt> Registry;

       typedef K Key;

       typedef K Key;

     Container container;

     Container container;

     public:

     public:

     MapRegistry() {}

     MapRegistry() {}

     MapRegistry(const MapRegistry&) {}

     MapRegistry(const MapRegistry&) {}

     MapRegistry& operator=(const MapRegistry&) {

     MapRegistry& operator=(const MapRegistry&) {

       for (it = container.begin(); it != container.end(); ++it) {

       for (it = container.begin(); it != container.end(); ++it) {

 	(*it)->destroy();

 	(*it)->destroy();

 	(*it)->graph = 0;

 	(*it)->graph = 0;

 	(*it)->registry = 0;

 	(*it)->registry = 0;

       }

       }

     }

     }

     ~MapRegistry() {

     ~MapRegistry() {

       typename Container::iterator it;

       typename Container::iterator it;

       for (it = container.begin(); it != container.end(); ++it) {

       for (it = container.begin(); it != container.end(); ++it) {

 	(*it)->destroy();

 	(*it)->destroy();

 	(*it)->registry = 0;

 	(*it)->registry = 0;

     }

     }

     public:

     public:

     void attach(MapBase& map) {

     void attach(MapBase& map) {

       if (map.registry) {

       if (map.registry) {

 	map.registry->detach(map);

 	map.registry->detach(map);

       }

       }

       container.push_back(&map);

       container.push_back(&map);

       map.registry = this;

       map.registry = this;

       map.registry_index = container.size()-1;

       map.registry_index = container.size()-1;

     } 

     } 

     void detach(MapBase& map) {

     void detach(MapBase& map) {

       container.back()->registry_index = map.registry_index; 

       container.back()->registry_index = map.registry_index; 

       container[map.registry_index] = container.back();

       container[map.registry_index] = container.back();

       container.pop_back();

       container.pop_back();

       map.registry = 0;

       map.registry = 0;

       map.graph = 0;

       map.graph = 0;

     }

     }

     virtual void add(Key& key) {

     virtual void add(Key& key) {

       typename Container::iterator it;

       typename Container::iterator it;

       for (it = container.begin(); it != container.end(); ++it) {

       for (it = container.begin(); it != container.end(); ++it) {

 	(*it)->add(key);

 	(*it)->add(key);

       }

       }

     }	

     }	

     virtual void erase(Key& key) {

     virtual void erase(Key& key) {

       typename Container::iterator it;

       typename Container::iterator it;

       for (it = container.begin(); it != container.end(); ++it) {

       for (it = container.begin(); it != container.end(); ++it) {

 	(*it)->erase(key);

 	(*it)->erase(key);

       }

       }