// 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)
based on code by Marc Shapiro (shapiro@sor.inria.fr)
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.
csize = DEFAULT_INITIAL_CAPACITY;
<T>* data = new <T>[csize];
hd = new <T>IChunk(data, lo, lo, fnc, csize);
<T>FPlex:: <T>FPlex(int maxsize)
if (maxsize == 0) error("invalid constructor specification");
<T>* data = new <T>[csize];
hd = new <T>IChunk(data, lo, lo, fnc, csize);
<T>* data = new <T>[csize];
hd = new <T>IChunk(data, maxsize, lo, fnc, fnc);
<T>FPlex:: <T>FPlex(int l, int maxsize)
if (maxsize == 0) error("invalid constructor specification");
<T>* data = new <T>[csize];
hd = new <T>IChunk(data, lo, lo, fnc, csize+lo);
<T>* data = new <T>[csize];
hd = new <T>IChunk(data, maxsize+lo, lo, fnc, fnc);
<T>FPlex:: <T>FPlex(int l, int hi, const <T&> initval, int maxsize)
<T>* data = new <T>[csize];
hd = new <T>IChunk(data, lo, lo, fnc, csize);
<T>* data = new <T>[csize];
hd = new <T>IChunk(data, -csize, lo, fnc, fnc);
<T>FPlex::<T>FPlex(const <T>FPlex& a)
if (csize < a.csize) csize = a.csize;
<T>* data = new <T> [csize];
hd = new <T>IChunk(data, lo, lo, fnc, lo+csize);
for (int i = a.low(); i < a.fence(); a.next(i)) (*this)[i] = a[i];
void <T>FPlex::operator= (const <T>FPlex& a)
if (csize < a.csize) csize = a.csize;
<T>* data = new <T> [csize];
hd = new <T>IChunk(data, lo, lo, fnc, lo+csize);
for (int i = a.low(); i < a.fence(); a.next(i)) (*this)[i] = a[i];
void <T>FPlex::fill(const <T&> x)
for (int i = lo; i < fnc; ++i) (*this)[i] = x;
void <T>FPlex::fill(const <T&> x, int lo, int hi)
for (int i = lo; i <= hi; ++i) (*this)[i] = x;
int <T>FPlex::OK () const
int v = hd != 0; // hd exists
v &= hd-><T>IChunk::OK(); // and is OK
v &= fnc - lo <= hd->size(); // and has enough space
v &= lo <= fnc; // plex indices consistent
v &= lo == hd->low_index(); // and match those
v &= fnc == hd->fence_index(); // of chunk
v &= one_chunk(); // and only one chunk
if (!v) error("invariant failure");