RhodeCode

        Parent::add(keys);

        for (int i = 0; i < int(keys.size()); ++i) {

          Parent::set(keys[i], 0);

        }

      }

      virtual void build() {

        Parent::build();

        Key it;

        typename Parent::Notifier* nf = Parent::notifier();

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

          Parent::set(it, 0);

        }

      }

    };

  public:

    /// \brief Constructor.

    ///

    /// Constructor for creating an in-degree map.

    explicit InDegMap(const Digraph& graph)

      : _digraph(graph), _deg(graph) {

      Parent::attach(_digraph.notifier(typename Digraph::Arc()));

      for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) {

        _deg[it] = countInArcs(_digraph, it);

      }

    }

    /// \brief Gives back the in-degree of a Node.

    ///

    /// Gives back the in-degree of a Node.

    int operator[](const Key& key) const {

      return _deg[key];

    }

  protected:

    typedef typename Digraph::Arc Arc;

    virtual void add(const Arc& arc) {

      ++_deg[_digraph.target(arc)];

    }

    virtual void add(const std::vector<Arc>& arcs) {

      for (int i = 0; i < int(arcs.size()); ++i) {

        ++_deg[_digraph.target(arcs[i])];

      }

    }

    virtual void erase(const Arc& arc) {

      --_deg[_digraph.target(arc)];

    }

    virtual void erase(const std::vector<Arc>& arcs) {

      for (int i = 0; i < int(arcs.size()); ++i) {

        --_deg[_digraph.target(arcs[i])];

      }

    }

    virtual void build() {

      for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) {

        _deg[it] = countInArcs(_digraph, it);

      }

    }

    virtual void clear() {

      for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) {

        _deg[it] = 0;

      }

    }

  private:

    const Digraph& _digraph;

    AutoNodeMap _deg;

  };

  /// \brief Map of the out-degrees of nodes in a digraph.

  ///

  /// This map returns the out-degree of a node. Once it is constructed,

  /// the degrees are stored in a standard \c NodeMap, so each query is done

  /// in constant time. On the other hand, the values are updated automatically

  /// whenever the digraph changes.

  ///

  /// \warning Besides \c addNode() and \c addArc(), a digraph structure

  /// may provide alternative ways to modify the digraph.

  /// The correct behavior of OutDegMap is not guarantied if these additional

  /// features are used. For example, the functions

  /// \ref ListDigraph::changeSource() "changeSource()",

  /// \ref ListDigraph::changeTarget() "changeTarget()" and

  /// \ref ListDigraph::reverseArc() "reverseArc()"

  /// of \ref ListDigraph will \e not update the degree values correctly.

  ///

  /// \sa InDegMap

  template <typename GR>

  class OutDegMap

    : protected ItemSetTraits<GR, typename GR::Arc>

      ::ItemNotifier::ObserverBase {

  public:

    /// The graph type of OutDegMap

    typedef GR Graph;

    typedef GR Digraph;

    /// The key type

    typedef typename Digraph::Node Key;

    /// The value type

    typedef int Value;

    typedef typename ItemSetTraits<Digraph, typename Digraph::Arc>

    ::ItemNotifier::ObserverBase Parent;

  private:

    class AutoNodeMap

      : public ItemSetTraits<Digraph, Key>::template Map<int>::Type {

    public:

      typedef typename ItemSetTraits<Digraph, Key>::

      template Map<int>::Type Parent;

      AutoNodeMap(const Digraph& digraph) : Parent(digraph, 0) {}

      virtual void add(const Key& key) {

        Parent::add(key);

        Parent::set(key, 0);

      }

      virtual void add(const std::vector<Key>& keys) {

        Parent::add(keys);

        for (int i = 0; i < int(keys.size()); ++i) {

          Parent::set(keys[i], 0);

        }

      }

      virtual void build() {

        Parent::build();

        Key it;

        typename Parent::Notifier* nf = Parent::notifier();

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

          Parent::set(it, 0);

        }

      }

    };

  public:

    /// \brief Constructor.

    ///

    /// Constructor for creating an out-degree map.

    explicit OutDegMap(const Digraph& graph)

      : _digraph(graph), _deg(graph) {

      Parent::attach(_digraph.notifier(typename Digraph::Arc()));

      for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) {

        _deg[it] = countOutArcs(_digraph, it);

      }

    }

    /// \brief Gives back the out-degree of a Node.

    ///

    /// Gives back the out-degree of a Node.

    int operator[](const Key& key) const {

      return _deg[key];

    }

  protected:

    typedef typename Digraph::Arc Arc;

    virtual void add(const Arc& arc) {

      ++_deg[_digraph.source(arc)];

    }

    virtual void add(const std::vector<Arc>& arcs) {

      for (int i = 0; i < int(arcs.size()); ++i) {

        ++_deg[_digraph.source(arcs[i])];

      }

    }

    virtual void erase(const Arc& arc) {

      --_deg[_digraph.source(arc)];

    }

    virtual void erase(const std::vector<Arc>& arcs) {

      for (int i = 0; i < int(arcs.size()); ++i) {

        --_deg[_digraph.source(arcs[i])];

      }

    }

    virtual void build() {

      for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) {

        _deg[it] = countOutArcs(_digraph, it);

      }

    }

    virtual void clear() {

      for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) {

        _deg[it] = 0;

      }

    }

  private:

    const Digraph& _digraph;

    AutoNodeMap _deg;

  };

  /// \brief Potential difference map

  ///

  /// PotentialDifferenceMap returns the difference between the potentials of

  /// the source and target nodes of each arc in a digraph, i.e. it returns

  /// \code

  ///   potential[gr.target(arc)] - potential[gr.source(arc)].

  /// \endcode

  /// \tparam GR The digraph type.

  /// \tparam POT A node map storing the potentials.

  template <typename GR, typename POT>

  class PotentialDifferenceMap {

  public:

    /// Key type

    typedef typename GR::Arc Key;

    /// Value type

    typedef typename POT::Value Value;

    /// \brief Constructor

    ///

    /// Contructor of the map.

    explicit PotentialDifferenceMap(const GR& gr,

                                    const POT& potential)

      : _digraph(gr), _potential(potential) {}

    /// \brief Returns the potential difference for the given arc.

    ///

    /// Returns the potential difference for the given arc, i.e.

    /// \code

    ///   potential[gr.target(arc)] - potential[gr.source(arc)].

    /// \endcode

    Value operator[](const Key& arc) const {

      return _potential[_digraph.target(arc)] -

        _potential[_digraph.source(arc)];

    }

  private:

    const GR& _digraph;

    const POT& _potential;

  };

  /// \brief Returns a PotentialDifferenceMap.

  ///

  /// This function just returns a PotentialDifferenceMap.

  /// \relates PotentialDifferenceMap

  template <typename GR, typename POT>

  PotentialDifferenceMap<GR, POT>

  potentialDifferenceMap(const GR& gr, const POT& potential) {

    return PotentialDifferenceMap<GR, POT>(gr, potential);

  }

  /// @}

}

