00001 /* 00002 * FIFOLinkedList.h : part of the Mace toolkit for building distributed systems 00003 * 00004 * Copyright (c) 2007, Charles Killian, Dejan Kostic, Ryan Braud, James W. Anderson, John Fisher-Ogden, Calvin Hubble, Duy Nguyen, Justin Burke, David Oppenheimer, Amin Vahdat, Adolfo Rodriguez, Sooraj Bhat 00005 * All rights reserved. 00006 * 00007 * Redistribution and use in source and binary forms, with or without 00008 * modification, are permitted provided that the following conditions are met: 00009 * 00010 * * Redistributions of source code must retain the above copyright 00011 * notice, this list of conditions and the following disclaimer. 00012 * * Redistributions in binary form must reproduce the above copyright 00013 * notice, this list of conditions and the following disclaimer in 00014 * the documentation and/or other materials provided with the 00015 * distribution. 00016 * * Neither the names of Duke University nor The University of 00017 * California, San Diego, nor the names of the authors or contributors 00018 * may be used to endorse or promote products derived from 00019 * this software without specific prior written permission. 00020 * 00021 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00022 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00023 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 00024 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE 00025 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00026 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 00027 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 00028 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 00029 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE 00030 * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00031 * 00032 * ----END-OF-LEGAL-STUFF---- */ 00033 #ifndef _FIFO_LINKED_LIST_H 00034 #define _FIFO_LINKED_LIST_H 00035 00036 #include <boost/shared_ptr.hpp> 00037 00057 template <class T> 00058 class FIFOLinkedList { 00059 private: 00060 class Element; 00061 typedef boost::shared_ptr<Element> ElementPtr; 00062 00063 class Element { 00064 public: 00065 Element() { } 00066 Element(const T& v) : v(v) { } 00067 00068 T v; 00069 ElementPtr next; 00070 }; 00071 00072 00073 public: 00074 FIFOLinkedList(const T& v) : first(0), last(0) { 00075 head = ElementPtr(new Element(v)); 00076 tail = head; 00077 } 00078 00079 virtual ~FIFOLinkedList() { } 00080 00082 virtual bool canPop() const { 00083 return (head->next.get() != 0); 00084 } // canPop 00085 00087 virtual uint64_t size() const { 00088 return last - first; 00089 } // size 00090 00092 virtual bool empty() const { 00093 return (first == last); 00094 } 00095 00097 virtual T& front() const { 00098 return head->v; 00099 } // front 00100 00102 virtual T& back() const { 00103 return tail->v; 00104 } // back 00105 00107 virtual void push(const T& v) { 00108 last++; 00109 ElementPtr n = ElementPtr(new Element(v)); 00110 tail->next = n; 00111 tail = n; 00112 } // push 00113 00115 virtual void pop() { 00116 first++; 00117 assert(canPop()); 00118 head = head->next; 00119 } // pop 00120 00122 virtual void clear() { 00123 while (!empty()) { 00124 pop(); 00125 } 00126 } 00127 00128 private: 00129 uint64_t first; 00130 uint64_t last; 00131 ElementPtr head; 00132 ElementPtr tail; 00133 }; // FIFOLinkedList 00134 00137 #endif // _FIFO_LINKED_LIST_H