// graph-tool -- a general graph modification and manipulation thingy
//
// Copyright (C) 2006-2022 Tiago de Paula Peixoto <tiago@skewed.de>
//
// This program is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License as published by the Free
// Software Foundation; either version 3 of the License, or (at your option) any
// later version.
//
// This program is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
// details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.

#include "graph_tool.hh"
#include "random.hh"

#include <boost/python.hpp>

#define GRAPH_RANGE never_filtered_never_reversed
#include "../blockmodel/graph_blockmodel.hh"

#include "graph_ranked.hh"
#include "graph_ranked_mcmc.hh"
#include "../loops/mcmc_loop.hh"

using namespace boost;
using namespace graph_tool;

GEN_DISPATCH(block_state, BlockState, BLOCK_STATE_params)


template <class BState>
GEN_DISPATCH(ranked_state, OState<BState>::template RankedState, RANKED_STATE_params)

template <class State>
GEN_DISPATCH(mcmc_block_state, MCMC<State>::template MCMCBlockState,
             MCMC_BLOCK_STATE_params(State))

python::object ranked_mcmc_sweep(python::object omcmc_state,
                                 python::object oblock_state,
                                 rng_t& rng)
{
    python::object ret;
    auto dispatch_d = [&](auto* dstate)
    {
        typedef typename std::remove_reference<decltype(*dstate)>::type
            dstate_t;

        auto dispatch = [&](auto& block_state)
        {
            typedef typename std::remove_reference<decltype(block_state)>::type
                state_t;

            mcmc_block_state<state_t>::make_dispatch
               (omcmc_state,
                [&](auto& s)
                {
                    auto ret_ = mcmc_sweep(*s, rng);
                    ret = tuple_apply([&](auto&... args){ return python::make_tuple(args...); }, ret_);
                });
        };
        ranked_state<dstate_t>::dispatch(oblock_state, dispatch, false);
    };
    block_state::dispatch(dispatch_d);
    return ret;
}

void export_ranked_mcmc()
{
    using namespace boost::python;
    def("ranked_mcmc_sweep", &ranked_mcmc_sweep);
}
