/* Barebones heap implementation supporting only insert and pop. Copyright (C) 2010-2023 Free Software Foundation, Inc. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . */ /* Full implementation: GDSL (http://gna.org/projects/gdsl/) by Nicolas Darnis . Adapted by Gene Auyeung. */ #include struct heap; void heap_free (struct heap *) _GL_ATTRIBUTE_NONNULL (); struct heap *heap_alloc (int (*) (void const *, void const *), size_t) _GL_ATTRIBUTE_MALLOC _GL_ATTRIBUTE_DEALLOC (heap_free, 1) _GL_ATTRIBUTE_RETURNS_NONNULL; int heap_insert (struct heap *heap, void *item) _GL_ATTRIBUTE_NONNULL (); void *heap_remove_top (struct heap *heap) _GL_ATTRIBUTE_NONNULL ();