/*
 * Copyright (c) 2010-2013 Isode Limited.
 * All rights reserved.
 * See the COPYING file for more information.
 */

#include <Swiften/Network/DomainNameServiceQuery.h>

#include <numeric>
#include <cassert>
#include <functional>
#include <iterator>

#include <Swiften/Base/RandomGenerator.h>
#include <boost/numeric/conversion/cast.hpp>
#include <boost/lambda/lambda.hpp>
#include <boost/lambda/bind.hpp>
#include <boost/typeof/typeof.hpp>

using namespace Swift;
namespace lambda = boost::lambda;

namespace {
	struct ResultPriorityComparator {
		bool operator()(const DomainNameServiceQuery::Result& a, const DomainNameServiceQuery::Result& b) const {
			return a.priority < b.priority;
		}
	};
}

namespace Swift {

DomainNameServiceQuery::~DomainNameServiceQuery() {
}

void DomainNameServiceQuery::sortResults(std::vector<DomainNameServiceQuery::Result>& queries, RandomGenerator& generator) {
	ResultPriorityComparator comparator;
	std::stable_sort(queries.begin(), queries.end(), comparator);

	std::vector<DomainNameServiceQuery::Result>::iterator i = queries.begin();
	while (i != queries.end()) {
		std::vector<DomainNameServiceQuery::Result>::iterator next = std::upper_bound(i, queries.end(), *i, comparator);
		if (std::distance(i, next) > 1) {
			std::vector<int> weights;
			std::transform(i, next, std::back_inserter(weights), 
					/* easy hack to account for '0' weights getting at least some weight */
					lambda::bind(&Result::weight, lambda::_1) + 1);
			for (int j = 0; j < boost::numeric_cast<int>(weights.size() - 1); ++j) {
				std::vector<int> cumulativeWeights;
				std::partial_sum(
						weights.begin() + j,
						weights.end(), 
						std::back_inserter(cumulativeWeights));
				int randomNumber = generator.generateRandomInteger(cumulativeWeights.back());
				BOOST_AUTO(selectedIndex, std::lower_bound(cumulativeWeights.begin(), cumulativeWeights.end(), randomNumber) - cumulativeWeights.begin());
				std::swap(i[j], i[j + selectedIndex]);
				std::swap(weights.begin()[j], weights.begin()[j + selectedIndex]);
			}
		}
		i = next;
	}
}


}