1.1 --- a/lemon/bits/vector_map.h	Tue Nov 04 21:36:46 2008 +0100
     1.2 +++ b/lemon/bits/vector_map.h	Tue Nov 04 21:37:59 2008 +0100
     1.3 @@ -38,9 +38,9 @@
     1.4    //
     1.5    // \brief Graph map based on the std::vector storage.
     1.6    //
     1.7 -  // The VectorMap template class is graph map structure what
     1.8 -  // automatically updates the map when a key is added to or erased from
     1.9 -  // the map. This map type uses the std::vector to store the values.
    1.10 +  // The VectorMap template class is graph map structure that automatically
    1.11 +  // updates the map when a key is added to or erased from the graph.
    1.12 +  // This map type uses std::vector to store the values.
    1.13    //
    1.14    // \tparam _Graph The graph this map is attached to.
    1.15    // \tparam _Item The item type of the graph items.
    1.16 @@ -169,7 +169,7 @@
    1.17  
    1.18      // \brief Adds a new key to the map.
    1.19      //
    1.20 -    // It adds a new key to the map. It called by the observer notifier
    1.21 +    // It adds a new key to the map. It is called by the observer notifier
    1.22      // and it overrides the add() member function of the observer base.
    1.23      virtual void add(const Key& key) {
    1.24        int id = Parent::notifier()->id(key);
    1.25 @@ -180,7 +180,7 @@
    1.26  
    1.27      // \brief Adds more new keys to the map.
    1.28      //
    1.29 -    // It adds more new keys to the map. It called by the observer notifier
    1.30 +    // It adds more new keys to the map. It is called by the observer notifier
    1.31      // and it overrides the add() member function of the observer base.
    1.32      virtual void add(const std::vector<Key>& keys) {
    1.33        int max = container.size() - 1;
    1.34 @@ -195,7 +195,7 @@
    1.35  
    1.36      // \brief Erase a key from the map.
    1.37      //
    1.38 -    // Erase a key from the map. It called by the observer notifier
    1.39 +    // Erase a key from the map. It is called by the observer notifier
    1.40      // and it overrides the erase() member function of the observer base.
    1.41      virtual void erase(const Key& key) {
    1.42        container[Parent::notifier()->id(key)] = Value();
    1.43 @@ -203,7 +203,7 @@
    1.44  
    1.45      // \brief Erase more keys from the map.
    1.46      //
    1.47 -    // Erase more keys from the map. It called by the observer notifier
    1.48 +    // It erases more keys from the map. It is called by the observer notifier
    1.49      // and it overrides the erase() member function of the observer base.
    1.50      virtual void erase(const std::vector<Key>& keys) {
    1.51        for (int i = 0; i < int(keys.size()); ++i) {
    1.52 @@ -211,9 +211,9 @@
    1.53        }
    1.54      }
    1.55  
    1.56 -    // \brief Buildes the map.
    1.57 +    // \brief Build the map.
    1.58      //
    1.59 -    // It buildes the map. It called by the observer notifier
    1.60 +    // It builds the map. It is called by the observer notifier
    1.61      // and it overrides the build() member function of the observer base.
    1.62      virtual void build() {
    1.63        int size = Parent::notifier()->maxId() + 1;
    1.64 @@ -223,7 +223,7 @@
    1.65  
    1.66      // \brief Clear the map.
    1.67      //
    1.68 -    // It erase all items from the map. It called by the observer notifier
    1.69 +    // It erases all items from the map. It is called by the observer notifier
    1.70      // and it overrides the clear() member function of the observer base.
    1.71      virtual void clear() {
    1.72        container.clear();