The Put and Erase functions in the cache.hpp file can reduce the granularity of locks

[userwang12]

like this
`
void Put(const Key &key, const Value &value) noexcept
{
auto elem_it = FindElem(key);

    {
        operation_guard lock{safe_op}; 
        if (elem_it == cache_items_map.end())
        {
            // add new element to the cache
            if (cache_items_map.size() + 1 > max_cache_size)
            {
                auto disp_candidate_key = cache_policy.ReplCandidate();
                Erase(disp_candidate_key);
            }

            Insert(key, std::move(value));
        }
        else
        {
            // update previous value
            Update(key, std::move(value));
        }
    }
}

`

[vpetrigo]

Hello @userwang12,
Unfortunately, it does not seem possible, since FindElem relies on underlying map's look up which is not thread-safe. If multiple threads would like to Put/Update an element into a cache and the given Key has been replaced, that may lead to an incorrect access.