a44421a79fb36cc2036fe116b97ea3bc9590cd0c
braney
  Fri Dec 2 09:34:39 2011 -0800
removed rcsid (#295)
diff --git src/lib/chainBlock.c src/lib/chainBlock.c
index 52dcb51..9d28b92 100644
--- src/lib/chainBlock.c
+++ src/lib/chainBlock.c
@@ -1,27 +1,26 @@
 /* chainBlock - Chain together scored blocks from an alignment
  * into scored chains.  Internally this uses a kd-tree and a
  * varient of an algorithm suggested by Webb Miller and further
  * developed by Jim Kent. */
 
 #include "common.h"
 #include "localmem.h"
 #include "linefile.h"
 #include "dlist.h"
 #include "chainBlock.h"
 
-static char const rcsid[] = "$Id: chainBlock.c,v 1.17 2005/04/10 14:41:21 markd Exp $";
 
 struct kdBranch
 /* A kd-tree. That is a binary tree which partitions the children
  * into higher and lower one dimension at a time.  We're just doing
  * one in two dimensions, so it alternates between q and t dimensions. */
     {
     struct kdBranch *lo;      /* Pointer to children with lower coordinates. */
     struct kdBranch *hi;      /* Pointer to children with higher coordinates. */
     struct kdLeaf *leaf;      /* Extra info for leaves on tree. */
     int cutCoord;	      /* Coordinate (in some dimension) to cut on */
     double maxScore;	      /* Max score of any leaf below us. */
     int maxQ;		      /* Maximum qEnd of any leaf below us. */
     int maxT;		      /* Maximum tEnd of any leaf below us. */
     };