mosesdecoder/search/nbest.hh
2012-11-15 18:04:07 +00:00

82 lines
1.7 KiB
C++

#ifndef SEARCH_NBEST__
#define SEARCH_NBEST__
#include "search/applied.hh"
#include "search/config.hh"
#include "search/edge.hh"
#include <boost/pool/object_pool.hpp>
#include <cstddef>
#include <queue>
#include <vector>
#include <assert.h>
namespace search {
class NBestList;
class NBestList {
private:
class RevealedRef {
public:
explicit RevealedRef(History history)
: in_(static_cast<NBestList*>(history)), index_(0) {}
private:
friend class NBestList;
NBestList *in_;
std::size_t index_;
};
typedef GenericApplied<RevealedRef> QueueEntry;
public:
NBestList(std::vector<PartialEdge> &existing, util::Pool &entry_pool, std::size_t keep);
Score TopAfterConstructor() const;
const std::vector<Applied> &Extract(util::Pool &pool, std::size_t n);
private:
Score Visit(util::Pool &pool, std::size_t index);
Applied Get(util::Pool &pool, std::size_t index);
void MoveTop(util::Pool &pool);
typedef std::vector<Applied> Revealed;
Revealed revealed_;
typedef std::priority_queue<QueueEntry> Queue;
Queue queue_;
};
class NBest {
public:
typedef std::vector<PartialEdge> Combine;
explicit NBest(const NBestConfig &config) : config_(config) {}
void Add(std::vector<PartialEdge> &existing, PartialEdge addition) const {
existing.push_back(addition);
}
NBestComplete Complete(std::vector<PartialEdge> &partials);
const std::vector<Applied> &Extract(History root);
private:
const NBestConfig config_;
boost::object_pool<NBestList> list_pool_;
util::Pool entry_pool_;
};
} // namespace search
#endif // SEARCH_NBEST__