use std::unordered_set instead of boost::unordered_set for all instances in moses2. To avoid confusionRELEASE-4.0RELEASE-4.0

3 files changed, 3 insertions, 5 deletions

diff --git a/moses2/defer/CubePruningCardinalStack/Misc.h b/moses2/defer/CubePruningCardinalStack/Misc.h
index 9f5d28f1e..d04c299d1 100644
--- a/moses2/defer/CubePruningCardinalStack/Misc.h
+++ b/moses2/defer/CubePruningCardinalStack/Misc.h
@@ -7,7 +7,6 @@
 #pragma once
 #include <boost/pool/pool_alloc.hpp>
 #include <boost/unordered_map.hpp>
-#include <boost/unordered_set.hpp>
 #include <vector>
 #include <queue>
 #include "../../legacy/Range.h"
@@ -72,7 +71,7 @@ public:
           QueueItemOrderer> Queue;
 
   typedef std::pair<const CubeEdge*, int> SeenPositionItem;
-  typedef boost::unordered_set<SeenPositionItem,
+  typedef std::unordered_set<SeenPositionItem,
           boost::hash<SeenPositionItem>,
           std::equal_to<SeenPositionItem>
           > SeenPositions;
diff --git a/moses2/defer/CubePruningCardinalStack/Search.cpp b/moses2/defer/CubePruningCardinalStack/Search.cpp
index 23cae74eb..6f72a53f8 100644
--- a/moses2/defer/CubePruningCardinalStack/Search.cpp
+++ b/moses2/defer/CubePruningCardinalStack/Search.cpp
@@ -96,7 +96,7 @@ void Search::Decode(size_t stackInd)
 
   /*
   cerr << "edges: ";
-  boost::unordered_set<const Bitmap*> uniqueBM;
+  std::unordered_set<const Bitmap*> uniqueBM;
   BOOST_FOREACH(CubeEdge *edge, edges) {
   	uniqueBM.insert(&edge->newBitmap);
   	//cerr << *edge << " ";
diff --git a/moses2/defer/CubePruningCardinalStack/Stack.h b/moses2/defer/CubePruningCardinalStack/Stack.h
index 94e987b7b..06ca54a57 100644
--- a/moses2/defer/CubePruningCardinalStack/Stack.h
+++ b/moses2/defer/CubePruningCardinalStack/Stack.h
@@ -6,7 +6,6 @@
  */
 #pragma once
 #include <boost/unordered_map.hpp>
-#include <boost/unordered_set.hpp>
 #include <deque>
 #include "../Hypothesis.h"
 #include "../../TypeDef.h"
@@ -29,7 +28,7 @@ typedef Vector<const Hypothesis*>  Hypotheses;
 class Stack
 {
 protected:
-  typedef boost::unordered_set<const Hypothesis*,
+  typedef std::unordered_set<const Hypothesis*,
           UnorderedComparer<Hypothesis>,
           UnorderedComparer<Hypothesis>
           > _HCType;