Method find

tests/relacy/spmchash.cpp:54–60

Thread-safe, but if somebody can remove the key while find() is in progress, then any returned value is not guaranteed to correspond to that key. This also applies if the key was not already present but once was. Elements can be found in any order.

    // to that key. This also applies if the key was not already present but
    // once was. Elements can be found in any order.
    TValue* find(std::uint64_t key)
    {
        auto idxEntry = get_entry_for_key(key);
        if (idxEntry == nullptr)
            return nullptr;
        return idxEntry->value.load(std::memory_order_acquire);
    }
    
    // Thread-safe, but if somebody else can remove the same key while remove()
    // is in progress, then any removed value is not guaranteed to correspond