Changeset 2033:7bf1f64962c2 in lemon-0.x

Timestamp:

04/03/06 18:05:26 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Small corrections

Location:

lemon

Files:

• bfs.h (modified) (1 diff)
• preflow.h (modified) (2 diffs)
• radix_sort.h (modified) (3 diffs)

lemon/bfs.h

@@ -282 +282 @@
     struct DefProcessedMapTraits : public Traits {
       typedef T ProcessedMap;
-      static ProcessedMap *createProcessedMap(const Graph &G) 
+      static ProcessedMap *createProcessedMap(const Graph &) 
       {
         throw UninitializedParameter();

lemon/preflow.h

@@ -160 +160 @@
     ///calling \ref source, \ref target, \ref capacityMap and \ref
     ///flowMap, resp.
-      Preflow(const Graph& _gr, Node _s, Node _t, 
-              const CapacityMap& _cap, FlowMap& _f,
-              const Tolerance &_sr=Tolerance()) :
+    Preflow(const Graph& _gr, Node _s, Node _t, 
+            const CapacityMap& _cap, FlowMap& _f,
+            const Tolerance &_sr=Tolerance()) :
         _g(&_gr), _source(_s), _target(_t), _capacity(&_cap),
         _flow(&_f), _surely(_sr),
@@ -169 +169 @@
         if ( _source==_target )
           throw InvalidArgument();
-      }
+    }
     
     ///Give a reference to the tolerance handler class

lemon/radix_sort.h

@@ -326 +326 @@
 
     int length = std::distance(first, last);
-    Key* buffer;
-    buffer = allocator.allocate(2 * length);
+    Key* buffer = allocator.allocate(2 * length);
     try {
       bool dir = true;
@@ -365 +364 @@
 
     int length = std::distance(first, last);
-    Key *buffer;
-    buffer = allocator.allocate(2 * length);
+    Key *buffer = allocator.allocate(2 * length);
     try {
       bool dir = true;
@@ -372 +370 @@
       for (int i = 0; i < (int)sizeof(Value); ++i) {
         if (dir) {
-          counterIntroSort(buffer, buffer + length, buffer + length, i, functor);
+          counterIntroSort(buffer, buffer + length, 
+                           buffer + length, i, functor);
         } else {
-          counterIntroSort(buffer + length, buffer + 2 * length, buffer, i, functor);
+          counterIntroSort(buffer + length, buffer + 2 * length, 
+                           buffer, i, functor);
         }
         dir = !dir;