diff options
author | Hieu Hoang <hieuhoang@gmail.com> | 2012-11-12 23:56:18 +0400 |
---|---|---|
committer | Hieu Hoang <hieuhoang@gmail.com> | 2012-11-12 23:56:18 +0400 |
commit | 5e3ef23cef6101d2c098eb3445f562e8f595655b (patch) | |
tree | b8c332b6fa82bae84ea4910967a10ba1b08a7107 /moses/RuleCubeQueue.h | |
parent | 8c785cff2b1be3cccd76ea9026f71b649762dfc3 (diff) |
move moses/src/* to moses/
Diffstat (limited to 'moses/RuleCubeQueue.h')
-rw-r--r-- | moses/RuleCubeQueue.h | 64 |
1 files changed, 64 insertions, 0 deletions
diff --git a/moses/RuleCubeQueue.h b/moses/RuleCubeQueue.h new file mode 100644 index 000000000..9763b3877 --- /dev/null +++ b/moses/RuleCubeQueue.h @@ -0,0 +1,64 @@ +// $Id$ +// vim:tabstop=2 +/*********************************************************************** + Moses - factored phrase-based language decoder + Copyright (C) 2010 Hieu Hoang + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2.1 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + ***********************************************************************/ + +#pragma once + +#include "RuleCube.h" + +#include <queue> +#include <vector> + +namespace Moses +{ + +class ChartManager; + +/** Define an ordering between RuleCube based on their best item scores. This + * is used to order items in the priority queue. + */ +class RuleCubeOrderer +{ + public: + bool operator()(const RuleCube *p, const RuleCube *q) const { + return p->GetTopScore() < q->GetTopScore(); + } +}; + +/** @todo how is this used */ +class RuleCubeQueue +{ + public: + RuleCubeQueue(ChartManager &manager) : m_manager(manager) {} + ~RuleCubeQueue(); + + void Add(RuleCube *); + ChartHypothesis *Pop(); + bool IsEmpty() const { return m_queue.empty(); } + + private: + typedef std::priority_queue<RuleCube*, std::vector<RuleCube*>, + RuleCubeOrderer > Queue; + + Queue m_queue; + ChartManager &m_manager; +}; + +} |