- hashtItem *htip, **htipp ;
-
- if (!(*htab))
- return ;
-
- /* first check if anything exists in the slot */
- if (! (*htab)->table[key] )
- return ;
-
- /* if delete chain */
- if ( action == DELETE_CHAIN )
- (*htab)->table[key] = NULL ;
- else {
-
- /* delete specific item */
- /* if a compare function is given then use the compare */
- /* function to find the item, else just compare the items */
-
- htipp = &((*htab)->table[key]);
- htip = (*htab)->table[key];
- for (; htip; htip = htip->next) {
-
- if (compareFunc ? compareFunc(item,htip->item) :
- (item == htip->item) ) {
- *htipp=htip->next;
- break;
- }
-
- htipp=&(htip->next);
- }
-
+ hashtItem *htip, **htipp;
+
+ if (!(*htab))
+ return;
+
+ /* first check if anything exists in the slot */
+ if (!(*htab)->table[key])
+ return;
+
+ /* if delete chain */
+ if (action == DELETE_CHAIN)
+ (*htab)->table[key] = NULL;
+ else
+ {
+
+ /* delete specific item */
+ /* if a compare function is given then use the compare */
+ /* function to find the item, else just compare the items */
+
+ htipp = &((*htab)->table[key]);
+ htip = (*htab)->table[key];
+ for (; htip; htip = htip->next)
+ {
+
+ if (compareFunc ? compareFunc (item, htip->item) :
+ (item == htip->item))
+ {
+ *htipp = htip->next;
+ break;
+ }
+
+ htipp = &(htip->next);
+ }
+