Changeset 676:7ec5e7e6c7b4 in lemon-0.x for src/work/deba

Timestamp:

06/08/04 08:44:05 (21 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

c++ setting for emacs
Empty commands for doxygen

Location:

src/work/deba

Files:

• map_defines.h (modified) (1 diff)
• map_registry.h (modified) (9 diffs)
• test_graph.h (modified) (1 diff)

src/work/deba/map_defines.h

@@ +1 @@
+// -*- c++ -*-
 #ifndef MAP_DEFINES_H
 #define MAP_DEFINES_H

src/work/deba/map_registry.h

@@ -5 +5 @@
 
 using namespace std;
+
+namespace hugo {
 
 /** 
@@ -12 +14 @@
     event.
 */
-
-namespace hugo {
-
   template <typename G, typename K, typename KIt>
   class MapRegistry {
@@ -24 +23 @@
 
 
+    ///. 
+
+    ///. 
+    /// 
     class MapBase {
     public:
@@ -138 +141 @@
     public:
         
+    ///. 
     MapRegistry() {}
         
+    ///.
     MapRegistry(const MapRegistry&) {}
                 
+    ///.
     MapRegistry& operator=(const MapRegistry&) {
       for (it = container.begin(); it != container.end(); ++it) {
@@ -150 +156 @@
     }
                                 
+    ///.
     ~MapRegistry() {
       typename Container::iterator it;
@@ -162 +169 @@
     public:
         
+    ///.
     void attach(MapBase& map) {
       if (map.registry) {
@@ -171 +179 @@
     } 
         
+    ///.
     void detach(MapBase& map) {
       container.back()->registry_index = map.registry_index; 
@@ -180 +189 @@
         
                 
+    ///. 
     virtual void add(Key& key) {
       typename Container::iterator it;
@@ -187 +197 @@
     }   
                 
+    ///.
     virtual void erase(Key& key) {
       typename Container::iterator it;

src/work/deba/test_graph.h

@@ -35 +35 @@
     
     typedef ListGraph Graph;
- 
-    CREATE_MAP_REGISTRIES
-    CREATE_MAPS(ArrayMapFactory)
-
+    
+    CREATE_MAP_REGISTRIES;
+    CREATE_MAPS(ArrayMapFactory);
+    
   private:
-
+    
     int node_id;
     int edge_id;
     int _node_num;
     int _edge_num;
-
+    
     node_item* _first_node;
     node_item* _last_node;