From 45c9efc7d558dbe160056f02e74df1fee5d2d0e5 Mon Sep 17 00:00:00 2001
From: Kenneth Heafield <github@kheafield.com>
Date: Tue, 11 Sep 2012 14:30:16 +0100
Subject: Add search library to cdec (not used yet)

---
 klm/search/edge_generator.hh | 54 ++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 klm/search/edge_generator.hh

(limited to 'klm/search/edge_generator.hh')

diff --git a/klm/search/edge_generator.hh b/klm/search/edge_generator.hh
new file mode 100644
index 00000000..e306dc61
--- /dev/null
+++ b/klm/search/edge_generator.hh
@@ -0,0 +1,54 @@
+#ifndef SEARCH_EDGE_GENERATOR__
+#define SEARCH_EDGE_GENERATOR__
+
+#include "search/edge.hh"
+
+#include <boost/unordered_map.hpp>
+
+#include <functional>
+#include <queue>
+
+namespace lm {
+namespace ngram {
+class ChartState;
+} // namespace ngram
+} // namespace lm
+
+namespace search {
+
+template <class Model> class Context;
+
+class VertexGenerator;
+
+struct PartialEdgePointerLess : std::binary_function<const PartialEdge *, const PartialEdge *, bool> {
+  bool operator()(const PartialEdge *first, const PartialEdge *second) const {
+    return *first < *second;
+  }
+};
+
+class EdgeGenerator {
+  public:
+    // True if it has a hypothesis.  
+    bool Init(Edge &edge, VertexGenerator &parent);
+
+    Score Top() const {
+      return top_;
+    }
+
+    template <class Model> bool Pop(Context<Model> &context, VertexGenerator &parent);
+
+  private:
+    const Rule &GetRule() const {
+      return from_->GetRule();
+    }
+
+    Score top_;
+
+    typedef std::priority_queue<PartialEdge*, std::vector<PartialEdge*>, PartialEdgePointerLess> Generate;
+    Generate generate_;
+
+    Edge *from_;
+};
+
+} // namespace search
+#endif // SEARCH_EDGE_GENERATOR__
-- 
cgit v1.2.3