Use WaitFreeHashMap in BinlogKeyValue.

1 files changed, 0 insertions, 16 deletions

diff --git a/tdutils/td/utils/algorithm.h b/tdutils/td/utils/algorithm.h
index d225a46a9..a87de8ecb 100644
--- a/tdutils/td/utils/algorithm.h
+++ b/tdutils/td/utils/algorithm.h
@@ -301,20 +301,4 @@ bool table_remove_if(FlatHashTable<NodeT, HashT, EqT> &table, FuncT &&func) {
   return table.remove_if(func);
 }
 
-template <class KeyT, class ValueT, class HashT, class EqT>
-class WaitFreeHashMap;
-
-template <class KeyT, class ValueT, class HashT, class EqT, class FuncT>
-bool table_remove_if(WaitFreeHashMap<KeyT, ValueT, HashT, EqT> &table, const FuncT &func) {
-  return table.remove_if(func);
-}
-
-template <class KeyT, class HashT, class EqT>
-class WaitFreeHashSet;
-
-template <class KeyT, class HashT, class EqT, class FuncT>
-bool table_remove_if(WaitFreeHashSet<KeyT, HashT, EqT> &table, const FuncT &func) {
-  return table.remove_if(func);
-}
-
 }  // namespace td