return ERROR;
}
- if (!(n = queue->head))
- {
- free (queue);
- return NOERROR;
- }
+ n = queue->head;
- do
+ while (n)
{
next = n->next;
node_destroy (n);
+ n = next;
}
- while ((n = next));
free (queue);
return NOERROR;
while (n->item != item && (n = n->next))
;
- if (!n)
- {
- return false;
- }
-
- return true;
+ return n != NULL;
}
int