// This may look like C code, but it is really -*- C++ -*-
// WARNING: This file is obsolete. Use ../DLList.h, if you can.
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.
#define _<T>DLListNode_h 1
<T>DLListNode(const <T&> h,
inline <T>DLListNode::<T>DLListNode() {}
inline <T>DLListNode::<T>DLListNode(const <T&> h, <T>DLListNode* p,
inline <T>DLListNode::~<T>DLListNode() {}
typedef <T>DLListNode* <T>DLListNodePtr;
friend class <T>DLListTrav;
<T>DLList(const <T>DLList& a);
<T>DLList& operator = (const <T>DLList& a);
<T>& operator () (Pix p);
Pix ins_after(Pix p, <T&> item);
Pix ins_before(Pix p, <T&> item);
void del(Pix& p, int dir = 1);
void error(const char* msg);
inline <T>DLList::~<T>DLList()
inline <T>DLList::<T>DLList()
inline int <T>DLList::empty()
inline void <T>DLList::next(Pix& p)
p = (p == 0 || p == h->bk)? 0 : Pix(((<T>DLListNode*)p)->fd);
inline void <T>DLList::prev(Pix& p)
p = (p == 0 || p == h)? 0 : Pix(((<T>DLListNode*)p)->bk);
inline Pix <T>DLList::first()
inline Pix <T>DLList::last()
return (h == 0)? 0 : Pix(h->bk);
inline <T>& <T>DLList::operator () (Pix p)
if (p == 0) error("null Pix");
return ((<T>DLListNode*)p)->hd;
inline <T>& <T>DLList::front()
if (h == 0) error("front: empty list");
inline <T>& <T>DLList::rear()
if (h == 0) error("rear: empty list");