// This may look like C code, but it is really -*- C++ -*-
Copyright (C) 1988 Free Software Foundation
written by Doug Lea (dl@rocky.oswego.edu)
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.
<T>VQueue::<T>VQueue(<T>VQueue& b)
:size(b.size), cnt(b.cnt), inp(b.inp), outp(b.outp), s(new <T> [b.size])
for (int i = 0; i < cnt; ++i)
void <T>VQueue::operator = (<T>VQueue& b)
inp = b.inp; outp = b.outp; cnt = b.cnt;
for (int i = 0; i < cnt; ++i)
void <T>VQueue::resize(int newsz)
error("resize: new size too small");
<T>* news = new <T> [newsz];
for (int i = 0; i < cnt; ++i)
int v = s != 0; // have space
v &= size >= 0; // a legal size
v &= inp >= 0 && inp <= size; // pointers with bounds
v &= outp >= 0 && outp <= size;
int c = (size + inp - outp) % size;
v &= cnt == size || cnt == c; // correct count
if (!v) error("invariant failure");