/* -*- C++ -*-

  *

  * This file is a part of LEMON, a generic C++ optimization library

  *

  * Copyright (C) 2003-2006

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  *

  * Permission to use, modify and distribute this software is granted

  * provided that this copyright notice appears in all copies. For

  * precise terms see the accompanying LICENSE file.

  *

  * This software is provided "AS IS" with no warranty of any kind,

  * express or implied, and with no claim as to its suitability for any

  * purpose.

  *

  */

 #ifndef LEMON_DEFAULT_MAP_H

 #define LEMON_DEFAULT_MAP_H

 #include <lemon/bits/array_map.h>

 #include <lemon/bits/vector_map.h>

 ///\ingroup graphmapfactory

 ///\file

 ///\brief Graph maps that construct and destruct

 ///their elements dynamically.

 namespace lemon {

 #ifndef GLIBCXX_DEBUG

   template <typename _Graph, typename _Item, typename _Value>

   struct DefaultMapSelector {

     typedef ArrayMap<_Graph, _Item, _Value> Map;

   };

 #else

   template <typename _Graph, typename _Item, typename _Value>

   struct DefaultMapSelector {

     typedef VectorMap<_Graph, _Item, _Value> Map;

   };

 #endif

   // bool

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, bool> {

     typedef VectorMap<_Graph, _Item, bool> Map;

   };

   // char

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, char> {

     typedef VectorMap<_Graph, _Item, char> Map;

   };

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, signed char> {

     typedef VectorMap<_Graph, _Item, signed char> Map;

   };

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, unsigned char> {

     typedef VectorMap<_Graph, _Item, unsigned char> Map;

   };

   // int

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, signed int> {

     typedef VectorMap<_Graph, _Item, signed int> Map;

   };

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, unsigned int> {

     typedef VectorMap<_Graph, _Item, unsigned int> Map;

   };

   // short

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, signed short> {

     typedef VectorMap<_Graph, _Item, signed short> Map;

   };

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, unsigned short> {

     typedef VectorMap<_Graph, _Item, unsigned short> Map;

   };

   // long

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, signed long> {

     typedef VectorMap<_Graph, _Item, signed long> Map;

   };

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, unsigned long> {

     typedef VectorMap<_Graph, _Item, unsigned long> Map;

   };

 #ifndef __STRICT_ANSI__

   // long long

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, signed long long> {

     typedef VectorMap<_Graph, _Item, signed long long> Map;

   };

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, unsigned long long> {

     typedef VectorMap<_Graph, _Item, unsigned long long> Map;

   };

 #endif

   // float

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, float> {

     typedef VectorMap<_Graph, _Item, float> Map;

   };

   // double

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, double> {

     typedef VectorMap<_Graph, _Item,  double> Map;

   };

   // long double

   template <typename _Graph, typename _Item>

   struct DefaultMapSelector<_Graph, _Item, long double> {

     typedef VectorMap<_Graph, _Item, long double> Map;

   };

   // pointer

   template <typename _Graph, typename _Item, typename _Ptr>

   struct DefaultMapSelector<_Graph, _Item, _Ptr*> {

     typedef VectorMap<_Graph, _Item, _Ptr*> Map;

   };

   /// \e

   template <

     typename _Graph, 

     typename _Item,

     typename _Value>

   class DefaultMap 

     : public DefaultMapSelector<_Graph, _Item, _Value>::Map {

   public:

     typedef typename DefaultMapSelector<_Graph, _Item, _Value>::Map Parent;

     typedef DefaultMap<_Graph, _Item, _Value> Map;

     typedef typename Parent::Graph Graph;

     typedef typename Parent::Value Value;

     DefaultMap(const Graph& _g) : Parent(_g) {}

     DefaultMap(const Graph& _g, const Value& _v) : Parent(_g, _v) {}

   };

   /// \e

   template <typename _Base> 

   class MappableGraphExtender : public _Base {

   public:

     typedef MappableGraphExtender<_Base> Graph;

     typedef _Base Parent;

     typedef typename Parent::Node Node;

     typedef typename Parent::NodeIt NodeIt;

     typedef typename Parent::Edge Edge;

     typedef typename Parent::EdgeIt EdgeIt;

     template <typename _Value>

     class NodeMap 

       : public IterableMapExtender<DefaultMap<Graph, Node, _Value> > {

     public:

       typedef MappableGraphExtender Graph;

       typedef IterableMapExtender<DefaultMap<Graph, Node, _Value> > Parent;

       NodeMap(const Graph& _g) 

 	: Parent(_g) {}

       NodeMap(const Graph& _g, const _Value& _v) 

 	: Parent(_g, _v) {}

       NodeMap& operator=(const NodeMap& cmap) {

 	return operator=<NodeMap>(cmap);

       }

       /// \brief Template assign operator.

       ///

       /// The given parameter should be conform to the ReadMap

       /// concecpt and could be indiced by the current item set of

       /// the NodeMap. In this case the value for each item

       /// is assigned by the value of the given ReadMap. 

       template <typename CMap>

       NodeMap& operator=(const CMap& cmap) {

 	checkConcept<concept::ReadMap<Node, _Value>, CMap>();

 	const typename Parent::Graph* graph = Parent::getGraph();

 	Node it;

 	for (graph->first(it); it != INVALID; graph->next(it)) {

 	  Parent::set(it, cmap[it]);

 	}

 	return *this;

       }

     };

     template <typename _Value>

     class EdgeMap 

       : public IterableMapExtender<DefaultMap<Graph, Edge, _Value> > {

     public:

       typedef MappableGraphExtender Graph;

       typedef IterableMapExtender<DefaultMap<Graph, Edge, _Value> > Parent;

       EdgeMap(const Graph& _g) 

 	: Parent(_g) {}

       EdgeMap(const Graph& _g, const _Value& _v) 

 	: Parent(_g, _v) {}

       EdgeMap& operator=(const EdgeMap& cmap) {

 	return operator=<EdgeMap>(cmap);

       }

       template <typename CMap>

       EdgeMap& operator=(const CMap& cmap) {

 	checkConcept<concept::ReadMap<Edge, _Value>, CMap>();

 	const typename Parent::Graph* graph = Parent::getGraph();

 	Edge it;

 	for (graph->first(it); it != INVALID; graph->next(it)) {

 	  Parent::set(it, cmap[it]);

 	}

 	return *this;

       }

     };

   };

   /// \e

   template <typename _Base> 

   class MappableEdgeSetExtender : public _Base {

   public:

     typedef MappableEdgeSetExtender<_Base> Graph;

     typedef _Base Parent;

     typedef typename Parent::Edge Edge;

     typedef typename Parent::EdgeIt EdgeIt;

     template <typename _Value>

     class EdgeMap 

       : public IterableMapExtender<DefaultMap<Graph, Edge, _Value> > {

     public:

       typedef MappableEdgeSetExtender Graph;

       typedef IterableMapExtender<DefaultMap<Graph, Edge, _Value> > Parent;

       EdgeMap(const Graph& _g) 

 	: Parent(_g) {}

       EdgeMap(const Graph& _g, const _Value& _v) 

 	: Parent(_g, _v) {}

       EdgeMap& operator=(const EdgeMap& cmap) {

 	return operator=<EdgeMap>(cmap);

       }

       template <typename CMap>

       EdgeMap& operator=(const CMap& cmap) {

 	checkConcept<concept::ReadMap<Edge, _Value>, CMap>();

 	const typename Parent::Graph* graph = Parent::getGraph();

 	Edge it;

 	for (graph->first(it); it != INVALID; graph->next(it)) {

 	  Parent::set(it, cmap[it]);

 	}

 	return *this;

       }

     };

   };

   /// \e

   template <typename _Base> 

   class MappableUGraphExtender : 

     public MappableGraphExtender<_Base> {

   public:

     typedef MappableUGraphExtender Graph;

     typedef MappableGraphExtender<_Base> Parent;

     typedef typename Parent::UEdge UEdge;

     template <typename _Value>

     class UEdgeMap 

       : public IterableMapExtender<DefaultMap<Graph, UEdge, _Value> > {

     public:

       typedef MappableUGraphExtender Graph;

       typedef IterableMapExtender<

 	DefaultMap<Graph, UEdge, _Value> > Parent;

       UEdgeMap(const Graph& _g) 

 	: Parent(_g) {}

       UEdgeMap(const Graph& _g, const _Value& _v) 

 	: Parent(_g, _v) {}

       UEdgeMap& operator=(const UEdgeMap& cmap) {

 	return operator=<UEdgeMap>(cmap);

       }

       template <typename CMap>

       UEdgeMap& operator=(const CMap& cmap) {

 	checkConcept<concept::ReadMap<UEdge, _Value>, CMap>();

 	const typename Parent::Graph* graph = Parent::getGraph();

 	UEdge it;

 	for (graph->first(it); it != INVALID; graph->next(it)) {

 	  Parent::set(it, cmap[it]);

 	}

 	return *this;

       }

     };

   };

   /// \e

   template <typename _Base> 

   class MappableUEdgeSetExtender : 

     public MappableEdgeSetExtender<_Base> {

   public:

     typedef MappableUEdgeSetExtender Graph;

     typedef MappableEdgeSetExtender<_Base> Parent;

     typedef typename Parent::UEdge UEdge;

     template <typename _Value>

     class UEdgeMap 

       : public IterableMapExtender<DefaultMap<Graph, UEdge, _Value> > {

     public:

       typedef MappableUEdgeSetExtender Graph;

       typedef IterableMapExtender<

 	DefaultMap<Graph, UEdge, _Value> > Parent;

       UEdgeMap(const Graph& _g) 

 	: Parent(_g) {}

       UEdgeMap(const Graph& _g, const _Value& _v) 

 	: Parent(_g, _v) {}

       UEdgeMap& operator=(const UEdgeMap& cmap) {

 	return operator=<UEdgeMap>(cmap);

       }

       template <typename CMap>

       UEdgeMap& operator=(const CMap& cmap) {

 	checkConcept<concept::ReadMap<UEdge, _Value>, CMap>();

 	const typename Parent::Graph* graph = Parent::getGraph();

 	UEdge it;

 	for (graph->first(it); it != INVALID; graph->next(it)) {

 	  Parent::set(it, cmap[it]);

 	}

 	return *this;

       }

     };

   };

   template <typename _Base>

   class MappableBpUGraphExtender : public _Base {

   public:

     typedef _Base Parent;

     typedef MappableBpUGraphExtender Graph;

     typedef typename Parent::Node Node;

     typedef typename Parent::ANode ANode;

     typedef typename Parent::BNode BNode;

     typedef typename Parent::Edge Edge;

     typedef typename Parent::UEdge UEdge;

     template <typename _Value>

     class ANodeMap 

       : public IterableMapExtender<DefaultMap<Graph, ANode, _Value> > {

     public:

       typedef MappableBpUGraphExtender Graph;

       typedef IterableMapExtender<DefaultMap<Graph, ANode, _Value> > 

       Parent;

       ANodeMap(const Graph& _g) 

 	: Parent(_g) {}

       ANodeMap(const Graph& _g, const _Value& _v) 

 	: Parent(_g, _v) {}

       ANodeMap& operator=(const ANodeMap& cmap) {

 	return operator=<ANodeMap>(cmap);

       }

       /// \brief Template assign operator.

       ///

       /// The given parameter should be conform to the ReadMap

       /// concept and could be indiced by the current item set of

       /// the ANodeMap. In this case the value for each item

       /// is assigned by the value of the given ReadMap. 

       template <typename CMap>

       ANodeMap& operator=(const CMap& cmap) {

 	checkConcept<concept::ReadMap<ANode, _Value>, CMap>();

 	const typename Parent::Graph* graph = Parent::getGraph();

 	ANode it;

 	for (graph->first(it); it != INVALID; graph->next(it)) {

 	  Parent::set(it, cmap[it]);

 	}

 	return *this;

       }

     };

     template <typename _Value>

     class BNodeMap 

       : public IterableMapExtender<DefaultMap<Graph, BNode, _Value> > {

     public:

       typedef MappableBpUGraphExtender Graph;

       typedef IterableMapExtender<DefaultMap<Graph, BNode, _Value> > 

       Parent;

       BNodeMap(const Graph& _g) 

 	: Parent(_g) {}

       BNodeMap(const Graph& _g, const _Value& _v) 

 	: Parent(_g, _v) {}

       BNodeMap& operator=(const BNodeMap& cmap) {

 	return operator=<BNodeMap>(cmap);

       }

       /// \brief Template assign operator.

       ///

       /// The given parameter should be conform to the ReadMap

       /// concept and could be indiced by the current item set of

       /// the BNodeMap. In this case the value for each item

       /// is assigned by the value of the given ReadMap. 

       template <typename CMap>

       BNodeMap& operator=(const CMap& cmap) {

 	checkConcept<concept::ReadMap<BNode, _Value>, CMap>();

 	const typename Parent::Graph* graph = Parent::getGraph();

 	BNode it;

 	for (graph->first(it); it != INVALID; graph->next(it)) {

 	  Parent::set(it, cmap[it]);

 	}

 	return *this;

       }

     };

   protected:

     template <typename _Value>

     class NodeMapBase : public Parent::NodeNotifier::ObserverBase {

     public:

       typedef MappableBpUGraphExtender Graph;

       typedef Node Key;

       typedef _Value Value;

       /// The reference type of the map;

       typedef typename BNodeMap<_Value>::Reference Reference;

       /// The pointer type of the map;

       typedef typename BNodeMap<_Value>::Pointer Pointer;

       /// The const value type of the map.

       typedef const Value ConstValue;

       /// The const reference type of the map;

       typedef typename BNodeMap<_Value>::ConstReference ConstReference;

       /// The pointer type of the map;

       typedef typename BNodeMap<_Value>::ConstPointer ConstPointer;

       typedef True ReferenceMapTag;

       NodeMapBase(const Graph& _g) 

 	: graph(&_g), bNodeMap(_g), aNodeMap(_g) {

 	Parent::NodeNotifier::ObserverBase::attach(_g.getNotifier(Node()));

       }

       NodeMapBase(const Graph& _g, const _Value& _v) 

 	: graph(&_g), bNodeMap(_g, _v), 

 	  aNodeMap(_g, _v) {

 	Parent::NodeNotifier::ObserverBase::attach(_g.getNotifier(Node()));

       }

       virtual ~NodeMapBase() {      

 	if (Parent::NodeNotifier::ObserverBase::attached()) {

 	  Parent::NodeNotifier::ObserverBase::detach();

 	}

       }

       ConstReference operator[](const Key& node) const {

 	if (Parent::aNode(node)) {

 	  return aNodeMap[node];

 	} else {

 	  return bNodeMap[node];

 	}

       } 

       Reference operator[](const Key& node) {

 	if (Parent::aNode(node)) {

 	  return aNodeMap[node];

 	} else {

 	  return bNodeMap[node];

 	}

       }

       void set(const Key& node, const Value& value) {

 	if (Parent::aNode(node)) {

 	  aNodeMap.set(node, value);

 	} else {

 	  bNodeMap.set(node, value);

 	}

       }

     protected:

       virtual void add(const Node&) {}

       virtual void add(const std::vector<Node>&) {}

       virtual void erase(const Node&) {}

       virtual void erase(const std::vector<Node>&) {}

       virtual void clear() {}

       virtual void build() {}

       const Graph* getGraph() const { return graph; }

     private:

       const Graph* graph;

       BNodeMap<_Value> bNodeMap;

       ANodeMap<_Value> aNodeMap;

     };

   public:

     template <typename _Value>

     class NodeMap 

       : public IterableMapExtender<NodeMapBase<_Value> > {

     public:

       typedef MappableBpUGraphExtender Graph;

       typedef IterableMapExtender< NodeMapBase<_Value> > Parent;

       NodeMap(const Graph& _g) 

 	: Parent(_g) {}

       NodeMap(const Graph& _g, const _Value& _v) 

 	: Parent(_g, _v) {}

       NodeMap& operator=(const NodeMap& cmap) {

 	return operator=<NodeMap>(cmap);

       }

       /// \brief Template assign operator.

       ///

       /// The given parameter should be conform to the ReadMap

       /// concept and could be indiced by the current item set of

       /// the NodeMap. In this case the value for each item

       /// is assigned by the value of the given ReadMap. 

       template <typename CMap>

       NodeMap& operator=(const CMap& cmap) {

 	checkConcept<concept::ReadMap<Node, _Value>, CMap>();

 	const typename Parent::Graph* graph = Parent::getGraph();

 	Node it;

 	for (graph->first(it); it != INVALID; graph->next(it)) {

 	  Parent::set(it, cmap[it]);

 	}

 	return *this;

       }

     };

     template <typename _Value>

     class EdgeMap 

       : public IterableMapExtender<DefaultMap<Graph, Edge, _Value> > {

     public:

       typedef MappableBpUGraphExtender Graph;

       typedef IterableMapExtender<DefaultMap<Graph, Edge, _Value> > Parent;

       EdgeMap(const Graph& _g) 

 	: Parent(_g) {}

       EdgeMap(const Graph& _g, const _Value& _v) 

 	: Parent(_g, _v) {}

       EdgeMap& operator=(const EdgeMap& cmap) {

 	return operator=<EdgeMap>(cmap);

       }

       template <typename CMap>

       EdgeMap& operator=(const CMap& cmap) {

 	checkConcept<concept::ReadMap<Edge, _Value>, CMap>();

 	const typename Parent::Graph* graph = Parent::getGraph();

 	Edge it;

 	for (graph->first(it); it != INVALID; graph->next(it)) {

 	  Parent::set(it, cmap[it]);

 	}

 	return *this;

       }

     };

     template <typename _Value>

     class UEdgeMap 

       : public IterableMapExtender<DefaultMap<Graph, UEdge, _Value> > {

     public:

       typedef MappableBpUGraphExtender Graph;

       typedef IterableMapExtender<DefaultMap<Graph, UEdge, _Value> > 

       Parent;

       UEdgeMap(const Graph& _g) 

 	: Parent(_g) {}

       UEdgeMap(const Graph& _g, const _Value& _v) 

 	: Parent(_g, _v) {}

       UEdgeMap& operator=(const UEdgeMap& cmap) {

 	return operator=<UEdgeMap>(cmap);

       }

       template <typename CMap>

       UEdgeMap& operator=(const CMap& cmap) {

 	checkConcept<concept::ReadMap<UEdge, _Value>, CMap>();

 	const typename Parent::Graph* graph = Parent::getGraph();

 	UEdge it;

 	for (graph->first(it); it != INVALID; graph->next(it)) {

 	  Parent::set(it, cmap[it]);

 	}

 	return *this;

       }

     };

   };

 }

 #endif