#include <stdio.h>
#include <stdlib.h>
#include "QueueInt.h"

Queue newQueue() {
  return NULL;
}

int deQueue(Queue *qPtr){
  if ((*qPtr)!=NULL) {
    QueueNode* aux = *qPtr;
    int val = (*qPtr)->val;
    (*qPtr) = aux->next;
    free(aux);
    return val;
  } else {
    fprintf(stderr,"deQueue numa fila vazia");
    exit(1);
    return 0;
  }
}
    

void enQueue(Queue *qPtr, int v){
  QueueNode* aux;
  aux = (QueueNode*) malloc(sizeof(QueueNode));
  aux->val = v;
  aux->next = NULL;

  if ((*qPtr)==NULL) {
    (*qPtr) = aux;
  } else {
    QueueNode* aux2;
    for (aux2 = *qPtr; aux2->next != NULL; aux2=aux2->next);
    aux2->next = aux;
  }
}


bool isEmptyQueue(Queue q){
  return (q==NULL);
}


void printQueue(Queue q){
  QueueNode* aux;
  for (aux=q; aux!=NULL; aux=aux->next)
    printf(" %d ,",aux->val);
  printf("\n");
}