| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | /* ----------------------------------------------------------------------------
 | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2019-02-11 22:39:48 +08:00
										 |  |  |  * GTSAM Copyright 2010, Georgia Tech Research Corporation, | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  |  * 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 Mar 26, 2010 | 
					
						
							|  |  |  |  * @author nikai | 
					
						
							|  |  |  |  * @brief unit tests for DSF | 
					
						
							|  |  |  |  */ | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  | #include <gtsam_unstable/base/DSF.h>
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | #include <CppUnitLite/TestHarness.h>
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | #include <iostream>
 | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | 
 | 
					
						
							|  |  |  | using namespace std; | 
					
						
							|  |  |  | using namespace gtsam; | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, makeSet) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   LONGS_EQUAL(1, dsf.size()); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, findSet) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(dsf.findSet(5) != dsf.findSet(7)); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, makeUnion) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,7); | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(dsf.findSet(5) == dsf.findSet(7)); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, makeUnion2) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(7,5); | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(dsf.findSet(5) == dsf.findSet(7)); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, makeUnion3) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(6,7); | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(dsf.findSet(5) == dsf.findSet(7)); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, makePair) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makePair(0, 1); | 
					
						
							|  |  |  |   dsf = dsf.makePair(1, 2); | 
					
						
							|  |  |  |   dsf = dsf.makePair(3, 2); | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(dsf.findSet(0) == dsf.findSet(3)); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, makeList) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   list<int> keys{5, 6, 7}; | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   dsf = dsf.makeList(keys); | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(dsf.findSet(5) == dsf.findSet(7)); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, numSets) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							|  |  |  |   LONGS_EQUAL(2, dsf.numSets()); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, sets) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							|  |  |  |   map<int, set<int> > sets = dsf.sets(); | 
					
						
							|  |  |  |   LONGS_EQUAL(1, sets.size()); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   set<int> expected{5, 6}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(expected == sets[dsf.findSet(5)]); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, sets2) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(6,7); | 
					
						
							|  |  |  |   map<int, set<int> > sets = dsf.sets(); | 
					
						
							|  |  |  |   LONGS_EQUAL(1, sets.size()); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   set<int> expected{5, 6, 7}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(expected == sets[dsf.findSet(5)]); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, sets3) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							|  |  |  |   map<int, set<int> > sets = dsf.sets(); | 
					
						
							|  |  |  |   LONGS_EQUAL(2, sets.size()); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   set<int> expected{5, 6}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(expected == sets[dsf.findSet(5)]); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, partition) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   list<int> keys{5}; | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   map<int, set<int> > partitions = dsf.partition(keys); | 
					
						
							|  |  |  |   LONGS_EQUAL(1, partitions.size()); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   set<int> expected{5}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(expected == partitions[dsf.findSet(5)]); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, partition2) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   list<int> keys{7}; | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   map<int, set<int> > partitions = dsf.partition(keys); | 
					
						
							|  |  |  |   LONGS_EQUAL(1, partitions.size()); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   set<int> expected{7}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(expected == partitions[dsf.findSet(7)]); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, partition3) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   list<int> keys{5, 7}; | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   map<int, set<int> > partitions = dsf.partition(keys); | 
					
						
							|  |  |  |   LONGS_EQUAL(2, partitions.size()); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   set<int> expected{5}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(expected == partitions[dsf.findSet(5)]); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, set) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							|  |  |  |   set<int> set = dsf.set(5); | 
					
						
							|  |  |  |   LONGS_EQUAL(2, set.size()); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   std::set<int> expected{5, 6}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(expected == set); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, set2) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(6,7); | 
					
						
							|  |  |  |   set<int> set = dsf.set(5); | 
					
						
							|  |  |  |   LONGS_EQUAL(3, set.size()); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   std::set<int> expected{5, 6, 7}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(expected == set); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | int func(const int& a) { return a + 10; } | 
					
						
							|  |  |  | TEST(DSF, map) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makeSet(5); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(6); | 
					
						
							|  |  |  |   dsf = dsf.makeSet(7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(5,6); | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  |   DSFInt actual = dsf.map(&func); | 
					
						
							|  |  |  |   DSFInt expected; | 
					
						
							|  |  |  |   expected = expected.makeSet(15); | 
					
						
							|  |  |  |   expected = expected.makeSet(16); | 
					
						
							|  |  |  |   expected = expected.makeSet(17); | 
					
						
							|  |  |  |   expected = expected.makeUnion(15,16); | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(actual == expected); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, flatten) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSFInt dsf; | 
					
						
							|  |  |  |   dsf = dsf.makePair(1, 2); | 
					
						
							|  |  |  |   dsf = dsf.makePair(2, 3); | 
					
						
							|  |  |  |   dsf = dsf.makePair(5, 6); | 
					
						
							|  |  |  |   dsf = dsf.makePair(6, 7); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(2, 6); | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  |   DSFInt actual = dsf.flatten(); | 
					
						
							|  |  |  |   DSFInt expected; | 
					
						
							|  |  |  |   expected = expected.makePair(1, 2); | 
					
						
							|  |  |  |   expected = expected.makePair(1, 3); | 
					
						
							|  |  |  |   expected = expected.makePair(1, 5); | 
					
						
							|  |  |  |   expected = expected.makePair(1, 6); | 
					
						
							|  |  |  |   expected = expected.makePair(1, 7); | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(actual == expected); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, flatten2) { | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   static string x1("x1"), x2("x2"), x3("x3"), x4("x4"); | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   list<string> keys{x1, x2, x3, x4}; | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  |   DSF<string> dsf(keys); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(x1,x2); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(x3,x4); | 
					
						
							|  |  |  |   dsf = dsf.makeUnion(x1,x3); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(dsf != dsf.flatten()); | 
					
						
							| 
									
										
										
										
											2012-10-02 22:40:07 +08:00
										 |  |  | 
 | 
					
						
							|  |  |  |   DSF<string> expected2; | 
					
						
							|  |  |  |   expected2 = expected2.makePair(x1, x2); | 
					
						
							|  |  |  |   expected2 = expected2.makePair(x1, x3); | 
					
						
							|  |  |  |   expected2 = expected2.makePair(x1, x4); | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   EXPECT(expected2 == dsf.flatten()); | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | TEST(DSF, mergePairwiseMatches) { | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  |   // Create some measurements with image index and feature index
 | 
					
						
							|  |  |  |   typedef pair<size_t,size_t> Measurement; | 
					
						
							|  |  |  |   Measurement m11(1,1),m12(1,2),m14(1,4); // in image 1
 | 
					
						
							|  |  |  |   Measurement m22(2,2),m23(2,3),m25(2,5),m26(2,6); // in image 2
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  |   // Add them all
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   list<Measurement> measurements{m11, m12, m14, m22, m23, m25, m26}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  | 
 | 
					
						
							|  |  |  |   // Create some "matches"
 | 
					
						
							|  |  |  |   typedef pair<Measurement,Measurement> Match; | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   list<Match> matches{Match(m11, m22), Match(m12, m23), Match(m14, m25), | 
					
						
							|  |  |  |                       Match(m14, m26)}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  | 
 | 
					
						
							|  |  |  |   // Merge matches
 | 
					
						
							|  |  |  |   DSF<Measurement> dsf(measurements); | 
					
						
							| 
									
										
										
										
											2016-05-21 23:52:14 +08:00
										 |  |  |   for(const Match& m: matches) | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |     dsf.makeUnionInPlace(m.first,m.second); | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  |   // Check that sets are merged correctly
 | 
					
						
							|  |  |  |   EXPECT(dsf.findSet(m11)==m11); | 
					
						
							|  |  |  |   EXPECT(dsf.findSet(m12)==m12); | 
					
						
							|  |  |  |   EXPECT(dsf.findSet(m14)==m14); | 
					
						
							|  |  |  |   EXPECT(dsf.findSet(m22)==m11); | 
					
						
							|  |  |  |   EXPECT(dsf.findSet(m23)==m12); | 
					
						
							|  |  |  |   EXPECT(dsf.findSet(m25)==m14); | 
					
						
							|  |  |  |   EXPECT(dsf.findSet(m26)==m14); | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  |   // Check that we have three connected components
 | 
					
						
							|  |  |  |   EXPECT_LONGS_EQUAL(3, dsf.numSets()); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   set<Measurement> expected1{m11,m22}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   set<Measurement> actual1 = dsf.set(m11); | 
					
						
							|  |  |  |   EXPECT(expected1 == actual1); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   set<Measurement> expected2{m12,m23}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   set<Measurement> actual2 = dsf.set(m12); | 
					
						
							|  |  |  |   EXPECT(expected2 == actual2); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-01-08 15:59:39 +08:00
										 |  |  |   set<Measurement> expected3{m14,m25,m26}; | 
					
						
							| 
									
										
										
										
											2013-10-27 00:08:18 +08:00
										 |  |  |   set<Measurement> actual3 = dsf.set(m14); | 
					
						
							|  |  |  |   EXPECT(expected3 == actual3); | 
					
						
							| 
									
										
										
										
											2012-05-04 01:03:16 +08:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | int main() { TestResult tr; return TestRegistry::runAllTests(tr);} | 
					
						
							|  |  |  | /* ************************************************************************* */ | 
					
						
							|  |  |  | 
 |