#endif // LEMON_MAPS_H

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

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

 *

 * Copyright (C) 2003-2009

 * 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.

 *

 */

#include <lemon/concepts/digraph.h>

#include <lemon/smart_graph.h>

#include <lemon/list_graph.h>

#include <lemon/lgf_reader.h>

#include <lemon/bellman_ford.h>

#include <lemon/path.h>

#include "graph_test.h"

#include "test_tools.h"

using namespace lemon;

char test_lgf[] =

  "@nodes\n"

  "label\n"

  "0\n"

  "1\n"

  "2\n"

  "3\n"

  "4\n"

  "@arcs\n"

  "    length\n"

  "0 1 3\n"

  "1 2 -3\n"

  "1 2 -5\n"

  "1 3 -2\n"

  "0 2 -1\n"

  "1 2 -4\n"

  "0 3 2\n"

  "4 2 -5\n"

  "2 3 1\n"

  "@attributes\n"

  "source 0\n"

  "target 3\n";

void checkBellmanFordCompile()

{

  typedef int Value;

  typedef concepts::Digraph Digraph;

  typedef concepts::ReadMap<Digraph::Arc,Value> LengthMap;

  typedef BellmanFord<Digraph, LengthMap> BF;

  typedef Digraph::Node Node;

  typedef Digraph::Arc Arc;

  Digraph gr;

  Node s, t, n;

  Arc e;

  Value l;

  bool b;

  BF::DistMap d(gr);

  BF::PredMap p(gr);

  LengthMap length;

  concepts::Path<Digraph> pp;

  {

    BF bf_test(gr,length);

    const BF& const_bf_test = bf_test;

    bf_test.run(s);

    bf_test.run(s,k);

    bf_test.init();

    bf_test.addSource(s);

    bf_test.addSource(s, 1);

    b = bf_test.processNextRound();

    b = bf_test.processNextWeakRound();

    bf_test.start();

    bf_test.checkedStart();

    bf_test.limitedStart(k);

    l  = const_bf_test.dist(t);

    e  = const_bf_test.predArc(t);

    s  = const_bf_test.predNode(t);

    b  = const_bf_test.reached(t);

    d  = const_bf_test.distMap();

    p  = const_bf_test.predMap();

    pp = const_bf_test.path(t);

    pp = const_bf_test.negativeCycle();

    for (BF::ActiveIt it(const_bf_test); it != INVALID; ++it) {}

  }

  {

    BF::SetPredMap<concepts::ReadWriteMap<Node,Arc> >

      ::SetDistMap<concepts::ReadWriteMap<Node,Value> >

      ::SetOperationTraits<BellmanFordDefaultOperationTraits<Value> >

      ::Create bf_test(gr,length);

    LengthMap length_map;

    concepts::ReadWriteMap<Node,Arc> pred_map;

    concepts::ReadWriteMap<Node,Value> dist_map;

    bf_test

      .lengthMap(length_map)

      .predMap(pred_map)

      .distMap(dist_map);

    bf_test.run(s);

    bf_test.run(s,k);

    bf_test.init();

    bf_test.addSource(s);

    bf_test.addSource(s, 1);

    b = bf_test.processNextRound();

    b = bf_test.processNextWeakRound();

    bf_test.start();

    bf_test.checkedStart();

    bf_test.limitedStart(k);

    l  = bf_test.dist(t);

    e  = bf_test.predArc(t);

    s  = bf_test.predNode(t);

    b  = bf_test.reached(t);

    pp = bf_test.path(t);

    pp = bf_test.negativeCycle();

  }

}

