Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* Biblioteka sa implemntacijom ATP - red pomocu pokazivaca. */
- struct tclient{
- /* Osnovna struktura koja sadrzi podatke o pojedinom klijentu. */
- tClient label;
- tclient *next;
- };
- struct tQueue{
- /* Struktura koja sadrzi pokazivace na prvi i zadnji element u redu. */
- tclient *front, *rear;
- };
- typedef struct tclient *client;
- typedef struct tQueue *queue;
- client FrontQ(queue Q){
- /* Vraca element sa pocetka reda. */
- if(Q->front == Q->rear)
- return NULL;
- return Q->front->next;
- }
- client EnQueueQ(client El, queue Q){
- /* Umece novi element na kraj reda. */
- tclient *New = new tclient;
- memcpy(New, El, sizeof(tclient));
- Q->rear->next = New;
- Q->rear = New;
- }
- void DeQueueQ(queue Q){
- /* Uklanja element sa pocetka reda. */
- if(Q->front == Q->rear) return;
- tclient *temp;
- temp = Q->front;
- Q->front = Q->front->next;
- delete temp;
- }
- queue InitQ(){
- /* Inicijalizira prazan red. */
- tclient *head = new tclient;
- tQueue *Q = new tQueue;
- Q->front = head; Q->rear = head;
- return Q;
- }
- bool IsEmptyQ(queue Q){
- return Q->front == Q->rear;
- }
Add Comment
Please, Sign In to add comment