Loading...
Searching...
No Matches
XrdOucChain.hh
Go to the documentation of this file.
#ifndef __OUC_CHAIN__
#define __OUC_CHAIN__
/******************************************************************************/
/* */
/* X r d O u c C h a i n . h h */
/* */
/* (c) 2003 by the Board of Trustees of the Leland Stanford, Jr., University */
/* All Rights Reserved */
/* Produced by Andrew Hanushevsky for Stanford University under contract */
/* DE-AC02-76-SFO0515 with the Department of Energy */
/* */
/* This file is part of the XRootD software suite. */
/* */
/* XRootD is free software: you can redistribute it and/or modify it under */
/* the terms of the GNU Lesser General Public License as published by the */
/* Free Software Foundation, either version 3 of the License, or (at your */
/* option) any later version. */
/* */
/* XRootD 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 Lesser General Public */
/* License for more details. */
/* */
/* You should have received a copy of the GNU Lesser General Public License */
/* along with XRootD in a file called COPYING.LESSER (LGPL license) and file */
/* COPYING (GPL license). If not, see <http://www.gnu.org/licenses/>. */
/* */
/* The copyright holder's institutional names and contributor's names may not */
/* be used to endorse or promote products derived from this software without */
/* specific prior written permission of the institution or contributor. */
/******************************************************************************/
template<class T>
class XrdOucQSItem
{
public:
XrdOucQSItem<T> *nextelem;
T *dataitem;
XrdOucQSItem(T *item) {dataitem = item; nextelem = 0;}
~XrdOucQSItem() {}
};
template<class T>
class XrdOucStack
{
public:
int isEmpty() {return anchor == 0;}
T *Pop() {XrdOucQSItem<T> *cp;
if (!(cp = anchor)) return (T *)0;
anchor = anchor->nextelem;
cp->nextelem = 0;
return cp->dataitem;
}
void Push(XrdOucQSItem<T> *item) {item->nextelem = anchor; anchor = item;}
XrdOucStack() {anchor = 0;}
~XrdOucStack() {}
private:
XrdOucQSItem<T> *anchor;
};
template<class T>
class XrdOucQueue
{
public:
void Add(XrdOucQSItem<T> *item)
{item->nextelem = 0;
if (lastelem) {lastelem->nextelem = item;
lastelem = item;
}
else anchor = lastelem = item;
}
int isEmpty() {return anchor == 0;}
T *Remove() {XrdOucQSItem<T> *qp;
if (!(qp = anchor)) return (T *)0;
if (!(anchor = anchor->nextelem)) lastelem = 0;
return qp->dataitem;
}
XrdOucQueue() {anchor = lastelem = 0;}
~XrdOucQueue() {}
private:
XrdOucQSItem<T> *anchor;
XrdOucQSItem<T> *lastelem;
};
#endif
XrdOucQSItem
Definition XrdOucChain.hh:35
XrdOucQSItem::nextelem
XrdOucQSItem< T > * nextelem
Definition XrdOucChain.hh:37
XrdOucQSItem::XrdOucQSItem
XrdOucQSItem(T *item)
Definition XrdOucChain.hh:39
XrdOucQSItem::~XrdOucQSItem
~XrdOucQSItem()
Definition XrdOucChain.hh:40
XrdOucQSItem::dataitem
T * dataitem
Definition XrdOucChain.hh:38
XrdOucQueue::XrdOucQueue
XrdOucQueue()
Definition XrdOucChain.hh:87
XrdOucQueue::~XrdOucQueue
~XrdOucQueue()
Definition XrdOucChain.hh:88
XrdOucQueue::isEmpty
int isEmpty()
Definition XrdOucChain.hh:79
XrdOucQueue::Add
void Add(XrdOucQSItem< T > *item)
Definition XrdOucChain.hh:71
XrdOucQueue::Remove
T * Remove()
Definition XrdOucChain.hh:81
XrdOucStack::Pop
T * Pop()
Definition XrdOucChain.hh:50
XrdOucStack::XrdOucStack
XrdOucStack()
Definition XrdOucChain.hh:59
XrdOucStack::~XrdOucStack
~XrdOucStack()
Definition XrdOucChain.hh:60
XrdOucStack::isEmpty
int isEmpty()
Definition XrdOucChain.hh:48
XrdOucStack::Push
void Push(XrdOucQSItem< T > *item)
Definition XrdOucChain.hh:57