ConcurrentMap< K, V, KT, VT >::Iterator Class Reference

#include <concurrent_map.h>

Public Member Functions
Key	getKey () const
Value	getValue () const
bool	isValid () const
	Iterator ()=default
	Iterator (ConcurrentMap &map)
void	next ()
void	setMap (ConcurrentMap &map)

Private Attributes
Key	m_hash
quint64	m_idx
Details::Table *	m_table
Value	m_value

Detailed Description

template<typename K, typename V, class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>
class ConcurrentMap< K, V, KT, VT >::Iterator

Definition at line 300 of file concurrent_map.h.

Constructor & Destructor Documentation

Iterator() [1/2]

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

ConcurrentMap< K, V, KT, VT >::Iterator::Iterator ( )

default

Iterator() [2/2]

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

ConcurrentMap< K, V, KT, VT >::Iterator::Iterator ( ConcurrentMap & map )

inline

Definition at line 310 of file concurrent_map.h.

        {
            // Since we've forbidden concurrent inserts (for now), nonatomic would suffice here, but let's plan ahead:
            m_table = map.m_root.load(Consume);
            m_idx = -1;
            next();
        }

References Consume, ConcurrentMap< K, V, KT, VT >::Iterator::m_idx, ConcurrentMap< K, V, KT, VT >::m_root, ConcurrentMap< K, V, KT, VT >::Iterator::m_table, and ConcurrentMap< K, V, KT, VT >::Iterator::next().

Member Function Documentation

getKey()

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

Key ConcurrentMap< K, V, KT, VT >::Iterator::getKey ( ) const

inline

Definition at line 353 of file concurrent_map.h.

        {
            // Since we've forbidden concurrent inserts (for now), nonatomic would suffice here, but let's plan ahead:
            return KeyTraits::dehash(m_hash);
        }

References ConcurrentMap< K, V, KT, VT >::Iterator::m_hash.

getValue()

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

Value ConcurrentMap< K, V, KT, VT >::Iterator::getValue ( ) const

inline

Definition at line 359 of file concurrent_map.h.

        {
            return m_value;
        }

References ConcurrentMap< K, V, KT, VT >::Iterator::m_value.

isValid()

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

bool ConcurrentMap< K, V, KT, VT >::Iterator::isValid ( ) const

inline

Definition at line 345 of file concurrent_map.h.

        {
#ifdef SANITY_CHECK
            KIS_SAFE_ASSERT_RECOVER_RETURN_VALUE(m_value != Value(ValueTraits::Redirect), false);
#endif
            return m_value != Value(ValueTraits::NullValue);
        }

References KIS_SAFE_ASSERT_RECOVER_RETURN_VALUE, and ConcurrentMap< K, V, KT, VT >::Iterator::m_value.

next()

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

void ConcurrentMap< K, V, KT, VT >::Iterator::next ( )

inline

Definition at line 325 of file concurrent_map.h.

        {
            while (++m_idx <= m_table->sizeMask) {
                // Index still inside range of table.
                typename Details::CellGroup* group = m_table->getCellGroups() + (m_idx >> 2);
                typename Details::Cell* cell = group->cells + (m_idx & 3);
                m_hash = cell->hash.load(Relaxed);
 
                if (m_hash != KeyTraits::NullHash) {
                    // Cell has been reserved.
                    m_value = cell->value.load(Relaxed);
                    if (m_value != Value(ValueTraits::NullValue))
                        return; // Yield this cell.
                }
            }
            // That's the end of the map.
            m_hash = KeyTraits::NullHash;
            m_value = Value(ValueTraits::NullValue);
        }

References Leapfrog< Map >::CellGroup::cells, Leapfrog< Map >::Table::getCellGroups(), Leapfrog< Map >::Cell::hash, Atomic< T >::load(), ConcurrentMap< K, V, KT, VT >::Iterator::m_hash, ConcurrentMap< K, V, KT, VT >::Iterator::m_idx, ConcurrentMap< K, V, KT, VT >::Iterator::m_table, ConcurrentMap< K, V, KT, VT >::Iterator::m_value, Relaxed, and Leapfrog< Map >::Cell::value.

setMap()

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

void ConcurrentMap< K, V, KT, VT >::Iterator::setMap ( ConcurrentMap & map )

inline

Definition at line 318 of file concurrent_map.h.

        {
            m_table = map.m_root.load(Consume);
            m_idx = -1;
            next();
        }

References Consume, ConcurrentMap< K, V, KT, VT >::Iterator::m_idx, ConcurrentMap< K, V, KT, VT >::m_root, ConcurrentMap< K, V, KT, VT >::Iterator::m_table, and ConcurrentMap< K, V, KT, VT >::Iterator::next().

Member Data Documentation

m_hash

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

Key ConcurrentMap< K, V, KT, VT >::Iterator::m_hash

private

Definition at line 305 of file concurrent_map.h.

m_idx

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

quint64 ConcurrentMap< K, V, KT, VT >::Iterator::m_idx

private

Definition at line 304 of file concurrent_map.h.

m_table

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

Details::Table* ConcurrentMap< K, V, KT, VT >::Iterator::m_table

private

Definition at line 303 of file concurrent_map.h.

m_value

template<typename K , typename V , class KT = DefaultKeyTraits<K>, class VT = DefaultValueTraits<V>>

Value ConcurrentMap< K, V, KT, VT >::Iterator::m_value

private

Definition at line 306 of file concurrent_map.h.

---

The documentation for this class was generated from the following file:

• libs/image/3rdparty/lock_free_map/concurrent_map.h