Category : OS/2 Files
Archive   : GPPDEV8F.ZIP
Filename : DLLIST.HP

// This may look like C code, but it is really -*- C++ -*-
/*
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.
*/


#ifndef _DLList_h
#ifdef __GNUG__
#pragma interface
#endif
#define _DLList_h 1

#include
#include ".defs.h"

#ifndef _DLListNode_h
#define _DLListNode_h 1

struct DLListNode
{
DLListNode* bk;
DLListNode* fd;
hd;
DLListNode();
DLListNode(const h,
DLListNode* p = 0,
DLListNode* n = 0);
~DLListNode();
};

inline DLListNode::DLListNode() {}

inline DLListNode::DLListNode(const h, DLListNode* p,
DLListNode* n)
:hd(h), bk(p), fd(n) {}

inline DLListNode::~DLListNode() {}

typedef DLListNode* DLListNodePtr;

#endif

class DLList
{
friend class DLListTrav;

DLListNode* h;

public:
DLList();
DLList(const DLList& a);
~DLList();

DLList& operator = (const DLList& a);

int empty();
int length();

void clear();

Pix prepend( item);
Pix append( item);
void join(DLList&);

& front();
remove_front();
void del_front();

& rear();
remove_rear();
void del_rear();

& operator () (Pix p);
Pix first();
Pix last();
void next(Pix& p);
void prev(Pix& p);
int owns(Pix p);
Pix ins_after(Pix p, item);
Pix ins_before(Pix p, item);
void del(Pix& p, int dir = 1);
void del_after(Pix& p);

void error(const char* msg);
int OK();
};


inline DLList::~DLList()
{
clear();
}

inline DLList::DLList()
{
h = 0;
}

inline int DLList::empty()
{
return h == 0;
}


inline void DLList::next(Pix& p)
{
p = (p == 0 || p == h->bk)? 0 : Pix(((DLListNode*)p)->fd);
}

inline void DLList::prev(Pix& p)
{
p = (p == 0 || p == h)? 0 : Pix(((DLListNode*)p)->bk);
}

inline Pix DLList::first()
{
return Pix(h);
}

inline Pix DLList::last()
{
return (h == 0)? 0 : Pix(h->bk);
}

inline & DLList::operator () (Pix p)
{
if (p == 0) error("null Pix");
return ((DLListNode*)p)->hd;
}

inline & DLList::front()
{
if (h == 0) error("front: empty list");
return h->hd;
}

inline & DLList::rear()
{
if (h == 0) error("rear: empty list");
return h->bk->hd;
}

#endif