queue1.cpp

来自「STRUCTURI DE DATE SI ALGORITMI」· C++ 代码 · 共 35 行

#include "queue1.h"
#include<conio.h>
#include<stdio.h>
#include<stdlib.h>

    void initQueue(Queue& Q){
       Q.head=Q.tail=0;
       }

   void putt(Queue& Q, Atom a){
     if((Q.head==1&&Q.tail==DIMMAX)||(Q.tail+1==Q.head)){
       printf("\nCOADA PLINA");
       exit(1);}
     else{
      Q.vect[Q.tail]=a;
       Q.tail++;
       }
       }

   Atom gett(Queue& Q){
      if(isEmptyt(Q)){
      printf("\nCOADA VIDA");
      exit(1);}
      else
      return(Q.vect[Q.head++]);
   }

  /* Atom front(Queue& Q)*/
   int isEmptyt(Queue& Q){
	if(Q.head==Q.tail)
	 return(1);
       else return(0);
       }