src/lib/cirTree.c 1.8

Index: src/lib/cirTree.c
===================================================================
RCS file: /projects/compbio/cvsroot/kent/src/lib/cirTree.c,v
retrieving revision 1.7
retrieving revision 1.8
diff -b -B -U 4 -r1.7 -r1.8
--- src/lib/cirTree.c	9 Feb 2009 02:43:23 -0000	1.7
+++ src/lib/cirTree.c	12 Nov 2009 19:34:48 -0000	1.8
@@ -51,9 +51,8 @@
 	bits64 offsetOfFirstChild, FILE *f)
 /* Recursively write an index level, skipping levels below destLevel,
  * writing out destLevel. */
 {
-// uglyf("rWriteIndexLevel blockSize=%d, childNodeSize=%d, offsetOfFirstChild=%llu, curLevel=%d, destLevel=%d slCount(tree)=%d\n", blockSize, childNodeSize, offsetOfFirstChild, curLevel, destLevel, slCount(tree->children));
 struct rTree *el;
 bits64 offset = offsetOfFirstChild;
 if (curLevel == destLevel)
     {
@@ -472,9 +471,8 @@
 
 static inline boolean cirTreeOverlaps(int qChrom, int qStart, int qEnd, 
 	int rStartChrom, int rStartBase, int rEndChrom, int rEndBase)
 {
-// uglyf("cirTreeOverlaps(query %d:%d-%d, range %d:%d - %d:%d)\n", qChrom, qStart, qEnd, rStartChrom, rStartBase, rEndChrom, rEndBase);
 return cmpTwoBits32(qChrom, qStart, rEndChrom, rEndBase) > 0 &&
        cmpTwoBits32(qChrom, qEnd, rStartChrom, rStartBase) < 0;
 }
 
@@ -552,9 +550,8 @@
  * start/end on chromIx.  Also there will be likely some non-overlapping items
  * in these blocks too. When done, use slListFree to dispose of the result. */
 {
 struct fileOffsetSize *blockList = NULL;
-// uglyf("cirTreeFindOverlappingBlocks(%p %u:%u-%u\n", crt, chromIx, start, end);
 rFindOverlappingBlocks(crt, 0, crt->rootOffset, chromIx, start, end, &blockList);
 slReverse(&blockList);
 return blockList;
 }