1.1 --- a/lemon/maps.h	Wed Nov 16 13:26:04 2005 +0000
     1.2 +++ b/lemon/maps.h	Wed Nov 16 13:39:29 2005 +0000
     1.3 @@ -858,9 +858,9 @@
     1.4      return NotMap<M>(m);
     1.5    }
     1.6  
     1.7 -  /// \brief Writeable bool map for store each true assigned elements.
     1.8 +  /// \brief Writable bool map for store each true assigned elements.
     1.9    ///
    1.10 -  /// Writeable bool map for store each true assigned elements. It will
    1.11 +  /// Writable bool map for store each true assigned elements. It will
    1.12    /// copies all the true setted keys to the given iterator.
    1.13    ///
    1.14    /// \note The container of the iterator should contain for each element.
    1.15 @@ -896,10 +896,10 @@
    1.16      Iterator _begin, _end;
    1.17    };
    1.18  
    1.19 -  /// \brief Writeable bool map for store each true assigned elements in 
    1.20 +  /// \brief Writable bool map for store each true assigned elements in 
    1.21    /// a back insertable container.
    1.22    ///
    1.23 -  /// Writeable bool map for store each true assigned elements in a back 
    1.24 +  /// Writable bool map for store each true assigned elements in a back 
    1.25    /// insertable container. It will push back all the true setted keys into
    1.26    /// the container.
    1.27    template <typename Container>
    1.28 @@ -922,10 +922,10 @@
    1.29      Container& container;    
    1.30    };
    1.31  
    1.32 -  /// \brief Writeable bool map for store each true assigned elements in 
    1.33 +  /// \brief Writable bool map for store each true assigned elements in 
    1.34    /// a front insertable container.
    1.35    ///
    1.36 -  /// Writeable bool map for store each true assigned elements in a front 
    1.37 +  /// Writable bool map for store each true assigned elements in a front 
    1.38    /// insertable container. It will push front all the true setted keys into
    1.39    /// the container.
    1.40    template <typename Container>
    1.41 @@ -948,10 +948,10 @@
    1.42      Container& container;    
    1.43    };
    1.44  
    1.45 -  /// \brief Writeable bool map for store each true assigned elements in 
    1.46 +  /// \brief Writable bool map for store each true assigned elements in 
    1.47    /// an insertable container.
    1.48    ///
    1.49 -  /// Writeable bool map for store each true assigned elements in an 
    1.50 +  /// Writable bool map for store each true assigned elements in an 
    1.51    /// insertable container. It will insert all the true setted keys into
    1.52    /// the container.
    1.53    template <typename Container>
    1.54 @@ -976,7 +976,7 @@
    1.55  
    1.56    /// \brief Fill the true setted elements with a given value.
    1.57    ///
    1.58 -  /// Writeable bool map for fill the true setted elements with a given value.
    1.59 +  /// Writable bool map for fill the true setted elements with a given value.
    1.60    /// The value can be setted 
    1.61    /// the container.
    1.62    template <typename Map>
    1.63 @@ -1016,10 +1016,10 @@
    1.64    };
    1.65  
    1.66  
    1.67 -  /// \brief Writeable bool map which stores for each true assigned elements  
    1.68 +  /// \brief Writable bool map which stores for each true assigned elements  
    1.69    /// the setting order number.
    1.70    ///
    1.71 -  /// Writeable bool map which stores for each true assigned elements  
    1.72 +  /// Writable bool map which stores for each true assigned elements  
    1.73    /// the setting order number.
    1.74    template <typename Map>
    1.75    class SettingOrderBoolMap {

     2.1 --- a/lemon/topology.h	Wed Nov 16 13:26:04 2005 +0000
     2.2 +++ b/lemon/topology.h	Wed Nov 16 13:39:29 2005 +0000
     2.3 @@ -1426,7 +1426,7 @@
     2.4    /// During the execution, the \c partMap will be set as the two 
     2.5    /// partitions of the graph.
     2.6    /// \param graph The undirected graph.
     2.7 -  /// \retval partMap A writeable bool map of nodes. It will be set as the
     2.8 +  /// \retval partMap A writable bool map of nodes. It will be set as the
     2.9    /// two partitions of the graph. 
    2.10    /// \return %True if \c graph is bipartite, %false otherwise.
    2.11    ///