Category : OS/2 Files
Archive   : GPPDEV8F.ZIP
Filename : RPLEX.HP
/*
Copyright (C) 1988 Free Software Foundation
written by Doug Lea ([email protected])
based on code by Marc Shapiro ([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 _
#ifdef __GNUG__
#pragma interface
#endif
#define _
#include "
// minimum number of chunks to index
#ifndef MIN_NCHUNKS
#define MIN_NCHUNKS 16
#endif
class
{
int base; // base index of lowest chunk
int lch; // index of lowest used chunk
int fch; // 1 + index of highest used chunk
int maxch; // max chunks in array
void make_initial_chunks(int up = 1);
void cache(int idx) const;
void cache(const
void set_cache(const
// not physically const
public:
// fence = 0;
// csize = default
// fence = 0;
// csize = ch_size
int ch_size); // fence=lo
// csize = ch_size
int hi, // fence = hi+1
const
int ch_size = 0); // csize= ch_size
// or fence-lo if 0
~
void operator= (const
// virtuals
const
const
Pix first() const;
Pix last() const;
void prev(Pix& ptr) const;
void next(Pix& ptr) const;
int owns(Pix p) const;
const
int low() const;
int high() const;
int valid(int idx) const;
void prev(int& idx) const;
void next(int& x) const;
const
int Pix_to_index(Pix p) const;
Pix index_to_Pix(int idx) const;
int can_add_high() const;
int can_add_low() const;
int full() const;
int add_high(const
int del_high ();
int add_low (const
int del_low ();
void fill(const
void fill(const
void clear();
void reverse();
int reset_low(int newlow);
int OK () const;
};
inline void
{
--idx;
}
inline void
{
++idx;
}
inline int
{
return 0;
}
inline int
{
return 1;
}
inline int
{
return 1;
}
inline int
{
return idx >= lo && idx < fnc;
}
inline int
{
return lo;
}
inline int
{
return fnc - 1;
}
inline void
{
((
}
inline void
{
if (idx < lo || idx >= fnc) index_error();
set_cache(chunks[(idx - base) / csize]);
}
inline
{
cache(lo); return *(ch->pointer_to(lo));
}
inline
{
cache(fnc-1); return *(ch->pointer_to(fnc - 1));
}
inline const
{
cache(lo); return *((const
}
inline const
{
cache(fnc-1); return *((const
}
inline int
{
if (!ch->actual_pointer(p)) cache(p);
return ch->index_of(p);
}
inline Pix
{
if (!ch->actual_index(idx)) cache(idx);
return (Pix)(ch->pointer_to(idx));
}
inline Pix
{
return Pix(hd->
}
inline Pix
{
return Pix(tl()->
}
inline void
{
Pix q = Pix(ch->
p = (q == 0)? Pix(dopred((
}
inline void
{
Pix q = Pix(ch->
p = (q == 0)? Pix(dosucc((
}
inline
{
return *((
}
inline
{
cache(idx); return *(ch->pointer_to(idx));
}
inline const
{
return *((const
}
inline const
{
cache(idx); return *((const
}
inline
{
delete chunks;
}
#endif
Very nice! Thank you for this wonderful archive. I wonder why I found it only now. Long live the BBS file archives!
This is so awesome! 😀 I’d be cool if you could download an entire archive of this at once, though.
But one thing that puzzles me is the “mtswslnkmcjklsdlsbdmMICROSOFT” string. There is an article about it here. It is definitely worth a read: http://www.os2museum.com/wp/mtswslnk/