/* Copyright (c) 2008, Geoffrey Foster
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of the <organization> nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY Geoffrey Foster ``AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL Geoffrey Foster BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef __MIN_HEAP_H
#define __MIN_HEAP_H

#include <stdlib.h>
#include <stdbool.h>

typedef int (*min_heap_cmp)(const void*, const void*);

typedef struct {
	void *priority;
	const void *data;
} min_heap_node;

typedef min_heap_node *min_heap_item;

typedef struct {
	size_t n;
	size_t max_size;
	min_heap_cmp cmp;
	min_heap_node *min_heap_data;
} min_heap;

bool min_heap_create(min_heap *h, min_heap_cmp cmp);
bool min_heap_cleanup(min_heap *h);
bool min_heap_insert(min_heap *h, void *priority, const void *data, min_heap_item *hi);
bool min_heap_find_min(min_heap *h, min_heap_item *hi);
const void *min_heap_delete_min(min_heap *h);
size_t min_heap_size(min_heap *h);
const void *min_heap_get_data(min_heap_item hi);

#endif /* __MIN_HEAP_H */