update source to Ceph Pacific 16.2.2

[ceph.git] / ceph / src / boost / libs / graph / example / fibonacci_heap.cpp

diff --git a/ceph/src/boost/libs/graph/example/fibonacci_heap.cpp b/ceph/src/boost/libs/graph/example/fibonacci_heap.cpp
index 6fa76d0288780070143fb725e02cd7a0882e8784..ffa42ab5181f9128480b034c321cfe5f10cc0691 100644 (file)
--- a/ceph/src/boost/libs/graph/example/fibonacci_heap.cpp
+++ b/ceph/src/boost/libs/graph/example/fibonacci_heap.cpp
@@ -24,57 +24,63 @@ namespace random_ns = boost;
 
 using namespace boost;
 
-int
-main()
+int main()
 {
-  typedef indirect_cmp<float*,std::less<float> > ICmp;
-  int i;
-  random_ns::mt19937 gen;
-  for (int N = 2; N < 200; ++N) {
-     uniform_int<> distrib(0, N-1);
-     boost::variate_generator<random_ns::mt19937&, uniform_int<> > rand_gen(gen, distrib);
-    for (int t = 0; t < 10; ++t) {
-      std::vector<float> v, w(N);
+    typedef indirect_cmp< float*, std::less< float > > ICmp;
+    int i;
+    random_ns::mt19937 gen;
+    for (int N = 2; N < 200; ++N)
+    {
+        uniform_int<> distrib(0, N - 1);
+        boost::variate_generator< random_ns::mt19937&, uniform_int<> > rand_gen(
+            gen, distrib);
+        for (int t = 0; t < 10; ++t)
+        {
+            std::vector< float > v, w(N);
 
-      ICmp cmp(&w[0], std::less<float>());
-      fibonacci_heap<int, ICmp> Q(N, cmp);
+            ICmp cmp(&w[0], std::less< float >());
+            fibonacci_heap< int, ICmp > Q(N, cmp);
 
-      for (int c = 0; c < w.size(); ++c)
-        w[c] = c;
+            for (int c = 0; c < w.size(); ++c)
+                w[c] = c;
 #ifndef BOOST_NO_CXX98_RANDOM_SHUFFLE
-      std::random_shuffle(w.begin(), w.end());
+            std::random_shuffle(w.begin(), w.end());
 #else
-      std::shuffle(w.begin(), w.end(), gen);
+            std::shuffle(w.begin(), w.end(), gen);
 #endif
 
-      for (i = 0; i < N; ++i)
-        Q.push(i);
+            for (i = 0; i < N; ++i)
+                Q.push(i);
 
-      for (i = 0; i < N; ++i) {
-        int u = rand_gen();
-        float r = rand_gen(); r /= 2.0;
-        w[u] = w[u] - r;
-        Q.update(u);
-      }
+            for (i = 0; i < N; ++i)
+            {
+                int u = rand_gen();
+                float r = rand_gen();
+                r /= 2.0;
+                w[u] = w[u] - r;
+                Q.update(u);
+            }
 
-      for (i = 0; i < N; ++i) {
-        v.push_back(w[Q.top()]);
-        Q.pop();
-      }
-      std::sort(w.begin(), w.end());
+            for (i = 0; i < N; ++i)
+            {
+                v.push_back(w[Q.top()]);
+                Q.pop();
+            }
+            std::sort(w.begin(), w.end());
 
-      if (! std::equal(v.begin(), v.end(), w.begin())) {
-        std::cout << std::endl << "heap sorted: ";
-        std::copy(v.begin(), v.end(), 
-                  std::ostream_iterator<float>(std::cout," "));
-        std::cout << std::endl << "correct: ";
-        std::copy(w.begin(), w.end(), 
-                  std::ostream_iterator<float>(std::cout," "));
-        std::cout << std::endl;
-        return -1;
-      }
+            if (!std::equal(v.begin(), v.end(), w.begin()))
+            {
+                std::cout << std::endl << "heap sorted: ";
+                std::copy(v.begin(), v.end(),
+                    std::ostream_iterator< float >(std::cout, " "));
+                std::cout << std::endl << "correct: ";
+                std::copy(w.begin(), w.end(),
+                    std::ostream_iterator< float >(std::cout, " "));
+                std::cout << std::endl;
+                return -1;
+            }
+        }
     }
-  }
-  std::cout << "fibonacci heap passed test" << std::endl; 
-  return 0;
+    std::cout << "fibonacci heap passed test" << std::endl;
+    return 0;
 }