1.1 --- a/lemon/bits/array_map.h Tue Nov 04 21:36:46 2008 +0100
1.2 +++ b/lemon/bits/array_map.h Tue Nov 04 21:37:59 2008 +0100
1.3 @@ -36,25 +36,24 @@
1.4 //
1.5 // \brief Graph map based on the array storage.
1.6 //
1.7 - // The ArrayMap 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 uses the allocators to implement
1.10 - // the container functionality.
1.11 + // The ArrayMap template class is graph map structure that automatically
1.12 + // updates the map when a key is added to or erased from the graph.
1.13 + // This map uses the allocators to implement the container functionality.
1.14 //
1.15 - // The template parameters are the Graph the current Item type and
1.16 + // The template parameters are the Graph, the current Item type and
1.17 // the Value type of the map.
1.18 template <typename _Graph, typename _Item, typename _Value>
1.19 class ArrayMap
1.20 : public ItemSetTraits<_Graph, _Item>::ItemNotifier::ObserverBase {
1.21 public:
1.22 - // The graph type of the maps.
1.23 + // The graph type.
1.24 typedef _Graph Graph;
1.25 - // The item type of the map.
1.26 + // The item type.
1.27 typedef _Item Item;
1.28 // The reference map tag.
1.29 typedef True ReferenceMapTag;
1.30
1.31 - // The key type of the maps.
1.32 + // The key type of the map.
1.33 typedef _Item Key;
1.34 // The value type of the map.
1.35 typedef _Value Value;
1.36 @@ -200,7 +199,7 @@
1.37
1.38 // \brief Adds a new key to the map.
1.39 //
1.40 - // It adds a new key to the map. It called by the observer notifier
1.41 + // It adds a new key to the map. It is called by the observer notifier
1.42 // and it overrides the add() member function of the observer base.
1.43 virtual void add(const Key& key) {
1.44 Notifier* nf = Parent::notifier();
1.45 @@ -228,7 +227,7 @@
1.46
1.47 // \brief Adds more new keys to the map.
1.48 //
1.49 - // It adds more new keys to the map. It called by the observer notifier
1.50 + // It adds more new keys to the map. It is called by the observer notifier
1.51 // and it overrides the add() member function of the observer base.
1.52 virtual void add(const std::vector<Key>& keys) {
1.53 Notifier* nf = Parent::notifier();
1.54 @@ -272,7 +271,7 @@
1.55
1.56 // \brief Erase a key from the map.
1.57 //
1.58 - // Erase a key from the map. It called by the observer notifier
1.59 + // Erase a key from the map. It is called by the observer notifier
1.60 // and it overrides the erase() member function of the observer base.
1.61 virtual void erase(const Key& key) {
1.62 int id = Parent::notifier()->id(key);
1.63 @@ -281,7 +280,7 @@
1.64
1.65 // \brief Erase more keys from the map.
1.66 //
1.67 - // Erase more keys from the map. It called by the observer notifier
1.68 + // Erase more keys from the map. It is called by the observer notifier
1.69 // and it overrides the erase() member function of the observer base.
1.70 virtual void erase(const std::vector<Key>& keys) {
1.71 for (int i = 0; i < int(keys.size()); ++i) {
1.72 @@ -290,9 +289,9 @@
1.73 }
1.74 }
1.75
1.76 - // \brief Buildes the map.
1.77 + // \brief Builds the map.
1.78 //
1.79 - // It buildes the map. It called by the observer notifier
1.80 + // It builds the map. It is called by the observer notifier
1.81 // and it overrides the build() member function of the observer base.
1.82 virtual void build() {
1.83 Notifier* nf = Parent::notifier();
1.84 @@ -306,7 +305,7 @@
1.85
1.86 // \brief Clear the map.
1.87 //
1.88 - // It erase all items from the map. It called by the observer notifier
1.89 + // It erase all items from the map. It is called by the observer notifier
1.90 // and it overrides the clear() member function of the observer base.
1.91 virtual void clear() {
1.92 Notifier* nf = Parent::notifier();