RhodeCode

 */

// (C) Copyright Jeremy Siek 2000.

// Distributed under the Boost Software License, Version 1.0. (See

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

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

  template <typename T>

  class IntegerMap {

  ///This \c concepts::ReadMap "read only map"

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

    ///

    /// The subscript operator.

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

  };

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

  ///map to simple read map.

  template<typename M> 

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

  ///Simple writeable wrapping of the 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.

  template<typename M> 

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

  };

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

  ///given maps. Its \c Key and \c Value will be inherited from \c M1.

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

  template<typename M1, typename M2> 

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

  };

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

  };

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

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

  ///

  template<typename M> 

  ///The \c Key and \c Value will be inherited from \c M1.

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

  template<typename  M1, typename M2> 

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

  };

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

  ///

  /// copies all the keys set to true to the given iterator.

  ///

  /// for each element.

  ///

  /// to the standard output.

  ///\code

  /// prim(graph, cost, writerMap);

  ///\endcode

  template <typename _Iterator, 

            typename _Functor =

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

    Iterator begin() const {

      return _begin;

    }

    Iterator end() const {

      return _end;

  };

  ///

  ///

  ///\code

  };

  /// a front insertable container.

  ///

  /// insertable container. It will push front all the keys set to \c true into

  /// the container. For example see the BackInserterBoolMap.

  };

  /// an insertable container.

  ///

  /// insertable container. It will insert all the keys set to \c true into

  /// connected components in a set you can use the next code:

  ///

  /// the container.

  ///

  /// and stores it in the \c comp map:

  ///\code

    } 

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

      if (value) {

  /// Writable bool map which stores for each true assigned elements  

  /// order of the nodes in the \c Dfs algorithm.

  ///

  ///\endcode

  ///

  /// ReachedMap should be readable in the dfs algorithm but the setting

  ///

  ///\code