# HG changeset patch
# User alpar
# Date 1132148369 0
# Node ID c499025ca6385abc051c9f40e5212357c3fbfa41
# Parent  5f2f3d982eba1a2c867c199bc252ad3ff6a73426
wirteable -> writable

diff -r 5f2f3d982eba -r c499025ca638 lemon/maps.h
--- a/lemon/maps.h	Wed Nov 16 13:26:04 2005 +0000
+++ b/lemon/maps.h	Wed Nov 16 13:39:29 2005 +0000
@@ -858,9 +858,9 @@
     return NotMap<M>(m);
   }
 
-  /// \brief Writeable bool map for store each true assigned elements.
+  /// \brief Writable bool map for store each true assigned elements.
   ///
-  /// Writeable bool map for store each true assigned elements. It will
+  /// Writable bool map for store each true assigned elements. It will
   /// copies all the true setted keys to the given iterator.
   ///
   /// \note The container of the iterator should contain for each element.
@@ -896,10 +896,10 @@
     Iterator _begin, _end;
   };
 
-  /// \brief Writeable bool map for store each true assigned elements in 
+  /// \brief Writable bool map for store each true assigned elements in 
   /// a back insertable container.
   ///
-  /// Writeable bool map for store each true assigned elements in a back 
+  /// Writable bool map for store each true assigned elements in a back 
   /// insertable container. It will push back all the true setted keys into
   /// the container.
   template <typename Container>
@@ -922,10 +922,10 @@
     Container& container;    
   };
 
-  /// \brief Writeable bool map for store each true assigned elements in 
+  /// \brief Writable bool map for store each true assigned elements in 
   /// a front insertable container.
   ///
-  /// Writeable bool map for store each true assigned elements in a front 
+  /// Writable bool map for store each true assigned elements in a front 
   /// insertable container. It will push front all the true setted keys into
   /// the container.
   template <typename Container>
@@ -948,10 +948,10 @@
     Container& container;    
   };
 
-  /// \brief Writeable bool map for store each true assigned elements in 
+  /// \brief Writable bool map for store each true assigned elements in 
   /// an insertable container.
   ///
-  /// Writeable bool map for store each true assigned elements in an 
+  /// Writable bool map for store each true assigned elements in an 
   /// insertable container. It will insert all the true setted keys into
   /// the container.
   template <typename Container>
@@ -976,7 +976,7 @@
 
   /// \brief Fill the true setted elements with a given value.
   ///
-  /// Writeable bool map for fill the true setted elements with a given value.
+  /// Writable bool map for fill the true setted elements with a given value.
   /// The value can be setted 
   /// the container.
   template <typename Map>
@@ -1016,10 +1016,10 @@
   };
 
 
-  /// \brief Writeable bool map which stores for each true assigned elements  
+  /// \brief Writable bool map which stores for each true assigned elements  
   /// the setting order number.
   ///
-  /// Writeable bool map which stores for each true assigned elements  
+  /// Writable bool map which stores for each true assigned elements  
   /// the setting order number.
   template <typename Map>
   class SettingOrderBoolMap {
diff -r 5f2f3d982eba -r c499025ca638 lemon/topology.h
--- a/lemon/topology.h	Wed Nov 16 13:26:04 2005 +0000
+++ b/lemon/topology.h	Wed Nov 16 13:39:29 2005 +0000
@@ -1426,7 +1426,7 @@
   /// During the execution, the \c partMap will be set as the two 
   /// partitions of the graph.
   /// \param graph The undirected graph.
-  /// \retval partMap A writeable bool map of nodes. It will be set as the
+  /// \retval partMap A writable bool map of nodes. It will be set as the
   /// two partitions of the graph. 
   /// \return %True if \c graph is bipartite, %false otherwise.
   ///