Category : OS/2 Files
Archive   : GPPDEV8F.ZIP
Filename : VQUEUE.HP

// This may look like C code, but it is really -*- C++ -*-
/*
Copyright (C) 1988 Free Software Foundation
written by Doug Lea ([email protected])

This file is part of the GNU C++ Library. This library is free
software; you can redistribute it and/or modify it under the terms of
the GNU Library General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version. This library is distributed in the hope
that it will be useful, but WITHOUT ANY WARRANTY; without even the
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the GNU Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free Software
Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/


#ifndef _VQueue_h
#ifdef __GNUG__
#pragma interface
#endif
#define _VQueue_h 1

#include ".Queue.h"

class VQueue : public Queue
{
protected:
int size;
int cnt;
int inp;
int outp;
* s;

public:

VQueue(int sz = DEFAULT_INITIAL_CAPACITY);
VQueue(VQueue&);
~VQueue();

void operator = (VQueue&);

void enq( item);
deq();
& front();
void del_front();

int length();
int empty();
int full();

int capacity();
void resize(int sz);
void clear();

int OK();
};


inline VQueue::VQueue(int sz)
{
s = new [size = sz];
cnt = inp = outp = 0;
}

inline VQueue::~VQueue()
{
delete [] s;
}

inline void VQueue::clear()
{
inp = outp = 0;
cnt = 0;
}

inline int VQueue::empty()
{
return cnt <= 0;
}

inline int VQueue::capacity()
{
return size;
}

inline int VQueue::full()
{
return cnt >= size;
}

inline int VQueue::length()
{
return cnt;
}

inline void VQueue::enq( item)
{
if (cnt >= size) error("enq to full Queue.");
++cnt;
s[inp] = item;
if (++inp == size) inp = 0;
}

inline VQueue::deq()
{
if (cnt <= 0) error("deq from empty Queue.");
--cnt;
int i = outp;
if (++outp == size) outp = 0;
return s[i];
}


inline void VQueue::del_front()
{
if (cnt <= 0) error("delete from empty Queue.");
--cnt;
if (++outp == size) outp = 0;
}

inline & VQueue::front()
{
if (empty()) error("top from empty Queue.");
return s[outp];
}

#endif