Rename is_key_empty to is_hash_table_key_empty.

tdutils/td/utils/FlatHashMapChunks.h

@@ -257,7 +257,7 @@ class FlatHashTableChunks {
   }
 
   Iterator find(const KeyT &key) {
-    if (empty() || is_key_empty(key)) {
+    if (empty() || is_hash_table_key_empty(key)) {
       return end();
     }
     const auto hash = calc_hash(key);
@@ -326,7 +326,7 @@ class FlatHashTableChunks {
 
   template <class... ArgsT>
   std::pair<Iterator, bool> emplace(KeyT key, ArgsT &&...args) {
-    CHECK(!is_key_empty(key));
+    CHECK(!is_hash_table_key_empty(key));
     auto it = find(key);
     if (it != end()) {
       return {it, false};

tdutils/td/utils/FlatHashMapLinear.h

@@ -200,7 +200,7 @@ class FlatHashTable {
   }
 
   Iterator find(const KeyT &key) {
-    if (unlikely(nodes_ == nullptr) || is_key_empty(key)) {
+    if (unlikely(nodes_ == nullptr) || is_hash_table_key_empty(key)) {
       return end();
     }
     auto bucket = calc_bucket(key);
@@ -265,7 +265,7 @@ class FlatHashTable {
   template <class... ArgsT>
   std::pair<Iterator, bool> emplace(KeyT key, ArgsT &&...args) {
     try_grow();
-    CHECK(!is_key_empty(key));
+    CHECK(!is_hash_table_key_empty(key));
     auto bucket = calc_bucket(key);
     while (true) {
       auto &node = nodes_[bucket];

tdutils/td/utils/HashTableUtils.h

@@ -11,7 +11,7 @@
 namespace td {
 
 template <class KeyT>
-bool is_key_empty(const KeyT &key) {
+bool is_hash_table_key_empty(const KeyT &key) {
   return key == KeyT();
 }
 

tdutils/td/utils/MapNode.h

@@ -65,7 +65,7 @@ struct MapNode {
   }
 
   bool empty() const {
-    return is_key_empty(first);
+    return is_hash_table_key_empty(first);
   }
 
   void clear() {

tdutils/td/utils/SetNode.h

@@ -50,7 +50,7 @@ struct SetNode {
   }
 
   bool empty() const {
-    return is_key_empty(first);
+    return is_hash_table_key_empty(first);
   }
 
   void clear() {