/**
* Inserts the element with the specified priority into the
* priority queue and maintains the heap condition
* of the priority queue.
*
* This function has a time complexity of O(Log N),
* with N being the number of elements in the queue.
*
* @return int rc >= 0: The size of the queue.
* @return int rc < 0: An error, see pbl_errno:
*
* <BR>PBL_ERROR_OUT_OF_MEMORY - Out of memory.
*/
int pblPriorityQueueInsert( /* */
PblPriorityQueue * queue, /** The queue to use */
int priority, /** Priority of the element to be inserted */
void * element /** Element to be inserted to the queue */
)
{
// Add to the end of the queue
//
int rc = pblPriorityQueueAddLast(queue, priority, element);
if (rc > 1)
{
// Ensure the heap condition for the last entry
//
pblHeapEnsureCondition(queue, rc - 1);
}
return rc;
}
/*
* Test frame for the priorityQueue library
*
* This test frame calls the priorityQueue library,
* it does not have any parameters, it is meant for
* showing how to use the library and for debugging the
* priorityQueue library.
*/
int pblPriorityQueue_TestFrame( void )
{
int i;
int rc;
char * data;
/*
* The priority queue to be used below.
*/
PblPriorityQueue * priorityQueue;
/*
* Create a new priority queue.
*/
priorityQueue = pblPriorityQueueNew();
fprintf( stdout, "pblPriorityQueueNew() priorityQueue = %s\n",
priorityQueue ? "retptr" : "NULL" );
if( priorityQueue == NULL)
{
return -1;
}
/*
* Test if queue is empty.
*/
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
/*
* Insert the string "1" with a priority value of 1.
*/
rc = pblPriorityQueueInsert( priorityQueue, 1, "1" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 1, 1 ) rc = %d\n",
rc );
/*
* Insert the string "2" with a priority value of 2.
*/
rc = pblPriorityQueueInsert( priorityQueue, 2, "2" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 2, 2 ) rc = %d\n",
rc );
/*
* Insert the string "3" with a priority value of 3.
*/
rc = pblPriorityQueueInsert( priorityQueue, 3, "3" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 3, 3 ) rc = %d\n",
rc );
/*
* Insert the string "4" with a priority value of 4.
*/
rc = pblPriorityQueueInsert( priorityQueue, 4, "4" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 4, 4 ) rc = %d\n",
rc );
/*
* Insert the string "5" with a priority value of 5.
*/
rc = pblPriorityQueueInsert( priorityQueue, 5, "5" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 5, 5 ) rc = %d\n",
rc );
/*
* Retrieve the size of the queue, should be 5.
*/
rc = pblPriorityQueueSize( priorityQueue );
fprintf( stdout, "pblPriorityQueueSize( priorityQueue ) rc = %d\n", rc );
/*
* Test if queue is empty.
*/
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
/*
* Retrieve the value with the highest priority, should be "5" with priority 5.
*/
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
/*
* Remove the value with the highest priority, should be "5" with priority 5.
*/
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
/*
* Retrive and remove the entries one after another.
*/
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
/*
* Test if the queue is empty, should be true now!
*/
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
/*
* Insert the string "1" with a priority value of 1.
*/
rc = pblPriorityQueueInsert( priorityQueue, 1, "1" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 1, 1 ) rc = %d\n",
rc );
/*
* Insert the string "21" with a priority value of 2.
*/
rc = pblPriorityQueueInsert( priorityQueue, 2, "21" );
fprintf( stdout,
"pblPriorityQueueInsert( priorityQueue, 2, 21 ) rc = %d\n", rc );
/*
* Insert the string "22" with a priority value of 2, note this is a case of two entries having the same priority.
*/
rc = pblPriorityQueueInsert( priorityQueue, 2, "22" );
fprintf( stdout,
"pblPriorityQueueInsert( priorityQueue, 2, 22 ) rc = %d\n", rc );
/*
* Insert the string "23" with a priority value of 2, note this is a case of more than two entries having the same priority.
*/
rc = pblPriorityQueueInsert( priorityQueue, 2, "23" );
fprintf( stdout,
"pblPriorityQueueInsert( priorityQueue, 2, 23 ) rc = %d\n", rc );
/*
* Insert the string "24" with a priority value of 2, note this is a case of more than two entries having the same priority.
*/
rc = pblPriorityQueueInsert( priorityQueue, 2, "24" );
fprintf( stdout,
"pblPriorityQueueInsert( priorityQueue, 2, 24 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( priorityQueue, 2, "25" );
fprintf( stdout,
"pblPriorityQueueInsert( priorityQueue, 2, 25 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( priorityQueue, 3, "3" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 3, 3 ) rc = %d\n",
rc );
/*
* Retrieve the current capacity of the queue, i.e. the capacity of the underlying array list.
*/
rc = pblPriorityQueueGetCapacity( priorityQueue );
fprintf( stdout, "pblPriorityQueueGetCapacity( priorityQueue ) rc = %d\n",
rc );
/*
* Trim the queue to its current size.
*/
rc = pblPriorityQueueTrimToSize( priorityQueue );
fprintf( stdout, "pblPriorityQueueTrimToSize( priorityQueue ) rc = %d\n",
rc );
/*
* Retrieve the current capacity of the queue, i.e. the capacity of the underlying array list.
*/
rc = pblPriorityQueueGetCapacity( priorityQueue );
fprintf( stdout, "pblPriorityQueueGetCapacity( priorityQueue ) rc = %d\n",
rc );
/*
* Retrieve and then remove the entries one after another
*/
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
/*
* Test if queue is empty, should return false!
*/
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
/*
* Clear the queue.
*/
pblPriorityQueueClear( priorityQueue );
fprintf( stdout, "pblPriorityQueueClear( priorityQueue ) \n" );
/*
* Test if queue is empty, should return true!
*/
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
/*
* Make room for at least 9 entries. First step of construction a priority queue with O(N) steps!
*/
rc = pblPriorityQueueEnsureCapacity( priorityQueue, 9 );
fprintf( stdout,
"pblPriorityQueueEnsureCapacity( priorityQueue, 9 ) rc = %d\n", rc );
/*
* Add a total of 9 entries WITHOUT ensuring the heap condition.
*/
rc = pblPriorityQueueAddLast( priorityQueue, 1, "1" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 1, 1 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 2, "2" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 2, 2 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 3, "3" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 3, 3 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 4, "4" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 4, 4 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 5, "5a" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 5, 5a ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 5, "5b" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 5, 5b ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 6, "6" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 6, 6 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 7, "7" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 7, 7 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 8, "8" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 8, 8 ) rc = %d\n", rc );
/*
* Construct the priority queue with 9 elements.
*/
pblPriorityQueueConstruct( priorityQueue );
fprintf( stdout, "pblPriorityQueueConstruct( priorityQueue ) \n" );
/*
* Give out the entire queue, shows that the queue now fulfills the heap condition.
*/
for( i = 0; i < pblPriorityQueueSize( priorityQueue ); i++ )
{
data = (char*)pblPriorityQueueGet( priorityQueue, i, &rc );
fprintf(
stdout,
"pblPriorityQueueGet( priorityQueue, %d ), priority = %d, data = %s\n",
i, rc, data );
}
/*
* Remove a specific element from the queue, ensure the heap condition.
*/
data = (char*)pblPriorityQueueRemoveAt( priorityQueue, 3, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveAt( priorityQueue, 3, &prio ) rc = %d, data = %s\n",
rc, data );
/*
* Give out the entire queue.
*/
for( i = 0; i < pblPriorityQueueSize( priorityQueue ); i++ )
{
data = (char*)pblPriorityQueueGet( priorityQueue, i, &rc );
fprintf(
stdout,
"pblPriorityQueueGet( priorityQueue, %d ), priority = %d, data = %s\n",
i, rc, data );
}
/*
* Insert a specific element.
*/
rc = pblPriorityQueueInsert( priorityQueue, 4, "44" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 4, 4 ) rc = %d\n",
rc );
/*
* Give out the entire queue.
*/
for( i = 0; i < pblPriorityQueueSize( priorityQueue ); i++ )
{
data = (char*)pblPriorityQueueGet( priorityQueue, i, &rc );
fprintf(
stdout,
"pblPriorityQueueGet( priorityQueue, %d ), priority = %d, data = %s\n",
i, rc, data );
}
rc = pblPriorityQueueSize( priorityQueue );
fprintf( stdout, "pblPriorityQueueSize( priorityQueue ) rc = %d\n", rc );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
/*
* Change the priority of the first entry.
*/
rc = pblPriorityQueueChangePriorityFirst( priorityQueue, -1 );
fprintf(
stdout,
"pblPriorityQueueChangePriorityFirst( priorityQueue, -1 ) rc = %d\n",
rc );
/*
* Change the priority of the element back to its original value.
*/
rc = pblPriorityQueueChangePriorityAt( priorityQueue, rc, 8 );
fprintf(
stdout,
"pblPriorityQueueChangePriorityAt( priorityQueue, 4, 8 ) rc = %d\n",
rc );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
if( rc == 1 )
{
/*
* Create an 'other' queue for testing the join of two queues.
*/
PblPriorityQueue * other = pblPriorityQueueNew();
rc = pblPriorityQueueInsert( other, 1, "1" );
fprintf( stdout, "pblPriorityQueueInsert( other, 1, 1 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( other, 2, "2" );
fprintf( stdout, "pblPriorityQueueInsert( other, 2, 2 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( other, 3, "3" );
fprintf( stdout, "pblPriorityQueueInsert( other, 3, 3 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( other, 4, "4" );
fprintf( stdout, "pblPriorityQueueInsert( other, 4, 4 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( other, 5, "5" );
fprintf( stdout, "pblPriorityQueueInsert( other, 5, 5 ) rc = %d\n", rc );
/*
* Join all entries from 'other' to the main queue.
*/
rc = pblPriorityQueueJoin( priorityQueue, other );
fprintf( stdout,
"pblPriorityQueueJoin( priorityQueue, other ) rc = %d\n", rc );
/*
* Test of 'other' is empty after the join.
*/
rc = pblPriorityQueueIsEmpty( other );
fprintf( stdout, "pblPriorityQueueIsEmpty( other ) rc = %d\n", rc );
/*
* Free all memory of the other queue, delete the other queue!
*/
pblPriorityQueueFree( other );
fprintf( stdout, "pblPriorityQueueFree( other ) \n" );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
pblPriorityQueueClear( priorityQueue );
fprintf( stdout, "pblPriorityQueueClear( priorityQueue ) \n" );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n",
rc );
}
/*
* Free all memory of the queue, delete the queue!
*/
pblPriorityQueueFree( priorityQueue );
fprintf( stdout, "pblPriorityQueueFree( priorityQueue ) \n" );
return ( 0 );
}
/*
* test frame for the priorityQueue library
*
* this test frame calls the priorityQueue library,
* it does not have any parameters, it is meant for
* debugging the priorityQueue library
*/
int pblPriorityQueue_TestFrame( void )
{
PblPriorityQueue * priorityQueue;
int rc;
char * data;
priorityQueue = pblPriorityQueueNew();
fprintf( stdout, "pblPriorityQueueNew() priorityQueue = %s\n",
priorityQueue ? "retptr" : "null" );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( priorityQueue, 1, "1" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 1, 1 ) rc = %d\n",
rc );
rc = pblPriorityQueueInsert( priorityQueue, 2, "2" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 2, 2 ) rc = %d\n",
rc );
rc = pblPriorityQueueInsert( priorityQueue, 3, "3" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 3, 3 ) rc = %d\n",
rc );
rc = pblPriorityQueueInsert( priorityQueue, 4, "4" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 4, 4 ) rc = %d\n",
rc );
rc = pblPriorityQueueInsert( priorityQueue, 5, "5" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 5, 5 ) rc = %d\n",
rc );
rc = pblPriorityQueueSize( priorityQueue );
fprintf( stdout, "pblPriorityQueueSize( priorityQueue ) rc = %d\n", rc );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( priorityQueue, 1, "1" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 1, 1 ) rc = %d\n",
rc );
rc = pblPriorityQueueInsert( priorityQueue, 2, "21" );
fprintf( stdout,
"pblPriorityQueueInsert( priorityQueue, 2, 21 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( priorityQueue, 2, "22" );
fprintf( stdout,
"pblPriorityQueueInsert( priorityQueue, 2, 22 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( priorityQueue, 2, "23" );
fprintf( stdout,
"pblPriorityQueueInsert( priorityQueue, 2, 23 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( priorityQueue, 2, "24" );
fprintf( stdout,
"pblPriorityQueueInsert( priorityQueue, 2, 24 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( priorityQueue, 2, "25" );
fprintf( stdout,
"pblPriorityQueueInsert( priorityQueue, 2, 25 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( priorityQueue, 3, "3" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 3, 3 ) rc = %d\n",
rc );
rc = pblPriorityQueueGetCapacity( priorityQueue );
fprintf( stdout, "pblPriorityQueueGetCapacity( priorityQueue ) rc = %d\n",
rc );
rc = pblPriorityQueueTrimToSize( priorityQueue );
fprintf( stdout, "pblPriorityQueueTrimToSize( priorityQueue ) rc = %d\n",
rc );
rc = pblPriorityQueueGetCapacity( priorityQueue );
fprintf( stdout, "pblPriorityQueueGetCapacity( priorityQueue ) rc = %d\n",
rc );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
pblPriorityQueueClear( priorityQueue );
fprintf( stdout, "pblPriorityQueueClear( priorityQueue ) \n" );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
rc = pblPriorityQueueEnsureCapacity( priorityQueue, 9 );
fprintf( stdout,
"pblPriorityQueueEnsureCapacity( priorityQueue, 9 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 1, "1" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 1, 1 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 2, "2" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 2, 2 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 3, "3" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 3, 3 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 4, "4" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 4, 4 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 5, "5a" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 5, 5a ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 5, "5b" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 5, 5b ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 6, "6" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 6, 6 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 7, "7" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 7, 7 ) rc = %d\n", rc );
rc = pblPriorityQueueAddLast( priorityQueue, 8, "8" );
fprintf( stdout,
"pblPriorityQueueAddLast( priorityQueue, 8, 8 ) rc = %d\n", rc );
pblPriorityQueueConstruct( priorityQueue );
fprintf( stdout, "pblPriorityQueueConstruct( priorityQueue ) \n" );
for( rc = 0; rc < pblPriorityQueueSize( priorityQueue ); rc++ )
{
int priority;
data = (char*)pblPriorityQueueGet( priorityQueue, rc, &priority );
fprintf(
stdout,
"pblPriorityQueueGet( priorityQueue, %d ), priority = %d, data = %s\n",
rc, priority, data );
}
data = (char*)pblPriorityQueueRemoveAt( priorityQueue, 3, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveAt( priorityQueue, 3, &prio ) rc = %d, data = %s\n",
rc, data );
for( rc = 0; rc < pblPriorityQueueSize( priorityQueue ); rc++ )
{
int priority;
data = (char*)pblPriorityQueueGet( priorityQueue, rc, &priority );
fprintf(
stdout,
"pblPriorityQueueGet( priorityQueue, %d ), priority = %d, data = %s\n",
rc, priority, data );
}
rc = pblPriorityQueueInsert( priorityQueue, 4, "4" );
fprintf( stdout, "pblPriorityQueueInsert( priorityQueue, 4, 4 ) rc = %d\n",
rc );
for( rc = 0; rc < pblPriorityQueueSize( priorityQueue ); rc++ )
{
int priority;
data = (char*)pblPriorityQueueGet( priorityQueue, rc, &priority );
fprintf(
stdout,
"pblPriorityQueueGet( priorityQueue, %d ), priority = %d, data = %s\n",
rc, priority, data );
}
rc = pblPriorityQueueSize( priorityQueue );
fprintf( stdout, "pblPriorityQueueSize( priorityQueue ) rc = %d\n", rc );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
rc = pblPriorityQueueChangePriorityFirst( priorityQueue, -1 );
fprintf(
stdout,
"pblPriorityQueueChangePriorityFirst( priorityQueue, -1 ) rc = %d\n",
rc );
rc = pblPriorityQueueChangePriorityAt( priorityQueue, rc, 8 );
fprintf(
stdout,
"pblPriorityQueueChangePriorityAt( priorityQueue, 4, 8 ) rc = %d\n",
rc );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n", rc );
if( rc == 1 )
{
PblPriorityQueue * other = pblPriorityQueueNew();
rc = pblPriorityQueueInsert( other, 1, "1" );
fprintf( stdout, "pblPriorityQueueInsert( other, 1, 1 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( other, 2, "2" );
fprintf( stdout, "pblPriorityQueueInsert( other, 2, 2 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( other, 3, "3" );
fprintf( stdout, "pblPriorityQueueInsert( other, 3, 3 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( other, 4, "4" );
fprintf( stdout, "pblPriorityQueueInsert( other, 4, 4 ) rc = %d\n", rc );
rc = pblPriorityQueueInsert( other, 5, "5" );
fprintf( stdout, "pblPriorityQueueInsert( other, 5, 5 ) rc = %d\n", rc );
rc = pblPriorityQueueJoin( priorityQueue, other );
fprintf( stdout,
"pblPriorityQueueJoin( priorityQueue, other ) rc = %d\n", rc );
rc = pblPriorityQueueIsEmpty( other );
fprintf( stdout, "pblPriorityQueueIsEmpty( other ) rc = %d\n", rc );
pblPriorityQueueFree( other );
fprintf( stdout, "pblPriorityQueueFree( other ) \n" );
data = (char*)pblPriorityQueueGetFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueGetFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
data = (char*)pblPriorityQueueRemoveFirst( priorityQueue, &rc );
fprintf(
stdout,
"pblPriorityQueueRemoveFirst( priorityQueue, &prio ) rc = %d, data = %s\n",
rc, data );
pblPriorityQueueClear( priorityQueue );
fprintf( stdout, "pblPriorityQueueClear( priorityQueue ) \n" );
rc = pblPriorityQueueIsEmpty( priorityQueue );
fprintf( stdout, "pblPriorityQueueIsEmpty( priorityQueue ) rc = %d\n",
rc );
}
pblPriorityQueueFree( priorityQueue );
fprintf( stdout, "pblPriorityQueueFree( priorityQueue ) \n" );
return ( rc );
}
