2 * Jalview - A Sequence Alignment Editor and Viewer
\r
3 * Copyright (C) 2005 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle
\r
5 * This program is free software; you can redistribute it and/or
\r
6 * modify it under the terms of the GNU General Public License
\r
7 * as published by the Free Software Foundation; either version 2
\r
8 * of the License, or (at your option) any later version.
\r
10 * This program is distributed in the hope that it will be useful,
\r
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
\r
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
\r
13 * GNU General Public License for more details.
\r
15 * You should have received a copy of the GNU General Public License
\r
16 * along with this program; if not, write to the Free Software
\r
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
\r
20 package jalview.schemes;
\r
25 public class ResidueColourScheme implements ColourSchemeI{
\r
28 public Vector consensus;
\r
30 public ResidueColourScheme(Color[] colors, int threshold) {
\r
31 this.colors = colors;
\r
32 this.threshold = threshold;
\r
35 public ResidueColourScheme()
\r
38 public void setConsensus(Vector consensus)
\r
40 this.consensus = consensus;
\r
43 public Color findColour(String aa)
\r
45 return colors[((Integer)(ResidueProperties.aaHash.get(aa))).intValue()];
\r
48 public Color findColour(String s, int j) {
\r
50 if( threshold==0 || aboveThreshold(s,j))
\r
51 return colors[((Integer)(ResidueProperties.aaHash.get(s))).intValue()];
\r
57 public int getThreshold() {
\r
61 public void setThreshold(int ct) {
\r
65 public boolean aboveThreshold(String s, int j)
\r
67 Hashtable hash = (Hashtable)consensus.elementAt(j);
\r
69 if ( ( (Integer) hash.get("maxCount")).intValue() != -1 && hash.contains(s))
\r
71 //// resCount//////////////////// ///////////////seq count////////////
\r
72 double sc = ( (Integer) hash.get(s)).intValue() * 100.0 / ( (Integer) hash.get("size")).intValue();
\r
74 if (sc >= threshold)
\r