int i;
if (H->free)
for (i = 0; i < H->count; i++)
- (*(H->free)) (H->items[i].content);
+ H->free(H->items[i].content);
free(H->items);
free(H);
return;
/**
* @brief Extracts from the heap and returns the element at position i.
* \param H the heap we're working on
- * \param i element position
+ * \param i element position
* \return the element at position i if ok, NULL otherwise
*
- * Extracts from the heap and returns the element at position i. The head is automatically reorded.
+ * Extracts from the heap and returns the element at position i. The heap is automatically reorded.
*/
void *xbt_heap_remove(xbt_heap_t H, int i)
{