remove unused includes

commit_hash:1853234e3cc2386843bcb3c973f43778e813efeb

Author: tobo

util/generic/hash.h

@@ -3,6 +3,7 @@
 #include "fwd.h"
 
 #include "hash_table.h"
+#include "mapfindptr.h"
 
 template <class Key, class T, class HashFcn, class EqualKey, class Alloc>
 class THashMap: public TMapOps<THashMap<Key, T, HashFcn, EqualKey, Alloc>> {

util/generic/hash_table.h

@@ -1,24 +1,18 @@
 #pragma once
 
 #include "fwd.h"
-#include "mapfindptr.h"
 
 #include <util/memory/alloc.h>
 #include <util/system/compiler.h>
 #include <util/system/type_name.h>
 #include <util/system/yassert.h>
 #include <util/str_stl.h>
 #include "yexception.h"
-#include "typetraits.h"
 #include "utility.h"
 
 #include <algorithm>
-#include <initializer_list>
 #include <memory>
 #include <tuple>
-#include <utility>
-
-#include <cstdlib>
 
 #include "hash_primes.h"
 
@@ -32,7 +26,7 @@ struct TSelect1st {
 template <class Value>
 struct __yhashtable_node {
     /** If the first bit is not set, then this is a pointer to the next node in
-     * the list of nodes for the current bucket. Otherwise this is a pointer of
+     * the list of nodes for the current bucket. Otherwise, this is a pointer of
      * type __yhashtable_node**, pointing back into the buckets array.
      *
      * This trick makes it possible to use only one node pointer in a hash table