Changeset 1669:66ae78d29f1e in lemon-0.x for lemon/bits/default_map.h

Timestamp:

08/31/05 15:29:32 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Template assign operator for graph maps.

Some naming and coding conventions.

File:

• lemon/bits/default_map.h (modified) (9 diffs)

lemon/bits/default_map.h

@@ -29 +29 @@
 namespace lemon {
 
-/// \addtogroup graphmapfactory
-/// @{
-
-  /** The ArrayMap template class is graph map structure what
-   *  automatically updates the map when a key is added to or erased from
-   *  the map. This map uses the VectorMap if the Value is a primitive
-   *  type and the ArrayMap for the other cases.
-   *
-   *  The template parameter is the MapRegistry that the maps
-   *  will belong to and the Value.
-   */
-
-
+  /// \addtogroup graphmapfactory
+  /// @{
 
   template <typename _Graph, typename _Item, typename _Value>
@@ -136 +125 @@
   };
 
-
-
+  /// \e
   template <
     typename _Graph, 
@@ -153 +141 @@
     DefaultMap(const Graph& _g) : Parent(_g) {}
     DefaultMap(const Graph& _g, const Value& _v) : Parent(_g, _v) {}
-  };
-
-
-
+
+  };
+
+
+  /// \e
   template <typename _Base> 
-  class DefaultMappableGraphExtender : public _Base {
+  class MappableGraphExtender : public _Base {
   public:
 
-    typedef DefaultMappableGraphExtender<_Base> Graph;
+    typedef MappableGraphExtender<_Base> Graph;
     typedef _Base Parent;
 
@@ -175 +164 @@
       : public IterableMapExtender<DefaultMap<Graph, Node, _Value> > {
     public:
-      typedef DefaultMappableGraphExtender Graph;
+      typedef MappableGraphExtender Graph;
       typedef IterableMapExtender<DefaultMap<Graph, Node, _Value> > Parent;
 
@@ -182 +171 @@
       NodeMap(const Graph& _g, const _Value& _v) 
         : Parent(_g, _v) {}
+
+      /// \brief Template assign operator.
+      ///
+      /// The given parameter should be conform to the ReadMap
+      /// concecpt and could be indiced by the current item set of
+      /// the NodeMap. In this case the value for each item
+      /// is assigned by the value of the given ReadMap. 
+      template <typename CMap>
+      NodeMap& operator=(const CMap& cmap) {
+        checkConcept<concept::ReadMap<Node, _Value>, CMap>();
+        const typename Parent::Graph* graph = Parent::getGraph();
+        Node it;
+        for (graph->first(it); it != INVALID; graph->next(it)) {
+          Parent::set(it, cmap[it]);
+        }
+        return *this;
+      }
+
     };
 
@@ -188 +195 @@
       : public IterableMapExtender<DefaultMap<Graph, Edge, _Value> > {
     public:
-      typedef DefaultMappableGraphExtender Graph;
+      typedef MappableGraphExtender Graph;
       typedef IterableMapExtender<DefaultMap<Graph, Edge, _Value> > Parent;
 
@@ -195 +202 @@
       EdgeMap(const Graph& _g, const _Value& _v) 
         : Parent(_g, _v) {}
+
+      template <typename CMap>
+      EdgeMap& operator=(const CMap& cmap) {
+        checkConcept<concept::ReadMap<Edge, _Value>, CMap>();
+        const typename Parent::Graph* graph = Parent::getGraph();
+        Edge it;
+        for (graph->first(it); it != INVALID; graph->next(it)) {
+          Parent::set(it, cmap[it]);
+        }
+        return *this;
+      }
     };
     
   };
 
+  /// \e
   template <typename _Base> 
   class MappableUndirGraphExtender : 
-    public DefaultMappableGraphExtender<_Base> {
+    public MappableGraphExtender<_Base> {
   public:
 
     typedef MappableUndirGraphExtender Graph;
-    typedef DefaultMappableGraphExtender<_Base> Parent;
+    typedef MappableGraphExtender<_Base> Parent;
 
     typedef typename Parent::UndirEdge UndirEdge;
@@ -221 +240 @@
       UndirEdgeMap(const Graph& _g, const _Value& _v) 
         : Parent(_g, _v) {}
+
+      template <typename CMap>
+      UndirEdgeMap& operator=(const CMap& cmap) {
+        checkConcept<concept::ReadMap<UndirEdge, _Value>, CMap>();
+        const typename Parent::Graph* graph = Parent::getGraph();
+        UndirEdge it;
+        for (graph->first(it); it != INVALID; graph->next(it)) {
+          Parent::set(it, cmap[it]);
+        }
+        return *this;
+      }
     };
 
@@ -226 +256 @@
   };
 
+  /// @}
 }