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.hh | 54 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 klm/search/edge.hh

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

diff --git a/klm/search/edge.hh b/klm/search/edge.hh
new file mode 100644
index 00000000..4d2a5cbf
--- /dev/null
+++ b/klm/search/edge.hh
@@ -0,0 +1,54 @@
+#ifndef SEARCH_EDGE__
+#define SEARCH_EDGE__
+
+#include "lm/state.hh"
+#include "search/arity.hh"
+#include "search/rule.hh"
+#include "search/types.hh"
+#include "search/vertex.hh"
+
+#include <queue>
+
+namespace search {
+
+class Edge {
+  public:
+    Edge() {
+      end_to_ = to_;
+    }
+
+    Rule &InitRule() { return rule_; }
+
+    void Add(Vertex &vertex) {
+      assert(end_to_ - to_ < kMaxArity);
+      *(end_to_++) = &vertex;
+    }
+
+    const Vertex &GetVertex(std::size_t index) const {
+      return *to_[index];
+    }
+
+    const Rule &GetRule() const { return rule_; }
+
+  private:
+    // Rule and pointers to rule arguments.  
+    Rule rule_;
+
+    Vertex *to_[kMaxArity];
+    Vertex **end_to_;
+};
+
+struct PartialEdge {
+  Score score;
+  // Terminals
+  lm::ngram::ChartState between[kMaxArity + 1];
+  // Non-terminals
+  PartialVertex nt[kMaxArity];
+
+  bool operator<(const PartialEdge &other) const {
+    return score < other.score;
+  }
+};
+
+} // namespace search
+#endif // SEARCH_EDGE__
-- 
cgit v1.2.3