From d7966e4e2a414b864502d51221738dafb113264b Mon Sep 17 00:00:00 2001
From: graehl <graehl@ec762483-ff6d-05da-a07a-a48fb63a330f>
Date: Wed, 11 Aug 2010 03:06:15 +0000
Subject: use boost hash

git-svn-id: https://ws10smt.googlecode.com/svn/trunk@516 ec762483-ff6d-05da-a07a-a48fb63a330f
---
 decoder/cfg.cc | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/decoder/cfg.cc b/decoder/cfg.cc
index 4149a1ce..147fa1a0 100755
--- a/decoder/cfg.cc
+++ b/decoder/cfg.cc
@@ -26,7 +26,7 @@ void CFG::Binarize(CFGBinarize const& b) {
   }
   // l2r only so far:
   cerr << "Binarizing "<<b<<endl;
-  HASH_MAP<BinRhs,NTHandle> bin2lhs; // we're going to hash cons rather than build an explicit trie from right to left.
+  HASH_MAP<BinRhs,NTHandle,boost::hash<BinRhs> > bin2lhs; // we're going to hash cons rather than build an explicit trie from right to left.
   HASH_MAP_EMPTY(bin2lhs,nullrhs);
   int rhsmin=b.bin_unary?0:1;
   // iterate using indices and not iterators because we'll be adding to both nodes and edge list.  we could instead pessimistically reserve space for both, but this is simpler.  also: store original end of nts since we won't need to reprocess newly added ones.
-- 
cgit v1.2.3