RhodeCode

    /// Gives back a default constructed element.

    Value operator[](const Key&) const { return Value(); }

    /// Absorbs the value.

    void set(const Key&, const Value&) {}

  };

  /// Returns a \ref NullMap class

  /// This function just returns a \ref NullMap class.

  /// \relates NullMap

  template <typename K, typename V>

  NullMap<K, V> nullMap() {

    return NullMap<K, V>();

  }

  /// Constant map.

  /// This \ref concepts::ReadMap "readable map" assigns a specified

  /// value to each key.

  ///

  /// In other aspects it is equivalent to \ref NullMap.

  /// So it conforms the \ref concepts::ReadWriteMap "ReadWriteMap"

  /// concept, but it absorbs the data written to it.

  ///

  /// The simplest way of using this map is through the constMap()

  /// function.

  ///

  /// \sa NullMap

  /// \sa IdentityMap

  template<typename K, typename V>

  class ConstMap : public MapBase<K, V> {

  private:

    V _value;

  public:

    typedef MapBase<K, V> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Default constructor

    /// Default constructor.

    /// The value of the map will be default constructed.

    ConstMap() {}

    /// Constructor with specified initial value

    /// Constructor with specified initial value.

    ConstMap(const Value &v) : _value(v) {}

    /// Gives back the specified value.

    Value operator[](const Key&) const { return _value; }

    /// Absorbs the value.

    void set(const Key&, const Value&) {}

    /// Sets the value that is assigned to each key.

    void setAll(const Value &v) {

      _value = v;

    }

    template<typename V1>

    ConstMap(const ConstMap<K, V1> &, const Value &v) : _value(v) {}

  };

  /// Returns a \ref ConstMap class

  /// This function just returns a \ref ConstMap class.

  /// \relates ConstMap

  template<typename K, typename V>

  inline ConstMap<K, V> constMap(const V &v) {

    return ConstMap<K, V>(v);

  }

  template<typename T, T v>

  struct Const {};

  /// Constant map with inlined constant value.

  /// This \ref concepts::ReadMap "readable map" assigns a specified

  /// value to each key.

  ///

  /// In other aspects it is equivalent to \ref NullMap.

  /// So it conforms the \ref concepts::ReadWriteMap "ReadWriteMap"

  /// concept, but it absorbs the data written to it.

  ///

  /// The simplest way of using this map is through the constMap()

  /// function.

  ///

  /// \sa NullMap

  /// \sa IdentityMap

  template<typename K, typename V, V v>

  class ConstMap<K, Const<V, v> > : public MapBase<K, V> {

  public:

    typedef MapBase<K, V> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor.

    ConstMap() {}

    /// Gives back the specified value.

    Value operator[](const Key&) const { return v; }

    /// Absorbs the value.

    void set(const Key&, const Value&) {}

  };

  /// Returns a \ref ConstMap class with inlined constant value

  /// This function just returns a \ref ConstMap class with inlined

  /// constant value.

  /// \relates ConstMap

  template<typename K, typename V, V v>

  inline ConstMap<K, Const<V, v> > constMap() {

    return ConstMap<K, Const<V, v> >();

  }

  /// Identity map.

  /// is equivalent to

  /// \code

  ///   addMap(m1,m2)

  /// \endcode

  ///

  /// This function is specialized for adaptable binary function

  /// classes and C++ functions.

  ///

  /// \relates CombineMap

  template<typename M1, typename M2, typename F, typename V>

  inline CombineMap<M1, M2, F, V>

  combineMap(const M1 &m1, const M2 &m2, const F &f) {

    return CombineMap<M1, M2, F, V>(m1,m2,f);

  }

  template<typename M1, typename M2, typename F>

  inline CombineMap<M1, M2, F, typename F::result_type>

  combineMap(const M1 &m1, const M2 &m2, const F &f) {

    return combineMap<M1, M2, F, typename F::result_type>(m1,m2,f);

  }

  template<typename M1, typename M2, typename K1, typename K2, typename V>

  inline CombineMap<M1, M2, V (*)(K1, K2), V>

  combineMap(const M1 &m1, const M2 &m2, V (*f)(K1, K2)) {

    return combineMap<M1, M2, V (*)(K1, K2), V>(m1,m2,f);

  }

  /// Converts an STL style (unary) functor to a map

  /// This \ref concepts::ReadMap "read-only map" returns the value

  /// of a given functor. Actually, it just wraps the functor and

  /// provides the \c Key and \c Value typedefs.

  ///

  /// Template parameters \c K and \c V will become its \c Key and

  /// \c Value. In most cases they have to be given explicitly because

  /// a functor typically does not provide \c argument_type and

  /// \c result_type typedefs.

  /// Parameter \c F is the type of the used functor.

  ///

  /// The simplest way of using this map is through the functorToMap()

  /// function.

  ///

  /// \sa MapToFunctor

  template<typename F,

	   typename K = typename F::argument_type,

	   typename V = typename F::result_type>

  class FunctorToMap : public MapBase<K, V> {

  public:

    typedef MapBase<K, V> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    FunctorToMap(const F &f = F()) : _f(f) {}

    /// \e

    Value operator[](const Key &k) const { return _f(k); }

  };

  /// Returns a \ref FunctorToMap class

  /// This function just returns a \ref FunctorToMap class.

  ///

  /// This function is specialized for adaptable binary function

  /// classes and C++ functions.

  ///

  /// \relates FunctorToMap

  template<typename K, typename V, typename F>

  inline FunctorToMap<F, K, V> functorToMap(const F &f) {

    return FunctorToMap<F, K, V>(f);

  }

  template <typename F>

  inline FunctorToMap<F, typename F::argument_type, typename F::result_type>

    functorToMap(const F &f)

  {

    return FunctorToMap<F, typename F::argument_type,

      typename F::result_type>(f);

  }

  template <typename K, typename V>

  inline FunctorToMap<V (*)(K), K, V> functorToMap(V (*f)(K)) {

    return FunctorToMap<V (*)(K), K, V>(f);

  }

  /// Converts a map to an STL style (unary) functor

  /// This class converts a map to an STL style (unary) functor.

  /// That is it provides an <tt>operator()</tt> to read its values.

  ///

  /// For the sake of convenience it also works as a usual

  /// \ref concepts::ReadMap "readable map", i.e. <tt>operator[]</tt>

  /// and the \c Key and \c Value typedefs also exist.

  ///

  /// The simplest way of using this map is through the mapToFunctor()

  C(int _x) : x(_x) {}

};

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> >();

    ConstMap<A,B> map1;

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

    ConstMap<A,B> map3 = map1;

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

    map1.setAll(B());

    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> > >();

  }

  // 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);