1 #include <cppunit/TestFixture.h>
2 #include <cppunit/extensions/HelperMacros.h>
4 #include <genesorter.h>
6 #include <genealgorithms.h>
7 #include <componenttree.h>
14 * A test case that is designed to produce
15 * example errors and failures.
19 #define TESTNAME ComponentTreeTest
22 class TESTNAME : public CPPUNIT_NS::TestFixture
24 CPPUNIT_TEST_SUITE( TESTNAME );
25 CPPUNIT_TEST( testCreate );
26 CPPUNIT_TEST( testMakeUnoriented );
27 CPPUNIT_TEST( testCountLeaves );
28 CPPUNIT_TEST( testShortBranches );
29 CPPUNIT_TEST_SUITE_END();
32 vector<int> _validPerm;
33 vector<int> _validPerm2;
34 vector<int> _validPerm3;
35 vector<int> _validPerm4;
40 int validPerm[] = {1,2,3,4};
41 _validPerm.assign(validPerm,validPerm+4);
42 int validPerm2[] = {1,-3,-2,4};
43 _validPerm2.assign(validPerm2,validPerm2+4);
44 int validPerm3[] = {0,-2,-1,4,3,5,-8,6,7,9};
45 _validPerm3.assign(validPerm3,validPerm3+10);
46 int validPerm4[] = {-3,1,2,4,6,5,7,-15,-13,-14,-12,-10,-11,-9,8};
47 _validPerm4.assign(validPerm4,validPerm4+15);
53 size_t count(ComponentTree::Node* n, bool all = false){
55 if (all || n->_comp.i2 != 0)
57 for (vector<ComponentTree::Node*>::iterator c = n->_children.begin();
58 c != n->_children.end(); ++c){
64 GeneOrder go(_validPerm.begin(),_validPerm.end());
65 ComponentTree t(findComponents(go));
66 ComponentTree::Node* n = t._root;
68 CPPUNIT_ASSERT_EQUAL((size_t)4u,count(n));
69 CPPUNIT_ASSERT_EQUAL((size_t)5u,count(n,true));
70 CPPUNIT_ASSERT_EQUAL((size_t)4u,n->_children.size());
72 Component go10(0,1,0,0,1);
73 Component go11(1,2,0,1,2);
74 Component go12(2,3,0,2,3);
75 Component go13(3,4,0,3,4);
76 CPPUNIT_ASSERT(n->_children[0]->_comp == go10);
77 CPPUNIT_ASSERT(n->_children[1]->_comp == go11);
78 CPPUNIT_ASSERT(n->_children[2]->_comp == go12);
79 CPPUNIT_ASSERT(n->_children[3]->_comp == go13);
81 GeneOrder go2(_validPerm4.begin(),_validPerm4.end());
82 ComponentTree t2(findComponents(go2));
85 CPPUNIT_ASSERT_EQUAL((size_t)6u,count(n));
86 CPPUNIT_ASSERT_EQUAL((size_t)9u,count(n,true));
87 CPPUNIT_ASSERT_EQUAL((size_t)3u,n->_children.size());
88 Component go20(1,2,0,2,3);
89 Component go21(0,4,0,0,4);
90 Component go22(4,7,1,4,7);
91 Component go23(-15,-12,-1,8,11);
92 Component go24(-12,-9,-1,11,14);
93 Component go25(7,16,0,7,16);
94 CPPUNIT_ASSERT(n->_children[0]->_comp == go21);
95 CPPUNIT_ASSERT(n->_children[1]->_comp == go22);
96 CPPUNIT_ASSERT(n->_children[2]->_comp == go25);
97 CPPUNIT_ASSERT(n->_children[0]->_children[0]->_children[0]->_comp == go20);
98 CPPUNIT_ASSERT(n->_children[2]->_children[0]->_children[0]->_comp == go23);
99 CPPUNIT_ASSERT(n->_children[2]->_children[0]->_children[1]->_comp == go24);
103 void testMakeUnoriented (){
104 GeneOrder go(_validPerm.begin(),_validPerm.end());
105 ComponentTree t(findComponents(go));
107 ComponentTree::Node* n = t._root;
109 CPPUNIT_ASSERT_EQUAL((size_t)0u,count(n));
110 CPPUNIT_ASSERT_EQUAL((size_t)1u,count(n,true));
111 CPPUNIT_ASSERT_EQUAL((size_t)0u,n->_children.size());
113 GeneOrder go2(_validPerm4.begin(),_validPerm4.end());
114 ComponentTree t2(findComponents(go2));
118 CPPUNIT_ASSERT_EQUAL((size_t)4u,count(n));
119 CPPUNIT_ASSERT_EQUAL((size_t)6u,count(n,true));
120 CPPUNIT_ASSERT_EQUAL((size_t)2u,n->_children.size());
121 Component go22(4,7,1,4,7);
122 Component go23(-15,-12,-1,8,11);
123 Component go24(-12,-9,-1,11,14);
124 Component go25(7,16,0,7,16);
125 CPPUNIT_ASSERT(n->_children[0]->_comp == go22);
126 CPPUNIT_ASSERT(n->_children[1]->_comp == go25);
127 CPPUNIT_ASSERT(n->_children[1]->_children[0]->_children[0]->_comp == go23);
128 CPPUNIT_ASSERT(n->_children[1]->_children[0]->_children[1]->_comp == go24);
131 void testCountLeaves (){
132 GeneOrder go(_validPerm.begin(),_validPerm.end());
133 ComponentTree t(findComponents(go));
136 CPPUNIT_ASSERT_EQUAL((size_t)0u,t.countLeaves());
138 GeneOrder go2(_validPerm4.begin(),_validPerm4.end());
139 ComponentTree t2(findComponents(go2));
141 ComponentTree::Node* n = t2._root;
142 CPPUNIT_ASSERT_EQUAL((size_t)2u,n->_children.size());
143 CPPUNIT_ASSERT_EQUAL(false,n->_children.empty());
144 CPPUNIT_ASSERT_EQUAL((size_t)3u,t2.countLeaves());
146 void testShortBranches (){
147 GeneOrder go(_validPerm.begin(),_validPerm.end());
148 ComponentTree t(findComponents(go));
151 CPPUNIT_ASSERT_EQUAL((size_t)0u,t.shortBranches());
153 GeneOrder go2(_validPerm4.begin(),_validPerm4.end());
154 ComponentTree t2(findComponents(go2));
156 ComponentTree::Node* n = t2._root;
157 //CPPUNIT_ASSERT_EQUAL((size_t)1u,t2.shortBranches());
162 CPPUNIT_TEST_SUITE_REGISTRATION( TESTNAME );