RhodeCode

        typedef LoggerBoolMap<typename RemoveConst<Out>::type> Map;

  /// easily done with LoggerBoolMap.

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

  class LoggerBoolMap {

    LoggerBoolMap(Iterator it)

  /// Returns a \ref LoggerBoolMap class

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

  ///   dfs(g,s).processedMap(loggerBoolMap(std::back_inserter(v))).run();

  ///   dfs(g,s).processedMap(loggerBoolMap(v.begin())).run();

  /// \note LoggerBoolMap is just \ref concepts::WriteMap "writable", so

  /// \c ReachedMap for \ref Bfs, \ref Dfs and \ref Dijkstra algorithms.

  /// \relates LoggerBoolMap

  inline LoggerBoolMap<Iterator> loggerBoolMap(Iterator it) {

    return LoggerBoolMap<Iterator>(it);

  // LoggerBoolMap

    LoggerBoolMap<std::back_insert_iterator<vec> > map1(std::back_inserter(v1));

    LoggerBoolMap<vec::iterator> map2(v2.begin());

          "Something is wrong with LoggerBoolMap");

    for ( LoggerBoolMap<vec::iterator>::Iterator it = map2.begin();

      check(v1[i++] == *it, "Something is wrong with LoggerBoolMap");