2 * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3 * Copyright (C) $$Year-Rel$$ The Jalview Authors
5 * This file is part of Jalview.
7 * Jalview is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation, either version 3
10 * of the License, or (at your option) any later version.
12 * Jalview is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty
14 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19 * The Jalview Authors are detailed in the 'AUTHORS' file.
21 package jalview.datamodel;
23 import static org.testng.AssertJUnit.assertEquals;
24 import static org.testng.AssertJUnit.assertFalse;
25 import static org.testng.AssertJUnit.assertSame;
26 import static org.testng.AssertJUnit.assertTrue;
28 import java.util.BitSet;
30 import org.junit.Assert;
31 import org.testng.annotations.Test;
33 public class SearchResultsTest
36 @Test(groups = { "Functional" })
37 public void testToString()
39 SequenceI seq = new Sequence("Seq1", "abcdefghijklm");
40 SearchResultsI sr = new SearchResults();
41 sr.addResult(seq, 1, 1);
42 assertEquals("[Seq1/1-1]", sr.toString());
43 sr.addResult(seq, 3, 5);
44 assertEquals("[Seq1/1-1, Seq1/3-5]", sr.toString());
46 seq = new Sequence("Seq2", "pqrstuvwxy");
47 sr.addResult(seq, 6, 7);
48 assertEquals("[Seq1/1-1, Seq1/3-5, Seq2/6-7]", sr.toString());
51 @Test(groups = { "Functional" })
52 public void testEquals()
54 SequenceI seq1 = new Sequence("", "abcdefghijklm");
55 SearchResultsI sr1 = new SearchResults();
56 SearchResultsI sr2 = new SearchResults();
58 assertFalse(sr1.equals(null)); // null object
59 assertFalse(sr1.equals(seq1)); // wrong type
60 assertTrue(sr1.equals(sr1)); // self
61 assertTrue(sr1.equals(sr2)); // empty
62 assertTrue(sr2.equals(sr1)); // reflexive
65 * if only one result is not empty
67 sr1.addResult(seq1, 1, 1);
68 assertTrue(sr1.equals(sr1));
69 assertFalse(sr1.equals(sr2));
70 assertFalse(sr2.equals(sr1));
75 sr2.addResult(seq1, 1, 1);
76 assertTrue(sr1.equals(sr2));
77 assertTrue(sr2.equals(sr1));
80 * both have three matches
82 sr1.addResult(seq1, 3, 4);
83 sr1.addResult(seq1, 6, 8);
84 sr2.addResult(seq1, 3, 4);
85 sr2.addResult(seq1, 6, 8);
86 assertTrue(sr1.equals(sr1));
87 assertTrue(sr2.equals(sr2));
88 assertTrue(sr1.equals(sr2));
89 assertTrue(sr2.equals(sr1));
93 * Matches that are similar but for distinct sequences are not equal
95 @Test(groups = { "Functional" })
96 public void testEquals_distinctSequences()
98 SequenceI seq1 = new Sequence("", "abcdefghijklm");
99 SequenceI seq2 = new Sequence("", "abcdefghijklm");
100 SearchResultsI sr1 = new SearchResults();
101 SearchResultsI sr2 = new SearchResults();
103 sr1.addResult(seq1, 1, 1);
104 sr2.addResult(seq2, 1, 1);
105 assertFalse(sr1.equals(sr2));
106 assertFalse(sr2.equals(sr1));
110 * Matches that are the same except for ordering are not equal
112 @Test(groups = { "Functional" })
113 public void testEquals_orderDiffers()
115 SequenceI seq1 = new Sequence("", "abcdefghijklm");
116 SearchResultsI sr1 = new SearchResults();
117 SearchResultsI sr2 = new SearchResults();
119 sr1.addResult(seq1, 1, 1);
120 sr1.addResult(seq1, 2, 2);
121 sr2.addResult(seq1, 2, 2);
122 sr2.addResult(seq1, 1, 1);
123 assertFalse(sr1.equals(sr2));
124 assertFalse(sr2.equals(sr1));
128 * Verify that hashCode matches for equal objects
130 @Test(groups = { "Functional" })
131 public void testHashcode()
133 SequenceI seq1 = new Sequence("", "abcdefghijklm");
134 SearchResultsI sr1 = new SearchResults();
135 SearchResultsI sr2 = new SearchResults();
140 assertEquals(sr1.hashCode(), sr2.hashCode());
145 sr1.addResult(seq1, 1, 1);
146 sr2.addResult(seq1, 1, 1);
147 assertEquals(sr1.hashCode(), sr2.hashCode());
152 sr1.addResult(seq1, 3, 4);
153 sr1.addResult(seq1, 6, 8);
154 sr2.addResult(seq1, 3, 4);
155 sr2.addResult(seq1, 6, 8);
156 assertEquals(sr1.hashCode(), sr2.hashCode());
160 * Verify that SearchResults$Match constructor normalises start/end to the
161 * 'forwards' direction
163 @Test(groups = { "Functional" })
164 public void testMatchConstructor()
166 SequenceI seq1 = new Sequence("", "abcdefghijklm");
167 SearchResultMatchI m = new SearchResults().new Match(seq1, 2, 5);
168 assertSame(seq1, m.getSequence());
169 assertEquals(2, m.getStart());
170 assertEquals(5, m.getEnd());
172 // now a reverse mapping:
173 m = new SearchResults().new Match(seq1, 5, 2);
174 assertSame(seq1, m.getSequence());
175 assertEquals(2, m.getStart());
176 assertEquals(5, m.getEnd());
180 * test markColumns for creating column selections
182 @Test(groups = { "Functional" })
183 public void testMarkColumns()
186 SequenceI seq1 = new Sequence("", "abcdefghijklm");
187 SequenceI seq2 = new Sequence("", "abcdefghijklm");
188 SequenceGroup s1g=new SequenceGroup(), s2g=new SequenceGroup(), sallg=new SequenceGroup();
189 s1g.addSequence(seq1, false);
190 s2g.addSequence(seq2, false);
191 sallg.addSequence(seq1, false);
192 sallg.addSequence(seq2, false);
194 SearchResultsI sr = new SearchResults();
195 BitSet bs = new BitSet();
197 SearchResultMatchI srm = null;
198 srm = sr.addResult(seq1, 1, 1);
199 Assert.assertNotNull("addResult didn't return Match", srm);
200 srm = sr.addResult(seq2, 1, 2);
201 assertEquals("Sequence reference not set", seq2, srm.getSequence());
202 assertEquals("match start incorrect", 1, srm.getStart());
203 assertEquals("match end incorrect", 2, srm.getEnd());
205 // set start/end range for groups to cover matches
211 sallg.setStartRes(0);
217 marked = sr.markColumns(s1g, bs);
218 // check the bitset cardinality before checking the return value
219 assertEquals("Didn't mark expected number", 1, bs.cardinality());
220 assertEquals("Didn't return count of number of bits marked", 1, marked);
221 assertTrue("Didn't mark expected position", bs.get(0));
222 // now check return value for marking the same again
224 "Didn't count number of bits marked for existing marked set",
226 sr.markColumns(s1g, bs));
232 marked = sr.markColumns(s2g, bs);
233 assertEquals("Didn't mark expected number", 2, bs.cardinality());
234 assertEquals("Didn't return count of number of bits marked", 2, marked);
235 assertTrue("Didn't mark expected position (1)", bs.get(0));
236 assertTrue("Didn't mark expected position (2)", bs.get(1));
240 * should be same as seq2
242 BitSet allbs = new BitSet();
243 assertEquals(2, sr.markColumns(sallg, allbs));
244 assertEquals(bs, allbs);
246 // now check range selection
249 * limit s2g to just the second column, sallg to the first column
254 BitSet tbs = new BitSet();
255 assertEquals("Group start/end didn't select columns to mark",1, sr.markColumns(s2g, tbs));
256 assertEquals("Group start/end didn't select columns to mark", 1, sr.markColumns(sallg, tbs));
258 "Didn't set expected number of columns in total for two successive marks",
259 2, tbs.cardinality());