home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftptest.leeds.ac.uk
/
2015.02.ftptest.leeds.ac.uk.tar
/
ftptest.leeds.ac.uk
/
bionet
/
CAE-GROUP
/
SCL-WIN3x
/
SCL.EXE
/
GENNODEL.H
< prev
next >
Wrap
C/C++ Source or Header
|
1994-07-20
|
3KB
|
96 lines
#ifndef gennodel_h
#define gennodel_h
/*
* NIST Utils Class Library
* clutils/gennodelist.h
* February, 1994
* David Sauder
* K. C. Morris
* Development of this software was funded by the United States Government,
* and is not subject to copyright.
*/
/* $Id: gennodelist.h,v 2.0.1.2 1994/04/05 16:44:08 sauderd Exp $ */
#ifdef __O3DB__
#include <OpenOODB.h>
#endif
#include <iostream.h>
//////////////////////////////////////////////////////////////////////////////
// class GenNodeList
// this class implements a doubly linked list by default.
// If you delete this object it does not delete all of its entries,
// only its head. If you want it to delete all of its entries as well
// as its head, you need to call DeleteEntries().
//////////////////////////////////////////////////////////////////////////////
class GenNodeList {
public:
GenNodeList(GenericNode *headNode);
virtual ~GenNodeList() { delete head; }
GenericNode *GetHead() { return head; }
virtual void ClearEntries();
virtual void DeleteEntries();
// deletes node from its previous list & appends
virtual void Append(GenericNode *node);
// deletes newNode from its previous list & inserts in
// relation to existNode
virtual void InsertAfter(GenericNode *newNode, GenericNode *existNode);
virtual void InsertBefore(GenericNode *newNode, GenericNode *existNode);
virtual void Remove(GenericNode *node);
protected:
GenericNode *head;
};
//////////////////////////////////////////////////////////////////////////////
// class GenNodeList inline functions
// these functions don't rely on any inline functions (its own or
// other classes) that aren't in this file
//////////////////////////////////////////////////////////////////////////////
inline GenNodeList::GenNodeList(GenericNode *headNode)
{
head = headNode;
head->next = head;
head->prev = head;
}
// inserts after existNode
inline void GenNodeList::InsertAfter(GenericNode *newNode,
GenericNode *existNode)
{
newNode->next = existNode->next;
newNode->next->prev = newNode;
newNode->prev = existNode;
existNode->next = newNode;
}
// inserts before existNode
inline void GenNodeList::InsertBefore(GenericNode *newNode,
GenericNode *existNode)
{
existNode->prev->next = newNode;
newNode->prev = existNode->prev;
newNode->next = existNode;
existNode->prev = newNode;
}
// inserts before the head node
inline void GenNodeList::Append(GenericNode *node)
{
InsertBefore(node, head);
}
#endif