Changeset 911:89a4fbb99cad in lemon-0.x for src/hugo/skeletons

Timestamp:

09/28/04 09:00:58 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1222

Message:

Fix many doxygen command bugs.

Location:

src/hugo/skeletons

Files:

• graph.h (modified) (5 diffs)
• sym_graph.h (modified) (8 diffs)

src/hugo/skeletons/graph.h

@@ -93 +93 @@
         /// Inequality operator
         
-        /// \sa \ref operator==(Node n)
+        /// \sa operator==(Node n)
         ///
         bool operator!=(Node) const { return true; }
@@ -181 +181 @@
         /// Inequality operator
 
-        /// \sa \ref operator==(Node n)
+        /// \sa operator==(Node n)
         ///
         bool operator!=(Edge) const { return true; }
@@ -383 +383 @@
       int id(const Edge&) const { return 0; }
 
-      /// .
+      ///\e
       
       ///\todo Should it be in the concept?
       ///
       int nodeNum() const { return 0; }
-      /// .
+      ///\e
 
       ///\todo Should it be in the concept?
@@ -406 +406 @@
       public:
 
-        /// .
+        ///\e
         NodeMap(const StaticGraph&) { }
-        /// .
+        ///\e
         NodeMap(const StaticGraph&, T) { }
 
@@ -430 +430 @@
       public:
 
-        /// .
+        ///\e
         EdgeMap(const StaticGraph&) { }
-        /// .
+        ///\e
         EdgeMap(const StaticGraph&, T) { }
     

src/hugo/skeletons/sym_graph.h

@@ -46 +46 @@
     /// feature, the documentation of a real symmetric graph imlementation
     /// like @ref SymListGraph or
-    /// @ref SymSmartGraph will just refer to this structure.
+    /// @ref hugo::SymSmartGraph will just refer to this structure.
     class StaticSymGraph
     {
@@ -94 +94 @@
         /// Inequality operator
         
-        /// \sa \ref operator==(Node n)
+        /// \sa operator==(Node n)
         ///
         bool operator!=(Node) const { return true; }
@@ -182 +182 @@
         /// Inequality operator
 
-        /// \sa \ref operator==(Node n)
+        /// \sa operator==(Node n)
         ///
         bool operator!=(SymEdge) const { return true; }
@@ -224 +224 @@
         /// Inequality operator
 
-        /// \sa \ref operator==(Node n)
+        /// \sa operator==(Node n)
         ///
         bool operator!=(Edge) const { return true; }
@@ -490 +490 @@
       int id(const SymEdge&) const { return 0; }
 
-      /// .
+      ///\e
       
       ///\todo Should it be in the concept?
       ///
       int nodeNum() const { return 0; }
-      /// .
+      ///\e
 
       ///\todo Should it be in the concept?
@@ -525 +525 @@
       public:
 
-        /// .
+        ///\e
         NodeMap(const StaticSymGraph&) { }
-        /// .
+        ///\e
         NodeMap(const StaticSymGraph&, T) { }
 
@@ -549 +549 @@
       public:
 
-        /// .
+        ///\e
         EdgeMap(const StaticSymGraph&) { }
-        /// .
+        ///\e
         EdgeMap(const StaticSymGraph&, T) { }
     
@@ -573 +573 @@
       public:
 
-        /// .
+        ///\e
         SymEdgeMap(const StaticSymGraph&) { }
-        /// .
+        ///\e
         SymEdgeMap(const StaticSymGraph&, T) { }