// 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 GNU CC.
GNU CC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY. No author or distributor
accepts responsibility to anyone for the consequences of using it
or for whether it serves any particular purpose or works at all,
unless he says so in writing. Refer to the GNU CC General Public
License for full details.
Everyone is granted permission to copy, modify and redistribute
GNU CC, but only under the conditions described in the
GNU CC General Public License. A copy of this license is
supposed to have been given to you along with GNU CC so you
can know your rights and responsibilities. It should be in a
file named COPYING. Among other things, the copyright notice
and this notice must be preserved on all copies.
class <T>XPlex: public <T>Plex
<T>IChunk* ch; // cached chunk
void make_initial_chunks(int up = 1);
void cache(int idx) const;
void cache(const <T>* p) const;
<T>* dopred(const <T>* p) const;
<T>* dosucc(const <T>* p) const;
void set_cache(const <T>IChunk* t) const; // logically,
<T>XPlex(); // set low = 0;
<T>XPlex(int ch_size); // low = 0;
<T>XPlex(int lo, // low = lo;
int ch_size); // fence=lo
<T>XPlex(int lo, // low = lo
const <T&> initval,// fill with initval,
int ch_size = 0); // csize= ch_size
<T>XPlex(const <T>XPlex&);
void operator= (const <T>XPlex&);
const <T>& high_element () const;
const <T>& low_element () const;
void prev(Pix& ptr) const;
void next(Pix& ptr) const;
<T>& operator () (Pix p);
const <T>& operator () (Pix p) const;
int valid(int idx) const;
void prev(int& idx) const;
<T>& operator [] (int index);
const <T>& operator [] (int index) const;
int Pix_to_index(Pix p) const;
Pix index_to_Pix(int idx) const;
int can_add_high() const;
int add_high(const <T&> elem);
int add_low (const <T&> elem);
void fill(const <T&> x, int from, int to);
void append(const <T>XPlex& a);
void prepend(const <T>XPlex& a);
#if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES)
inline void <T>XPlex::prev(int& idx) const
inline void <T>XPlex::next(int& idx) const
inline int <T>XPlex::full () const
inline int <T>XPlex::can_add_high() const
inline int <T>XPlex::can_add_low() const
inline int <T>XPlex::valid (int idx) const
return idx >= lo && idx < fnc;
inline int <T>XPlex::low() const
inline int <T>XPlex::high() const
inline <T>& <T>XPlex:: operator [] (int idx)
if (!ch->actual_index(idx)) cache(idx);
return *(ch->pointer_to(idx));
inline const <T>& <T>XPlex:: operator [] (int idx) const
if (!ch->actual_index(idx)) cache(idx);
return *((const <T>*)(ch->pointer_to(idx)));
inline <T>& <T>XPlex::low_element ()
if (empty()) index_error();
return *(hd->pointer_to(lo));
inline const <T>& <T>XPlex::low_element () const
if (empty()) index_error();
return *((const <T>*)(hd->pointer_to(lo)));
inline <T>& <T>XPlex::high_element ()
if (empty()) index_error();
return *(tl()->pointer_to(fnc - 1));
inline const <T>& <T>XPlex::high_element () const
if (empty()) index_error();
return *((const <T>*)(tl()->pointer_to(fnc - 1)));
inline int <T>XPlex::Pix_to_index(Pix px) const
if (!ch->actual_pointer(p)) cache(p);
inline Pix <T>XPlex::index_to_Pix(int idx) const
if (!ch->actual_index(idx)) cache(idx);
return (Pix)(ch->pointer_to(idx));
inline Pix <T>XPlex::first() const
return Pix(hd-><T>IChunk::first_pointer());
inline Pix <T>XPlex::last() const
return Pix(tl()-><T>IChunk::last_pointer());
inline void <T>XPlex::prev(Pix& p) const
Pix q = Pix(ch-><T>IChunk::pred((<T>*) p));
p = (q == 0)? Pix(dopred((const <T>*) p)) : q;
inline void <T>XPlex::next(Pix& p) const
Pix q = Pix(ch-><T>IChunk::succ((<T>*) p));
p = (q == 0)? Pix(dosucc((const <T>*)p)) : q;
inline <T>& <T>XPlex:: operator () (Pix p)
inline const <T>& <T>XPlex:: operator () (Pix p) const
inline void <T>XPlex::set_cache(const <T>IChunk* t) const
((<T>XPlex*)(this))->ch = (<T>IChunk*)t;