f1dbcb6086c78ca7abe7354f39de4a89e9a51dc6
max
  Thu Feb 6 16:15:37 2014 -0800
code review changes, refs #12615
diff --git src/lib/hash.c src/lib/hash.c
index 470111a..b6ab3a0 100644
--- src/lib/hash.c
+++ src/lib/hash.c
@@ -416,31 +416,31 @@
 /* first field is the next pointer and the second is the name. */
 {
 struct hash *hash = NULL;
 struct slName *namedList = list, *item;
 if (!list)
     return NULL;
 hash = newHash(0);
 for (item = namedList; item != NULL; item = item->next)
     hashAdd(hash, item->name, item);
 return hash;
 }
 
 struct hash *hashSetFromSlNameList(void *list)
 /* Create a hashSet (hash with only keys) out of a list of slNames or any kind
  * of list where the first field is the next pointer and the second is the name. 
- * Returns NULL if the list if NULL. */
+ * Returns NULL if the list is NULL. */
 {
 struct hash *hash = NULL;
 struct slName *namedList = list, *item;
 if (!list)
     return NULL;
 hash = newHash(0);
 for (item = namedList; item != NULL; item = item->next)
     hashAdd(hash, item->name, NULL);
 return hash;
 }
 
 void hashTraverseEls(struct hash *hash, void (*func)(struct hashEl *hel))
 /* Apply func to every element of hash with hashEl as parameter. */
 {
 int i;