Gabriele Cosmo
68 lines
1.9 KiB
C++
68 lines
1.9 KiB
C++
|
|
#ifndef gennodelist_h
|
|
#define gennodelist_h
|
|
|
|
/*
|
|
* NIST Utils Class Library
|
|
* clutils/gennodelist.h
|
|
* April 1997
|
|
* 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 1.4 2000/01/21 13:42:39 gcosmo Exp $ */
|
|
|
|
#ifdef __O3DB__
|
|
#include <OpenOODB.h>
|
|
#endif
|
|
|
|
#include "G4ios.hh"
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
// 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;
|
|
}
|
|
|
|
#endif
|