00001 // $Id$ 00002 // vim:tabstop=2 00003 /*********************************************************************** 00004 Moses - factored phrase-based language decoder 00005 Copyright (C) 2010 Hieu Hoang 00006 00007 This library is free software; you can redistribute it and/or 00008 modify it under the terms of the GNU Lesser General Public 00009 License as published by the Free Software Foundation; either 00010 version 2.1 of the License, or (at your option) any later version. 00011 00012 This library is distributed in the hope that it will be useful, 00013 but WITHOUT ANY WARRANTY; without even the implied warranty of 00014 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00015 Lesser General Public License for more details. 00016 00017 You should have received a copy of the GNU Lesser General Public 00018 License along with this library; if not, write to the Free Software 00019 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 00020 ***********************************************************************/ 00021 00022 #include "RuleCubeQueue.h" 00023 00024 #include "RuleCubeItem.h" 00025 #include "StaticData.h" 00026 #include "ChartManager.h" 00027 00028 namespace Moses 00029 { 00030 00031 RuleCubeQueue::~RuleCubeQueue() 00032 { 00033 while (!m_queue.empty()) { 00034 RuleCube *cube = m_queue.top(); 00035 m_queue.pop(); 00036 delete cube; 00037 } 00038 } 00039 00040 void RuleCubeQueue::Add(RuleCube *ruleCube) 00041 { 00042 m_queue.push(ruleCube); 00043 } 00044 00045 ChartHypothesis *RuleCubeQueue::Pop() 00046 { 00047 // pop the most promising rule cube 00048 RuleCube *cube = m_queue.top(); 00049 m_queue.pop(); 00050 00051 // pop the most promising item from the cube and get the corresponding 00052 // hypothesis 00053 RuleCubeItem *item = cube->Pop(m_manager); 00054 if (m_manager.options()->cube.lazy_scoring) { 00055 item->CreateHypothesis(cube->GetTranslationOption(), m_manager); 00056 } 00057 ChartHypothesis *hypo = item->ReleaseHypothesis(); 00058 00059 // if the cube contains more items then push it back onto the queue 00060 if (!cube->IsEmpty()) { 00061 m_queue.push(cube); 00062 } else { 00063 delete cube; 00064 } 00065 00066 return hypo; 00067 } 00068 00069 }