4898794edd81be5285ea6e544acbedeaeb31bf78
max
  Tue Nov 23 08:10:57 2021 -0800
Fixing pointers to README file for license in all source code files. refs #27614

diff --git src/hg/oneShot/cacheMergedRanges/rbmTree.c src/hg/oneShot/cacheMergedRanges/rbmTree.c
index 425d67d..cb66be7 100644
--- src/hg/oneShot/cacheMergedRanges/rbmTree.c
+++ src/hg/oneShot/cacheMergedRanges/rbmTree.c
@@ -1,25 +1,25 @@
 /* rbmTree - Red-Black Tree with Merging of overlapping values - 
  * a type of binary tree which automatically keeps itself relatively balanced 
  * during inserts and deletions.
  *   original author: Shane Saunders
  *   adapted into local conventions: Jim Kent
  *   extended to support merging of overlaps: Angie Hinrichs
  */
 
 /* Copyright (C) 2011 The Regents of the University of California 
- * See README in this or parent directory for licensing information. */
+ * See kent/LICENSE or http://genome.ucsc.edu/license/ for licensing information. */
 
 #include "common.h"
 #include "localmem.h"
 #include "rbmTree.h"
 
 
 /* The stack keeps us from having to keep explicit
  * parent, grandparent, greatgrandparent variables.
  * It needs to be big enough for the maximum depth
  * of tree.  Since the whole point of rb trees is
  * that they are self-balancing, this is not all
  * that deep, just 2*log2(N).  Therefore a stack of
  * 256 is good for up to 2^128 items in stack, which
  * should keep us for the next couple of millenia... */