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/lib/colHash.c src/lib/colHash.c
index 4d085ed..96bfef2 100644
--- src/lib/colHash.c
+++ src/lib/colHash.c
@@ -1,51 +1,51 @@
 /* colHash - stuff for fast lookup of index given an
  * rgb value. */
 
 /* 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 "memgfx.h"
 #include "colHash.h"
 
 
 struct colHash *colHashNew()
 /* Get a new color hash. */
 {
 struct colHash *cHash;
 AllocVar(cHash);
 cHash->freeEl = cHash->elBuf;
 return cHash;
 }
 
 void colHashFree(struct colHash **pEl)
 /* Free up color hash. */
 {
 freez(pEl);
 }
 
 struct colHashEl *colHashAdd(struct colHash *cHash, 
 	unsigned r, unsigned g, unsigned b, int ix)
 /* Add new element to color hash. */
 {
 struct colHashEl *che = cHash->freeEl++, **pCel;
 che->col.r = r;
 che->col.g = g;
 che->col.b = b;
 che->ix = ix;
 pCel = &cHash->lists[colHashFunc(r,g,b)];
 slAddHead(pCel, che);
 return che;
 }
 
 struct colHashEl *colHashLookup(struct colHash *cHash, 
 	unsigned r, unsigned g, unsigned b)
 /* Lookup value in hash. */
 {
 struct colHashEl *che;
 for (che = cHash->lists[colHashFunc(r,g,b)]; che != NULL; che = che->next)
     if (che->col.r == r && che->col.g == g && che->col.b == b)
 	return che;
 return NULL;
 }