Category : OS/2 Files
Archive   : GPPDEV8F.ZIP
Filename : SPLAYBAG.CCP
Output of file : SPLAYBAG.CCP contained in archive : GPPDEV8F.ZIP
/*
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.
*/
#ifdef __GNUG__
#pragma implementation
#endif
#include
#include "
/*
struct to simulate the special `null' node in the Sleater & Tarjan JACM 1985
splay tree algorithms
All routines use a version of their `simple top-down' splay alg. (p 669)
*/
struct _dummySplayNode
{
} _dummy_null;
/*
traversal primitives
*/
{
if (t != 0) while (t->lt != 0) t = t->lt;
return t;
}
{
if (t != 0) while (t->rt != 0) t = t->rt;
return t;
}
{
if (t == 0)
return 0;
if (t->rt != 0)
{
t = t->rt;
while (t->lt != 0) t = t->lt;
return t;
}
else
{
for (;;)
{
if (t->par == 0 || t == t->par->lt)
return t->par;
else
t = t->par;
}
}
}
{
if (t == 0)
return 0;
else if (t->lt != 0)
{
t = t->lt;
while (t->rt != 0) t = t->rt;
return t;
}
else
{
for (;;)
{
if (t->par == 0 || t == t->par->rt)
return t->par;
else
t = t->par;
}
}
}
Pix
{
if (root == 0) return 0;
if (t != 0)
{
int cmp =
if (cmp == 0)
{
t = succ(t);
if (t != 0 &&
return Pix(t);
else
return 0;
}
else if (cmp < 0)
return 0;
}
t = root;
int comp =
if (comp == 0)
return Pix(t);
dummy->rt = dummy->lt = dummy->par = 0;
while (comp != 0)
{
if (comp > 0)
{
if (tr == 0)
break;
else
{
comp =
if (comp <= 0 || tr->rt == 0)
{
l->rt = t; t->par = l;
l = t;
t = tr;
if (comp >= 0)
break;
}
else
{
if ((t->rt = tr->lt) != 0) t->rt->par = t;
tr->lt = t; t->par = tr;
l->rt = tr; tr->par = l;
l = tr;
t = tr->rt;
comp =
}
}
}
else
{
if (tl == 0)
break;
else
{
comp =
if (comp >= 0 || tl->lt == 0)
{
r->lt = t; t->par = r;
r = t;
t = tl;
if (comp <= 0)
break;
}
else
{
if ((t->lt = tl->rt) != 0) t->lt->par = t;
tl->rt = t; t->par = tl;
r->lt = tl; tl->par = r;
r = tl;
t = tl->lt;
comp =
}
}
}
}
if ((r->lt = t->rt) != 0) r->lt->par = r;
if ((l->rt = t->lt) != 0) l->rt->par = l;
if ((t->lt = dummy->rt) != 0) t->lt->par = t;
if ((t->rt = dummy->lt) != 0) t->rt->par = t;
t->par = 0;
root = t;
if (comp != 0)
return 0;
else
{
l = pred(t);
while (l != 0 &&
return Pix(t);
}
}
int
{
int n = 0;
if (t != 0)
{
do
{
++n;
t = succ(t);
} while (t != 0 &&
}
return n;
}
Pix
{
++count;
if (t == 0)
{
root = newnode;
return Pix(root);
}
int comp =
dummy->rt = dummy->lt = dummy->par = 0;
int done = 0;
while (!done)
{
if (comp >= 0)
{
if (tr == 0)
{
tr = newnode;
comp = 0; done = 1;
}
else
comp =
if (comp <= 0)
{
l->rt = t; t->par = l;
l = t;
t = tr;
}
else
{
if (trr == 0)
{
trr = newnode;
comp = 0; done = 1;
}
else
comp =
if ((t->rt = tr->lt) != 0) t->rt->par = t;
tr->lt = t; t->par = tr;
l->rt = tr; tr->par = l;
l = tr;
t = trr;
}
}
else
{
if (tl == 0)
{
tl = newnode;
comp = 0; done = 1;
}
else
comp =
if (comp >= 0)
{
r->lt = t; t->par = r;
r = t;
t = tl;
}
else
{
if (tll == 0)
{
tll = newnode;
comp = 0; done = 1;
}
else
comp =
if ((t->lt = tl->rt) != 0) t->lt->par = t;
tl->rt = t; t->par = tl;
r->lt = tl; tl->par = r;
r = tl;
t = tll;
}
}
}
if ((r->lt = t->rt) != 0) r->lt->par = r;
if ((l->rt = t->lt) != 0) l->rt->par = l;
if ((t->lt = dummy->rt) != 0) t->lt->par = t;
if ((t->rt = dummy->lt) != 0) t->rt->par = t;
t->par = 0;
root = t;
return Pix(root);
}
void
{
if (t == 0) return;
--count;
if (t->rt == 0)
{
if (t == root)
{
if ((root = t->lt) != 0) root->par = 0;
}
else if (t == p->lt)
{
if ((p->lt = t->lt) != 0) p->lt->par = p;
}
else
if ((p->rt = t->lt) != 0) p->rt->par = p;
}
else
{
for(;;)
{
if (l == 0)
{
if (t == root)
{
root = r;
r->par = 0;
}
else if (t == p->lt)
{
p->lt = r;
r->par = p;
}
else
{
p->rt = r;
r->par = p;
}
if ((r->lt = t->lt) != 0) r->lt->par = r;
break;
}
else
{
if ((r->lt = l->rt) != 0) r->lt->par = r;
l->rt = r; r->par = l;
r = l;
l = l->lt;
}
}
}
delete t;
}
void
{
while (t != 0)
{
_del(t);
t = (
}
}
void
{
if (t != 0)
{
_kill(t->lt);
_kill(t->rt);
delete t;
}
}
{
if (t != 0)
{
if (l != 0) l->par = x;
if (r != 0) r->par = x;
return x;
}
else
return 0;
}
int
{
int v = 1;
if (root == 0)
v = count == 0;
else
{
int n = 1;
while (t != 0)
{
++n;
v &=
trail = t;
t = succ(t);
}
v &= n == count;
}
if (!v) error("invariant failure");
return v;
}
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/