- hashtItem *htip, **htipp ;
-
- if (!(*h))
- return 0;
-
- /* first check if anything exists in the slot */
- if (! (*h)->table[key] )
- return 0;
-
- /* delete specific item */
- /* if a compare function is given then use the compare */
- /* function to find the item, else just compare the items */
-
- htipp = &((*h)->table[key]);
- htip = (*h)->table[key];
- for (; htip; htip = htip->next) {
- if (
- (compare && compare(pkey, htip->pkey)) ||
- pkey == htip->pkey) {
- *htipp=htip->next;
- break;
- }
- htipp=&(htip->next);
+ hashtItem *htip, **htipp;
+ bool found = FALSE;
+
+ if (!(*h))
+ return 0;
+
+ /* first check if anything exists in the slot */
+ if (!(*h)->table[key])
+ return 0;
+
+ /* delete specific item */
+ /* if a compare function is given then use the compare */
+ /* function to find the item, else just compare the items */
+
+ htipp = &((*h)->table[key]);
+ htip = (*h)->table[key];
+ for (; htip; htip = htip->next)
+ {
+ if (
+ (compare && compare (pkey, htip->pkey)) ||
+ pkey == htip->pkey)
+ {
+ *htipp = htip->next;
+ found = TRUE;
+ break;
+ }
+ htipp = &(htip->next);