heap.h

基于linux环境的ns2多机并行仿真补丁

/*---------------------------------------------------------------------------*/
/* Priority queue interface with an in-place heap.                           */
/* Author(s): Kalyan Perumalla, Richard Fujimoto.                            */
/* $Revision: 1.1 $ $Name: v26apr05 $ $Date: 2003/04/11 20:17:37 $ */
/*---------------------------------------------------------------------------*/
#ifndef __HEAP_H
#define __HEAP_H

#include <stdio.h>

/*
 *  Heap Data Structure
 */

/* default data type */
#define HEAP_DEFAULT_TYPE -1

/* value used if size field not specified */
#define HEAP_UNDEFINED_SIZE 0

/* type definition for heap */
typedef struct HEAP_Struct *HEAP_PQ;

/* a node within the heap */
typedef struct HEAP_NodeS *HEAP_Node;

/* type definition of key */
typedef double KEY_TYPE;

HEAP_PQ HEAP_Create( int, int );
HEAP_Node HEAP_Insert( HEAP_PQ, KEY_TYPE, void * );
HEAP_Node HEAP_InsertWithType( HEAP_PQ, KEY_TYPE, void *, long, long );
void *HEAP_Delete( HEAP_PQ , KEY_TYPE *);
void *HEAP_DeleteWithType( HEAP_PQ , KEY_TYPE *, long *, long *);
void *HEAP_DeleteArbitrary ( HEAP_PQ, HEAP_Node, KEY_TYPE * );
void *HEAP_DeleteArbitraryWithType ( HEAP_PQ, HEAP_Node, KEY_TYPE *, long *, long * );
void HEAP_Dump( FILE *, HEAP_PQ );
KEY_TYPE HEAP_Min(HEAP_PQ);

/* return first element in heap w/o deleteing */
void *HEAP_First( HEAP_PQ, KEY_TYPE *);
/* return the number of elements in the heap */
int HEAP_Count( HEAP_PQ);

#endif /*__HEAP_H*/