1.1 --- a/core/sm_simple_prioqueue.h	Fri Jul 11 06:51:21 2008 +0000
     1.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.3 @@ -1,66 +0,0 @@
     1.4 -/**
     1.5 - * vim: set ts=4 :
     1.6 - * =============================================================================
     1.7 - * SourceMod
     1.8 - * Copyright (C) 2004-2008 AlliedModders LLC.  All rights reserved.
     1.9 - * =============================================================================
    1.10 - *
    1.11 - * This program is free software; you can redistribute it and/or modify it under
    1.12 - * the terms of the GNU General Public License, version 3.0, as published by the
    1.13 - * Free Software Foundation.
    1.14 - * 
    1.15 - * This program is distributed in the hope that it will be useful, but WITHOUT
    1.16 - * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
    1.17 - * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
    1.18 - * details.
    1.19 - *
    1.20 - * You should have received a copy of the GNU General Public License along with
    1.21 - * this program.  If not, see <http://www.gnu.org/licenses/>.
    1.22 - *
    1.23 - * As a special exception, AlliedModders LLC gives you permission to link the
    1.24 - * code of this program (as well as its derivative works) to "Half-Life 2," the
    1.25 - * "Source Engine," the "SourcePawn JIT," and any Game MODs that run on software
    1.26 - * by the Valve Corporation.  You must obey the GNU General Public License in
    1.27 - * all respects for all other code used.  Additionally, AlliedModders LLC grants
    1.28 - * this exception to all derivative works.  AlliedModders LLC defines further
    1.29 - * exceptions, found in LICENSE.txt (as of this writing, version JULY-31-2007),
    1.30 - * or <http://www.sourcemod.net/license.php>.
    1.31 - *
    1.32 - * Version: $Id$
    1.33 - */
    1.34 -
    1.35 -#include "sm_queue.h"
    1.36 -#include <IDBDriver.h>
    1.37 -
    1.38 -template <class T>
    1.39 -class PrioQueue
    1.40 -{
    1.41 -private:
    1.42 -	Queue<T> m_HighQueue;
    1.43 -	Queue<T> m_NormalQueue;
    1.44 -	Queue<T> m_LowQueue;
    1.45 -public:
    1.46 -	inline Queue<T> & GetQueue(PrioQueueLevel level)
    1.47 -	{
    1.48 -		if (level == PrioQueue_High)
    1.49 -		{
    1.50 -			return m_HighQueue;
    1.51 -		} else if (level == PrioQueue_Normal) {
    1.52 -			return m_NormalQueue;
    1.53 -		} else {
    1.54 -			return m_LowQueue;
    1.55 -		}
    1.56 -	}
    1.57 -	inline Queue<T> & GetLikelyQueue()
    1.58 -	{
    1.59 -		if (!m_HighQueue.empty())
    1.60 -		{
    1.61 -			return m_HighQueue;
    1.62 -		}
    1.63 -		if (!m_NormalQueue.empty())
    1.64 -		{
    1.65 -			return m_NormalQueue;
    1.66 -		}
    1.67 -		return m_LowQueue;
    1.68 -	}
    1.69 -};