QueueADT.c

// QueuePADT.c
                        /*ÕËÏÐÏÉÇÓÇ ÏÕÑÁÓ ÄÕÍÁÌÉÊÁ ÌÅ ÄÅÉÊÔÅÓ*/
                        
#include <stdio.h>
#include <stdlib.h>
#include "QueueADT.h"

void CreateQ(QueueType *Queue)
/* Ëåéôïõñãßá: Äçìéïõñãåß ìéá êåíÞ óõíäåäåìÝíç ïõñÜ. 
   ÅðéóôñÝöåé: Ìéá êåíÞ óõíäåäåìÝíç ïõñÜ 
*/
{
	Queue->Front = NULL;
	Queue->Rear = NULL;
}

boolean EmptyQ(QueueType Queue)
/* ÄÝ÷åôáé:    Ìéá óõíäåäåìÝíç ïõñÜ. 
   Ëåéôïõñãßá: ÅëÝã÷åé áí ç óõíäåäåìÝíç ïõñÜ åßíáé êåíÞ. 
   ÅðéóôñÝöåé: True áí ç ïõñÜ åßíáé êåíÞ, false  äéáöïñåôéêÜ 
*/
{
	return (Queue.Front==NULL);
}

void AddQ(QueueType *Queue, QueueElementType Item)
/* ÄÝ÷åôáé:    Ìéá óõíäåäåìÝíç ïõñÜ Queue êáé Ýíá  óôïé÷åßï Item.
   Ëåéôïõñãßá: ÐñïóèÝôåé ôï óôïé÷åßï Item óôï ôÝëïò ôçò óõíäåäåìÝíçò ïõñÜò Queue.
   ÅðéóôñÝöåé: Ôçí ôñïðïðïéçìÝíç ïõñÜ
*/
{
	QueuePointer TempPtr;

    TempPtr= (QueuePointer)malloc(sizeof(struct QueueNode));
    TempPtr->Data = Item; 
    TempPtr->Next = NULL;
    if (Queue->Front==NULL) 
        Queue->Front=TempPtr;
    else
        Queue->Rear->Next = TempPtr;
    Queue->Rear=TempPtr;
}

void RemoveQ(QueueType *Queue, QueueElementType *Item)
/* ÄÝ÷åôáé:    Ìéá óõíäåäåìÝíç ïõñÜ. 
   Ëåéôïõñãßá: Áöáéñåß ôï óôïé÷åßï Item áðü ôçí  êïñõöÞ ôçò óõíäåäåìÝíçò ïõñÜò, 
                áí äåí åßíáé  êåíÞ. 
   ÅðéóôñÝöåé: Ôï óôïé÷åßï Item êáé ôçí ôñïðïðïéçìÝíç óõíäåäåìÝíç ïõñÜ. 
   ¸îïäïò:     ÌÞíõìá êåíÞò ïõñÜò, áí ç ïõñÜ åßíáé  êåíÞ 
*/
{
    QueuePointer TempPtr;
    
    if (EmptyQ(*Queue)) {
   	    printf("EMPTY Queue\n");
    }
   else
   {
        TempPtr = Queue->Front;
        *Item=TempPtr->Data;
        Queue->Front = Queue->Front->Next;     
        free(TempPtr);
        if (Queue->Front==NULL) Queue->Rear=NULL;
    }   
}