update source to Ceph Pacific 16.2.2

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

//=======================================================================
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include <boost/config.hpp>
#include <iostream>
#include <vector>
#include <boost/graph/random.hpp>
#ifndef BOOST_NO_CXX11_HDR_RANDOM
#include <random>
namespace random_ns = std;
#else
#include <boost/random/mersenne_twister.hpp>
namespace random_ns = boost;
#endif
#include <algorithm>
#include <boost/pending/fibonacci_heap.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/pending/indirect_cmp.hpp>

using namespace boost;

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);

            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;
#ifndef BOOST_NO_CXX98_RANDOM_SHUFFLE
            std::random_shuffle(w.begin(), w.end());
#else
            std::shuffle(w.begin(), w.end(), gen);
#endif

            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)
            {
                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;
            }
        }
    }
    std::cout << "fibonacci heap passed test" << std::endl;
    return 0;
}