/* ----------------------------------------------------------------------------

 * GTSAM Copyright 2010, Georgia Tech Research Corporation, 
 * Atlanta, Georgia 30332-0415
 * All Rights Reserved
 * Authors: Frank Dellaert, et al. (see THANKS for the full author list)

 * See LICENSE for the license information

 * -------------------------------------------------------------------------- */

/**
 * @file testDSF.cpp
 * @date June 25, 2010
 * @author nikai
 * @brief unit tests for DSF
 */

#include <iostream>
#include <boost/make_shared.hpp>
#include <boost/assign/std/list.hpp>
#include <boost/assign/std/set.hpp>
#include <boost/assign/std/vector.hpp>
using namespace boost::assign;
#include <CppUnitLite/TestHarness.h>

#include <gtsam_unstable/base/DSFVector.h>

using namespace std;
using namespace gtsam;

/* ************************************************************************* */
TEST(DSFVectorVector, findSet) {
	DSFVector dsf(3);
	CHECK(dsf.findSet(0) != dsf.findSet(2));
}

/* ************************************************************************* */
TEST(DSFVectorVector, makeUnionInPlace) {
	DSFVector dsf(3);
	dsf.makeUnionInPlace(0,2);
	CHECK(dsf.findSet(0) == dsf.findSet(2));
}

/* ************************************************************************* */
TEST(DSFVectorVector, makeUnionInPlace2) {
	boost::shared_ptr<DSFVector::V> v = boost::make_shared<DSFVector::V>(5);
	std::vector<size_t> keys; keys += 1, 3;
	DSFVector dsf(v, keys);
	dsf.makeUnionInPlace(1,3);
	CHECK(dsf.findSet(1) == dsf.findSet(3));
}

/* ************************************************************************* */
TEST(DSFVector, makeUnion2) {
	DSFVector dsf(3);
	dsf.makeUnionInPlace(2,0);
	CHECK(dsf.findSet(0) == dsf.findSet(2));
}

/* ************************************************************************* */
TEST(DSFVector, makeUnion3) {
	DSFVector dsf(3);
	dsf.makeUnionInPlace(0,1);
	dsf.makeUnionInPlace(1,2);
	CHECK(dsf.findSet(0) == dsf.findSet(2));
}

/* ************************************************************************* */
TEST(DSFVector, sets) {
	DSFVector dsf(2);
	dsf.makeUnionInPlace(0,1);
	map<size_t, set<size_t> > sets = dsf.sets();
	LONGS_EQUAL(1, sets.size());

	set<size_t> expected; expected += 0, 1;
	CHECK(expected == sets[dsf.findSet(0)]);
}

/* ************************************************************************* */
TEST(DSFVector, arrays) {
	DSFVector dsf(2);
	dsf.makeUnionInPlace(0,1);
	map<size_t, vector<size_t> > arrays = dsf.arrays();
	LONGS_EQUAL(1, arrays.size());

	vector<size_t> expected; expected += 0, 1;
	CHECK(expected == arrays[dsf.findSet(0)]);
}

/* ************************************************************************* */
TEST(DSFVector, sets2) {
	DSFVector dsf(3);
	dsf.makeUnionInPlace(0,1);
	dsf.makeUnionInPlace(1,2);
	map<size_t, set<size_t> > sets = dsf.sets();
	LONGS_EQUAL(1, sets.size());

	set<size_t> expected; expected += 0, 1, 2;
	CHECK(expected == sets[dsf.findSet(0)]);
}

/* ************************************************************************* */
TEST(DSFVector, arrays2) {
	DSFVector dsf(3);
	dsf.makeUnionInPlace(0,1);
	dsf.makeUnionInPlace(1,2);
	map<size_t, vector<size_t> > arrays = dsf.arrays();
	LONGS_EQUAL(1, arrays.size());

	vector<size_t> expected; expected += 0, 1, 2;
	CHECK(expected == arrays[dsf.findSet(0)]);
}

/* ************************************************************************* */
TEST(DSFVector, sets3) {
	DSFVector dsf(3);
	dsf.makeUnionInPlace(0,1);
	map<size_t, set<size_t> > sets = dsf.sets();
	LONGS_EQUAL(2, sets.size());

	set<size_t> expected; expected += 0, 1;
	CHECK(expected == sets[dsf.findSet(0)]);
}

/* ************************************************************************* */
TEST(DSFVector, arrays3) {
	DSFVector dsf(3);
	dsf.makeUnionInPlace(0,1);
	map<size_t, vector<size_t> > arrays = dsf.arrays();
	LONGS_EQUAL(2, arrays.size());

	vector<size_t> expected; expected += 0, 1;
	CHECK(expected == arrays[dsf.findSet(0)]);
}

/* ************************************************************************* */
TEST(DSFVector, set) {
	DSFVector dsf(3);
	dsf.makeUnionInPlace(0,1);
	set<size_t> set = dsf.set(0);
	LONGS_EQUAL(2, set.size());

	std::set<size_t> expected; expected += 0, 1;
	CHECK(expected == set);
}

/* ************************************************************************* */
TEST(DSFVector, set2) {
	DSFVector dsf(3);
	dsf.makeUnionInPlace(0,1);
	dsf.makeUnionInPlace(1,2);
	set<size_t> set = dsf.set(0);
	LONGS_EQUAL(3, set.size());

	std::set<size_t> expected; expected += 0, 1, 2;
	CHECK(expected == set);
}

/* ************************************************************************* */
TEST(DSFVector, isSingleton) {
	DSFVector dsf(3);
	dsf.makeUnionInPlace(0,1);
	CHECK(!dsf.isSingleton(0));
	CHECK(!dsf.isSingleton(1));
	CHECK( dsf.isSingleton(2));
}
/* ************************************************************************* */
int main() { TestResult tr; return TestRegistry::runAllTests(tr);}
/* ************************************************************************* */