1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
/*
* BioJava development code
*
* This code may be freely distributed and modified under the
* terms of the GNU Lesser General Public Licence. This should
* be distributed with the code. If you do not have a copy,
* see:
*
* http://www.gnu.org/copyleft/lesser.html
*
* Copyright for this code is held jointly by the individual
* authors. These should be listed in @author doc comments.
*
* For more information on the BioJava project and its aims,
* or to join the biojava-l mailing list, visit the home page
* at:
*
* http://www.biojava.org/
*
*/
package org.biojava.bio.symbol;
import junit.framework.TestCase;
/**
* Tests IntegerAlphabet to make sure we can get it, that it is
* canonical, that symbols it returns are canonical, that finite
* ranges are canonical and that symbols in finite ranges are
* canonical.
*
* @since 1.2
*/
public class IntegerAlphabetTest extends TestCase
{
public IntegerAlphabetTest(String name) {
super(name);
}
public void testCanonicalAlphabet() {
assertEquals(
AlphabetManager.alphabetForName("INTEGER"),
IntegerAlphabet.getInstance()
);
assertEquals(
IntegerAlphabet.getInstance(),
IntegerAlphabet.getInstance()
);
}
public void testCanonicalSymbols() {
Symbol[] syms = new Symbol[10];
for(int i = 0; i < syms.length; i++) {
syms[i] = IntegerAlphabet.getInstance().getSymbol(i);
}
for(int i = 0; i < syms.length; i++) {
assertEquals(
syms[i],
IntegerAlphabet.getInstance().getSymbol(i)
);
}
}
public void testCanonicalSubAlphabet() {
int min = 200;
int max = 300;
Alphabet a1 = IntegerAlphabet.getSubAlphabet(min, max);
Alphabet a2 = IntegerAlphabet.getSubAlphabet(min, max);
assertEquals(a1, a2);
}
public void testSubAlphabetSymbolsCanonical()
throws IllegalSymbolException {
int min = 400;
int max = 500;
IntegerAlphabet alpha = IntegerAlphabet.getInstance();
IntegerAlphabet.SubIntegerAlphabet a1 = IntegerAlphabet.getSubAlphabet(min, max);
for(int i = min; i <= max; i++) {
assertEquals(
a1.getSymbol(i),
a1.getSymbol(i)
);
assertEquals(
a1.getSymbol(i),
alpha.getSymbol(i)
);
}
}
}
|
