de347b602f04699d5c00223cd08bee9fc821c97b
kent
  Tue Mar 26 23:50:54 2013 -0700
Improved readability and removed unused function parameter. Ref #10428.
diff --git src/utils/bedGraphToBigWig/bedGraphToBigWig.c src/utils/bedGraphToBigWig/bedGraphToBigWig.c
index b0c176b..5a171ab 100644
--- src/utils/bedGraphToBigWig/bedGraphToBigWig.c
+++ src/utils/bedGraphToBigWig/bedGraphToBigWig.c
@@ -239,31 +239,31 @@
 struct bbiSumOutStream *stream = bbiSumOutStreamOpen(itemsPerSlot, f, doCompress);
 
 /* remove initial browser and track lines */
 lineFileRemoveInitialCustomTrackLines(lf);
 
 for (;;)
     {
     /* Get next line of input if any. */
     char *row[5];
     int rowSize = lineFileChopNext(lf, row, ArraySize(row));
 
     /* Output last section and break if at end of file. */
     if (rowSize == 0 && sum != NULL)
 	{
 	bbiOutputOneSummaryFurtherReduce(sum, &twiceReducedList, doubleReductionSize, 
-		&boundsPt, boundsEnd, usage->size, lm, stream);
+		&boundsPt, boundsEnd, lm, stream);
 	break;
 	}
 
     /* Parse out row. */
     char *chrom = row[0];
     bits32 start = sqlUnsigned(row[1]);
     bits32 end = sqlUnsigned(row[2]);
     float val = sqlFloat(row[3]);
 
     /* Update total summary stuff. */
     bits32 size = end-start;
     if (firstRow)
 	{
         totalSum->validCount = size;
 	totalSum->minVal = totalSum->maxVal = val;
@@ -273,69 +273,69 @@
 	}
     else
         {
 	totalSum->validCount += size;
 	if (val < totalSum->minVal) totalSum->minVal = val;
 	if (val > totalSum->maxVal) totalSum->maxVal = val;
 	totalSum->sumData += val*size;
 	totalSum->sumSquares += val*val*size;
 	}
 
     /* If new chromosome output existing block. */
     if (differentString(chrom, usage->name))
         {
 	usage = usage->next;
 	bbiOutputOneSummaryFurtherReduce(sum, &twiceReducedList, doubleReductionSize,
-		&boundsPt, boundsEnd, usage->size, lm, stream);
+		&boundsPt, boundsEnd, lm, stream);
 	sum = NULL;
 	}
 
     /* If start past existing block then output it. */
     else if (sum != NULL && sum->end <= start)
 	{
 	bbiOutputOneSummaryFurtherReduce(sum, &twiceReducedList, doubleReductionSize, 
-		&boundsPt, boundsEnd, usage->size, lm, stream);
+		&boundsPt, boundsEnd, lm, stream);
 	sum = NULL;
 	}
 
     /* If don't have a summary we're working on now, make one. */
     if (sum == NULL)
         {
 	oneSummary.chromId = usage->id;
 	oneSummary.start = start;
 	oneSummary.end = start + initialReduction;
 	if (oneSummary.end > usage->size) oneSummary.end = usage->size;
 	oneSummary.minVal = oneSummary.maxVal = val;
 	oneSummary.sumData = oneSummary.sumSquares = 0.0;
 	oneSummary.validCount = 0;
 	sum = &oneSummary;
 	}
     
     /* Deal with case where might have to split an item between multiple summaries.  This
      * loop handles all but the final affected summary in that case. */
     while (end > sum->end)
         {
 	verbose(3, "Splitting start %d, end %d, sum->start %d, sum->end %d\n", start, end, sum->start, sum->end);
 	/* Fold in bits that overlap with existing summary and output. */
 	bits32 overlap = rangeIntersection(start, end, sum->start, sum->end);
 	sum->validCount += overlap;
 	if (sum->minVal > val) sum->minVal = val;
 	if (sum->maxVal < val) sum->maxVal = val;
 	sum->sumData += val * overlap;
 	sum->sumSquares += val*val * overlap;
 	bbiOutputOneSummaryFurtherReduce(sum, &twiceReducedList, doubleReductionSize, 
-		&boundsPt, boundsEnd, usage->size, lm, stream);
+		&boundsPt, boundsEnd, lm, stream);
 	size -= overlap;
 
 	/* Move summary to next part. */
 	sum->start = start = sum->end;
 	sum->end = start + initialReduction;
 	if (sum->end > usage->size) sum->end = usage->size;
 	sum->minVal = sum->maxVal = val;
 	sum->sumData = sum->sumSquares = 0.0;
 	sum->validCount = 0;
 	}
 
     /* Add to summary. */
     sum->validCount += size;
     if (sum->minVal > val) sum->minVal = val;
     if (sum->maxVal < val) sum->maxVal = val;