Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMosesAdmin <moses-support-owner@mit.edu>2015-08-08 02:00:45 +0300
committerMosesAdmin <moses-support-owner@mit.edu>2015-08-08 02:00:45 +0300
commit21aa5af640946c0f00c717a0774d05441a4b6902 (patch)
tree263d9827fd439e6c909b771821776e40151b7fc8 /moses/SearchNormal.cpp
parent883c34aee9266cce72f9a8851e863cb4b910c718 (diff)
daily automatic beautifier
Diffstat (limited to 'moses/SearchNormal.cpp')
-rw-r--r--moses/SearchNormal.cpp24
1 files changed, 12 insertions, 12 deletions
diff --git a/moses/SearchNormal.cpp b/moses/SearchNormal.cpp
index 227c27479..52b56a30a 100644
--- a/moses/SearchNormal.cpp
+++ b/moses/SearchNormal.cpp
@@ -16,8 +16,8 @@ namespace Moses
* /param transOptColl collection of translation options to be used for this sentence
*/
SearchNormal::
-SearchNormal(Manager& manager, const InputType &source,
- const TranslationOptionCollection &transOptColl)
+SearchNormal(Manager& manager, const InputType &source,
+ const TranslationOptionCollection &transOptColl)
: Search(manager)
, m_source(source)
, m_hypoStackColl(source.GetSize() + 1)
@@ -38,8 +38,8 @@ SearchNormal(Manager& manager, const InputType &source,
std::vector < HypothesisStackNormal >::iterator iterStack;
for (size_t ind = 0 ; ind < m_hypoStackColl.size() ; ++ind) {
HypothesisStackNormal *sourceHypoColl = new HypothesisStackNormal(m_manager);
- sourceHypoColl->SetMaxHypoStackSize(this->m_options.search.stack_size,
- this->m_options.search.stack_diversity);
+ sourceHypoColl->SetMaxHypoStackSize(this->m_options.search.stack_size,
+ this->m_options.search.stack_diversity);
sourceHypoColl->SetBeamWidth(this->m_options.search.beam_width);
m_hypoStackColl[ind] = sourceHypoColl;
}
@@ -51,26 +51,26 @@ SearchNormal::~SearchNormal()
}
-bool
+bool
SearchNormal::
ProcessOneStack(HypothesisStack* hstack)
{
if (this->out_of_time()) return false;
SentenceStats &stats = m_manager.GetSentenceStats();
- HypothesisStackNormal &sourceHypoColl
- = *static_cast<HypothesisStackNormal*>(hstack);
+ HypothesisStackNormal &sourceHypoColl
+ = *static_cast<HypothesisStackNormal*>(hstack);
// the stack is pruned before processing (lazy pruning):
VERBOSE(3,"processing hypothesis from next stack");
- IFVERBOSE(2) stats.StartTimeStack();
+ IFVERBOSE(2) stats.StartTimeStack();
sourceHypoColl.PruneToSize(m_options.search.stack_size);
VERBOSE(3,std::endl);
sourceHypoColl.CleanupArcList();
- IFVERBOSE(2) stats.StopTimeStack();
+ IFVERBOSE(2) stats.StopTimeStack();
// go through each hypothesis on the stack and try to expand it
- BOOST_FOREACH(Hypothesis* h, sourceHypoColl)
- ProcessOneHypothesis(*h);
+ BOOST_FOREACH(Hypothesis* h, sourceHypoColl)
+ ProcessOneHypothesis(*h);
return true;
}
@@ -90,7 +90,7 @@ void SearchNormal::Decode()
// go through each stack
BOOST_FOREACH(HypothesisStack* hstack, m_hypoStackColl) {
if (!ProcessOneStack(hstack)) return;
- IFVERBOSE(2) OutputHypoStackSize();
+ IFVERBOSE(2) OutputHypoStackSize();
actual_hypoStack = static_cast<HypothesisStackNormal*>(hstack);
}
}