RhodeCode

      /// Returns the value associated with a key.

      /// \bug Value shouldn't need to be default constructible.

      ///

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

      };

    };

    /// Read/writable map concept.

    ///

    /// Dereferable map concept.

    ///

    template<typename K, typename T, typename R, typename CR>

    class ReferenceMap : public ReadWriteMap<K,T>

    {

      Value tmp;

    public:

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

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

      /// Sets the value associated with a key.

      void set(const Key &k,const Value &t) { operator[](k)=t; }

      template<typename _ReferenceMap>

      struct ReferenceMapConcept {

  /// Constant map.

  template<typename K, typename T>

  class ConstMap : public MapBase<K, T> {

  private:

  /// Constant map with inlined constant value.

  template<typename K, typename V, V v>

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

  public:

    void set(const K&, const V&) { }

  };

  ///This function just returns a \c ConstMap class with inlined value.

  ///\relates ConstMap

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

  }

  ///This is essentially a wrapper for \c std::map with addition that

  ///you can specify a default value different from \c Value().

  template <typename K, typename T, typename Compare = std::less<K> >

    template <typename K1, typename T1, typename C1>

    friend class StdMap;

  public:

    ///Key type

    ///Value type

    ///Reference Type

    typedef T& Reference;

    ///Const reference type

    typedef const T& ConstReference;

  private:

    typedef std::map<K, T, Compare> Map;

    /// Constructor with specified default value

    StdMap(const T& value = T()) : _value(value) {}

    template <typename T1, typename Comp1>

    StdMap(const std::map<Key, T1, Comp1> &map, const T& value = T()) 

      : _map(map.begin(), map.end()), _value(value) {}

    template<typename T1, typename Comp1>

    StdMap(const StdMap<Key, T1, Comp1> &c) 

      : _map(c._map.begin(), c._map.end()), _value(c._value) {}

  };

  /// \brief Map for storing values for keys from the range <tt>[0..size-1]</tt>

  ///

  /// are stored in a \c std::vector<T>  container. It can be used with

  /// some data structures, for example \c UnionFind, \c BinHeap, when 

  /// the used items are small integer numbers. 

  ///

  /// \todo Revise its name

  template <typename T>

    template <typename T1>

    friend class IntegerMap;

  public:

    ///\e

    ///\e

    ///\e

    typedef T& Reference;

    ///\e

    typedef const T& ConstReference;

  private:

    typedef std::vector<T> Vector;

    /// Constructor with specified default value

    IntegerMap(int size = 0, const T& value = T()) : _vector(size, value) {}

    template <typename T1>

    IntegerMap(const std::vector<T1>& vector) 

      : _vector(vector.begin(), vector.end()) {}

    template <typename T1>

    IntegerMap(const IntegerMap<T1> &c) 

      : _vector(c._vector.begin(), c._vector.end()) {}

  };

  /// @}

  /// \addtogroup map_adaptors

  ///\brief Convert the \c Value of a map to another type using

  ///the default conversion.

  ///

  ///converts the \c Value of a map to type \c T.

  ///Its \c Key is inherited from \c M.

  template <typename M, typename T> 

    ///\param _m is the underlying map.

    ConvertMap(const M &_m) : m(_m) {};

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

  };

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

  };

  ///Simple writable wrapping of a map

  ///wrapping of the given map. Sometimes the reference maps cannot be

  ///combined with simple read-write maps. This map adaptor wraps the

  ///given map to simple read-write map.

    void set(Key k, const Value& c) { m.set(k, c); }

  };

  ///Sum of two maps

  ///given maps.

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

  template<typename M1, typename M2> 

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

    const M1& m1;

  ///Returns an \c AddMap class

  ///This function just returns an \c AddMap class.

  ///

  ///\relates AddMap

  template<typename M1, typename M2> 

  ///Shift a map with a constant.

  ///given map and a constant value.

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

  ///

  ///Shift a map with a constant (ReadWrite version).

  ///given map and a constant value. It makes also possible to write the map.

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

  ///

  ///Difference of two maps

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

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

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

  ///Product of two maps

  ///values of the two given maps.

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

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

  ///Scales a map with a constant.

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

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

  ///

  ///Scales a map with a constant (ReadWrite version).

  ///given map multiplied from the left side with a constant value. 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.

  ///Quotient of two maps

  ///values of the two given maps.

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

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

  ///Composition of two maps

  ///two given maps.

  ///That is to say, if \c m1 is of type \c M1 and \c m2 is of \c M2,

  ///then for

  ///Combine of two maps using an STL (binary) functor.

  ///

  ///binary functor and returns the composition of the two

  ///given maps unsing the functor. 

  ///That is to say, if \c m1 and \c m2 is of type \c M1 and \c M2

  ///Negative value of a map

  ///value of the value returned by the given map.

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

  ///The unary \c - operator must be defined for \c Value, of course.

  ///Negative value of a map (ReadWrite version)

  ///value of the value returned by the given map.

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

  ///The unary \c - operator must be defined for \c Value, of course.

  ///Absolute value of a map

  ///of the value returned by 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 -

  ///Converts an STL style functor to a map

  ///of a given functor.

  ///

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

  ///

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

  ///

  ///This function just returns a \c FunctorMap class.

  ///

  ///\relates FunctorMap

  template<typename K, typename V, typename F> inline 

  FunctorMap<F, K, V> functorMap(const F &f) {

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

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

  ///

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

  ///i.e. <tt>operator[]</tt> and the \c Key and \c Value typedefs also exist.

  ///

  ///\sa FunctorMap

    return MapFunctor<M>(m);

  }

  ///parameters and each read request will be passed just to the

  ///

  ///The \c Key and \c Value are inherited from \c M1.

  ///

  ///\sa ForkWriteMap

  ///

  ///Applies all map setting operations to two maps

  ///parameters and each write request will be passed to both of them.

  ///then the read operations will return the

  ///corresponding values of \c M1.

  ///

  ///The \c Key and \c Value are inherited from \c M1.

  ///

  ///\sa ForkMap

  template<typename  M1, typename M2> 

  ///Logical 'not' of a map

  ///logical negation of the value returned by the given map.

  ///

  ///\sa NotWriteMap

  template <typename M> 

  ///Logical 'not' of a map (ReadWrie version)

  ///logical negation of the value returned by the given map. When it is set,

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

  ///

  ///\sa NotMap

  template <typename M> 

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

  ///

  ///

  /// \note The container of the iterator should contain space 

  /// for each element.

  ///

  ///\code

  /// typedef IdMap<Graph, Edge> EdgeIdMap;

  /// EdgeIdMap edgeId(graph);