bool Stack::pop1(int &p)
{
if(!IsEmpty1())
{
p=s[top1--];
return true;
}
else
return false;
}
Event1* DeQueue1(Queue1 *pqueue,int arrivetime){
Event1 *pnode = pqueue->front;
if(IsEmpty1(pqueue)!=1&&pnode!=NULL)
{
pqueue->front = pnode->next;
pqueue->size--;
free(pnode);
if(pqueue->size==0)
pqueue->rear = NULL;
}
return pqueue->front;
}
void Stack::display1()
{
if(!IsEmpty1())
{
cout<<"\nStack values";
for(int i=top1;i>=0;i--)
cout<<" "<<s[i];
cout<<endl;
}
else
cout<<"\nStack is empty\n";
}
Event1* EnQueue1(Queue1 *pqueue, int arrivetime)
{
Event1 *pnode = malloc(sizeof(Event1*));
if(pnode != NULL)
{
pnode->arrivetime = arrivetime;
pnode->next = NULL;
if(IsEmpty1(pqueue))
{
pqueue->front = pnode;
}
else
{
pqueue->rear->next = pnode;
}
pqueue->rear = pnode;
pqueue->size++;
}
return pnode;
}
