| 
									
										
										
										
											2010-06-25 14:35:44 +08:00
										 |  |  | /*
 | 
					
						
							|  |  |  |  * testDSF.cpp | 
					
						
							|  |  |  |  * | 
					
						
							|  |  |  |  *   Created on: June 25, 2010 | 
					
						
							|  |  |  |  *       Author: nikai | 
					
						
							|  |  |  |  *  Description: unit tests for DSF | 
					
						
							|  |  |  |  */ | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | #include <iostream>
 | 
					
						
							|  |  |  | #include <boost/assign/std/list.hpp>
 | 
					
						
							|  |  |  | #include <boost/assign/std/set.hpp>
 | 
					
						
							|  |  |  | using namespace boost::assign; | 
					
						
							| 
									
										
										
										
											2010-08-20 01:23:19 +08:00
										 |  |  | #include <gtsam/CppUnitLite/TestHarness.h>
 | 
					
						
							| 
									
										
										
										
											2010-06-25 14:35:44 +08:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2010-08-20 01:23:19 +08:00
										 |  |  | #include <gtsam/base/DSFVector.h>
 | 
					
						
							| 
									
										
										
										
											2010-06-25 14:35:44 +08:00
										 |  |  | 
 | 
					
						
							|  |  |  | 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(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, 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, 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, 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); | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | int main() { TestResult tr; return TestRegistry::runAllTests(tr);} | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | 
 |