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
22 import jalview.datamodel.*;
\r
26 public class PIDColourScheme extends ResidueColourScheme {
\r
27 public Color[] pidColours;
\r
28 public float[] thresholds;
\r
30 SequenceGroup group;
\r
32 public PIDColourScheme() {
\r
33 this.pidColours = ResidueProperties.pidColours;
\r
34 this.thresholds = ResidueProperties.pidThresholds;
\r
39 public Color findColour(String s, int j) {
\r
41 if( threshold!=0 && !aboveThreshold(s,j))
\r
44 Color c = Color.white;
\r
45 Hashtable hash = (Hashtable)consensus.elementAt(j);
\r
48 if ( Integer.parseInt( hash.get("maxCount").toString() ) != -1 && hash.contains(s))
\r
50 sc = ( (Integer) hash.get(s)).intValue() * 100.0 / ((Integer)hash.get("size")).intValue() ;
\r
51 // MC Should be isGap
\r
52 if (!jalview.util.Comparison.isGap((s.charAt(0))))
\r
54 for (int i = 0; i < thresholds.length; i++)
\r
56 if (sc > thresholds[i])
\r