a44421a79fb36cc2036fe116b97ea3bc9590cd0c
braney
  Fri Dec 2 09:34:39 2011 -0800
removed rcsid (#295)
diff --git src/lib/boxLump.c src/lib/boxLump.c
index 4a9827c..0fdfbc9 100644
--- src/lib/boxLump.c
+++ src/lib/boxLump.c
@@ -1,29 +1,28 @@
 /* boxLump - This will lump together boxes that overlap into the smallest
  * box that encompasses the overlap.  It will put other boxes that 
  * fit in the encompassing box in there too. 
  *   It works by projecting the box list along one dimension at a
  * time looking for gaps between boxes. This is similar in function
  * to boxFindClumps, but a bit less precise, and quite a bit faster.
  * in some important cases. */
 
 #include "common.h"
 #include "hash.h"
 #include "boxClump.h"
 #include "boxLump.h"
 
-static char const rcsid[] = "$Id: boxLump.c,v 1.2 2008/09/17 17:56:37 kent Exp $";
 
 int boxInCmpQuery(const void *va, const void *vb)
 /* Compare to sort based on query start. */
 {
 const struct boxIn *a = *((struct boxIn **)va);
 const struct boxIn *b = *((struct boxIn **)vb);
 return a->qStart - b->qStart;
 }
 
 int boxInCmpTarget(const void *va, const void *vb)
 /* Compare to sort based on query start. */
 {
 const struct boxIn *a = *((struct boxIn **)va);
 const struct boxIn *b = *((struct boxIn **)vb);
 return a->tStart - b->tStart;