#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 . */ /* */ /* 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 XrdOucQSItem { public: XrdOucQSItem *nextelem; T *dataitem; XrdOucQSItem(T *item) {dataitem = item; nextelem = 0;} ~XrdOucQSItem() {} }; template class XrdOucStack { public: int isEmpty() {return anchor == 0;} T *Pop() {XrdOucQSItem *cp; if (!(cp = anchor)) return (T *)0; anchor = anchor->nextelem; cp->nextelem = 0; return cp->dataitem; } void Push(XrdOucQSItem *item) {item->nextelem = anchor; anchor = item;} XrdOucStack() {anchor = 0;} ~XrdOucStack() {} private: XrdOucQSItem *anchor; }; template class XrdOucQueue { public: void Add(XrdOucQSItem *item) {item->nextelem = 0; if (lastelem) {lastelem->nextelem = item; lastelem = item; } else anchor = lastelem = item; } int isEmpty() {return anchor == 0;} T *Remove() {XrdOucQSItem *qp; if (!(qp = anchor)) return (T *)0; if (!(anchor = anchor->nextelem)) lastelem = 0; return qp->dataitem; } XrdOucQueue() {anchor = lastelem = 0;} ~XrdOucQueue() {} private: XrdOucQSItem *anchor; XrdOucQSItem *lastelem; }; #endif