X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fschemes%2FResidueColourScheme.java;h=9c10e7d8e1101c95b193233ff6c60c781de3b020;hb=b8d09897dacc7b0ad203982b4578e2c1d8929142;hp=b0a5caa81f8f172cb75d9d326521c5cd65fb63a0;hpb=d4505fe7ead8da6d4fdf7e0b4680f66b3a408e87;p=jalview.git diff --git a/src/jalview/schemes/ResidueColourScheme.java b/src/jalview/schemes/ResidueColourScheme.java index b0a5caa..9c10e7d 100755 --- a/src/jalview/schemes/ResidueColourScheme.java +++ b/src/jalview/schemes/ResidueColourScheme.java @@ -1,65 +1,148 @@ +/* +* Jalview - A Sequence Alignment Editor and Viewer +* Copyright (C) 2005 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle +* +* This program is free software; you can redistribute it and/or +* modify it under the terms of the GNU General Public License +* as published by the Free Software Foundation; either version 2 +* of the License, or (at your option) any later version. +* +* This program is distributed in the hope that it will be useful, +* but WITHOUT ANY WARRANTY; without even the implied warranty of +* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +* GNU General Public License for more details. +* +* You should have received a copy of the GNU General Public License +* along with this program; if not, write to the Free Software +* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA +*/ package jalview.schemes; -import jalview.datamodel.*; -import java.util.*; import java.awt.*; -public class ResidueColourScheme implements ColourSchemeI{ - Color [] colors; - int threshold = 0; +import java.util.*; - public ResidueColourScheme(Color[] colors, int threshold) { - this.colors = colors; - this.threshold = threshold; - } - public ResidueColourScheme() { +/** + * DOCUMENT ME! + * + * @author $author$ + * @version $Revision$ + */ +public class ResidueColourScheme implements ColourSchemeI +{ + Color[] colors; + int threshold = 0; + + /** DOCUMENT ME!! */ + public Vector consensus; + + /** + * Creates a new ResidueColourScheme object. + * + * @param colors DOCUMENT ME! + * @param threshold DOCUMENT ME! + */ + public ResidueColourScheme(Color[] colors, int threshold) + { + this.colors = colors; + this.threshold = threshold; } - public Color findColour(String aa) + /** + * Creates a new ResidueColourScheme object. + */ + public ResidueColourScheme() { - return colors[((Integer)(ResidueProperties.aaHash.get(aa))).intValue()]; } - public Color findColour(String s, int j, Vector aa) { - - if( threshold==0 || aboveThreshold(aa,s,j)) - return colors[((Integer)(ResidueProperties.aaHash.get(s))).intValue()]; - else - return Color.white; + /** + * DOCUMENT ME! + * + * @param consensus DOCUMENT ME! + */ + public void setConsensus(Vector consensus) + { + this.consensus = consensus; + } + /** + * DOCUMENT ME! + * + * @param aa DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public Color findColour(String aa) + { + return colors[((Integer) (ResidueProperties.aaHash.get(aa))).intValue()]; } - public int getThreshold() { - return threshold; + /** + * DOCUMENT ME! + * + * @param s DOCUMENT ME! + * @param j DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public Color findColour(String s, int j) + { + if ((threshold == 0) || aboveThreshold(s, j)) + { + return colors[((Integer) (ResidueProperties.aaHash.get(s))).intValue()]; + } + else + { + return Color.white; + } } - public void setThreshold(int ct) { - threshold = ct; + /** + * DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public int getThreshold() + { + return threshold; } - public boolean aboveThreshold(Vector aa,String s, int j) + /** + * DOCUMENT ME! + * + * @param ct DOCUMENT ME! + */ + public void setThreshold(int ct) { + threshold = ct; + } - Hashtable hash = (Hashtable)aa.elementAt(j); + /** + * DOCUMENT ME! + * + * @param s DOCUMENT ME! + * @param j DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public boolean aboveThreshold(String s, int j) + { + Hashtable hash = (Hashtable) consensus.elementAt(j); - if ( ( (Integer) hash.get("maxCount")).intValue() != -1 && hash.contains(s)) + if ((((Integer) hash.get("maxCount")).intValue() != -1) && + hash.contains(s)) { - //// resCount//////////////////// ///////////////seq count//////////// - double sc = ( (Integer) hash.get(s)).intValue() * 100.0 / ( (Integer) hash.get("size")).intValue(); - - if (sc >= threshold) - return true; - + //// resCount//////////////////// ///////////////seq count//////////// + double sc = (((Integer) hash.get(s)).intValue() * 100.0) / ((Integer) hash.get( + "size")).intValue(); + + if (sc >= threshold) + { + return true; + } } - return false; - } - - public boolean canThreshold() { - return true; - } - public boolean isUserDefinable() { - return false; + return false; } }