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:
authorKenneth Heafield <github@kheafield.com>2014-01-02 01:19:06 +0400
committerKenneth Heafield <github@kheafield.com>2014-01-02 01:19:06 +0400
commit732a1b074426352498fc99459ae8499d95690084 (patch)
tree56a06f19e341260128faf60743e84506943e9c07 /util/multi_intersection.hh
parent18aaf4750a11f7a903a143b83f51eb34323613ea (diff)
KenLM 85c82bd, revamp Moses timer to have more precision
Diffstat (limited to 'util/multi_intersection.hh')
-rw-r--r--util/multi_intersection.hh2
1 files changed, 1 insertions, 1 deletions
diff --git a/util/multi_intersection.hh b/util/multi_intersection.hh
index 8334d39df..04678352d 100644
--- a/util/multi_intersection.hh
+++ b/util/multi_intersection.hh
@@ -66,7 +66,7 @@ template <class Iterator, class Output, class Less> void AllIntersection(std::ve
std::sort(sets.begin(), sets.end(), detail::RangeLessBySize<boost::iterator_range<Iterator> >());
boost::optional<Value> ret;
- for (boost::optional<Value> ret; ret = detail::FirstIntersectionSorted(sets, less); sets.front().advance_begin(1)) {
+ for (boost::optional<Value> ret; (ret = detail::FirstIntersectionSorted(sets, less)); sets.front().advance_begin(1)) {
out(*ret);
}
}