void queueGet (tQueue* q, char* c) {
/*
** Odstraní znak ze zaèátku fronty a vrátí ho prostøednictvím parametru c.
** Pokud je fronta prázdná, o¹etøete to voláním funkce queueError(QERR_GET).
**
** Pøi implementaci vyu¾ijte døíve definovaných funkcí queueEmpty,
** queueFront a queueRemove.
*/
if (queueEmpty(q))
{
queueError(QERR_GET);
return;
}
queueFront(q, c); /* c bude ukazova» na prvý znak fronty */
queueRemove(q); /* Index prvého prvku sa posunie na nasledujúci */
}
void queueGet (tQueue* q, char* c) {
/*
** Odstraní znak ze zaèátku fronty a vrátí ho prostøednictvím parametru c.
** Pokud je fronta prázdná, o¹etøete to voláním funkce queueError(QERR_GET).
**
** Pøi implementaci vyu¾ijte døíve definovaných funkcí queueEmpty,
** queueFront a queueRemove.
*/
if(queueEmpty(q)){ // Zkontroluj, zda-li neni fronte prazdna
queueError(QERR_GET); // Vyhod chybovou hlasku
return; // Ukonci
}
queueFront(q, c); // Vrat znak
queueRemove(q); // A odstran ho
}
void queueGet (tQueue* q, char* c) {
/*
** Odstraní znak ze zaèátku fronty a vrátí ho prostøednictvím parametru c.
** Pokud je fronta prázdná, o¹etøete to voláním funkce queueError(QERR_GET).
**
** Pøi implementaci vyu¾ijte døíve definovaných funkcí queueEmpty,
** queueFront a queueRemove.
*/
if(queueEmpty(q) == 0) //fronta nie je prazdna
{
queueFront(q, c); //najprv vratime znak
queueRemove(q); //potom odstranime
}
else //fronta je prazdna
{
queueError(QERR_GET);
}
}
void queueGet (tQueue* q, char* c) {
/*
** Odstran znak ze zatku fronty a vrt ho prostednictvm parametru c.
** Pokud je fronta przdn, oetete to volnm funkce queueError(QERR_GET).
**
** Pi implementaci vyuijte dve definovanch funkc queueEmpty,
** queueFront a queueRemove.
*/
if(queueEmpty(q) == 0)
{
queueFront(q, c);
queueRemove(q);
}
else
{
queueError(QERR_GET);
}
}
int main( void )
{
QUEUE *queue;
QUEUE_NODE *queueNode;
void* dataInPtr;
void* dataOutPtr;
int queue_status;
int queue_element_count;
queue = createQueue ();
//a.print queue status, Empty
printf("Test Case(a) : Print queue status, Empty\n\n");
queue_status = emptyQueue(queue);
if(queue_status == 1)
{
printf("queue status : Empty\n");
}
else
{
printf("queue status : not empty\n");
}
printf("\n\n");
//b.Dequeue and print data. Should return error
printf("Test Case(b) : Dequeue and print data\n\n");
dequeue( queue, &dataOutPtr );
printf("\n\n");
//c. Enqueue data into queue
printf("Test Case(c) : Enqueue data into queue : Ann\n\n");
dataInPtr = (char*)calloc((strlen("Ann")+1), sizeof(char) );
strcpy(dataInPtr, "Ann");
enqueue( queue, dataInPtr);
//d. Enqueue data into queue
printf("Test Case(d) : Enqueue data into queue : Bob\n\n");
dataInPtr = (char*)calloc(strlen("Bob")+1, sizeof(char) );
strcpy(dataInPtr, "Bob");
enqueue( queue, dataInPtr);
//e.Print queue status, Empty
printf("Test Case(e) : Print queue status, Empty\n\n");
queue_status = emptyQueue(queue);
if(queue_status == 1)
{
printf("queue status : Empty\n");
}
else
{
printf("queue status : not empty\n");
}
printf("\n\n");
//f.Print queue status, Full
printf("Test Case(f) : Print queue status, Full\n\n");
queue_status = fullQueue( queue );
if(queue_status == 1)
{
printf("queue status : Full\n");
}
else
{
printf("queue status : not full\n");
}
printf("\n\n");
//g. Print data at the front
printf("Test Case(g) : Print data at the front\n\n");
queueFront ( queue, &dataOutPtr );
printf("Data at the queue front is : %s\n", queue->front->dataPtr);
printf("\n\n");
//h. Print data at the rear
printf("Test Case(h) : Print data at the rear\n\n");
queueRear ( queue, &dataOutPtr );
printf("Data at the queue rear is : %s\n", queue->rear->dataPtr);
printf("\n\n");
//i. Print entire queue
printf("Test Case(i) : Print entire queue\n\n");
printf("The entire queue is : ");
queueNode = queue->front;
while(queueNode != NULL)
{
printf("%s ", queueNode->dataPtr);
queueNode = queueNode->link;
}
printf("\n\n");
//j.Print number of element in queue
printf("Test Case(j) : Print number of element in queue\n\n");
queue_element_count = queueCount( queue );
printf("total no of element in queue is %d\n", queue_element_count);
printf("\n\n");
//k.Dequeue and print data
printf("Test Case(k) : Dequeue and print data\n\n");
dequeue( queue, &dataOutPtr );
printf("after dequeueing we got : %s\n", dataOutPtr);
free(dataOutPtr);
printf("\n\n");
//l.Dequeue and print data
printf("Test Case(l) : Dequeue and print data\n\n");
dequeue( queue, &dataOutPtr );
printf("after dequeueing we got : %s\n", dataOutPtr);
free(dataOutPtr);
printf("\n\n");
//m.Dequeue and print data
printf("Test Case(m) : Dequeue and print data\n\n");
dequeue( queue, &dataOutPtr );
printf("\n\n");
//n. Enqueue data into queue
printf("Test Case(n) : Enqueue and print data : Dan\n\n");
dataInPtr = (char*)calloc(strlen("Dan")+1, sizeof(char) );
strcpy(dataInPtr, "Dan");
enqueue( queue, dataInPtr );
//o. Print data at the front
printf("Test Case(o) : Print data at the front\n\n");
queueFront ( queue, &dataOutPtr );
printf("Data at the queue front is : %s\n", queue->front->dataPtr);
printf("\n\n");
//p. Print data at the rear
printf("Test Case(p) : Print data at the rear\n\n");
queueRear ( queue, &dataOutPtr );
printf("Data at the queue rear is : %s\n", queue->rear->dataPtr);
printf("\n\n");
//q. Enqueue data into queue
printf("Test Case(q) : Enqueue data into queue : Tom\n\n");
dataInPtr = (char*)calloc(strlen("Tom")+1, sizeof(char) );
strcpy(dataInPtr, "Tom");
enqueue( queue, dataInPtr );
//r. print data at the front
printf("Test Case(r) : Print data at the front\n\n");
queueFront( queue, &dataOutPtr );
printf("Data at the queue front is : %s\n", queue->front->dataPtr);
printf("\n\n");
//s. Print data at the rear
printf("Test Case(s) : Print data at the rear\n\n");
queueRear ( queue, &dataOutPtr );
printf("Data at the queue rear is : %s\n", queue->rear->dataPtr);
printf("\n\n");
//t. Destroy queue and quit
printf("Test Case(t) : Destroy queue and quit\n\n");
destroyQueue( queue );
#ifdef _MSC_VER
printf( _CrtDumpMemoryLeaks() ? "Memory Leak\n" : "No Memory Leak\n");
#endif
system("pause");
return 0;
}
int qFront(Queue *q)
{
clearScreen();
printBill(queueFront(q));
wait();
}
