[Lemon-commits] [lemon_svn] deba: r2257 - in hugo/trunk/lemon: . bits

[Lemon SVN]

Author: deba
Date: Mon Oct 17 12:30:59 2005
New Revision: 2257

Modified:
   hugo/trunk/lemon/bits/vector_map.h
   hugo/trunk/lemon/graph_utils.h
   hugo/trunk/lemon/path.h

Log:
Minor changes and bugfixes



Modified: hugo/trunk/lemon/bits/vector_map.h
==============================================================================
--- hugo/trunk/lemon/bits/vector_map.h	(original)
+++ hugo/trunk/lemon/bits/vector_map.h	Mon Oct 17 12:30:59 2005
@@ -71,14 +71,6 @@
     typedef _Item Key;
     /// The value type of the map.
     typedef _Value Value;
-    /// The const reference type of the map.
-    typedef typename Container::const_reference ConstReference;
-    /// The reference type of the map.
-    typedef typename Container::reference Reference;
-
-    typedef const Value ConstValue;
-    typedef Value* Pointer;
-    typedef const Value* ConstPointer;
 
     typedef AlterationNotifier<_Item> Registry;
 
@@ -99,7 +91,6 @@
     /// The pointer type of the map;
     typedef typename Container::const_pointer ConstPointer;
 
-    typedef True FullTypeTag;
 
     /// \brief Constructor to attach the new map into the registry.
     ///

Modified: hugo/trunk/lemon/graph_utils.h
==============================================================================
--- hugo/trunk/lemon/graph_utils.h	(original)
+++ hugo/trunk/lemon/graph_utils.h	Mon Oct 17 12:30:59 2005
@@ -1326,7 +1326,7 @@
   /// whenever the graph changes.
   ///
   /// \warning Besides addNode() and addEdge(), a graph structure may provide
-  /// alternative ways to mogify the graph. The correct behavior of InDegMap
+  /// alternative ways to modify the graph. The correct behavior of InDegMap
   /// is not guarantied if these additional featureas are used. For example
   /// the funstions \ref ListGraph::changeSource() "changeSource()",
   /// \ref ListGraph::changeTarget() "changeTarget()" and
@@ -1432,7 +1432,7 @@
   /// whenever the graph changes.
   ///
   /// \warning Besides addNode() and addEdge(), a graph structure may provide
-  /// alternative ways to mogify the graph. The correct behavior of OutDegMap
+  /// alternative ways to modify the graph. The correct behavior of OutDegMap
   /// is not guarantied if these additional featureas are used. For example
   /// the funstions \ref ListGraph::changeSource() "changeSource()",
   /// \ref ListGraph::changeTarget() "changeTarget()" and

Modified: hugo/trunk/lemon/path.h
==============================================================================
--- hugo/trunk/lemon/path.h	(original)
+++ hugo/trunk/lemon/path.h	Mon Oct 17 12:30:59 2005
@@ -383,6 +383,7 @@
   //! and \c Edge of the original graph.
   //!
   //! \todo Thoroughfully check all the range and consistency tests.
+  /// \todo May we need just path for undirected graph instead of this.
   template<typename Graph>
   class UndirPath {
   public: