int main(void){
register guint i;
register PQueueSet *pq_set = PQueueSet_create();
register PQueue *pq = PQueue_create(pq_set, test_comp_low_int,
NULL);
register Data *dn;
PQueue_Node *acc[DATA_TOTAL];
Data data[DATA_TOTAL] = {
{ "REMOVE-1", -1, 300, 200, 50},
{ "jumps", -1, 39, 38, 32}, { "dog", -1, 72, 61, 60},
{ "brown", -1, 99, 40, 8}, { "over", -1, 68, 35, 33},
{ "REMOVE-2", -1, 25, 20, 15},
{ "fox", -1, 20, 19, 17}, { "quick", -1, 99, 19, 3},
{ "lazy", -1, 99, 67, 51}, { "the", -1, 3, 2, 1},
{ "a", -1, 82, 41, 34},
{ "REMOVE-3", -1, 40, 30, 20}
};
gint r[3] = {0, 5, 11};
gchar *answer[DATA_TOTAL-3] = {
"the", "quick", "brown", "fox", "jumps",
"over", "a", "lazy", "dog"};
g_print("Adding words with initial priorities\n");
for(i = 0; i < DATA_TOTAL; i++){
g_print("Adding [%s]\n", data[i].word);
data[i].real_priority = data[i].priority1;
acc[i] = PQueue_push(pq, (gpointer)&data[i]);
}
g_print("Set intermediate priorities\n");
for(i = 0; i < DATA_TOTAL; i++){
g_print("Raising [%s] from %d to %d\n",
data[i].word, data[i].priority1, data[i].priority2);
data[i].real_priority = data[i].priority2;
PQueue_raise(pq, acc[i]);
}
g_print("Set final priorities\n");
for(i = 0; i < DATA_TOTAL; i++){
g_print("Raising [%s] from %d to %d\n",
data[i].word, data[i].priority2, data[i].priority3);
data[i].real_priority = data[i].priority3;
PQueue_raise(pq, acc[i]);
}
g_print("Testing traverse\n");
PQueue_traverse(pq, test_traverse_func, NULL);
for(i = 0; i < 3; i++){
g_print("Testing remove of \"%s\"\n", data[r[i]].word);
PQueue_remove(pq, acc[r[i]]);
g_print("Testing traverse\n");
PQueue_traverse(pq, test_traverse_func, NULL);
}
g_print("Popping data\n");
for(i = 0; i < (DATA_TOTAL-3); i++){
dn = PQueue_pop(pq);
g_print("Word: [%s] Answer: [%s]\n", dn->word, answer[i]);
g_assert(!strcmp(dn->word, answer[i]));
}
PQueue_destroy(pq, NULL, NULL);
PQueueSet_destroy(pq_set);
return 0;
}
void JobQueue_destroy(JobQueue *jq){
#ifdef USE_PTHREADS
g_assert(!PQueue_total(jq->pq));
PQueue_destroy(jq->pq, JobQueue_Task_free_func, NULL);
PQueueSet_destroy(jq->pq_set);
pthread_mutex_destroy(&jq->queue_lock);
g_free(jq->thread);
#endif /* USE_PTHREADS */
g_free(jq);
return;
}
PQueue *PQueue_create(PQueue_compare compare, PQueue_hash hash)
{
PQueue *p_queue = malloc(sizeof(PQueue));
check_mem(p_queue);
p_queue->heap = BHeap_create(PQueueNode_cmp, 10);
check_mem(p_queue->heap);
p_queue->map = Hashmap_create(compare, hash);
check_mem(p_queue->map);
return p_queue;
error:
if(p_queue) PQueue_destroy(p_queue);
return NULL;
}
