Method insert

cachelib/common/ApproxSplitSet.h:189–202

Returns true if @key already existed in the set before insert

  // Returns true if @key already existed in the set before insert
  bool insert(uint64_t key) {
    std::lock_guard<std::mutex> l(mutex_);
    DCHECK(!splits_.empty());
    // Important to lookup first, because entry may be in another split, not the
    // one we're currently inserting into.
    auto exists = lookupLocked(key);
    if (!exists) {
      if (splits_.back().size() >= maxSplitSize_) {
        addNewSplit();
      }
      splits_.back().insert(key);
    }
    return exists;
  }

  void reset() {
    std::lock_guard<std::mutex> lock{mutex_};