Sirikata
|
00001 /* Sirikata 00002 * AbstractQueue.hpp 00003 * 00004 * Copyright (c) 2010, Daniel Reiter Horn 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 00009 * met: 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 name of Sirikata nor the names of its contributors may 00017 * be used to endorse or promote products derived from this software 00018 * without specific prior written permission. 00019 * 00020 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS 00021 * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 00022 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A 00023 * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 00024 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00025 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00026 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00027 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00028 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00029 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00030 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00031 */ 00032 00033 #ifndef _SIRIKATA_ABSTRACTQUEUE_HPP_ 00034 #define _SIRIKATA_ABSTRACTQUEUE_HPP_ 00035 00036 namespace Sirikata { 00037 00038 namespace QueueEnum { 00039 enum PushResult { 00040 PushSucceeded, 00041 PushExceededMaximumSize 00042 }; 00043 }; 00044 00045 template <typename ElementType> class AbstractQueue { 00046 public: 00047 typedef ElementType Type; 00048 00049 AbstractQueue(){ 00050 } 00051 virtual ~AbstractQueue(){} 00052 00053 virtual QueueEnum::PushResult push(const ElementType &msg)=0; 00054 00055 virtual const ElementType& front() const=0; 00056 00057 virtual ElementType& front()=0; 00058 00059 virtual ElementType pop() { return ElementType(); } 00060 00061 virtual bool empty() const=0; 00062 00063 virtual uint32 size() const=0; 00068 }; 00069 00070 } 00071 #endif