void checkBellmanFordFunctionCompile()

{

  typedef int Value;

  typedef concepts::Digraph Digraph;

  typedef Digraph::Arc Arc;

  typedef Digraph::Node Node;

  typedef concepts::ReadMap<Digraph::Arc,Value> LengthMap;

  Digraph g;

  bool b;

  bellmanFord(g,LengthMap()).run(Node());

  b = bellmanFord(g,LengthMap()).run(Node(),Node());

  bellmanFord(g,LengthMap())

    .predMap(concepts::ReadWriteMap<Node,Arc>())

    .distMap(concepts::ReadWriteMap<Node,Value>())

    .run(Node());

  b=bellmanFord(g,LengthMap())

    .predMap(concepts::ReadWriteMap<Node,Arc>())

    .distMap(concepts::ReadWriteMap<Node,Value>())

    .path(concepts::Path<Digraph>())

    .dist(Value())

    .run(Node(),Node());

}

template <typename Digraph, typename Value>

void checkBellmanFord() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  typedef typename Digraph::template ArcMap<Value> LengthMap;

  Digraph gr;

  Node s, t;

  LengthMap length(gr);

  std::istringstream input(test_lgf);

  digraphReader(gr, input).

    arcMap("length", length).

    node("source", s).

    node("target", t).

    run();

  BellmanFord<Digraph, LengthMap>

    bf(gr, length);

  bf.run(s);

  Path<Digraph> p = bf.path(t);

  check(bf.reached(t) && bf.dist(t) == -1, "Bellman-Ford found a wrong path.");

  check(p.length() == 3, "path() found a wrong path.");

  check(checkPath(gr, p), "path() found a wrong path.");

  check(pathSource(gr, p) == s, "path() found a wrong path.");

  check(pathTarget(gr, p) == t, "path() found a wrong path.");

  ListPath<Digraph> path;

  Value dist;

  bool reached = bellmanFord(gr,length).path(path).dist(dist).run(s,t);

  check(reached && dist == -1, "Bellman-Ford found a wrong path.");

  check(path.length() == 3, "path() found a wrong path.");

  check(checkPath(gr, path), "path() found a wrong path.");

  check(pathSource(gr, path) == s, "path() found a wrong path.");

  check(pathTarget(gr, path) == t, "path() found a wrong path.");

  for(ArcIt e(gr); e!=INVALID; ++e) {

    Node u=gr.source(e);

    Node v=gr.target(e);

    check(!bf.reached(u) || (bf.dist(v) - bf.dist(u) <= length[e]),

          "Wrong output. dist(target)-dist(source)-arc_length=" <<

          bf.dist(v) - bf.dist(u) - length[e]);

  }

  for(NodeIt v(gr); v!=INVALID; ++v) {

    if (bf.reached(v)) {

      check(v==s || bf.predArc(v)!=INVALID, "Wrong tree.");

      if (bf.predArc(v)!=INVALID ) {

        Arc e=bf.predArc(v);

        Node u=gr.source(e);

        check(u==bf.predNode(v),"Wrong tree.");

        check(bf.dist(v) - bf.dist(u) == length[e],

              "Wrong distance! Difference: " <<

              bf.dist(v) - bf.dist(u) - length[e]);

      }

    }

  }

}

