00001 /*********************************************************************** 00002 Moses - statistical machine translation system 00003 Copyright (C) 2006-2011 University of Edinburgh 00004 00005 This library is free software; you can redistribute it and/or 00006 modify it under the terms of the GNU Lesser General Public 00007 License as published by the Free Software Foundation; either 00008 version 2.1 of the License, or (at your option) any later version. 00009 00010 This library is distributed in the hope that it will be useful, 00011 but WITHOUT ANY WARRANTY; without even the implied warranty of 00012 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00013 Lesser General Public License for more details. 00014 00015 You should have received a copy of the GNU Lesser General Public 00016 License along with this library; if not, write to the Free Software 00017 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 00018 ***********************************************************************/ 00019 00020 #pragma once 00021 00022 #include "ChartTrellisDetour.h" 00023 00024 #include <set> 00025 00026 namespace Moses 00027 { 00028 00034 class ChartTrellisDetourQueue 00035 { 00036 public: 00037 // Create empty queue with fixed capacity of c. Capacity 0 means unbounded. 00038 ChartTrellisDetourQueue(size_t c) : m_capacity(c) {} 00039 ~ChartTrellisDetourQueue(); 00040 00041 bool Empty() const { 00042 return m_queue.empty(); 00043 } 00044 00045 // Add the detour to the queue or delete it if the queue is full and the 00046 // score is no better than the queue's worst score. 00047 void Push(const ChartTrellisDetour *detour); 00048 00049 // Remove the best-scoring detour from the queue and return it. The 00050 // caller is responsible for deleting the object. 00051 const ChartTrellisDetour *Pop(); 00052 00053 private: 00054 struct DetourOrderer { 00055 bool operator()(const ChartTrellisDetour* a, 00056 const ChartTrellisDetour* b) const { 00057 return (a->GetTotalScore() > b->GetTotalScore()); 00058 } 00059 }; 00060 00061 typedef std::multiset<const ChartTrellisDetour *, DetourOrderer> QueueType; 00062 00063 QueueType m_queue; 00064 const size_t m_capacity; 00065 }; 00066 00067 } // namespace Moses