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.
23 import static org.testng.AssertJUnit.assertEquals;
24 import static org.testng.AssertJUnit.assertFalse;
25 import static org.testng.AssertJUnit.assertNull;
26 import static org.testng.AssertJUnit.assertSame;
27 import static org.testng.AssertJUnit.assertTrue;
28 import static org.testng.internal.junit.ArrayAsserts.assertArrayEquals;
30 import jalview.gui.JvOptionPane;
32 import java.util.ArrayList;
33 import java.util.Arrays;
34 import java.util.List;
36 import org.testng.annotations.BeforeClass;
37 import org.testng.annotations.Test;
39 public class MapListTest
42 @BeforeClass(alwaysRun = true)
43 public void setUpJvOptionPane()
45 JvOptionPane.setInteractiveMode(false);
46 JvOptionPane.setMockResponse(JvOptionPane.CANCEL_OPTION);
49 @Test(groups = { "Functional" })
50 public void testSomething()
52 MapList ml = new MapList(new int[] { 1, 5, 10, 15, 25, 20 }, new int[] {
54 MapList ml1 = new MapList(new int[] { 1, 3, 17, 4 },
55 new int[] { 51, 1 }, 1, 3);
56 MapList ml2 = new MapList(new int[] { 1, 60 }, new int[] { 1, 20 }, 3,
58 // test internal consistency
59 int to[] = new int[51];
61 MapList mldna = new MapList(new int[] { 2, 2, 6, 8, 12, 16 }, new int[]
63 int[] frm = mldna.locateInFrom(1, 1);
64 testLocateFrom(mldna, 1, 1, new int[] { 2, 2, 6, 7 });
67 * for (int from=1; from<=51; from++) { int[] too=ml.shiftTo(from); int[]
68 * toofrom=ml.shiftFrom(too[0]);
69 * System.out.println("ShiftFrom("+from+")=="+too[0]+" %
70 * "+too[1]+"\t+-+\tShiftTo("+too[0]+")=="+toofrom[0]+" % "+toofrom[1]); }
74 private static void testLocateFrom(MapList mldna, int i, int j, int[] ks)
76 int[] frm = mldna.locateInFrom(i, j);
77 assertEquals("Failed test locate from " + i + " to " + j,
78 Arrays.toString(frm), Arrays.toString(ks));
82 * test routine. not incremental.
88 private void testMap(MapList ml, int fromS, int fromE)
90 // todo convert to JUnit style tests
91 for (int from = 1; from <= 25; from++)
93 int[] too = ml.shiftFrom(from);
94 System.out.print("ShiftFrom(" + from + ")==");
97 System.out.print("NaN\n");
101 System.out.print(too[0] + " % " + too[1] + " (" + too[2] + ")");
102 System.out.print("\t+--+\t");
103 int[] toofrom = ml.shiftTo(too[0]);
106 if (toofrom[0] != from)
108 System.err.println("Mapping not reflexive:" + from + " "
109 + too[0] + "->" + toofrom[0]);
111 System.out.println("ShiftTo(" + too[0] + ")==" + toofrom[0]
112 + " % " + toofrom[1] + " (" + toofrom[2] + ")");
116 System.out.println("ShiftTo(" + too[0] + ")=="
117 + "NaN! - not Bijective Mapping!");
121 int mmap[][] = ml.makeFromMap();
122 System.out.println("FromMap : (" + mmap[0][0] + " " + mmap[0][1] + " "
123 + mmap[0][2] + " " + mmap[0][3] + " ");
124 for (int i = 1; i <= mmap[1].length; i++)
126 if (mmap[1][i - 1] == -1)
128 System.out.print(i + "=XXX");
133 System.out.print(i + "=" + (mmap[0][2] + mmap[1][i - 1]));
137 System.out.print("\n");
141 System.out.print(",");
144 // test range function
145 System.out.print("\nTest locateInFrom\n");
147 int f = mmap[0][2], t = mmap[0][3];
150 System.out.println("Range " + f + " to " + t);
151 int rng[] = ml.locateInFrom(f, t);
154 for (int i = 0; i < rng.length; i++)
156 System.out.print(rng[i] + ((i % 2 == 0) ? "," : ";"));
161 System.out.println("No range!");
163 System.out.print("\nReversed\n");
164 rng = ml.locateInFrom(t, f);
167 for (int i = 0; i < rng.length; i++)
169 System.out.print(rng[i] + ((i % 2 == 0) ? "," : ";"));
174 System.out.println("No range!");
176 System.out.print("\n");
181 System.out.print("\n");
182 mmap = ml.makeToMap();
183 System.out.println("ToMap : (" + mmap[0][0] + " " + mmap[0][1] + " "
184 + mmap[0][2] + " " + mmap[0][3] + " ");
185 for (int i = 1; i <= mmap[1].length; i++)
187 if (mmap[1][i - 1] == -1)
189 System.out.print(i + "=XXX");
194 System.out.print(i + "=" + (mmap[0][2] + mmap[1][i - 1]));
198 System.out.print("\n");
202 System.out.print(",");
205 System.out.print("\n");
206 // test range function
207 System.out.print("\nTest locateInTo\n");
209 int f = mmap[0][2], t = mmap[0][3];
212 System.out.println("Range " + f + " to " + t);
213 int rng[] = ml.locateInTo(f, t);
216 for (int i = 0; i < rng.length; i++)
218 System.out.print(rng[i] + ((i % 2 == 0) ? "," : ";"));
223 System.out.println("No range!");
225 System.out.print("\nReversed\n");
226 rng = ml.locateInTo(t, f);
229 for (int i = 0; i < rng.length; i++)
231 System.out.print(rng[i] + ((i % 2 == 0) ? "," : ";"));
236 System.out.println("No range!");
240 System.out.print("\n");
246 * Tests for method that locates ranges in the 'from' map for given range in
249 @Test(groups = { "Functional" })
250 public void testLocateInFrom_noIntrons()
253 * Simple mapping with no introns
255 int[] codons = new int[] { 1, 12 };
256 int[] protein = new int[] { 1, 4 };
257 MapList ml = new MapList(codons, protein, 3, 1);
258 assertEquals("[1, 3]", Arrays.toString(ml.locateInFrom(1, 1)));
259 assertEquals("[4, 6]", Arrays.toString(ml.locateInFrom(2, 2)));
260 assertEquals("[7, 9]", Arrays.toString(ml.locateInFrom(3, 3)));
261 assertEquals("[10, 12]", Arrays.toString(ml.locateInFrom(4, 4)));
262 assertEquals("[1, 6]", Arrays.toString(ml.locateInFrom(1, 2)));
263 assertEquals("[1, 9]", Arrays.toString(ml.locateInFrom(1, 3)));
264 assertEquals("[1, 12]", Arrays.toString(ml.locateInFrom(1, 4)));
265 assertEquals("[4, 9]", Arrays.toString(ml.locateInFrom(2, 3)));
266 assertEquals("[4, 12]", Arrays.toString(ml.locateInFrom(2, 4)));
267 assertEquals("[7, 12]", Arrays.toString(ml.locateInFrom(3, 4)));
268 assertEquals("[10, 12]", Arrays.toString(ml.locateInFrom(4, 4)));
270 assertNull(ml.locateInFrom(0, 0));
271 assertNull(ml.locateInFrom(1, 5));
272 assertNull(ml.locateInFrom(-1, 1));
276 * Tests for method that locates ranges in the 'from' map for given range in
279 @Test(groups = { "Functional" })
280 public void testLocateInFrom_withIntrons()
283 * Exons at positions [2, 3, 5] [6, 7, 9] [10, 12, 14] [16, 17, 18] i.e.
284 * 2-3, 5-7, 9-10, 12-12, 14-14, 16-18
286 int[] codons = { 2, 3, 5, 7, 9, 10, 12, 12, 14, 14, 16, 18 };
287 int[] protein = { 1, 4 };
288 MapList ml = new MapList(codons, protein, 3, 1);
289 assertEquals("[2, 3, 5, 5]", Arrays.toString(ml.locateInFrom(1, 1)));
290 assertEquals("[6, 7, 9, 9]", Arrays.toString(ml.locateInFrom(2, 2)));
291 assertEquals("[10, 10, 12, 12, 14, 14]",
292 Arrays.toString(ml.locateInFrom(3, 3)));
293 assertEquals("[16, 18]", Arrays.toString(ml.locateInFrom(4, 4)));
297 * Tests for method that locates ranges in the 'to' map for given range in the
300 @Test(groups = { "Functional" })
301 public void testLocateInTo_noIntrons()
304 * Simple mapping with no introns
306 int[] codons = new int[] { 1, 12 };
307 int[] protein = new int[] { 1, 4 };
308 MapList ml = new MapList(codons, protein, 3, 1);
309 assertEquals("[1, 1]", Arrays.toString(ml.locateInTo(1, 3)));
310 assertEquals("[2, 2]", Arrays.toString(ml.locateInTo(4, 6)));
311 assertEquals("[3, 3]", Arrays.toString(ml.locateInTo(7, 9)));
312 assertEquals("[4, 4]", Arrays.toString(ml.locateInTo(10, 12)));
313 assertEquals("[1, 2]", Arrays.toString(ml.locateInTo(1, 6)));
314 assertEquals("[1, 3]", Arrays.toString(ml.locateInTo(1, 9)));
315 assertEquals("[1, 4]", Arrays.toString(ml.locateInTo(1, 12)));
316 assertEquals("[2, 2]", Arrays.toString(ml.locateInTo(4, 6)));
317 assertEquals("[2, 4]", Arrays.toString(ml.locateInTo(4, 12)));
320 * A part codon is treated as if a whole one.
322 assertEquals("[1, 1]", Arrays.toString(ml.locateInTo(1, 1)));
323 assertEquals("[1, 1]", Arrays.toString(ml.locateInTo(1, 2)));
324 assertEquals("[1, 2]", Arrays.toString(ml.locateInTo(1, 4)));
325 assertEquals("[1, 3]", Arrays.toString(ml.locateInTo(2, 8)));
326 assertEquals("[1, 4]", Arrays.toString(ml.locateInTo(3, 11)));
327 assertEquals("[2, 4]", Arrays.toString(ml.locateInTo(5, 11)));
329 assertNull(ml.locateInTo(0, 0));
330 assertNull(ml.locateInTo(1, 13));
331 assertNull(ml.locateInTo(-1, 1));
335 * Tests for method that locates ranges in the 'to' map for given range in the
338 @Test(groups = { "Functional" })
339 public void testLocateInTo_withIntrons()
342 * Exons at positions [2, 3, 5] [6, 7, 9] [10, 12, 14] [16, 17, 18] i.e.
343 * 2-3, 5-7, 9-10, 12-12, 14-14, 16-18
345 int[] codons = { 2, 3, 5, 7, 9, 10, 12, 12, 14, 14, 16, 18 };
347 * Mapped proteins at positions 1, 3, 4, 6 in the sequence
349 int[] protein = { 1, 1, 3, 4, 6, 6 };
350 MapList ml = new MapList(codons, protein, 3, 1);
353 * Can't map from an unmapped position
355 assertNull(ml.locateInTo(1, 2));
356 assertNull(ml.locateInTo(2, 4));
357 assertNull(ml.locateInTo(4, 4));
360 * Valid range or subrange of codon1 maps to protein1.
362 assertEquals("[1, 1]", Arrays.toString(ml.locateInTo(2, 2)));
363 assertEquals("[1, 1]", Arrays.toString(ml.locateInTo(3, 3)));
364 assertEquals("[1, 1]", Arrays.toString(ml.locateInTo(3, 5)));
365 assertEquals("[1, 1]", Arrays.toString(ml.locateInTo(2, 3)));
366 assertEquals("[1, 1]", Arrays.toString(ml.locateInTo(2, 5)));
368 // codon position 6 starts the next protein:
369 assertEquals("[1, 1, 3, 3]", Arrays.toString(ml.locateInTo(3, 6)));
371 // codon positions 7 to 17 (part) cover proteins 2/3/4 at positions 3/4/6
372 assertEquals("[3, 4, 6, 6]", Arrays.toString(ml.locateInTo(7, 17)));
377 * Test equals method.
379 @Test(groups = { "Functional" })
380 public void testEquals()
382 int[] codons = new int[] { 2, 3, 5, 7, 9, 10, 12, 12, 14, 14, 16, 18 };
383 int[] protein = new int[] { 1, 4 };
384 MapList ml = new MapList(codons, protein, 3, 1);
385 MapList ml1 = new MapList(codons, protein, 3, 1); // same values
386 MapList ml2 = new MapList(codons, protein, 2, 1); // fromRatio differs
387 MapList ml3 = new MapList(codons, protein, 3, 2); // toRatio differs
389 MapList ml6 = new MapList(codons, protein, 3, 1); // fromShifts differ
391 MapList ml7 = new MapList(codons, protein, 3, 1); // toShifts differ
393 assertTrue(ml.equals(ml));
394 assertTrue(ml.equals(ml1));
395 assertTrue(ml1.equals(ml));
397 assertFalse(ml.equals(null));
398 assertFalse(ml.equals("hello"));
399 assertFalse(ml.equals(ml2));
400 assertFalse(ml.equals(ml3));
401 assertFalse(ml.equals(ml6));
402 assertFalse(ml.equals(ml7));
403 assertFalse(ml6.equals(ml7));
407 MapList ml4 = new MapList(codons, null, 3, 1); // toShifts null
408 assertFalse(ml.equals(ml4));
409 } catch (NullPointerException e)
411 // actually thrown by constructor before equals can be called
415 MapList ml5 = new MapList(null, protein, 3, 1); // fromShifts null
416 assertFalse(ml.equals(ml5));
417 } catch (NullPointerException e)
419 // actually thrown by constructor before equals can be called
424 * Test for the method that flattens a list of ranges into a single array.
426 @Test(groups = { "Functional" })
427 public void testGetRanges()
429 List<int[]> ranges = new ArrayList<>();
430 ranges.add(new int[] { 2, 3 });
431 ranges.add(new int[] { 5, 6 });
432 assertEquals("[2, 3, 5, 6]", Arrays.toString(MapList.getRanges(ranges)));
436 * Check state after construction
438 @Test(groups = { "Functional" })
439 public void testConstructor()
441 int[] codons = { 2, 3, 5, 7, 9, 10, 12, 12, 14, 14, 16, 18 };
442 int[] protein = { 1, 1, 3, 4, 6, 6 };
443 MapList ml = new MapList(codons, protein, 3, 1);
444 assertEquals(3, ml.getFromRatio());
445 assertEquals(2, ml.getFromLowest());
446 assertEquals(18, ml.getFromHighest());
447 assertEquals(1, ml.getToLowest());
448 assertEquals(6, ml.getToHighest());
449 assertEquals("{[2, 3], [5, 7], [9, 10], [12, 12], [14, 14], [16, 18]}",
450 prettyPrint(ml.getFromRanges()));
451 assertEquals("{[1, 1], [3, 4], [6, 6]}", prettyPrint(ml.getToRanges()));
454 * Also copy constructor
456 MapList ml2 = new MapList(ml);
457 assertEquals(3, ml2.getFromRatio());
458 assertEquals(2, ml2.getFromLowest());
459 assertEquals(18, ml2.getFromHighest());
460 assertEquals(1, ml2.getToLowest());
461 assertEquals(6, ml2.getToHighest());
462 assertEquals("{[2, 3], [5, 7], [9, 10], [12, 12], [14, 14], [16, 18]}",
463 prettyPrint(ml2.getFromRanges()));
464 assertEquals("{[1, 1], [3, 4], [6, 6]}", prettyPrint(ml2.getToRanges()));
469 codons = new int[] { 9, 6 };
470 protein = new int[] { 100, 91, 80, 79 };
471 ml = new MapList(codons, protein, 3, 1);
472 assertEquals(6, ml.getFromLowest());
473 assertEquals(9, ml.getFromHighest());
474 assertEquals(79, ml.getToLowest());
475 assertEquals(100, ml.getToHighest());
479 * Test constructor can merge consecutive ranges
481 @Test(groups = { "Functional" })
482 public void testConstructor_mergeRanges()
484 int[] codons = { 2, 3, 3, 7, 9, 10, 12, 12, 14, 14, 16, 17 };
485 int[] protein = { 1, 1, 1, 3, 6, 6 };
486 MapList ml = new MapList(codons, protein, 3, 1);
487 assertEquals(3, ml.getFromRatio());
488 assertEquals(2, ml.getFromLowest());
489 assertEquals(17, ml.getFromHighest());
490 assertEquals(1, ml.getToLowest());
491 assertEquals(6, ml.getToHighest());
492 assertEquals("{[2, 7], [9, 10], [12, 12], [14, 14], [16, 17]}",
493 prettyPrint(ml.getFromRanges()));
494 assertEquals("{[1, 3], [6, 6]}", prettyPrint(ml.getToRanges()));
498 * Convert a List of {[i, j], [k, l], ...} to "[[i, j], [k, l], ...]"
503 private String prettyPrint(List<int[]> ranges)
505 StringBuilder sb = new StringBuilder(ranges.size() * 5);
506 boolean first = true;
508 for (int[] range : ranges)
514 sb.append(Arrays.toString(range));
518 return sb.toString();
522 * Test the method that creates an inverse mapping
524 @Test(groups = { "Functional" })
525 public void testGetInverse()
527 int[] codons = { 2, 3, 5, 7, 9, 10, 12, 12, 14, 14, 16, 18 };
528 int[] protein = { 1, 1, 3, 4, 6, 6 };
530 MapList ml = new MapList(codons, protein, 3, 1);
531 MapList ml2 = ml.getInverse();
532 assertEquals(ml.getFromRatio(), ml2.getToRatio());
533 assertEquals(ml.getFromRatio(), ml2.getToRatio());
534 assertEquals(ml.getToHighest(), ml2.getFromHighest());
535 assertEquals(ml.getFromHighest(), ml2.getToHighest());
536 assertEquals(prettyPrint(ml.getFromRanges()),
537 prettyPrint(ml2.getToRanges()));
538 assertEquals(prettyPrint(ml.getToRanges()),
539 prettyPrint(ml2.getFromRanges()));
542 @Test(groups = { "Functional" })
543 public void testToString()
545 MapList ml = new MapList(new int[] { 1, 5, 10, 15, 25, 20 }, new int[] {
547 String s = ml.toString();
548 assertEquals("[ [1, 5] [10, 15] [25, 20] ] 1:3 to [ [51, 1] ]", s);
551 @Test(groups = { "Functional" })
552 public void testAddMapList()
554 MapList ml = new MapList(new int[] { 11, 15, 20, 25, 35, 30 },
555 new int[] { 72, 22 }, 1, 3);
556 assertEquals(11, ml.getFromLowest());
557 assertEquals(35, ml.getFromHighest());
558 assertEquals(22, ml.getToLowest());
559 assertEquals(72, ml.getToHighest());
561 MapList ml2 = new MapList(new int[] { 2, 4, 37, 40 }, new int[] { 12,
562 17, 78, 83, 88, 96 }, 1, 3);
564 assertEquals(2, ml.getFromLowest());
565 assertEquals(40, ml.getFromHighest());
566 assertEquals(12, ml.getToLowest());
567 assertEquals(96, ml.getToHighest());
569 String s = ml.toString();
571 "[ [11, 15] [20, 25] [35, 30] [2, 4] [37, 40] ] 1:3 to [ [72, 22] [12, 17] [78, 83] [88, 96] ]",
576 * Test that confirms adding a map twice does nothing
578 @Test(groups = { "Functional" })
579 public void testAddMapList_sameMap()
581 MapList ml = new MapList(new int[] { 11, 15, 20, 25, 35, 30 },
582 new int[] { 72, 22 }, 1, 3);
583 String before = ml.toString();
585 assertEquals(before, ml.toString());
586 ml.addMapList(new MapList(ml));
587 assertEquals(before, ml.toString());
590 @Test(groups = { "Functional" })
591 public void testAddMapList_contiguous()
593 MapList ml = new MapList(new int[] { 11, 15 }, new int[] { 72, 58 }, 1,
596 MapList ml2 = new MapList(new int[] { 15, 16 }, new int[] { 58, 53 },
599 assertEquals("[ [11, 16] ] 1:3 to [ [72, 53] ]", ml.toString());
603 * Check state after construction
605 @Test(groups = { "Functional" })
606 public void testConstructor_withLists()
611 int[][] codons = new int[][] { { 9, 6 } };
612 int[][] protein = new int[][] { { 100, 91 }, { 80, 79 } };
613 MapList ml = new MapList(Arrays.asList(codons), Arrays.asList(protein),
615 assertEquals(6, ml.getFromLowest());
616 assertEquals(9, ml.getFromHighest());
617 assertEquals(79, ml.getToLowest());
618 assertEquals(100, ml.getToHighest());
622 * Test that method that inspects for the (first) forward or reverse from
623 * range. Single position ranges are ignored.
625 @Test(groups = { "Functional" })
626 public void testIsFromForwardStrand()
628 // [3-9] declares forward strand
629 MapList ml = new MapList(new int[] { 2, 2, 3, 9, 12, 11 }, new int[] {
631 assertTrue(ml.isFromForwardStrand());
633 // [11-5] declares reverse strand ([13-14] is ignored)
634 ml = new MapList(new int[] { 2, 2, 11, 5, 13, 14 },
635 new int[] { 20, 11 }, 1, 1);
636 assertFalse(ml.isFromForwardStrand());
638 // all single position ranges - defaults to forward strand
639 ml = new MapList(new int[] { 2, 2, 4, 4, 6, 6 }, new int[] { 3, 1 }, 1,
641 assertTrue(ml.isFromForwardStrand());
645 * Test the method that merges a list of ranges where possible
647 @Test(groups = { "Functional" })
648 public void testCoalesceRanges()
650 assertNull(MapList.coalesceRanges(null));
651 List<int[]> ranges = new ArrayList<>();
652 assertSame(ranges, MapList.coalesceRanges(ranges));
653 ranges.add(new int[] { 1, 3 });
654 assertSame(ranges, MapList.coalesceRanges(ranges));
656 // add non-contiguous range:
657 ranges.add(new int[] { 5, 6 });
658 assertSame(ranges, MapList.coalesceRanges(ranges));
660 // 'contiguous' range in opposite direction is not merged:
661 ranges.add(new int[] { 7, 6 });
662 assertSame(ranges, MapList.coalesceRanges(ranges));
664 // merging in forward direction:
666 ranges.add(new int[] { 1, 3 });
667 ranges.add(new int[] { 4, 5 });
668 ranges.add(new int[] { 5, 5 });
669 ranges.add(new int[] { 5, 7 });
670 List<int[]> merged = MapList.coalesceRanges(ranges);
671 assertEquals(1, merged.size());
672 assertArrayEquals(new int[] { 1, 7 }, merged.get(0));
673 // verify input list is unchanged
674 assertEquals(4, ranges.size());
675 assertArrayEquals(new int[] { 1, 3 }, ranges.get(0));
676 assertArrayEquals(new int[] { 4, 5 }, ranges.get(1));
677 assertArrayEquals(new int[] { 5, 5 }, ranges.get(2));
678 assertArrayEquals(new int[] { 5, 7 }, ranges.get(3));
680 // merging in reverse direction:
682 ranges.add(new int[] { 7, 5 });
683 ranges.add(new int[] { 5, 4 });
684 ranges.add(new int[] { 4, 4 });
685 ranges.add(new int[] { 3, 1 });
686 merged = MapList.coalesceRanges(ranges);
687 assertEquals(1, merged.size());
688 assertArrayEquals(new int[] { 7, 1 }, merged.get(0));
690 // merging with switches of direction:
692 ranges.add(new int[] { 1, 3 });
693 ranges.add(new int[] { 4, 5 });
694 ranges.add(new int[] { 5, 5 });
695 ranges.add(new int[] { 6, 6 });
696 ranges.add(new int[] { 12, 10 });
697 ranges.add(new int[] { 9, 8 });
698 ranges.add(new int[] { 8, 8 });
699 ranges.add(new int[] { 7, 7 });
700 merged = MapList.coalesceRanges(ranges);
701 assertEquals(2, merged.size());
702 assertArrayEquals(new int[] { 1, 6 }, merged.get(0));
703 assertArrayEquals(new int[] { 12, 7 }, merged.get(1));
707 * Test the method that merges a list of ranges where possible
709 @Test(groups = { "Functional" })
710 public void testCoalesceRanges_withOverlap()
712 List<int[]> ranges = new ArrayList<>();
713 ranges.add(new int[] { 1, 3 });
714 ranges.add(new int[] { 2, 5 });
717 * [2, 5] should extend [1, 3]
719 List<int[]> merged = MapList.coalesceRanges(ranges);
720 assertEquals(1, merged.size());
721 assertArrayEquals(new int[] { 1, 5 }, merged.get(0));
724 * a subsumed interval should be dropped
727 ranges.add(new int[] { 1, 6 });
728 ranges.add(new int[] { 2, 4 });
729 merged = MapList.coalesceRanges(ranges);
730 assertEquals(1, merged.size());
731 assertArrayEquals(new int[] { 1, 6 }, merged.get(0));
734 ranges.add(new int[] { 1, 5 });
735 ranges.add(new int[] { 1, 6 });
736 merged = MapList.coalesceRanges(ranges);
737 assertEquals(1, merged.size());
738 assertArrayEquals(new int[] { 1, 6 }, merged.get(0));
741 * merge duplicate ranges
744 ranges.add(new int[] { 1, 3 });
745 ranges.add(new int[] { 1, 3 });
746 merged = MapList.coalesceRanges(ranges);
747 assertEquals(1, merged.size());
748 assertArrayEquals(new int[] { 1, 3 }, merged.get(0));
754 ranges.add(new int[] { 9, 5 });
755 ranges.add(new int[] { 9, 4 });
756 ranges.add(new int[] { 8, 3 });
757 ranges.add(new int[] { 3, 2 });
758 ranges.add(new int[] { 1, 0 });
759 merged = MapList.coalesceRanges(ranges);
760 assertEquals(1, merged.size());
761 assertArrayEquals(new int[] { 9, 0 }, merged.get(0));
765 * Test the method that compounds ('traverses') two mappings
767 @Test(groups = "Functional")
768 public void testTraverse()
771 * simple 1:1 plus 1:1 forwards
773 MapList ml1 = new MapList(new int[] { 3, 4, 8, 12 }, new int[] { 5, 8,
775 MapList ml2 = new MapList(new int[] { 1, 50 }, new int[] { 40, 45, 70,
776 75, 90, 127 }, 1, 1);
777 MapList compound = ml1.traverse(ml2);
779 assertEquals(compound.getFromRatio(), 1);
780 assertEquals(compound.getToRatio(), 1);
781 List<int[]> fromRanges = compound.getFromRanges();
782 assertEquals(fromRanges.size(), 2);
783 assertArrayEquals(new int[] { 3, 4 }, fromRanges.get(0));
784 assertArrayEquals(new int[] { 8, 12 }, fromRanges.get(1));
785 List<int[]> toRanges = compound.getToRanges();
786 assertEquals(toRanges.size(), 2);
787 // 5-8 maps to 44-45,70-71
788 // 11-13 maps to 74-75,90
789 assertArrayEquals(new int[] { 44, 45, 70, 71 }, toRanges.get(0));
790 assertArrayEquals(new int[] { 74, 75, 90, 90 }, toRanges.get(1));
793 * 1:1 over 1:1 backwards ('reverse strand')
795 ml1 = new MapList(new int[] { 1, 50 }, new int[] { 70, 119 }, 1, 1);
796 ml2 = new MapList(new int[] { 1, 500 },
797 new int[] { 1000, 901, 600, 201 }, 1, 1);
798 compound = ml1.traverse(ml2);
800 assertEquals(compound.getFromRatio(), 1);
801 assertEquals(compound.getToRatio(), 1);
802 fromRanges = compound.getFromRanges();
803 assertEquals(fromRanges.size(), 1);
804 assertArrayEquals(new int[] { 1, 50 }, fromRanges.get(0));
805 toRanges = compound.getToRanges();
806 assertEquals(toRanges.size(), 1);
807 assertArrayEquals(new int[] { 931, 901, 600, 582 }, toRanges.get(0));
810 * 1:1 plus 1:3 should result in 1:3
812 ml1 = new MapList(new int[] { 1, 30 }, new int[] { 11, 40 }, 1, 1);
813 ml2 = new MapList(new int[] { 1, 100 }, new int[] { 1, 50, 91, 340 },
815 compound = ml1.traverse(ml2);
817 assertEquals(compound.getFromRatio(), 1);
818 assertEquals(compound.getToRatio(), 3);
819 fromRanges = compound.getFromRanges();
820 assertEquals(fromRanges.size(), 1);
821 assertArrayEquals(new int[] { 1, 30 }, fromRanges.get(0));
822 // 11-40 maps to 31-50,91-160
823 toRanges = compound.getToRanges();
824 assertEquals(toRanges.size(), 1);
825 assertArrayEquals(new int[] { 31, 50, 91, 160 }, toRanges.get(0));
828 * 3:1 plus 1:1 should result in 3:1
830 ml1 = new MapList(new int[] { 1, 30 }, new int[] { 11, 20 }, 3, 1);
831 ml2 = new MapList(new int[] { 1, 100 }, new int[] { 1, 15, 91, 175 },
833 compound = ml1.traverse(ml2);
835 assertEquals(compound.getFromRatio(), 3);
836 assertEquals(compound.getToRatio(), 1);
837 fromRanges = compound.getFromRanges();
838 assertEquals(fromRanges.size(), 1);
839 assertArrayEquals(new int[] { 1, 30 }, fromRanges.get(0));
840 // 11-20 maps to 11-15, 91-95
841 toRanges = compound.getToRanges();
842 assertEquals(toRanges.size(), 1);
843 assertArrayEquals(new int[] { 11, 15, 91, 95 }, toRanges.get(0));
846 * 1:3 plus 3:1 should result in 1:1
848 ml1 = new MapList(new int[] { 21, 40 }, new int[] { 13, 72 }, 1, 3);
849 ml2 = new MapList(new int[] { 1, 300 }, new int[] { 51, 70, 121, 200 },
851 compound = ml1.traverse(ml2);
853 assertEquals(compound.getFromRatio(), 1);
854 assertEquals(compound.getToRatio(), 1);
855 fromRanges = compound.getFromRanges();
856 assertEquals(fromRanges.size(), 1);
857 assertArrayEquals(new int[] { 21, 40 }, fromRanges.get(0));
858 // 13-72 maps 3:1 to 55-70, 121-124
859 toRanges = compound.getToRanges();
860 assertEquals(toRanges.size(), 1);
861 assertArrayEquals(new int[] { 55, 70, 121, 124 }, toRanges.get(0));
864 * 3:1 plus 1:3 should result in 1:1
866 ml1 = new MapList(new int[] { 31, 90 }, new int[] { 13, 32 }, 3, 1);
867 ml2 = new MapList(new int[] { 11, 40 }, new int[] { 41, 50, 71, 150 },
869 compound = ml1.traverse(ml2);
871 assertEquals(compound.getFromRatio(), 1);
872 assertEquals(compound.getToRatio(), 1);
873 fromRanges = compound.getFromRanges();
874 assertEquals(fromRanges.size(), 1);
875 assertArrayEquals(new int[] { 31, 90 }, fromRanges.get(0));
876 // 13-32 maps to 47-50,71-126
877 toRanges = compound.getToRanges();
878 assertEquals(toRanges.size(), 1);
879 assertArrayEquals(new int[] { 47, 50, 71, 126 }, toRanges.get(0));
882 * method returns null if not all regions are mapped through
884 ml1 = new MapList(new int[] { 1, 50 }, new int[] { 101, 150 }, 1, 1);
885 ml2 = new MapList(new int[] { 131, 180 }, new int[] { 201, 250 }, 1, 3);
886 compound = ml1.traverse(ml2);
887 assertNull(compound);
891 * Test that method that inspects for the (first) forward or reverse 'to' range.
892 * Single position ranges are ignored.
894 @Test(groups = { "Functional" })
895 public void testIsToForwardsStrand()
897 // [3-9] declares forward strand
898 MapList ml = new MapList(new int[] { 20, 11 },
900 { 2, 2, 3, 9, 12, 11 }, 1, 1);
901 assertTrue(ml.isToForwardStrand());
903 // [11-5] declares reverse strand ([13-14] is ignored)
904 ml = new MapList(new int[] { 20, 11 },
906 { 2, 2, 11, 5, 13, 14 }, 1, 1);
907 assertFalse(ml.isToForwardStrand());
909 // all single position ranges - defaults to forward strand
910 ml = new MapList(new int[] { 3, 1 }, new int[] { 2, 2, 4, 4, 6, 6 }, 1,
912 assertTrue(ml.isToForwardStrand());