void checkBellmanFordNegativeCycle() {

  DIGRAPH_TYPEDEFS(SmartDigraph);

  SmartDigraph gr;

  IntArcMap length(gr);

  Node n1 = gr.addNode();

  Node n2 = gr.addNode();

  Node n3 = gr.addNode();

  Node n4 = gr.addNode();

  Arc a1 = gr.addArc(n1, n2);

  Arc a2 = gr.addArc(n2, n2);

  length[a1] = 2;

  length[a2] = -1;

  {

    BellmanFord<SmartDigraph, IntArcMap> bf(gr, length);

    bf.run(n1);

    StaticPath<SmartDigraph> p = bf.negativeCycle();

    check(p.length() == 1 && p.front() == p.back() && p.front() == a2,

          "Wrong negative cycle.");

  }

  length[a2] = 0;

  {

    BellmanFord<SmartDigraph, IntArcMap> bf(gr, length);

    bf.run(n1);

    check(bf.negativeCycle().empty(),

          "Negative cycle should not be found.");

  }

  length[gr.addArc(n1, n3)] = 5;

  length[gr.addArc(n4, n3)] = 1;

  length[gr.addArc(n2, n4)] = 2;

  length[gr.addArc(n3, n2)] = -4;

  {

    BellmanFord<SmartDigraph, IntArcMap> bf(gr, length);

    bf.init();

    bf.addSource(n1);

    for (int i = 0; i < 4; ++i) {

      check(bf.negativeCycle().empty(),

            "Negative cycle should not be found.");

      bf.processNextRound();

    }

    StaticPath<SmartDigraph> p = bf.negativeCycle();

    check(p.length() == 3, "Wrong negative cycle.");

    check(length[p.nth(0)] + length[p.nth(1)] + length[p.nth(2)] == -1,

          "Wrong negative cycle.");

  }

}

int main() {

  checkBellmanFord<ListDigraph, int>();

  checkBellmanFord<SmartDigraph, double>();

  checkBellmanFordNegativeCycle();

  return 0;

}

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

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

 *

 * Copyright (C) 2003-2009

 * 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.

 *

 */

#include <deque>

#include <set>

#include <lemon/concept_check.h>

#include <lemon/concepts/maps.h>

#include <lemon/maps.h>

#include <lemon/list_graph.h>

#include <lemon/smart_graph.h>

#include <lemon/adaptors.h>

#include <lemon/dfs.h>

#include "test_tools.h"

using namespace lemon;

using namespace lemon::concepts;

struct A {};

inline bool operator<(A, A) { return true; }

struct B {};

class C {

public:

};

class F {

public:

  typedef A argument_type;

  typedef B result_type;

  B operator()(const A&) const { return B(); }

private:

  F& operator=(const F&);

};

int func(A) { return 3; }

int binc(int a, B) { return a+1; }

typedef ReadMap<A, double> DoubleMap;

typedef ReadWriteMap<A, double> DoubleWriteMap;

typedef ReferenceMap<A, double, double&, const double&> DoubleRefMap;

