for (int i = 0; i <= 255; i++)
{
boolean isClosingChar = Rna.isClosingParenthesis((char) i);
- boolean isClosingString = Rna.isClosingParenthesis(String
- .valueOf((char) i));
+ boolean isClosingString = Rna
+ .isClosingParenthesis(String.valueOf((char) i));
if ((i >= 'a' && i <= 'z') || i == ')' || i == '}' || i == ']'
|| i == '>')
{
else
{
assertFalse(String.format("close base pair %c", i), isClosingChar);
- assertFalse(String.format("close base pair %c", i), isClosingString);
+ assertFalse(String.format("close base pair %c", i),
+ isClosingString);
}
assertFalse(Rna.isClosingParenthesis(String.valueOf((char) i) + " "));
}
for (int i = 0; i <= 255; i++)
{
boolean isOpeningChar = Rna.isOpeningParenthesis((char) i);
- boolean isOpeningString = Rna.isOpeningParenthesis(String
- .valueOf((char) i));
+ boolean isOpeningString = Rna
+ .isOpeningParenthesis(String.valueOf((char) i));
if ((i >= 'A' && i <= 'Z') || i == '(' || i == '{' || i == '['
|| i == '<')
{
for (int i = 0; i <= 255; i++)
{
boolean isValidChar = Rna.isRnaSecondaryStructureSymbol((char) i);
- boolean isValidString = Rna.isRnaSecondaryStructureSymbol(String
- .valueOf((char) i));
+ boolean isValidString = Rna
+ .isRnaSecondaryStructureSymbol(String.valueOf((char) i));
if ((i >= 'A' && i <= 'Z') || (i >= 'a' && i <= 'z') || i == '('
|| i == ')' || i == '{' || i == '}' || i == '[' || i == ']'
|| i == '<' || i == '>')
assertFalse(String.format("close base pair %c", i), isValidChar);
assertFalse(String.format("close base pair %c", i), isValidString);
}
- assertFalse(Rna.isRnaSecondaryStructureSymbol(String
- .valueOf((char) i) + " "));
+ assertFalse(Rna.isRnaSecondaryStructureSymbol(
+ String.valueOf((char) i) + " "));
}
}
String rna = ".([.)]..{.<}.>";
SequenceFeature[] sfs = Rna.getHelixMap(rna);
assertEquals(4, sfs.length);
-
+
/*
* pairs are added in the order in which the closing bracket is found
* (see testGetSimpleBPs)