1

/* $Id$ */

     2

     3

#ifndef QUEUE_H

     4

#define QUEUE_H

     5

     6

//#define NOFREE

     7

//#define QUEUE_DEBUG

     8

//#define HASH_DEBUG

     9

//#define HASH_STATS

    10

    11

    12

typedef struct Queue Queue;

    13

typedef bool Queue_PushProc(Queue* q, void* item, int priority);

    14

typedef void* Queue_PopProc(Queue* q);

    15

typedef bool Queue_DeleteProc(Queue* q, void* item, int priority);

    16

typedef void Queue_ClearProc(Queue* q, bool free_values);

    17

typedef void Queue_FreeProc(Queue* q, bool free_values);

    18

    19

typedef struct InsSortNode InsSortNode;

    20

struct InsSortNode {

    21

	void* item;

    22

	int priority;

    23

	InsSortNode* next;

    24

};

    25

    26

typedef struct BinaryHeapNode BinaryHeapNode;

    27

struct BinaryHeapNode {

    28

	void* item;

    29

	int priority;

    30

};

    31

    32

    33

struct Queue{

    34

	/*

    35

	 * Pushes an element into the queue, at the appropriate place for the queue.

    36

	 * Requires the queue pointer to be of an appropriate type, of course.

    37

	 */

    38

	Queue_PushProc* push;

    39

	/*

    40

	 * Pops the first element from the queue. What exactly is the first element,

    41

	 * is defined by the exact type of queue.

    42

	 */

    43

	Queue_PopProc* pop;

    44

	/*

    45

	 * Deletes the item from the queue. priority should be specified if

    46

	 * known, which speeds up the deleting for some queue's. Should be -1

    47

	 * if not known.

    48

	 */

    49

	Queue_DeleteProc* del;

    50

    51

	/* Clears the queue, by removing all values from it. It's state is

    52

	 * effectively reset. If free_items is true, each of the items cleared

    53

	 * in this way are free()'d.

    54

	 */

    55

	Queue_ClearProc* clear;

    56

	/* Frees the queue, by reclaiming all memory allocated by it. After

    57

	 * this it is no longer usable. If free_items is true, any remaining

    58

	 * items are free()'d too.

    59

	 */

    60

	Queue_FreeProc* free;

    61

    62

	union {

    63

		struct {

    64

			InsSortNode* first;

    65

		} inssort;

    66

		struct {

    67

			uint max_size;

    68

			uint size;

    69

			uint blocks; /* The amount of blocks for which space is reserved in elements */

    70

			BinaryHeapNode** elements;

    71

		} binaryheap;

    72

	} data;

    73

};

    74

    75

    76

/*

    77

 * Insertion Sorter

    78

 */

    79

    80

/* Initializes a inssort and allocates internal memory. There is no maximum

    81

 * size */

    82

void init_InsSort(Queue* q);

    83

    84

    85

/*

    86

 *  Binary Heap

    87

 *  For information, see:

    88

 *   http://www.policyalmanac.org/games/binaryHeaps.htm

    89

 */

    90

    91

/* The amount of elements that will be malloc'd at a time */

    92

#define BINARY_HEAP_BLOCKSIZE_BITS 10

    93

    94

/* Initializes a binary heap and allocates internal memory for maximum of

    95

 * max_size elements */

    96

void init_BinaryHeap(Queue* q, uint max_size);

    97

    98

    99

/*

   100

 * Hash

   101

 */

   102

typedef struct HashNode HashNode;

   103

struct HashNode {

   104

	uint key1;

   105

	uint key2;

   106

	void* value;

   107

	HashNode* next;

   108

};

   109

/**

   110

 * Generates a hash code from the given key pair. You should make sure that

   111

 * the resulting range is clearly defined.

   112

 */

   113

typedef uint Hash_HashProc(uint key1, uint key2);

   114

typedef struct Hash {

   115

	/* The hash function used */

   116

	Hash_HashProc* hash;

   117

	/* The amount of items in the hash */

   118

	uint size;

   119

	/* The number of buckets allocated */

   120

	uint num_buckets;

   121

	/* A pointer to an array of num_buckets buckets. */

   122

	HashNode* buckets;

   123

	/* A pointer to an array of numbuckets booleans, which will be true if

   124

	 * there are any Nodes in the bucket */

   125

	bool* buckets_in_use;

   126

} Hash;

   127

   128

/* Call these function to manipulate a hash */

   129

   130

/* Deletes the value with the specified key pair from the hash and returns

   131

 * that value. Returns NULL when the value was not present. The value returned

   132

 * is _not_ free()'d! */

   133

void* Hash_Delete(Hash* h, uint key1, uint key2);

   134

/* Sets the value associated with the given key pair to the given value.

   135

 * Returns the old value if the value was replaced, NULL when it was not yet present. */

   136

void* Hash_Set(Hash* h, uint key1, uint key2, void* value);

   137

/* Gets the value associated with the given key pair, or NULL when it is not

   138

 * present. */

   139

void* Hash_Get(const Hash* h, uint key1, uint key2);

   140

   141

/* Call these function to create/destroy a hash */

   142

   143

/* Builds a new hash in an existing struct. Make sure that hash() always

   144

 * returns a hash less than num_buckets! Call delete_hash after use */

   145

void init_Hash(Hash* h, Hash_HashProc* hash, uint num_buckets);

   146

/*

   147

 * Deletes the hash and cleans up. Only cleans up memory allocated by new_Hash

   148

 * & friends. If free is true, it will call free() on all the values that

   149

 * are left in the hash.

   150

 */

   151

void delete_Hash(Hash* h, bool free_values);

   152

/*

   153

 * Cleans the hash, but keeps the memory allocated

   154

 */

   155

void clear_Hash(Hash* h, bool free_values);

   156

/*

   157

 * Gets the current size of the Hash

   158

 */

   159

uint Hash_Size(const Hash* h);

   160

   161

#endif /* QUEUE_H */