* returns a new Hashtable[] of size maxSeqLength, if Hashtable not supplied.
* This class is used extensively in calculating alignment colourschemes that
* depend on the amount of conservation in each alignment column.
- *
+ *
* @author $author$
* @version $Revision$
*/
public static final String PROFILE = "P";
- public static final Hashtable[] calculate(List<SequenceI> list, int start,
- int end)
+ public static final Hashtable[] calculate(List<SequenceI> list,
+ int start, int end)
{
return calculate(list, start, end, false);
}
- public static final Hashtable[] calculate(List<SequenceI> sequences, int start,
- int end, boolean profile)
+ public static final Hashtable[] calculate(List<SequenceI> sequences,
+ int start, int end, boolean profile)
{
SequenceI[] seqs = new SequenceI[sequences.size()];
int width = 0;
- synchronized (sequences) {
- for (int i = 0; i < sequences.size(); i++)
+ synchronized (sequences)
{
- seqs[i] = sequences.get(i);
- if (seqs[i].getLength() > width)
+ for (int i = 0; i < sequences.size(); i++)
{
- width = seqs[i].getLength();
+ seqs[i] = sequences.get(i);
+ if (seqs[i].getLength() > width)
+ {
+ width = seqs[i].getLength();
+ }
}
- }
- Hashtable[] reply = new Hashtable[width];
+ Hashtable[] reply = new Hashtable[width];
- if (end >= width)
- {
- end = width;
- }
+ if (end >= width)
+ {
+ end = width;
+ }
- calculate(seqs, start, end, reply, profile);
- return reply;
- }
+ calculate(seqs, start, end, reply, profile);
+ return reply;
+ }
}
public static final void calculate(SequenceI[] sequences, int start,
for (j = 0; j < jSize; j++)
{
- if (sequences[j]==null)
+ if (sequences[j] == null)
{
- System.err.println("WARNING: Consensus skipping null sequence - possible race condition.");
+ System.err
+ .println("WARNING: Consensus skipping null sequence - possible race condition.");
continue;
}
seq = sequences[j].getSequence();
/**
* Compute all or part of the annotation row from the given consensus
* hashtable
- *
+ *
* @param consensus
* - pre-allocated annotation row
* @param hconsensus
for (int i = iStart; i < width; i++)
{
Hashtable hci;
- if (i >= hconsensus.length || ((hci=hconsensus[i])==null))
+ if (i >= hconsensus.length || ((hci = hconsensus[i]) == null))
{
// happens if sequences calculated over were shorter than alignment
// width
{
fv = (Float) hci.get(AAFrequency.PID_GAPS);
}
- if (fv==null)
+ if (fv == null)
{
consensus.annotations[i] = null;
// data has changed below us .. give up and
{
for (int c = 0; c < alphabet.length; c++)
{
- tval = profile[0][alphabet[c]]
- * 100f
- / profile[1][ignoreGapsInConsensusCalculation ? 1
- : 0];
+ tval = profile[0][alphabet[c]] * 100f
+ / profile[1][ignoreGapsInConsensusCalculation ? 1 : 0];
mouseOver += ((c == 0) ? "" : "; ") + alphabet[c] + " "
+ ((int) tval) + "%";
}
{
tval = profile[0][((char[]) ca[c])[0]]
* 100f
- / profile[1][ignoreGapsInConsensusCalculation ? 1
- : 0];
+ / profile[1][ignoreGapsInConsensusCalculation ? 1 : 0];
mouseOver += ((p == 0) ? "" : "; ") + ((char[]) ca[c])[0]
+ " " + ((int) tval) + "%";
p++;
/**
* get the sorted profile for the given position of the consensus
- *
+ *
* @param hconsensus
* @return
*/
;
jalview.util.QuickSort.sort(vl, ca);
rtnval[0] = 2;
- rtnval[1]=0;
+ rtnval[1] = 0;
for (int c = ca.length - 1; profile[0][((char[]) ca[c])[0]] > 0; c--)
{
if (((char[]) ca[c])[0] != '-')
rtnval[rtnval[0]++] = ((char[]) ca[c])[0];
rtnval[rtnval[0]] = (int) (profile[0][((char[]) ca[c])[0]] * 100f / profile[1][ignoreGapsInConsensusCalculation ? 1
: 0]);
- rtnval[1]+=rtnval[rtnval[0]++];
+ rtnval[1] += rtnval[rtnval[0]++];
}
}
return rtnval;