// 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.
#ifndef _<T><C>SplayMap_h
#define _<T><C>SplayMap_h 1
#define _<T><C>SplayNode 1
<T><C>SplayNode(<T&> h, <C&> c,
inline <T><C>SplayNode::<T><C>SplayNode(<T&> h, <C&> c,
:item(h), cont(c), lt(l), rt(r), par(0) {}
inline <T><C>SplayNode::~<T><C>SplayNode() {}
typedef <T><C>SplayNode* <T><C>SplayNodePtr;
class <T><C>SplayMap : public <T><C>Map
<T><C>SplayNode* leftmost();
<T><C>SplayNode* rightmost();
<T><C>SplayNode* pred(<T><C>SplayNode* t);
<T><C>SplayNode* succ(<T><C>SplayNode* t);
void _kill(<T><C>SplayNode* t);
<T><C>SplayNode* _copy(<T><C>SplayNode* t);
<T><C>SplayMap(<C&> dflt);
<T><C>SplayMap(<T><C>SplayMap& a);
<C>& operator [] (<T&> key);
inline <T><C>SplayMap::~<T><C>SplayMap()
inline <T><C>SplayMap::<T><C>SplayMap(<C&> dflt) :<T><C>Map(dflt)
inline <T><C>SplayMap::<T><C>SplayMap(<T><C>SplayMap& b) :<T><C>Map(b.def)
inline Pix <T><C>SplayMap::first()
inline Pix <T><C>SplayMap::last()
inline void <T><C>SplayMap::next(Pix& i)
if (i != 0) i = Pix(succ((<T><C>SplayNode*)i));
inline void <T><C>SplayMap::prev(Pix& i)
if (i != 0) i = Pix(pred((<T><C>SplayNode*)i));
inline <T>& <T><C>SplayMap::key (Pix i)
if (i == 0) error("null Pix");
return ((<T><C>SplayNode*)i)->item;
inline <C>& <T><C>SplayMap::contents (Pix i)
if (i == 0) error("null Pix");
return ((<T><C>SplayNode*)i)->cont;
inline void <T><C>SplayMap::clear()
inline int <T><C>SplayMap::contains(<T&> key)