6b1004fac96e92ac287422b374aed8d7a5f13277
kent
  Sun Jan 19 18:06:59 2014 -0800
Fixing typo in comment.
diff --git src/lib/common.c src/lib/common.c
index 58d22a6..b454b46 100644
--- src/lib/common.c
+++ src/lib/common.c
@@ -370,31 +370,31 @@
 slCat(*pList, b);
 slSort(pList,compare);
 }
 
 void slSortMergeUniq(void *pA, void *b, CmpFunction *compare, void (*free)())
 // Merges and sorts a pair of singly linked lists leaving only unique
 // items via slUniqufy.  duplicate itens are defined by the compare routine
 // returning 0. If free is provided, items dropped from list can disposed of.
 {
 struct slList **pList = (struct slList **)pA;
 slCat(*pList, b);
 slUniqify(pList,compare,free);
 }
 
 boolean slRemoveEl(void *vpList, void *vToRemove)
-/* Remove element from doubly linked list.  Usage:
+/* Remove element from singly linked list.  Usage:
  *    slRemove(&list, el);
  * Returns TRUE if element in list.  */
 {
 struct slList **pList = vpList;
 struct slList *toRemove = vToRemove;
 struct slList *el, *next, *newList = NULL;
 boolean didRemove = FALSE;
 
 for (el = *pList; el != NULL; el = next)
     {
     next = el->next;
     if (el != toRemove)
 	{
 	slAddHead(&newList, el);
 	}