priority_queue_base_dispatch.hpp revision 1.1.1.1
1// -*- C++ -*- 2 3// Copyright (C) 2005, 2006 Free Software Foundation, Inc. 4// 5// This file is part of the GNU ISO C++ Library. This library is free 6// software; you can redistribute it and/or modify it under the terms 7// of the GNU General Public License as published by the Free Software 8// Foundation; either version 2, or (at your option) any later 9// version. 10 11// This library is distributed in the hope that it will be useful, but 12// WITHOUT ANY WARRANTY; without even the implied warranty of 13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14// General Public License for more details. 15 16// You should have received a copy of the GNU General Public License 17// along with this library; see the file COPYING. If not, write to 18// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, 19// MA 02111-1307, USA. 20 21// As a special exception, you may use this file as part of a free 22// software library without restriction. Specifically, if other files 23// instantiate templates or use macros or inline functions from this 24// file, or you compile this file and link it with other files to 25// produce an executable, this file does not by itself cause the 26// resulting executable to be covered by the GNU General Public 27// License. This exception does not however invalidate any other 28// reasons why the executable file might be covered by the GNU General 29// Public License. 30 31// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 32 33// Permission to use, copy, modify, sell, and distribute this software 34// is hereby granted without fee, provided that the above copyright 35// notice appears in all copies, and that both that copyright notice 36// and this permission notice appear in supporting documentation. None 37// of the above authors, nor IBM Haifa Research Laboratories, make any 38// representation about the suitability of this software for any 39// purpose. It is provided "as is" without express or implied 40// warranty. 41 42/** 43 * @file priority_queue_base_dispatch.hpp 44 * Contains an pqiative container dispatching base. 45 */ 46 47#ifndef PB_DS_PRIORITY_QUEUE_BASE_DS_DISPATCHER_HPP 48#define PB_DS_PRIORITY_QUEUE_BASE_DS_DISPATCHER_HPP 49 50#include <ext/pb_ds/detail/pairing_heap_/pairing_heap_.hpp> 51#include <ext/pb_ds/detail/binomial_heap_/binomial_heap_.hpp> 52#include <ext/pb_ds/detail/rc_binomial_heap_/rc_binomial_heap_.hpp> 53#include <ext/pb_ds/detail/binary_heap_/binary_heap_.hpp> 54#include <ext/pb_ds/detail/thin_heap_/thin_heap_.hpp> 55 56namespace pb_ds 57{ 58 namespace detail 59 { 60 61 template<typename Value_Type, typename Cmp_Fn, typename Tag, typename Allocator> 62 struct priority_queue_base_dispatch; 63 64 template<typename Value_Type, typename Cmp_Fn, typename Allocator> 65 struct priority_queue_base_dispatch<Value_Type, Cmp_Fn, pairing_heap_tag, Allocator> 66 { 67 typedef pairing_heap_< Value_Type, Cmp_Fn, Allocator> type; 68 }; 69 70 template<typename Value_Type, typename Cmp_Fn, typename Allocator> 71 struct priority_queue_base_dispatch<Value_Type, Cmp_Fn, binomial_heap_tag, Allocator> 72 { 73 typedef binomial_heap_< Value_Type, Cmp_Fn, Allocator> type; 74 }; 75 76 template<typename Value_Type, typename Cmp_Fn, typename Allocator> 77 struct priority_queue_base_dispatch<Value_Type, Cmp_Fn, rc_binomial_heap_tag, Allocator> 78 { 79 typedef rc_binomial_heap_< Value_Type, Cmp_Fn, Allocator> type; 80 }; 81 82 template<typename Value_Type, typename Cmp_Fn, typename Allocator> 83 struct priority_queue_base_dispatch<Value_Type, Cmp_Fn, binary_heap_tag, Allocator> 84 { 85 typedef binary_heap_< Value_Type, Cmp_Fn, Allocator> type; 86 }; 87 88 template<typename Value_Type, typename Cmp_Fn, typename Allocator> 89 struct priority_queue_base_dispatch<Value_Type, Cmp_Fn, thin_heap_tag, Allocator> 90 { 91 typedef thin_heap_< Value_Type, Cmp_Fn, Allocator> type; 92 }; 93 94 } // namespace detail 95} // namespace pb_ds 96 97#endif // #ifndef PB_DS_PRIORITY_QUEUE_BASE_DS_DISPATCHER_HPP 98