heterogeneous mutations for ConcurrentHashMap

Summary:
This diff adds heterogeneous mutation support to ConcurrentHashMap.
The gating of the allowed key types are done in `EnableHeterogeneousInsert`.

`CHM::insert()` does not destructure `pair` arguments and `CHM::emplace()` does
not yet attempt to identify a usable key, leaving those as future follow-ups.

Reviewed By: yfeldblum

Differential Revision: D23349316

fbshipit-source-id: 3d0b22f5c540d913db6bc93d77481d2ffc4426ac

folly/concurrency/ConcurrentHashMap.h

@@ -169,6 +169,27 @@ class ConcurrentHashMap {
   typedef KeyEqual key_equal;
   typedef ConstIterator const_iterator;
 
+ private:
+  template <typename K, typename T>
+  using EnableHeterogeneousInsert = std::enable_if_t<
+      ::folly::detail::
+          EligibleForHeterogeneousInsert<KeyType, HashFn, KeyEqual, K>::value,
+      T>;
+
+  template <typename K>
+  using IsIter = std::is_same<ConstIterator, remove_cvref_t<K>>;
+
+  template <typename K, typename T>
+  using EnableHeterogeneousErase = std::enable_if_t<
+      ::folly::detail::EligibleForHeterogeneousFind<
+          KeyType,
+          HashFn,
+          KeyEqual,
+          std::conditional_t<IsIter<K>::value, KeyType, K>>::value &&
+          !IsIter<K>::value,
+      T>;
+
+ public:
   /*
    * Construct a ConcurrentHashMap with 1 << ShardBits shards, size
    * and max_size given.  Both size and max_size will be rounded up to
@@ -260,13 +281,12 @@ class ConcurrentHashMap {
 
   std::pair<ConstIterator, bool> insert(
       std::pair<key_type, mapped_type>&& foo) {
-    auto segment = pickSegment(foo.first);
-    std::pair<ConstIterator, bool> res(
-        std::piecewise_construct,
-        std::forward_as_tuple(this, segment),
-        std::forward_as_tuple(false));
-    res.second = ensureSegment(segment)->insert(res.first.it_, std::move(foo));
-    return res;
+    return insertImpl(std::move(foo));
+  }
+
+  template <typename Key, EnableHeterogeneousInsert<Key, int> = 0>
+  std::pair<ConstIterator, bool> insert(std::pair<Key, mapped_type>&& foo) {
+    return insertImpl(std::move(foo));
   }
 
   template <typename Key, typename Value>
@@ -375,6 +395,12 @@ class ConcurrentHashMap {
     return item.first->second;
   }
 
+  template <typename Key, EnableHeterogeneousInsert<Key, int> = 0>
+  const ValueType operator[](const Key& key) {
+    auto item = insert(key, ValueType());
+    return item.first->second;
+  }
+
   const ValueType at(const KeyType& key) const { return atImpl(key); }
 
   template <typename K, EnableHeterogeneousFind<K, int> = 0>
@@ -384,14 +410,11 @@ class ConcurrentHashMap {
 
   // TODO update assign interface, operator[], at
 
-  size_type erase(const key_type& k) {
-    auto segment = pickSegment(k);
-    auto seg = segments_[segment].load(std::memory_order_acquire);
-    if (!seg) {
-      return 0;
-    } else {
-      return seg->erase(k);
-    }
+  size_type erase(const key_type& k) { return eraseImpl(k); }
+
+  template <typename K, EnableHeterogeneousErase<K, int> = 0>
+  size_type erase(const K& k) {
+    return eraseImpl(k);
   }
 
   // Calls the hash function, and therefore may throw.
@@ -409,15 +432,24 @@ class ConcurrentHashMap {
         k, [&expected](const ValueType& v) { return v == expected; });
   }
 
+  template <typename K, EnableHeterogeneousErase<K, int> = 0>
+  size_type erase_if_equal(const K& k, const ValueType& expected) {
+    return erase_key_if(
+        k, [&expected](const ValueType& v) { return v == expected; });
+  }
+
   // Erase if predicate evaluates to true on the existing value
   template <typename Predicate>
   size_type erase_key_if(const key_type& k, Predicate&& predicate) {
-    auto segment = pickSegment(k);
-    auto seg = segments_[segment].load(std::memory_order_acquire);
-    if (!seg) {
-      return 0;
+    return eraseKeyIfImpl(k, std::forward<Predicate>(predicate));
   }
-    return seg->erase_key_if(k, std::forward<Predicate>(predicate));
+
+  template <
+      typename K,
+      typename Predicate,
+      EnableHeterogeneousErase<K, int> = 0>
+  size_type erase_key_if(const K& k, Predicate&& predicate) {
+    return eraseKeyIfImpl(k, std::forward<Predicate>(predicate));
   }
 
   // NOT noexcept, initializes new shard segments vs.
@@ -561,6 +593,38 @@ class ConcurrentHashMap {
     return item->second;
   }
 
+  template <typename Key>
+  std::pair<ConstIterator, bool> insertImpl(std::pair<Key, mapped_type>&& foo) {
+    auto segment = pickSegment(foo.first);
+    std::pair<ConstIterator, bool> res(
+        std::piecewise_construct,
+        std::forward_as_tuple(this, segment),
+        std::forward_as_tuple(false));
+    res.second = ensureSegment(segment)->insert(res.first.it_, std::move(foo));
+    return res;
+  }
+
+  template <typename K>
+  size_type eraseImpl(const K& k) {
+    auto segment = pickSegment(k);
+    auto seg = segments_[segment].load(std::memory_order_acquire);
+    if (!seg) {
+      return 0;
+    } else {
+      return seg->erase(k);
+    }
+  }
+
+  template <typename K, typename Predicate>
+  size_type eraseKeyIfImpl(const K& k, Predicate&& predicate) {
+    auto segment = pickSegment(k);
+    auto seg = segments_[segment].load(std::memory_order_acquire);
+    if (!seg) {
+      return 0;
+    }
+    return seg->erase_key_if(k, std::forward<Predicate>(predicate));
+  }
+
   template <typename K>
   uint64_t pickSegment(const K& k) const {
     auto h = HashFn()(k);

folly/concurrency/detail/ConcurrentHashMap-detail.h

@@ -254,10 +254,10 @@ class alignas(64) BucketTable {
 
   bool empty() { return size() == 0; }
 
-  template <typename MatchFunc, typename... Args>
+  template <typename MatchFunc, typename K, typename... Args>
   bool insert(
       Iterator& it,
-      const KeyType& k,
+      const K& k,
       InsertType type,
       MatchFunc match,
       hazptr_obj_cohort<Atom>* cohort,
@@ -266,10 +266,10 @@ class alignas(64) BucketTable {
         it, k, type, match, nullptr, cohort, std::forward<Args>(args)...);
   }
 
-  template <typename MatchFunc, typename... Args>
+  template <typename MatchFunc, typename K, typename... Args>
   bool insert(
       Iterator& it,
-      const KeyType& k,
+      const K& k,
       InsertType type,
       MatchFunc match,
       Node* cur,
@@ -357,8 +357,8 @@ class alignas(64) BucketTable {
     return false;
   }
 
-  template <typename MatchFunc>
-  std::size_t erase(const KeyType& key, Iterator* iter, MatchFunc match) {
+  template <typename K, typename MatchFunc>
+  std::size_t erase(const K& key, Iterator* iter, MatchFunc match) {
     Node* node{nullptr};
     auto h = HashFn()(key);
     {
@@ -605,10 +605,10 @@ class alignas(64) BucketTable {
     DCHECK(buckets);
   }
 
-  template <typename MatchFunc, typename... Args>
+  template <typename MatchFunc, typename K, typename... Args>
   bool doInsert(
       Iterator& it,
-      const KeyType& k,
+      const K& k,
       InsertType type,
       MatchFunc match,
       Node* cur,
@@ -1145,10 +1145,10 @@ class alignas(64) SIMDTable {
 
   bool empty() { return size() == 0; }
 
-  template <typename MatchFunc, typename... Args>
+  template <typename MatchFunc, typename K, typename... Args>
   bool insert(
       Iterator& it,
-      const KeyType& k,
+      const K& k,
       InsertType type,
       MatchFunc match,
       hazptr_obj_cohort<Atom>* cohort,
@@ -1198,10 +1198,10 @@ class alignas(64) SIMDTable {
     return true;
   }
 
-  template <typename MatchFunc, typename... Args>
+  template <typename MatchFunc, typename K, typename... Args>
   bool insert(
       Iterator& it,
-      const KeyType& k,
+      const K& k,
       InsertType type,
       MatchFunc match,
       Node* cur,
@@ -1287,8 +1287,8 @@ class alignas(64) SIMDTable {
     return false;
   }
 
-  template <typename MatchFunc>
-  std::size_t erase(const KeyType& key, Iterator* iter, MatchFunc match) {
+  template <typename K, typename MatchFunc>
+  std::size_t erase(const K& key, Iterator* iter, MatchFunc match) {
     auto h = HashFn()(key);
     const HashPair hp = splitHash(h);
 
@@ -1391,8 +1391,9 @@ class alignas(64) SIMDTable {
   static size_t probeDelta(HashPair hp) { return 2 * hp.second + 1; }
 
   // Must hold lock.
+  template <typename K>
   Node* find_internal(
-      const KeyType& k,
+      const K& k,
       const HashPair& hp,
       Chunks* chunks,
       size_t ccount,
@@ -1421,10 +1422,10 @@ class alignas(64) SIMDTable {
     return nullptr;
   }
 
-  template <typename MatchFunc, typename... Args>
+  template <typename MatchFunc, typename K, typename... Args>
   bool prepare_insert(
       Iterator& it,
-      const KeyType& k,
+      const K& k,
       InsertType type,
       MatchFunc match,
       hazptr_obj_cohort<Atom>* cohort,
@@ -1649,7 +1650,8 @@ class alignas(64) ConcurrentHashMapSegment {
 
   bool empty() { return impl_.empty(); }
 
-  bool insert(Iterator& it, std::pair<key_type, mapped_type>&& foo) {
+  template <typename Key>
+  bool insert(Iterator& it, std::pair<Key, mapped_type>&& foo) {
     return insert(it, std::move(foo.first), std::move(foo.second));
   }
 
@@ -1749,10 +1751,10 @@ class alignas(64) ConcurrentHashMapSegment {
     return res;
   }
 
-  template <typename MatchFunc, typename... Args>
+  template <typename MatchFunc, typename K, typename... Args>
   bool insert_internal(
       Iterator& it,
-      const KeyType& k,
+      const K& k,
       InsertType type,
       MatchFunc match,
       Args&&... args) {
@@ -1760,10 +1762,10 @@ class alignas(64) ConcurrentHashMapSegment {
         it, k, type, match, cohort_, std::forward<Args>(args)...);
   }
 
-  template <typename MatchFunc, typename... Args>
+  template <typename MatchFunc, typename K, typename... Args>
   bool insert_internal(
       Iterator& it,
-      const KeyType& k,
+      const K& k,
       InsertType type,
       MatchFunc match,
       Node* cur) {
@@ -1779,18 +1781,18 @@ class alignas(64) ConcurrentHashMapSegment {
   }
 
   // Listed separately because we need a prev pointer.
-  size_type erase(const key_type& key) {
+  template <typename K>
+  size_type erase(const K& key) {
     return erase_internal(key, nullptr, [](const ValueType&) { return true; });
   }
 
-  template <typename Predicate>
-  size_type erase_key_if(const key_type& key, Predicate&& predicate) {
+  template <typename K, typename Predicate>
+  size_type erase_key_if(const K& key, Predicate&& predicate) {
     return erase_internal(key, nullptr, std::forward<Predicate>(predicate));
   }
 
-  template <typename MatchFunc>
-  size_type
-  erase_internal(const key_type& key, Iterator* iter, MatchFunc match) {
+  template <typename K, typename MatchFunc>
+  size_type erase_internal(const K& key, Iterator* iter, MatchFunc match) {
     return impl_.erase(key, iter, match);
   }
 

folly/concurrency/test/ConcurrentHashMapTest.cpp

@@ -21,6 +21,7 @@
 #include <thread>
 
 #include <folly/Traits.h>
+#include <folly/container/test/TrackingTypes.h>
 #include <folly/hash/Hash.h>
 #include <folly/portability/GFlags.h>
 #include <folly/portability/GTest.h>
@@ -834,7 +835,10 @@ TYPED_TEST_P(ConcurrentHashMapTest, IteratorLoop) {
 namespace {
 template <typename T, typename Arg>
 using detector_find = decltype(std::declval<T>().find(std::declval<Arg>()));
-}
+
+template <typename T, typename Arg>
+using detector_erase = decltype(std::declval<T>().erase(std::declval<Arg>()));
+} // namespace
 
 TYPED_TEST_P(ConcurrentHashMapTest, HeterogeneousLookup) {
   using Hasher = folly::transparent<folly::hasher<folly::StringPiece>>;
@@ -868,6 +872,70 @@ TYPED_TEST_P(ConcurrentHashMapTest, HeterogeneousLookup) {
   checks(folly::as_const(map));
 }
 
+TYPED_TEST_P(ConcurrentHashMapTest, HeterogeneousInsert) {
+  using Hasher = folly::transparent<folly::hasher<folly::StringPiece>>;
+  using KeyEqual = folly::transparent<std::equal_to<folly::StringPiece>>;
+  using P = std::pair<StringPiece, std::string>;
+  using CP = std::pair<const StringPiece, std::string>;
+
+  ConcurrentHashMap<std::string, std::string, Hasher, KeyEqual> map;
+  P p{"foo", "hello"};
+  StringPiece foo{"foo"};
+  StringPiece bar{"bar"};
+
+  map.insert("foo", "hello");
+  map.insert(foo, "hello");
+  // TODO(T31574848): the list-initialization below does not work on libstdc++
+  // versions (e.g., GCC < 6) with no implementation of N4387 ("perfect
+  // initialization" for pairs and tuples).
+  //   StringPiece sp{"foo"};
+  //   map.insert({sp, "hello"});
+  map.insert({"foo", "hello"});
+  map.insert(P("foo", "hello"));
+  map.insert(CP("foo", "hello"));
+  map.insert(std::move(p));
+  map.insert_or_assign("foo", "hello");
+  map.insert_or_assign(StringPiece{"foo"}, "hello");
+
+  map.erase(StringPiece{"foo"});
+  map.erase(foo);
+  map.erase("");
+  EXPECT_TRUE(map.empty());
+
+  map.insert("foo", "hello");
+  map.insert("bar", "world");
+  map.erase_if_equal(StringPiece{"foo"}, "hello");
+  map.erase_key_if(bar, [](const std::string& s) { return s == "world"; });
+  map.erase("");
+  EXPECT_TRUE(map.empty());
+
+  map.insert("foo", "baz");
+  EXPECT_TRUE(map.assign(foo, "hello2"));
+  EXPECT_TRUE(map.assign_if_equal("foo", "hello2", "hello"));
+  EXPECT_EQ(map[foo], "hello");
+  auto it = map.find(foo);
+  map.erase(it);
+  EXPECT_TRUE(map.empty());
+
+  map.try_emplace(foo);
+  map.try_emplace(foo, "hello");
+  map.try_emplace(StringPiece{"foo"}, "hello");
+  map.try_emplace(foo, "hello");
+  map.try_emplace(foo);
+  map.try_emplace("foo");
+  map.try_emplace("foo", "hello");
+  map.try_emplace("bar", /* count */ 20, 'x');
+  EXPECT_EQ(map[bar], std::string(20, 'x'));
+
+  map.emplace(StringPiece{"foo"}, "hello");
+  map.emplace("foo", "hello");
+
+  // invocability checks
+  static_assert(
+      !is_detected_v<detector_erase, decltype(map), int>,
+      "there shouldn't be an erase() overload for this string map with an int param");
+}
+
 REGISTER_TYPED_TEST_CASE_P(
     ConcurrentHashMapTest,
     MapTest,
@@ -903,7 +971,8 @@ REGISTER_TYPED_TEST_CASE_P(
     insertStressTest,
     IteratorMove,
     IteratorLoop,
-    HeterogeneousLookup);
+    HeterogeneousLookup,
+    HeterogeneousInsert);
 
 using folly::detail::concurrenthashmap::bucket::BucketTable;