typedef ReadMap<A, bool> BoolMap;

typedef ReadWriteMap<A, bool> BoolWriteMap;

typedef ReferenceMap<A, bool, bool&, const bool&> BoolRefMap;

int main()

{

  // Map concepts

  checkConcept<ReadMap<A,B>, ReadMap<A,B> >();

  checkConcept<ReadMap<A,C>, ReadMap<A,C> >();

  checkConcept<WriteMap<A,B>, WriteMap<A,B> >();

  checkConcept<WriteMap<A,C>, WriteMap<A,C> >();

  checkConcept<ReadWriteMap<A,B>, ReadWriteMap<A,B> >();

  checkConcept<ReadWriteMap<A,C>, ReadWriteMap<A,C> >();

  checkConcept<ReferenceMap<A,B,B&,const B&>, ReferenceMap<A,B,B&,const B&> >();

  checkConcept<ReferenceMap<A,C,C&,const C&>, ReferenceMap<A,C,C&,const C&> >();

  // NullMap

  {

    checkConcept<ReadWriteMap<A,B>, NullMap<A,B> >();

    NullMap<A,B> map1;

    NullMap<A,B> map2 = map1;

    map1 = nullMap<A,B>();

  }

  // ConstMap

  {

    checkConcept<ReadWriteMap<A,B>, ConstMap<A,B> >();

    checkConcept<ReadWriteMap<A,C>, ConstMap<A,C> >();

    ConstMap<A,B> map1;

    ConstMap<A,B> map2 = B();

    ConstMap<A,B> map3 = map1;

    map1 = constMap<A>(B());

    map1 = constMap<A,B>();

    map1.setAll(B());

    ConstMap<A,C> map4(C(1));

    ConstMap<A,C> map5 = map4;

    map4 = constMap<A>(C(2));

    map4.setAll(C(3));

    checkConcept<ReadWriteMap<A,int>, ConstMap<A,int> >();

    check(constMap<A>(10)[A()] == 10, "Something is wrong with ConstMap");

    checkConcept<ReadWriteMap<A,int>, ConstMap<A,Const<int,10> > >();

    ConstMap<A,Const<int,10> > map6;

    ConstMap<A,Const<int,10> > map7 = map6;

    map6 = constMap<A,int,10>();

    map7 = constMap<A,Const<int,10> >();

    check(map6[A()] == 10 && map7[A()] == 10,

          "Something is wrong with ConstMap");

  }

  // IdentityMap

  {

    checkConcept<ReadMap<A,A>, IdentityMap<A> >();

    IdentityMap<A> map1;

    IdentityMap<A> map2 = map1;

    map1 = identityMap<A>();

    checkConcept<ReadMap<double,double>, IdentityMap<double> >();

    check(identityMap<double>()[1.0] == 1.0 &&

          identityMap<double>()[3.14] == 3.14,

          "Something is wrong with IdentityMap");

  }

  // RangeMap

  {

    checkConcept<ReferenceMap<int,B,B&,const B&>, RangeMap<B> >();

    RangeMap<B> map1;

    RangeMap<B> map2(10);

    RangeMap<B> map3(10,B());

    RangeMap<B> map4 = map1;

    RangeMap<B> map5 = rangeMap<B>();

    RangeMap<B> map6 = rangeMap<B>(10);

    RangeMap<B> map7 = rangeMap(10,B());

    checkConcept< ReferenceMap<int, double, double&, const double&>,

                  RangeMap<double> >();

    std::vector<double> v(10, 0);

    v[5] = 100;

    RangeMap<double> map8(v);

    RangeMap<double> map9 = rangeMap(v);

    check(map9.size() == 10 && map9[2] == 0 && map9[5] == 100,

          "Something is wrong with RangeMap");

  }

  // SparseMap

  {

    checkConcept<ReferenceMap<A,B,B&,const B&>, SparseMap<A,B> >();

    SparseMap<A,B> map1;

    SparseMap<A,B> map2 = B();

    SparseMap<A,B> map3 = sparseMap<A,B>();

    SparseMap<A,B> map4 = sparseMap<A>(B());

    checkConcept< ReferenceMap<double, int, int&, const int&>,

                  SparseMap<double, int> >();

    std::map<double, int> m;

    SparseMap<double, int> map5(m);

    SparseMap<double, int> map6(m,10);

    SparseMap<double, int> map7 = sparseMap(m);

    SparseMap<double, int> map8 = sparseMap(m,10);

    check(map5[1.0] == 0 && map5[3.14] == 0 &&

          map6[1.0] == 10 && map6[3.14] == 10,

          "Something is wrong with SparseMap");

    map5[1.0] = map6[3.14] = 100;

    check(map5[1.0] == 100 && map5[3.14] == 0 &&

          map6[1.0] == 10 && map6[3.14] == 100,

          "Something is wrong with SparseMap");

  }

  // ComposeMap

  {

    typedef ComposeMap<DoubleMap, ReadMap<B,A> > CompMap;

    checkConcept<ReadMap<B,double>, CompMap>();

    CompMap map1 = CompMap(DoubleMap(),ReadMap<B,A>());

    CompMap map2 = composeMap(DoubleMap(), ReadMap<B,A>());

    SparseMap<double, bool> m1(false); m1[3.14] = true;

    RangeMap<double> m2(2); m2[0] = 3.0; m2[1] = 3.14;

    check(!composeMap(m1,m2)[0] && composeMap(m1,m2)[1],

          "Something is wrong with ComposeMap")

  }

  // CombineMap

  {

    typedef CombineMap<DoubleMap, DoubleMap, std::plus<double> > CombMap;

    checkConcept<ReadMap<A,double>, CombMap>();

    CombMap map1 = CombMap(DoubleMap(), DoubleMap());

    CombMap map2 = combineMap(DoubleMap(), DoubleMap(), std::plus<double>());

    check(combineMap(constMap<B,int,2>(), identityMap<B>(), &binc)[B()] == 3,

          "Something is wrong with CombineMap");

  }

  // FunctorToMap, MapToFunctor

  {

    checkConcept<ReadMap<A,B>, FunctorToMap<F,A,B> >();

    checkConcept<ReadMap<A,B>, FunctorToMap<F> >();

    FunctorToMap<F> map1;

    FunctorToMap<F> map2 = FunctorToMap<F>(F());

    B b = functorToMap(F())[A()];

    checkConcept<ReadMap<A,B>, MapToFunctor<ReadMap<A,B> > >();

    MapToFunctor<ReadMap<A,B> > map = MapToFunctor<ReadMap<A,B> >(ReadMap<A,B>());

    check(functorToMap(&func)[A()] == 3,

          "Something is wrong with FunctorToMap");

    check(mapToFunctor(constMap<A,int>(2))(A()) == 2,

          "Something is wrong with MapToFunctor");

    check(mapToFunctor(functorToMap(&func))(A()) == 3 &&

          mapToFunctor(functorToMap(&func))[A()] == 3,

          "Something is wrong with FunctorToMap or MapToFunctor");

    check(functorToMap(mapToFunctor(constMap<A,int>(2)))[A()] == 2,

          "Something is wrong with FunctorToMap or MapToFunctor");

  }

  // ConvertMap

  {

    checkConcept<ReadMap<double,double>,

      ConvertMap<ReadMap<double, int>, double> >();

    ConvertMap<RangeMap<bool>, int> map1(rangeMap(1, true));

    ConvertMap<RangeMap<bool>, int> map2 = convertMap<int>(rangeMap(2, false));

  }

  // ForkMap

  {

    checkConcept<DoubleWriteMap, ForkMap<DoubleWriteMap, DoubleWriteMap> >();

    typedef RangeMap<double> RM;

    typedef SparseMap<int, double> SM;

    RM m1(10, -1);

    SM m2(-1);

    checkConcept<ReadWriteMap<int, double>, ForkMap<RM, SM> >();

    checkConcept<ReadWriteMap<int, double>, ForkMap<SM, RM> >();

    ForkMap<RM, SM> map1(m1,m2);

    ForkMap<SM, RM> map2 = forkMap(m2,m1);

    map2.set(5, 10);

    check(m1[1] == -1 && m1[5] == 10 && m2[1] == -1 &&

          m2[5] == 10 && map2[1] == -1 && map2[5] == 10,

          "Something is wrong with ForkMap");

  }