9723799cf6f1a8fb714ae1493b224b8e91aebf09
tdreszer
  Mon Jul 30 12:17:38 2012 -0700
Making final pass through tree of checkins as dictated by Jim. None of these changes should affect executables in any way. This pass is due to expanding fingerprint caused by kompare.
diff --git src/hg/hgTracks/expRatioTracks.c src/hg/hgTracks/expRatioTracks.c
index c0831b5..cb63541 100644
--- src/hg/hgTracks/expRatioTracks.c
+++ src/hg/hgTracks/expRatioTracks.c
@@ -346,32 +346,32 @@
 {
 const struct linkedFeaturesSeries *a = *((struct linkedFeaturesSeries **)va);
 const struct linkedFeaturesSeries *b = *((struct linkedFeaturesSeries **)vb);
 /* make sure that the duplicate and nsclc end up at the end */
 if(sameString(a->name, "DUPLICATE"))
     return 1;
 if(sameString(a->name, "NSCLC"))
     return 1;
 if(sameString(b->name, "DUPLICATE"))
     return -1;
 if(sameString(b->name, "NSCLC"))
     return -1;
 return(strcmp(a->name, b->name));
 }
 
-struct linkedFeaturesSeries *msBedGroupByIndex(struct bed *bedList, char *database,
-        char *table, int expIndex, char *filter, int filterIndex)
+struct linkedFeaturesSeries *msBedGroupByIndex(struct bed *bedList, char *database, char *table,
+                                               int expIndex, char *filter, int filterIndex)
 /* Groups bed expScores in multiple scores bed by the expIndex
  * in the expRecord->extras array. Makes use of hashes to remember
  * numerical index of experiments, as hard to do in a list.
  * If expIndex is -1, then use name instead of extras[expIndex] */
 {
 struct linkedFeaturesSeries *lfsList = NULL, **lfsArray;
 struct linkedFeatures *lf = NULL;
 struct sqlConnection *conn;
 struct hash *indexes;
 struct hash *expTypes;
 struct hash *expIndexesToNames;
 int numIndexes = 0, currentIndex, i;
 struct expRecord *erList = NULL, *er=NULL;
 struct slInt *srList = NULL, *sr=NULL;
 char buff[256];
@@ -1026,31 +1026,32 @@
 /* cap the value to be less than or equal to maxDeviation */
 if(val > 5000)maxDeviation=3;
 if(absVal > maxDeviation)
     absVal = maxDeviation;
 
 /* project the value into the number of colors we have.
  * i.e. if val = 1.0 and max is 2.0 and number of shades is 16 then index would be
  * 1 * 15 /2.0 = 7.5 = 7
  */
 colorIndex = (int)(absVal * maxRGBShade/maxDeviation);
 if (val > 0)
     if (val == addednumber+1)
         {
         return shadesOfLowe1[9];
         }
-        else if(val == addednumber+2){
+    else if (val == addednumber+2)
+        {
                 return  shadesOfLowe2[9];
 	}
 	else if(val == addednumber+3){
 		return shadesOfLowe3[9];
 	}
 	else{
   return shadesOfRed[colorIndex];
 	 }
 else
     {
     if(colorSchemeFlag == 0)
 	return shadesOfGreen[colorIndex];
     else
 	return shadesOfBlue[colorIndex];
     }