prev_value()

template<typename K , typename V >

V * scl::linked_unordered_map< K, V >::prev_value ( const K & key )

inline

Get the previous element by the key.

Parameters

[in]

key

the key.

Returns

Returns the previous element.

Note

It's slow, so do not use it unnecessary.

@breif Returns nullptr if not find key.

Returns nullptr if not a prev value;

Iter the list.

Definition at line 278 of file LinkedUnorderedMap.h.

    {
        if (!has_key(key)) return nullptr;
 
        std::shared_lock<std::shared_mutex> lock(m_Mutex);
 
        if (key == m_Keys.front()) return nullptr;
 
        for (auto it = m_Keys.begin(); it != m_Keys.end(); ++it)
        {
            if (*it == key)
            {
                return &(*std::prev(it));
            }
        }
 
        return nullptr;
    }

References scl::linked_unordered_map< K, V >::has_key().