| 1 |
|
package jalview.ws2.actions.alignment; |
| 2 |
|
|
| 3 |
|
import java.util.ArrayList; |
| 4 |
|
import java.util.Collections; |
| 5 |
|
import java.util.LinkedHashMap; |
| 6 |
|
import java.util.List; |
| 7 |
|
import java.util.Map; |
| 8 |
|
|
| 9 |
|
import jalview.analysis.AlignSeq; |
| 10 |
|
import jalview.analysis.SeqsetUtils; |
| 11 |
|
import jalview.analysis.SeqsetUtils.SequenceInfo; |
| 12 |
|
import jalview.datamodel.AlignmentI; |
| 13 |
|
import jalview.datamodel.Sequence; |
| 14 |
|
import jalview.datamodel.SequenceI; |
| 15 |
|
import jalview.util.Comparison; |
| 16 |
|
import jalview.ws2.actions.BaseJob; |
| 17 |
|
import jalview.ws2.api.WebServiceJobHandle; |
| 18 |
|
|
| 19 |
|
|
| 20 |
|
|
| 21 |
|
|
| 22 |
|
@link |
| 23 |
|
@link |
| 24 |
|
|
| 25 |
|
@author |
| 26 |
|
|
| 27 |
|
|
| |
|
| 78.2% |
Uncovered Elements: 12 (55) |
Complexity: 16 |
Complexity Density: 0.48 |
|
| 28 |
|
class AlignmentJob extends BaseJob |
| 29 |
|
{ |
| 30 |
|
private final List<SequenceI> emptySeqs; |
| 31 |
|
|
| 32 |
|
private final Map<String, SequenceInfo> names; |
| 33 |
|
|
| 34 |
|
private AlignmentI alignmentResult; |
| 35 |
|
|
| |
|
| 100% |
Uncovered Elements: 0 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
|
| 36 |
26 |
AlignmentJob(List<SequenceI> inputSeqs, List<SequenceI> emptySeqs,... |
| 37 |
|
Map<String, SequenceInfo> names) |
| 38 |
|
{ |
| 39 |
26 |
super(Collections.unmodifiableList(inputSeqs)); |
| 40 |
26 |
this.emptySeqs = Collections.unmodifiableList(emptySeqs); |
| 41 |
26 |
this.names = Collections.unmodifiableMap(names); |
| 42 |
|
} |
| 43 |
|
|
| |
|
| 68.4% |
Uncovered Elements: 12 (38) |
Complexity: 9 |
Complexity Density: 0.38 |
|
| 44 |
26 |
public static AlignmentJob create(SequenceI[] seqs, int minlen, boolean keepGaps)... |
| 45 |
|
{ |
| 46 |
26 |
int nseqs = 0; |
| 47 |
104 |
for (int i = 0; i < seqs.length; i++) |
| 48 |
|
{ |
| 49 |
78 |
if (seqs[i].getEnd() - seqs[i].getStart() >= minlen) |
| 50 |
78 |
nseqs++; |
| 51 |
|
} |
| 52 |
26 |
boolean valid = nseqs > 1; |
| 53 |
26 |
Map<String, SequenceInfo> names = new LinkedHashMap<>(); |
| 54 |
26 |
List<SequenceI> inputSeqs = new ArrayList<>(); |
| 55 |
26 |
List<SequenceI> emptySeqs = new ArrayList<>(); |
| 56 |
104 |
for (int i = 0; i < seqs.length; i++) |
| 57 |
|
{ |
| 58 |
78 |
SequenceI seq = seqs[i]; |
| 59 |
78 |
String newName = SeqsetUtils.unique_name(i); |
| 60 |
78 |
names.put(newName, SeqsetUtils.SeqCharacterHash(seq)); |
| 61 |
78 |
if (valid && seq.getEnd() - seq.getStart() >= minlen) |
| 62 |
|
{ |
| 63 |
|
|
| 64 |
78 |
String seqString = seq.getSequenceAsString(); |
| 65 |
78 |
if (!keepGaps) |
| 66 |
72 |
seqString = AlignSeq.extractGaps(Comparison.GapChars, seqString); |
| 67 |
78 |
inputSeqs.add(new Sequence(newName, seqString)); |
| 68 |
|
} |
| 69 |
|
else |
| 70 |
|
{ |
| 71 |
0 |
String seqString = ""; |
| 72 |
0 |
if (seq.getEnd() >= seq.getStart()) |
| 73 |
|
{ |
| 74 |
0 |
seqString = seq.getSequenceAsString(); |
| 75 |
0 |
if (!keepGaps) |
| 76 |
0 |
seqString = AlignSeq.extractGaps(Comparison.GapChars, seqString); |
| 77 |
|
} |
| 78 |
0 |
emptySeqs.add(new Sequence(newName, seqString)); |
| 79 |
|
} |
| 80 |
|
} |
| 81 |
26 |
return new AlignmentJob(inputSeqs, emptySeqs, names); |
| 82 |
|
} |
| 83 |
|
|
| |
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 84 |
196 |
@Override... |
| 85 |
|
public boolean isInputValid() |
| 86 |
|
{ |
| 87 |
196 |
return inputSeqs.size() >= 2; |
| 88 |
|
} |
| 89 |
|
|
| |
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 90 |
8 |
List<SequenceI> getEmptySequences()... |
| 91 |
|
{ |
| 92 |
8 |
return emptySeqs; |
| 93 |
|
} |
| 94 |
|
|
| |
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 95 |
8 |
Map<String, SequenceInfo> getNames()... |
| 96 |
|
{ |
| 97 |
8 |
return names; |
| 98 |
|
} |
| 99 |
|
|
| |
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 100 |
46 |
boolean hasResult()... |
| 101 |
|
{ |
| 102 |
46 |
return alignmentResult != null; |
| 103 |
|
} |
| 104 |
|
|
| |
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 105 |
8 |
AlignmentI getAlignmentResult()... |
| 106 |
|
{ |
| 107 |
8 |
return alignmentResult; |
| 108 |
|
} |
| 109 |
|
|
| |
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 110 |
20 |
void setAlignmentResult(AlignmentI alignment)... |
| 111 |
|
{ |
| 112 |
20 |
this.alignmentResult = alignment; |
| 113 |
|
} |
| 114 |
|
} |