d1a11e955077906d793c5f6ca9eee3c40a77f1b0
braney
  Wed Feb 19 14:24:48 2020 -0800
use a name index in a bigBed if available and there are identifiers in hgTables and
the region is whole genome

diff --git src/inc/hash.h src/inc/hash.h
index 361bb43..5803299 100644
--- src/inc/hash.h
+++ src/inc/hash.h
@@ -240,30 +240,33 @@
 struct hash *newHashLm(int powerOfTwoSize, struct lm *lm);
 /* Returns new hash table using the given lm.  Recommended lm block size is 256B to 64kB,
  * depending on powerOfTwoSize. */
 #define hashNewLm(size, lm) newHashLm(size, lm)
 
 void hashReverseAllBucketLists(struct hash *hash);
 /* Reverse all hash bucket list.  You might do this to
  * get them back in the same order things were added to the hash */
 
 void hashResize(struct hash *hash, int powerOfTwoSize);
 /* Resize the hash to a new size */
 
 struct hash *hashFromSlNameList(void *list);
 /* Create a hash out of a list of slNames. */
 
+struct slName *hashSlNameFromHash(struct hash *hash);
+/* Create a slName list from the names in a hash. */
+
 struct hash *hashSetFromSlNameList(void *list);
 /* Create a hashSet (hash without values) out of a list of slNames. */
 
 void freeHash(struct hash **pHash);
 /* Free up hash table. */
 #define hashFree(a) freeHash(a)	/* Synonym */
 
 void freeHashAndVals(struct hash **pHash);
 /* Free up hash table and all values associated with it.
  * (Just calls freeMem on each hel->val) */
 
 void hashFreeWithVals(struct hash **pHash, void (freeFunc)());
 /* Free up hash table and all values associated with it. freeFunc is a
  * function to free an entry, should take a pointer to a pointer to an
  * entry. */