mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-09-20 07:42:21 +03:00
56 lines
1.4 KiB
C++
56 lines
1.4 KiB
C++
#include "search/vertex.hh"
|
|
|
|
#include "search/context.hh"
|
|
|
|
#include <algorithm>
|
|
#include <functional>
|
|
|
|
#include <assert.h>
|
|
|
|
namespace search {
|
|
|
|
namespace {
|
|
|
|
struct GreaterByBound : public std::binary_function<const VertexNode *, const VertexNode *, bool> {
|
|
bool operator()(const VertexNode *first, const VertexNode *second) const {
|
|
return first->Bound() > second->Bound();
|
|
}
|
|
};
|
|
|
|
} // namespace
|
|
|
|
void VertexNode::RecursiveSortAndSet(ContextBase &context, VertexNode *&parent_ptr) {
|
|
if (Complete()) {
|
|
assert(end_);
|
|
assert(extend_.empty());
|
|
return;
|
|
}
|
|
if (extend_.size() == 1) {
|
|
parent_ptr = extend_[0];
|
|
extend_[0]->RecursiveSortAndSet(context, parent_ptr);
|
|
context.DeleteVertexNode(this);
|
|
return;
|
|
}
|
|
for (std::vector<VertexNode*>::iterator i = extend_.begin(); i != extend_.end(); ++i) {
|
|
(*i)->RecursiveSortAndSet(context, *i);
|
|
}
|
|
std::sort(extend_.begin(), extend_.end(), GreaterByBound());
|
|
bound_ = extend_.front()->Bound();
|
|
}
|
|
|
|
void VertexNode::SortAndSet(ContextBase &context) {
|
|
// This is the root. The root might be empty.
|
|
if (extend_.empty()) {
|
|
bound_ = -INFINITY;
|
|
return;
|
|
}
|
|
// The root cannot be replaced. There's always one transition.
|
|
for (std::vector<VertexNode*>::iterator i = extend_.begin(); i != extend_.end(); ++i) {
|
|
(*i)->RecursiveSortAndSet(context, *i);
|
|
}
|
|
std::sort(extend_.begin(), extend_.end(), GreaterByBound());
|
|
bound_ = extend_.front()->Bound();
|
|
}
|
|
|
|
} // namespace search
|