core/sm_simple_prioqueue.h
author Scott Ehlert <ds@alliedmods.net>
Fri Mar 21 04:26:53 2008 +0000 (2008-03-21)
changeset 1944 17984feecafd
parent 1330 ab94316bb52b
child 1947 e73a1e51833b
permissions -rw-r--r--
Merged crash fix (amb1539) from 1.0.1 branch
     1 /**
     2  * vim: set ts=4 :
     3  * =============================================================================
     4  * SourceMod
     5  * Copyright (C) 2004-2007 AlliedModders LLC.  All rights reserved.
     6  * =============================================================================
     7  *
     8  * This program is free software; you can redistribute it and/or modify it under
     9  * the terms of the GNU General Public License, version 3.0, as published by the
    10  * Free Software Foundation.
    11  * 
    12  * This program is distributed in the hope that it will be useful, but WITHOUT
    13  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
    14  * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
    15  * details.
    16  *
    17  * You should have received a copy of the GNU General Public License along with
    18  * this program.  If not, see <http://www.gnu.org/licenses/>.
    19  *
    20  * As a special exception, AlliedModders LLC gives you permission to link the
    21  * code of this program (as well as its derivative works) to "Half-Life 2," the
    22  * "Source Engine," the "SourcePawn JIT," and any Game MODs that run on software
    23  * by the Valve Corporation.  You must obey the GNU General Public License in
    24  * all respects for all other code used.  Additionally, AlliedModders LLC grants
    25  * this exception to all derivative works.  AlliedModders LLC defines further
    26  * exceptions, found in LICENSE.txt (as of this writing, version JULY-31-2007),
    27  * or <http://www.sourcemod.net/license.php>.
    28  *
    29  * Version: $Id$
    30  */
    31 
    32 #include "sm_queue.h"
    33 #include <IDBDriver.h>
    34 
    35 template <class T>
    36 class PrioQueue
    37 {
    38 private:
    39 	Queue<T> m_HighQueue;
    40 	Queue<T> m_NormalQueue;
    41 	Queue<T> m_LowQueue;
    42 public:
    43 	inline Queue<T> & GetQueue(PrioQueueLevel level)
    44 	{
    45 		if (level == PrioQueue_High)
    46 		{
    47 			return m_HighQueue;
    48 		} else if (level == PrioQueue_Normal) {
    49 			return m_NormalQueue;
    50 		} else {
    51 			return m_LowQueue;
    52 		}
    53 	}
    54 	inline Queue<T> & GetLikelyQueue()
    55 	{
    56 		if (!m_HighQueue.empty())
    57 		{
    58 			return m_HighQueue;
    59 		}
    60 		if (!m_NormalQueue.empty())
    61 		{
    62 			return m_NormalQueue;
    63 		}
    64 		return m_LowQueue;
    65 	}
    66 };