c01aa83032dacdc7cdc84a4057a04db34087d6eb
angie
  Tue Apr 17 14:04:04 2012 -0700
Removing silly debug printf caught by Brian in code review (thanks!).
diff --git src/hg/lib/annoGrateWig.c src/hg/lib/annoGrateWig.c
index edee9b4..87c18c3 100644
--- src/hg/lib/annoGrateWig.c
+++ src/hg/lib/annoGrateWig.c
@@ -4,32 +4,30 @@
 #include "annoStreamWig.h"
 #include "sqlNum.h"
 #include "wiggle.h"
 
 static void tidyUp(const struct annoRow *rowIn, struct annoRow **pOutList,
 		   uint primaryStart, uint primaryEnd)
 /* This takes a wiggle chunk coming from a .wig/database row and makes it into
  * zero or more tidy little NAN-less annoRows.  Trim rowIn to the bounds of
  * primary, trim NANs from beginning and break into multiple rows where there
  * are NANs in the middle.  If the rowIn is contiguous with the row at the
  * head of outList, expand that row to include rowIn's data. */
 {
 uint start = max(rowIn->start, primaryStart);
 uint end = min(rowIn->end, primaryEnd);
 float *vector = rowIn->data;
-if (sameString(rowIn->chrom, "chr17_gl000206_random") && rowIn->start > 9000)
-    uglyf("woohoo.\n");
 while (end > start)
     {
     uint offset = start - rowIn->start;
     if (vector[offset] == NAN)
 	start++;
     else
 	{
 	// If there is a NAN before end, that's the end of this row:
 	uint thisEnd = start;
 	while (thisEnd < end && vector[thisEnd - rowIn->start] != NAN)
 	    thisEnd++;
 	struct annoRow *headRow = *pOutList;
 	if (headRow == NULL || rowIn->start > headRow->end)
 	    {
 	    // allocate a new row