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;
if (count > size) {
H->size = 2 * size + 1;
- H->items =(void *) realloc(H->items,(H->size) * sizeof(struct xbt_heapItem));
+ H->items =
+ (void *) realloc(H->items, (H->size) * sizeof(struct xbt_heapItem));
}
item = &(H->items[count - 1]);
if (H->count < H->size / 4 && H->size > 16) {
H->size = H->size / 2 + 1;
H->items =
- (void *) realloc(H->items,
- (H->size) * sizeof(struct xbt_heapItem));
+ (void *) realloc(H->items, (H->size) * sizeof(struct xbt_heapItem));
}
return max;
}
*/
double xbt_heap_maxkey(xbt_heap_t H)
{
- xbt_assert0(H->count != 0,"Empty heap");
+ xbt_assert0(H->count != 0, "Empty heap");
return KEY(H, 0);
}
*/
void *xbt_heap_maxcontent(xbt_heap_t H)
{
- xbt_assert0(H->count != 0,"Empty heap");
+ xbt_assert0(H->count != 0, "Empty heap");
return CONTENT(H, 0);
}