1.1 --- a/lemon/bin_heap.h	Fri Oct 20 12:06:49 2006 +0000
     1.2 +++ b/lemon/bin_heap.h	Sun Oct 22 19:45:57 2006 +0000
     1.3 @@ -54,7 +54,6 @@
     1.4  
     1.5    public:
     1.6      typedef Item                             ItemType;
     1.7 -    // FIXME: stl-ben nem ezt hivjak value_type -nak, hanem a kovetkezot...
     1.8      typedef Prio                             PrioType;
     1.9      typedef std::pair<ItemType,PrioType>     PairType;
    1.10      typedef ItemIntMap                       ItemIntMapType;

     2.1 --- a/lemon/maps.h	Fri Oct 20 12:06:49 2006 +0000
     2.2 +++ b/lemon/maps.h	Sun Oct 22 19:45:57 2006 +0000
     2.3 @@ -1018,8 +1018,8 @@
     2.4    ///Logical 'not' of a map with writing possibility
     2.5    
     2.6    ///This bool \ref concept::ReadWriteMap "read-write map" returns the 
     2.7 -  ///logical negation of value returned by the given map. It is setted
     2.8 -  ///then the negation of the value be setted to the original map.
     2.9 +  ///logical negation of value returned by the given map. When it is set,
    2.10 +  ///the opposite value is set to the original map.
    2.11    ///Its \c Key and will be inherited from \c M,
    2.12    ///its Value is <tt>bool</tt>.
    2.13    template <typename M> 
    2.14 @@ -1064,8 +1064,8 @@
    2.15  
    2.16    /// \brief Writable bool map for store each true assigned elements.
    2.17    ///
    2.18 -  /// Writable bool map for store each true assigned elements. It will
    2.19 -  /// copies all the true setted keys to the given iterator.
    2.20 +  /// Writable bool map to store each true assigned elements. It will
    2.21 +  /// copies all the keys set to true to the given iterator.
    2.22    ///
    2.23    /// \note The container of the iterator should contain space 
    2.24    /// for each element.
    2.25 @@ -1100,12 +1100,12 @@
    2.26      StoreBoolMap(Iterator it, const Functor& functor = Functor()) 
    2.27        : _begin(it), _end(it), _functor(functor) {}
    2.28  
    2.29 -    /// Gives back the given first setted iterator.
    2.30 +    /// Gives back the given iterator set for the first time.
    2.31      Iterator begin() const {
    2.32        return _begin;
    2.33      }
    2.34   
    2.35 -    /// Gives back the iterator after the last setted.
    2.36 +    /// Gives back the iterator after the last set operation.
    2.37      Iterator end() const {
    2.38        return _end;
    2.39      }
    2.40 @@ -1126,7 +1126,7 @@
    2.41    /// a back insertable container.
    2.42    ///
    2.43    /// Writable bool map for store each true assigned elements in a back 
    2.44 -  /// insertable container. It will push back all the true setted keys into
    2.45 +  /// insertable container. It will push back all the keys set to true into
    2.46    /// the container. It can be used to retrieve the items into a standard
    2.47    /// container. The next example shows how can you store the undirected
    2.48    /// edges in a vector with prim algorithm.
    2.49 @@ -1165,7 +1165,7 @@
    2.50    /// a front insertable container.
    2.51    ///
    2.52    /// Writable bool map for store each true assigned elements in a front 
    2.53 -  /// insertable container. It will push front all the true setted keys into
    2.54 +  /// insertable container. It will push front all the keys set to \c true into
    2.55    /// the container. For example see the BackInserterBoolMap.
    2.56    template <typename Container,
    2.57              typename Functor =
    2.58 @@ -1196,7 +1196,7 @@
    2.59    /// an insertable container.
    2.60    ///
    2.61    /// Writable bool map for store each true assigned elements in an 
    2.62 -  /// insertable container. It will insert all the true setted keys into
    2.63 +  /// insertable container. It will insert all the keys set to \c true into
    2.64    /// the container. If you want to store the cut edges of the strongly
    2.65    /// connected components in a set you can use the next code:
    2.66    ///
    2.67 @@ -1236,10 +1236,10 @@
    2.68      Functor functor;
    2.69    };
    2.70  
    2.71 -  /// \brief Fill the true setted elements with a given value.
    2.72 +  /// \brief Fill the true set elements with a given value.
    2.73    ///
    2.74 -  /// Writable bool map for fill the true setted elements with a given value.
    2.75 -  /// The value can be setted 
    2.76 +  /// Writable bool map to fill the elements set to \c true with a given value.
    2.77 +  /// The value can set 
    2.78    /// the container.
    2.79    ///
    2.80    /// The next code finds the connected components of the undirected graph
    2.81 @@ -1362,7 +1362,7 @@
    2.82      SettingOrderBoolMap(Map& _map) 
    2.83        : map(_map), counter(0) {}
    2.84  
    2.85 -    /// Number of setted keys.
    2.86 +    /// Number of set operations.
    2.87      int num() const {
    2.88        return counter;
    2.89      }