/* 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 __RANDOMIZED_MELDABLE_QUEUE_H
#define __RANDOMIZED_MELDABLE_QUEUE_H

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

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

typedef struct rmq_node_tag {
	struct rmq_node_tag *left;
	struct rmq_node_tag *right;
	const void *data;
	void *priority;
} rmq_node;

typedef struct {
	rmq_node *root;
	rmq_cmp cmp;
	size_t size;
} rmq;

typedef rmq_node *rmq_item;

bool rmq_create(rmq*, rmq_cmp);
bool rmq_cleanup(rmq*);
bool rmq_insert(rmq*, void*, const void*, rmq_item*);
bool rmq_find_min(rmq*, rmq_item*);
const void *rmq_delete_min(rmq*);
size_t rmq_size(rmq*);
const void *rmq_get_data(rmq_item);

#endif /* __RANDOMIZED_MELDABLE_QUEUE_H */