[1648] | 1 | package de.ugoe.cs.autoquest.tasktrees.alignment.algorithms; |
---|
| 2 | |
---|
| 3 | import static org.junit.Assert.*; |
---|
| 4 | |
---|
| 5 | import org.junit.Test; |
---|
| 6 | |
---|
| 7 | public class NumberSequenceTest { |
---|
| 8 | |
---|
| 9 | @Test |
---|
| 10 | public void testContainsPattern() { |
---|
| 11 | int[] seq = new int[10]; |
---|
| 12 | for (int i=0; i<10; i++) { |
---|
| 13 | seq[i] = i; |
---|
| 14 | } |
---|
| 15 | |
---|
| 16 | int[] pat1 = new int[]{2,3,4}; |
---|
| 17 | int[] pat2 = new int[]{2,3,4}; |
---|
| 18 | |
---|
| 19 | int[] pat3 = new int[]{5,-1,7}; |
---|
| 20 | int[] pat4 = new int[]{1,2,3}; |
---|
| 21 | |
---|
| 22 | int[] pat5 = new int[]{-1,-1,-1}; |
---|
| 23 | int[] pat6 = new int[]{10,11,12}; |
---|
| 24 | |
---|
| 25 | |
---|
| 26 | NumberSequence ns = new NumberSequence(10); |
---|
| 27 | ns.setSequence(seq); |
---|
| 28 | |
---|
| 29 | NumberSequence firstpattern = new NumberSequence(3); |
---|
| 30 | NumberSequence secondpattern = new NumberSequence(3); |
---|
| 31 | firstpattern.setSequence(pat1); |
---|
| 32 | secondpattern.setSequence(pat2); |
---|
| 33 | |
---|
| 34 | Match pattern = new Match(); |
---|
| 35 | pattern.setFirstSequence(firstpattern); |
---|
| 36 | pattern.setSecondSequence(secondpattern); |
---|
| 37 | |
---|
| 38 | assertEquals(Integer.valueOf(2),ns.containsPattern(pattern).get(0)); |
---|
| 39 | |
---|
| 40 | firstpattern.setSequence(pat3); |
---|
| 41 | secondpattern.setSequence(pat4); |
---|
| 42 | |
---|
| 43 | assertEquals(Integer.valueOf(1),ns.containsPattern(pattern).get(0)); |
---|
| 44 | assertEquals(Integer.valueOf(5),ns.containsPattern(pattern).get(1)); |
---|
| 45 | |
---|
| 46 | firstpattern.setSequence(pat5); |
---|
| 47 | secondpattern.setSequence(pat5); |
---|
| 48 | |
---|
| 49 | assertEquals(0,ns.containsPattern(pattern).size()); |
---|
| 50 | |
---|
| 51 | firstpattern.setSequence(pat6); |
---|
| 52 | secondpattern.setSequence(pat6); |
---|
| 53 | |
---|
| 54 | assertEquals(0,ns.containsPattern(pattern).size()); |
---|
| 55 | } |
---|
| 56 | |
---|
| 57 | @Test |
---|
| 58 | public void testEventCount() { |
---|
| 59 | int[] seq = new int[10]; |
---|
| 60 | for (int i=0; i<10; i++) { |
---|
| 61 | seq[i] = i; |
---|
| 62 | } |
---|
| 63 | NumberSequence ns = new NumberSequence(10); |
---|
| 64 | ns.setSequence(seq); |
---|
| 65 | |
---|
| 66 | int[] pat2 = new int[]{-1,-1,-1}; |
---|
| 67 | int[] pat3 = new int[]{0,1,2,3,0,2}; |
---|
| 68 | |
---|
| 69 | assertEquals(1,ns.eventCount(5)); |
---|
| 70 | |
---|
| 71 | ns.setSequence(pat2); |
---|
| 72 | assertEquals(3,ns.eventCount(-1)); |
---|
| 73 | |
---|
| 74 | ns.setSequence(pat3); |
---|
| 75 | assertEquals(2,ns.eventCount(0)); |
---|
| 76 | assertEquals(2,ns.eventCount(2)); |
---|
| 77 | assertEquals(0,ns.eventCount(5)); |
---|
| 78 | } |
---|
| 79 | |
---|
| 80 | @Test |
---|
| 81 | public void testEqualsNumberSequence() { |
---|
| 82 | int[] seq1 = new int[10]; |
---|
| 83 | for (int i=0; i<10; i++) { |
---|
| 84 | seq1[i] = i; |
---|
| 85 | } |
---|
| 86 | NumberSequence ns1 = new NumberSequence(10); |
---|
| 87 | ns1.setSequence(seq1); |
---|
| 88 | |
---|
| 89 | int[] seq2 = new int[10]; |
---|
| 90 | for (int i=0; i<10; i++) { |
---|
| 91 | seq2[i] = i; |
---|
| 92 | } |
---|
| 93 | NumberSequence ns2 = new NumberSequence(10); |
---|
| 94 | ns2.setSequence(seq2); |
---|
| 95 | |
---|
| 96 | int[] seq3 = new int[10]; |
---|
| 97 | for (int i=0; i<10; i++) { |
---|
| 98 | seq3[i] = 2*i; |
---|
| 99 | } |
---|
| 100 | NumberSequence ns3 = new NumberSequence(10); |
---|
| 101 | ns3.setSequence(seq3); |
---|
| 102 | |
---|
| 103 | assertTrue(ns1.equals(ns2)); |
---|
| 104 | assertFalse(ns1.equals(ns3)); |
---|
| 105 | assertFalse(ns2.equals(ns3)); |
---|
| 106 | |
---|
| 107 | } |
---|
| 108 | |
---|
| 109 | } |
---|