RhodeCode

    Value operator[](const Key &k) const { return _m1[k]*_m2[k]; }

  };

  /// Returns a \ref MulMap class

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

  ///

  /// For example, if \c m1 and \c m2 are both maps with \c double

  /// values, then <tt>mulMap(m1,m2)[x]</tt> will be equal to

  /// <tt>m1[x]*m2[x]</tt>.

  ///

  /// \relates MulMap

  template<typename M1, typename M2>

  inline MulMap<M1, M2> mulMap(const M1 &m1,const M2 &m2) {

    return MulMap<M1, M2>(m1,m2);

  }

  /// Quotient of two maps

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

  /// of the values of the two given maps.

  /// Its \c Key and \c Value types are inherited from \c M1.

  /// The \c Key and \c Value of \c M2 must be convertible to those of

  /// \c M1.

  ///

  /// If \c m1 is of type \c M1 and \c m2 is of \c M2, then for

  /// \code

  ///   DivMap<M1,M2> dm(m1,m2);

  /// \endcode

  /// <tt>dm[x]</tt> will be equal to <tt>m1[x]/m2[x]</tt>.

  ///

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

  /// function.

  ///

  /// \sa AddMap, SubMap, MulMap

  template<typename M1, typename M2>

  class DivMap : public MapBase<typename M1::Key, typename M1::Value> {

    const M1 &_m1;

    const M2 &_m2;

  public:

    typedef MapBase<typename M1::Key, typename M1::Value> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    DivMap(const M1 &m1,const M2 &m2) : _m1(m1), _m2(m2) {}

    /// \e

    Value operator[](const Key &k) const { return _m1[k]/_m2[k]; }

  };

  /// Returns a \ref DivMap class

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

  ///

  /// For example, if \c m1 and \c m2 are both maps with \c double

  /// values, then <tt>divMap(m1,m2)[x]</tt> will be equal to

  /// <tt>m1[x]/m2[x]</tt>.

  ///

  /// \relates DivMap

  template<typename M1, typename M2>

  inline DivMap<M1, M2> divMap(const M1 &m1,const M2 &m2) {

    return DivMap<M1, M2>(m1,m2);

  }

  /// Shifts a map with a constant.

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

  /// the given map and a constant value (i.e. it shifts the map with

  /// the constant). Its \c Key and \c Value are inherited from \c M.

  ///

  /// Actually,

  /// \code

  ///   ShiftMap<M> sh(m,v);

  /// \endcode

  /// is equivalent to

  /// \code

  ///   ConstMap<M::Key, M::Value> cm(v);

  ///   AddMap<M, ConstMap<M::Key, M::Value> > sh(m,cm);

  /// \endcode

  ///

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

  /// function.

  ///

  /// \sa ShiftWriteMap

  template<typename M, typename C = typename M::Value>

  class ShiftMap : public MapBase<typename M::Key, typename M::Value> {

    const M &_m;

    C _v;

  public:

    typedef MapBase<typename M::Key, typename M::Value> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    /// Constructor.

    /// \param m The undelying map.

    /// \param v The constant value.

    ShiftMap(const M &m, const C &v) : _m(m), _v(v) {}

    /// \e

    Value operator[](const Key &k) const { return _m[k]+_v; }

  };

  /// Shifts a map with a constant (read-write version).

  /// This \ref concepts::ReadWriteMap "read-write map" returns the sum

  /// of the given map and a constant value (i.e. it shifts the map with

  /// the constant). Its \c Key and \c Value are inherited from \c M.

  /// It makes also possible to write the map.

  ///

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

  /// function.

  ///

  /// \sa ShiftMap

  template<typename M, typename C = typename M::Value>

  class ShiftWriteMap : public MapBase<typename M::Key, typename M::Value> {

    M &_m;

    C _v;

  public:

    typedef MapBase<typename M::Key, typename M::Value> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    /// Constructor.

    /// \param m The undelying map.

    /// \param v The constant value.

    ShiftWriteMap(M &m, const C &v) : _m(m), _v(v) {}

    /// \e

    Value operator[](const Key &k) const { return _m[k]+_v; }

    /// \e

    void set(const Key &k, const Value &v) { _m.set(k, v-_v); }

  };

  /// Returns a \ref ShiftMap class

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

  ///

  /// For example, if \c m is a map with \c double values and \c v is

  /// \c double, then <tt>shiftMap(m,v)[x]</tt> will be equal to

  /// <tt>m[x]+v</tt>.

  ///

  /// \relates ShiftMap

  template<typename M, typename C>

  inline ShiftMap<M, C> shiftMap(const M &m, const C &v) {

    return ShiftMap<M, C>(m,v);

  }

  /// Returns a \ref ShiftWriteMap class

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

  ///

  /// For example, if \c m is a map with \c double values and \c v is

  /// \c double, then <tt>shiftWriteMap(m,v)[x]</tt> will be equal to

  /// <tt>m[x]+v</tt>.

  /// Moreover it makes also possible to write the map.

  ///

  /// \relates ShiftWriteMap

  template<typename M, typename C>

  inline ShiftWriteMap<M, C> shiftWriteMap(M &m, const C &v) {

    return ShiftWriteMap<M, C>(m,v);

  }

  /// Scales a map with a constant.

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

  /// the given map multiplied from the left side with a constant value.

  /// Its \c Key and \c Value are inherited from \c M.

  ///

  /// Actually,

  /// \code

  ///   ScaleMap<M> sc(m,v);

  /// \endcode

  /// is equivalent to

  /// \code

  ///   ConstMap<M::Key, M::Value> cm(v);

  ///   MulMap<ConstMap<M::Key, M::Value>, M> sc(cm,m);

  /// \endcode

  ///

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

  /// function.

  ///

  /// \sa ScaleWriteMap

  template<typename M, typename C = typename M::Value>

  class ScaleMap : public MapBase<typename M::Key, typename M::Value> {

    const M &_m;

    C _v;

  public:

    typedef MapBase<typename M::Key, typename M::Value> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    /// Constructor.

    /// \param m The undelying map.

    /// \param v The constant value.

    ScaleMap(const M &m, const C &v) : _m(m), _v(v) {}

    /// \e

    Value operator[](const Key &k) const { return _v*_m[k]; }

  };

  /// Scales a map with a constant (read-write version).

  /// This \ref concepts::ReadWriteMap "read-write map" returns the value of

  /// the given map multiplied from the left side with a constant value.

  /// Its \c Key and \c Value are inherited from \c M.

  /// It can also be used as write map if the \c / operator is defined

  /// between \c Value and \c C and the given multiplier is not zero.

  ///

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

  /// function.

  ///

  /// \sa ScaleMap

  template<typename M, typename C = typename M::Value>

  class ScaleWriteMap : public MapBase<typename M::Key, typename M::Value> {

    M &_m;

    C _v;

  public:

    typedef MapBase<typename M::Key, typename M::Value> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    /// Constructor.

    /// \param m The undelying map.

    /// \param v The constant value.

    ScaleWriteMap(M &m, const C &v) : _m(m), _v(v) {}

    /// \e

    Value operator[](const Key &k) const { return _v*_m[k]; }

    /// \e

    void set(const Key &k, const Value &v) { _m.set(k, v/_v); }

  };

  /// Returns a \ref ScaleMap class

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

  ///

  /// For example, if \c m is a map with \c double values and \c v is

  /// \c double, then <tt>scaleMap(m,v)[x]</tt> will be equal to

  /// <tt>v*m[x]</tt>.

  ///

  /// \relates ScaleMap

  template<typename M, typename C>

  inline ScaleMap<M, C> scaleMap(const M &m, const C &v) {

    return ScaleMap<M, C>(m,v);

  }

  /// Returns a \ref ScaleWriteMap class

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

  ///

  /// For example, if \c m is a map with \c double values and \c v is

  /// \c double, then <tt>scaleWriteMap(m,v)[x]</tt> will be equal to

  /// <tt>v*m[x]</tt>.

  /// Moreover it makes also possible to write the map.

  ///

  /// \relates ScaleWriteMap

  template<typename M, typename C>

  inline ScaleWriteMap<M, C> scaleWriteMap(M &m, const C &v) {

    return ScaleWriteMap<M, C>(m,v);

  }

  /// Negative of a map

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

  /// of the values of the given map (using the unary \c - operator).

  /// Its \c Key and \c Value are inherited from \c M.

  ///

  /// If M::Value is \c int, \c double etc., then

  /// \code

  ///   NegMap<M> neg(m);

  /// \endcode

  /// is equivalent to

  /// \code

  ///   ScaleMap<M> neg(m,-1);

  /// \endcode

  ///

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

  /// function.

  ///

  /// \sa NegWriteMap

  template<typename M>

  class NegMap : public MapBase<typename M::Key, typename M::Value> {

    const M& _m;

  public:

    typedef MapBase<typename M::Key, typename M::Value> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    NegMap(const M &m) : _m(m) {}

    /// \e

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

  };

  /// Negative of a map (read-write version)

  /// This \ref concepts::ReadWriteMap "read-write map" returns the

  /// negative of the values of the given map (using the unary \c -

  /// operator).

  /// Its \c Key and \c Value are inherited from \c M.

  /// It makes also possible to write the map.

  ///

  /// If M::Value is \c int, \c double etc., then

  /// \code

  ///   NegWriteMap<M> neg(m);

  /// \endcode

  /// is equivalent to

  /// \code

  ///   ScaleWriteMap<M> neg(m,-1);

  /// \endcode

  ///

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

  /// function.

  ///

  /// \sa NegMap

  template<typename M>

  class NegWriteMap : public MapBase<typename M::Key, typename M::Value> {

    M &_m;

  public:

    typedef MapBase<typename M::Key, typename M::Value> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    NegWriteMap(M &m) : _m(m) {}

    /// \e

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

    /// \e

    void set(const Key &k, const Value &v) { _m.set(k, -v); }

  };

  /// Returns a \ref NegMap class

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

  ///

  /// For example, if \c m is a map with \c double values, then

  /// <tt>negMap(m)[x]</tt> will be equal to <tt>-m[x]</tt>.

  ///

  /// \relates NegMap

  template <typename M>

  inline NegMap<M> negMap(const M &m) {

    return NegMap<M>(m);

  }

  /// Returns a \ref NegWriteMap class

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

  ///

  /// For example, if \c m is a map with \c double values, then

  /// <tt>negWriteMap(m)[x]</tt> will be equal to <tt>-m[x]</tt>.

  /// Moreover it makes also possible to write the map.

  ///

  /// \relates NegWriteMap

  template <typename M>

  inline NegWriteMap<M> negWriteMap(M &m) {

    return NegWriteMap<M>(m);

  }

  /// Absolute value of a map

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

  /// value of the values of the given map.

  /// Its \c Key and \c Value are inherited from \c M.

  /// \c Value must be comparable to \c 0 and the unary \c -

  /// operator must be defined for it, of course.

  ///

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

  /// function.

  template<typename M>

  class AbsMap : public MapBase<typename M::Key, typename M::Value> {

    const M &_m;

  public:

    typedef MapBase<typename M::Key, typename M::Value> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    AbsMap(const M &m) : _m(m) {}

    /// \e

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

      Value tmp = _m[k];

      return tmp >= 0 ? tmp : -tmp;

    }

  };

  /// Returns an \ref AbsMap class

  /// This function just returns an \ref AbsMap class.

  ///

  /// For example, if \c m is a map with \c double values, then

  /// <tt>absMap(m)[x]</tt> will be equal to <tt>m[x]</tt> if

  /// it is positive or zero and <tt>-m[x]</tt> if <tt>m[x]</tt> is

  /// negative.

  ///

  /// \relates AbsMap

  template<typename M>

  inline AbsMap<M> absMap(const M &m) {

    return AbsMap<M>(m);

  }

  /// @}

  // Logical maps and map adaptors:

  /// \addtogroup maps

  /// @{

  /// Constant \c true map.

  /// This \ref concepts::ReadMap "read-only map" assigns \c true to

  /// each key.

  ///

  /// Note that

  /// \code

  ///   TrueMap<K> tm;

  /// \endcode

  /// is equivalent to

  /// \code

  ///   ConstMap<K,bool> tm(true);

  /// \endcode

  ///

  /// \sa FalseMap

  /// \sa ConstMap

  template <typename K>

  class TrueMap : public MapBase<K, bool> {

  public:

    typedef MapBase<K, bool> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Gives back \c true.

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

  };

  /// Returns a \ref TrueMap class

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

  /// \relates TrueMap

  template<typename K>

  inline TrueMap<K> trueMap() {

    return TrueMap<K>();

  }

  /// Constant \c false map.

  /// This \ref concepts::ReadMap "read-only map" assigns \c false to

  /// each key.

  ///

  /// Note that

  /// \code

  ///   FalseMap<K> fm;

  /// \endcode

  /// is equivalent to

  /// \code

  ///   ConstMap<K,bool> fm(false);

  /// \endcode

  ///

  /// \sa TrueMap

  /// \sa ConstMap

  template <typename K>

  class FalseMap : public MapBase<K, bool> {

  public:

    typedef MapBase<K, bool> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Gives back \c false.

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

  };

  /// Returns a \ref FalseMap class

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

  /// \relates FalseMap

  template<typename K>

  inline FalseMap<K> falseMap() {

    return FalseMap<K>();

  }

  /// @}

  /// \addtogroup map_adaptors

  /// @{

  /// Logical 'and' of two maps

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

  /// 'and' of the values of the two given maps.

  /// Its \c Key type is inherited from \c M1 and its \c Value type is

  /// \c bool. \c M2::Key must be convertible to \c M1::Key.

  ///

  /// If \c m1 is of type \c M1 and \c m2 is of \c M2, then for

  /// \code

  ///   AndMap<M1,M2> am(m1,m2);

  /// \endcode

  /// <tt>am[x]</tt> will be equal to <tt>m1[x]&&m2[x]</tt>.

  ///

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

  /// function.

  ///

  /// \sa OrMap

  /// \sa NotMap, NotWriteMap

  template<typename M1, typename M2>

  class AndMap : public MapBase<typename M1::Key, bool> {

    const M1 &_m1;

    const M2 &_m2;

  public:

    typedef MapBase<typename M1::Key, bool> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    AndMap(const M1 &m1, const M2 &m2) : _m1(m1), _m2(m2) {}

    /// \e

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

  };

  /// Returns an \ref AndMap class

  /// This function just returns an \ref AndMap class.

  ///

  /// For example, if \c m1 and \c m2 are both maps with \c bool values,

  /// then <tt>andMap(m1,m2)[x]</tt> will be equal to

  /// <tt>m1[x]&&m2[x]</tt>.

  ///

  /// \relates AndMap

  template<typename M1, typename M2>

  inline AndMap<M1, M2> andMap(const M1 &m1, const M2 &m2) {

    return AndMap<M1, M2>(m1,m2);

  }

  /// Logical 'or' of two maps

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

  /// 'or' of the values of the two given maps.

  /// Its \c Key type is inherited from \c M1 and its \c Value type is

  /// \c bool. \c M2::Key must be convertible to \c M1::Key.

  ///

  /// If \c m1 is of type \c M1 and \c m2 is of \c M2, then for

  /// \code

  ///   OrMap<M1,M2> om(m1,m2);

  /// \endcode

  /// <tt>om[x]</tt> will be equal to <tt>m1[x]||m2[x]</tt>.

  ///

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

  /// function.

  ///

  /// \sa AndMap

  /// \sa NotMap, NotWriteMap

  template<typename M1, typename M2>

  class OrMap : public MapBase<typename M1::Key, bool> {

    const M1 &_m1;

    const M2 &_m2;

  public:

    typedef MapBase<typename M1::Key, bool> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    OrMap(const M1 &m1, const M2 &m2) : _m1(m1), _m2(m2) {}

    /// \e

    Value operator[](const Key &k) const { return _m1[k]||_m2[k]; }

  };

  /// Returns an \ref OrMap class

  /// This function just returns an \ref OrMap class.

  ///

  /// For example, if \c m1 and \c m2 are both maps with \c bool values,

  /// then <tt>orMap(m1,m2)[x]</tt> will be equal to

  /// <tt>m1[x]||m2[x]</tt>.

  ///

  /// \relates OrMap

  template<typename M1, typename M2>

  inline OrMap<M1, M2> orMap(const M1 &m1, const M2 &m2) {

    return OrMap<M1, M2>(m1,m2);

  }

  /// Logical 'not' of a map

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

  /// negation of the values of the given map.

  /// Its \c Key is inherited from \c M and its \c Value is \c bool.

  ///

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

  /// function.

  ///

  /// \sa NotWriteMap

  template <typename M>

  class NotMap : public MapBase<typename M::Key, bool> {

    const M &_m;

  public:

    typedef MapBase<typename M::Key, bool> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    NotMap(const M &m) : _m(m) {}

    /// \e

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

  };

  /// Logical 'not' of a map (read-write version)

  /// This \ref concepts::ReadWriteMap "read-write map" returns the

  /// logical negation of the values of the given map.

  /// Its \c Key is inherited from \c M and its \c Value is \c bool.

  /// It makes also possible to write the map. When a value is set,

  /// the opposite value is set to the original map.

  ///

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

  /// function.

  ///

  /// \sa NotMap

  template <typename M>

  class NotWriteMap : public MapBase<typename M::Key, bool> {

    M &_m;

  public:

    typedef MapBase<typename M::Key, bool> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    NotWriteMap(M &m) : _m(m) {}

    /// \e

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

    /// \e

    void set(const Key &k, bool v) { _m.set(k, !v); }

  };

  /// Returns a \ref NotMap class

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

  ///

  /// For example, if \c m is a map with \c bool values, then

  /// <tt>notMap(m)[x]</tt> will be equal to <tt>!m[x]</tt>.

  ///

  /// \relates NotMap

  template <typename M>

  inline NotMap<M> notMap(const M &m) {

    return NotMap<M>(m);

  }

  /// Returns a \ref NotWriteMap class

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

  ///

  /// For example, if \c m is a map with \c bool values, then

  /// <tt>notWriteMap(m)[x]</tt> will be equal to <tt>!m[x]</tt>.

  /// Moreover it makes also possible to write the map.

  ///

  /// \relates NotWriteMap

  template <typename M>

  inline NotWriteMap<M> notWriteMap(M &m) {

    return NotWriteMap<M>(m);

  }

  /// Combination of two maps using the \c == operator

  /// This \ref concepts::ReadMap "read-only map" assigns \c true to

  /// the keys for which the corresponding values of the two maps are

  /// equal.

  /// Its \c Key type is inherited from \c M1 and its \c Value type is

  /// \c bool. \c M2::Key must be convertible to \c M1::Key.

  ///

  /// If \c m1 is of type \c M1 and \c m2 is of \c M2, then for

  /// \code

  ///   EqualMap<M1,M2> em(m1,m2);

  /// \endcode

  /// <tt>em[x]</tt> will be equal to <tt>m1[x]==m2[x]</tt>.

  ///

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

  /// function.

  ///

  /// \sa LessMap

  template<typename M1, typename M2>

  class EqualMap : public MapBase<typename M1::Key, bool> {

    const M1 &_m1;

    const M2 &_m2;

  public:

    typedef MapBase<typename M1::Key, bool> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    EqualMap(const M1 &m1, const M2 &m2) : _m1(m1), _m2(m2) {}

    /// \e

    Value operator[](const Key &k) const { return _m1[k]==_m2[k]; }

  };

  /// Returns an \ref EqualMap class

  /// This function just returns an \ref EqualMap class.

  ///

  /// For example, if \c m1 and \c m2 are maps with keys and values of

  /// the same type, then <tt>equalMap(m1,m2)[x]</tt> will be equal to

  /// <tt>m1[x]==m2[x]</tt>.

  ///

  /// \relates EqualMap

  template<typename M1, typename M2>

  inline EqualMap<M1, M2> equalMap(const M1 &m1, const M2 &m2) {

    return EqualMap<M1, M2>(m1,m2);

  }

  /// Combination of two maps using the \c < operator

  /// This \ref concepts::ReadMap "read-only map" assigns \c true to

  /// the keys for which the corresponding value of the first map is

  /// less then the value of the second map.

  /// Its \c Key type is inherited from \c M1 and its \c Value type is

  /// \c bool. \c M2::Key must be convertible to \c M1::Key.

  ///

  /// If \c m1 is of type \c M1 and \c m2 is of \c M2, then for

  /// \code

  ///   LessMap<M1,M2> lm(m1,m2);

  /// \endcode

  /// <tt>lm[x]</tt> will be equal to <tt>m1[x]<m2[x]</tt>.

  ///

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

  /// function.

  ///

  /// \sa EqualMap

  template<typename M1, typename M2>

  class LessMap : public MapBase<typename M1::Key, bool> {

    const M1 &_m1;

    const M2 &_m2;

  public:

    typedef MapBase<typename M1::Key, bool> Parent;

    typedef typename Parent::Key Key;

    typedef typename Parent::Value Value;

    /// Constructor

    LessMap(const M1 &m1, const M2 &m2) : _m1(m1), _m2(m2) {}

    /// \e

    Value operator[](const Key &k) const { return _m1[k]<_m2[k]; }

  };

  /// Returns an \ref LessMap class

  /// This function just returns an \ref LessMap class.

  ///

  /// For example, if \c m1 and \c m2 are maps with keys and values of

  /// the same type, then <tt>lessMap(m1,m2)[x]</tt> will be equal to

  /// <tt>m1[x]<m2[x]</tt>.

  ///

  /// \relates LessMap

  template<typename M1, typename M2>

  inline LessMap<M1, M2> lessMap(const M1 &m1, const M2 &m2) {

    return LessMap<M1, M2>(m1,m2);

  }

  namespace _maps_bits {

    template <typename _Iterator, typename Enable = void>

    struct IteratorTraits {

      typedef typename std::iterator_traits<_Iterator>::value_type Value;

    };

    template <typename _Iterator>

    struct IteratorTraits<_Iterator,

      typename exists<typename _Iterator::container_type>::type>

    {

      typedef typename _Iterator::container_type::value_type Value;

    };

  }

  /// \brief Writable bool map for logging each \c true assigned element

  ///

  /// each \c true assigned element, i.e it copies subsequently each

  /// keys set to \c true to the given iterator.

  ///

  ///

  /// \note The container of the iterator must contain enough space

  template <typename It,

	    typename Ke=typename _maps_bits::IteratorTraits<It>::Value>

  class StoreBoolMap {

  public:

    typedef It Iterator;

    typedef Ke Key;

    typedef bool Value;

    /// Constructor

    StoreBoolMap(Iterator it)

      : _begin(it), _end(it) {}

    /// Gives back the given iterator set for the first key

    Iterator begin() const {

      return _begin;

    }

    /// Gives back the the 'after the last' iterator

    Iterator end() const {

      return _end;

    }

    /// The set function of the map

      if (value) {

	*_end++ = key;

      }

    }

  private:

    Iterator _begin;

  };

  /// @}

}

#endif // LEMON_MAPS_H

/* -*- C++ -*-

 *

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

 *

 * Copyright (C) 2003-2008

 * 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 "test_tools.h"

using namespace lemon;

using namespace lemon::concepts;

struct A {};

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

struct B {};

class C {

  int x;

public:

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

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

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

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

    MapToFunctor<ReadMap<A,B> > map(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));

  }