-/**
-* @file pqueue.h
-* @date 18.04.2007
-* @author Christian Wuerdig
-* @brief Implementation of a priority queue. This is the ported version of the
-* original Java implementation by Matthias Braun.
-* @version $Id$
-*/
+/*
+ * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
-#ifndef _PQUEUE_H_
-#define _PQUEUE_H_
+/**
+ * @file
+ * @date 18.04.2007
+ * @author Christian Wuerdig
+ * @brief Implementation of a priority queue. This is the ported version of the
+ * original Java implementation by Matthias Braun.
+ * @version $Id$
+ */
+#ifndef FIRM_ADT_PQUEUE_H
+#define FIRM_ADT_PQUEUE_H
typedef struct _pqueue_t pqueue;
* @param data The actual data which should be stored in the queue.
* @param key The priority for the data.
*/
-void pqueue_put(pqueue *q, void *data, double key);
+void pqueue_put(pqueue *q, void *data, int key);
/**
* Returns and removes the first element, ie. that one with the highest priority, from the queue.
*/
int pqueue_empty(pqueue *q);
-#endif /* _PQUEUE_H_ */
+#endif