#include <cxxtest/TestSuite.h>

#include "common/util.h"
#include "common/func.h"
#include "common/algorithm.h"
#include "common/list.h"

class AlgorithmTestSuite : public CxxTest::TestSuite {
	template<typename T, class StrictWeakOrdering>
	void checkSort(T first, T last, StrictWeakOrdering comp = StrictWeakOrdering()) {
		// Check whether the container is sorted by the given binary predicate, which
		// decides whether the first value passed preceeds the second value passed.
		//
		// To do that it checks an item and its follower in the container with the
		// given predicate in reverse order, when it returns false everything is
		// fine, when it returns false, the follower preceeds the item and thus
		// the order is violated.
		for (T prev = first++; first != last; ++prev, ++first)
			TS_ASSERT_EQUALS(comp(*first, *prev), false);
	}

	struct Item {
		int value;
		Item(int v) : value(v) {}
	};

	struct ItemCmp {
		bool operator()(const Item &a, const Item &b) {
			return a.value < b.value;
		}
	};

public:
	void test_pod_sort() {
		{
			int array[] = { 63, 11, 31, 72, 1, 48, 32, 69, 38, 31 };
			Common::sort(array, array + ARRAYSIZE(array));
			checkSort(array, array + ARRAYSIZE(array), Common::Less<int>());

			Common::sort(array, array + ARRAYSIZE(array)); //already sorted one
			checkSort(array, array + ARRAYSIZE(array), Common::Less<int>());
		}
		{
			int array[] = { 90, 80, 70, 60, 50, 40, 30, 20, 10 };
			Common::sort(array, array + ARRAYSIZE(array));
			checkSort(array, array + ARRAYSIZE(array), Common::Less<int>());

			Common::sort(array, array + ARRAYSIZE(array), Common::Greater<int>());
			checkSort(array, array + ARRAYSIZE(array), Common::Greater<int>());
		}
	}
	
	void test_container_sort() {
		const int n = 1000;

		Common::List<Item> list;
		for(int i = 0; i < n; ++i)
			list.push_back(Item(i * 0xDEADBEEF % 1337));

		Common::sort(list.begin(), list.end(), ItemCmp());
		checkSort(list.begin(), list.end(), ItemCmp());

		//already sorted
		Common::sort(list.begin(), list.end(), ItemCmp());
		checkSort(list.begin(), list.end(), ItemCmp());
	}
};