Use std::vector to implement HashTable

Allows some code semplification and avoids directly
allocation and managing heap memory.

Also the usual renaming while there.

No functional change and no speed regression.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>

src/endgame.h

@@ -112,7 +112,7 @@ public:
   Endgames();
   ~Endgames();
 
-  template<typename T> EndgameBase<T>* get(Key key) {
+  template<typename T> EndgameBase<T>* probe(Key key) {
     return map((T*)0).count(key) ? map((T*)0)[key] : NULL;
   }
 };