Data-Compression/Static_Huffman/priority_queue.h at master · luke-mao/Data-Compression · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#ifndef _PQ_H_
#define _PQ_H_


#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include "tree.h"
#include "util.h"


struct _PriorityQueue{
    int size;
    int count;
    TreeNode *queue;
};

typedef struct _PriorityQueue *PriorityQueue;


PriorityQueue PriorityQueueCreate(void);
PriorityQueue PriorityQueueDestroy(PriorityQueue);

// double the size every time
void PriorityQueueIncreaseSize(PriorityQueue);

int GetSize(PriorityQueue);
int GetCount(PriorityQueue);

bool IsPriorityQueueValid(PriorityQueue);
bool IsPriorityQueueFull(PriorityQueue);

void IncreaseCount(PriorityQueue);
void DecreaseCount(PriorityQueue);

void PriorityQueueInsertTreeNode(PriorityQueue, TreeNode);
TreeNode PriorityQueueGetTreeNode(PriorityQueue);

void PriorityQueueShow(PriorityQueue);


#endif