#include <kis_tile_hash_table.h>

Public Types
typedef T	TileType

typedef KisSharedPtr< T >	TileTypeSP

Public Member Functions
template<class Helper = LockerType>
std::enable_if< std::is_same< Helper, QWriteLocker >::value, void >::type	deleteCurrent ()

bool	isDone () const

	KisTileHashTableIteratorTraits (KisTileHashTableTraits< T > *ht)

template<class Helper = LockerType>
std::enable_if< std::is_same< Helper, QWriteLocker >::value, void >::type	moveCurrentToHashTable (KisTileHashTableTraits< T > *newHashTable)

void	next ()

TileTypeSP	tile () const

	~KisTileHashTableIteratorTraits ()

Protected Member Functions
qint32	nextNonEmptyList (qint32 startIdx)

Protected Attributes
KisTileHashTableTraits< T > *	m_hashTable

qint32	m_index

LockerType	m_locker

TileTypeSP	m_tile

Detailed Description

template<class T, class LockerType>
class KisTileHashTableIteratorTraits< T, LockerType >

Walks through all tiles inside hash table Note: You can't work with your hash table in a regular way during iterating with this iterator, because HT is locked. The only thing you can do is to delete current tile.

LockerType defines if the iterator is constant or mutable. One should pass either QReadLocker or QWriteLocker as a parameter.

Definition at line 132 of file kis_tile_hash_table.h.

Member Typedef Documentation

◆ TileType

template<class T , class LockerType >

typedef T KisTileHashTableIteratorTraits< T, LockerType >::TileType

Definition at line 135 of file kis_tile_hash_table.h.

◆ TileTypeSP

template<class T , class LockerType >

typedef KisSharedPtr<T> KisTileHashTableIteratorTraits< T, LockerType >::TileTypeSP

Definition at line 136 of file kis_tile_hash_table.h.

Constructor & Destructor Documentation

◆ KisTileHashTableIteratorTraits()

template<class T , class LockerType >

KisTileHashTableIteratorTraits< T, LockerType >::KisTileHashTableIteratorTraits ( KisTileHashTableTraits< T > * ht )

inline

Definition at line 138 of file kis_tile_hash_table.h.

        : m_locker(&ht->m_lock)
    {
        m_hashTable = ht;
        m_index = nextNonEmptyList(0);
        if (m_index < KisTileHashTableTraits<T>::TABLE_SIZE)
            m_tile = m_hashTable->m_hashTable[m_index];
    }

References KisTileHashTableIteratorTraits< T, LockerType >::m_hashTable, KisTileHashTableIteratorTraits< T, LockerType >::m_index, KisTileHashTableIteratorTraits< T, LockerType >::m_tile, and KisTileHashTableIteratorTraits< T, LockerType >::nextNonEmptyList().

◆ ~KisTileHashTableIteratorTraits()

template<class T , class LockerType >

KisTileHashTableIteratorTraits< T, LockerType >::~KisTileHashTableIteratorTraits ( )

inline

Definition at line 147 of file kis_tile_hash_table.h.

147 {

148 }

Member Function Documentation

◆ deleteCurrent()

template<class T , class LockerType >

template<class Helper = LockerType>

std::enable_if< std::is_same< Helper, QWriteLocker >::value, void >::type KisTileHashTableIteratorTraits< T, LockerType >::deleteCurrent ( )

inline

Definition at line 177 of file kis_tile_hash_table.h.

                    {
        TileTypeSP tile = m_tile;
        next();
 
        const qint32 idx = m_hashTable->calculateHash(tile->col(), tile->row());
        m_hashTable->unlinkTile(tile->col(), tile->row(), idx);
    }

References KisTileHashTableIteratorTraits< T, LockerType >::m_hashTable, KisTileHashTableIteratorTraits< T, LockerType >::m_tile, KisTileHashTableIteratorTraits< T, LockerType >::next(), and KisTileHashTableIteratorTraits< T, LockerType >::tile().

◆ isDone()

template<class T , class LockerType >

bool KisTileHashTableIteratorTraits< T, LockerType >::isDone ( ) const

inline

Definition at line 170 of file kis_tile_hash_table.h.

                        {
        return !m_tile;
    }

References KisTileHashTableIteratorTraits< T, LockerType >::m_tile.

◆ moveCurrentToHashTable()

template<class T , class LockerType >

template<class Helper = LockerType>

std::enable_if< std::is_same< Helper, QWriteLocker >::value, void >::type KisTileHashTableIteratorTraits< T, LockerType >::moveCurrentToHashTable ( KisTileHashTableTraits< T > * newHashTable )

inline

Definition at line 188 of file kis_tile_hash_table.h.

                                                                    {
        TileTypeSP tile = m_tile;
        next();
 
        const qint32 idx = m_hashTable->calculateHash(tile->col(), tile->row());
        m_hashTable->unlinkTile(tile->col(), tile->row(), idx);
 
        newHashTable->addTile(tile);
    }

References KisTileHashTableTraits< T >::addTile(), KisTileHashTableIteratorTraits< T, LockerType >::m_hashTable, KisTileHashTableIteratorTraits< T, LockerType >::m_tile, KisTileHashTableIteratorTraits< T, LockerType >::next(), and KisTileHashTableIteratorTraits< T, LockerType >::tile().

◆ next()

template<class T , class LockerType >

void KisTileHashTableIteratorTraits< T, LockerType >::next ( )

inline

Definition at line 150 of file kis_tile_hash_table.h.

                {
        if (m_tile) {
            m_tile = m_tile->next();
            if (!m_tile) {
                qint32 idx = nextNonEmptyList(m_index + 1);
                if (idx < KisTileHashTableTraits<T>::TABLE_SIZE) {
                    m_index = idx;
                    m_tile = m_hashTable->m_hashTable[idx];
                } else {
                    //EOList reached
                    m_index = -1;
                    // m_tile.clear(); // already null
                }
            }
        }
    }

References KisTileHashTableIteratorTraits< T, LockerType >::m_hashTable, KisTileHashTableIteratorTraits< T, LockerType >::m_index, KisTileHashTableIteratorTraits< T, LockerType >::m_tile, and KisTileHashTableIteratorTraits< T, LockerType >::nextNonEmptyList().

◆ nextNonEmptyList()

template<class T , class LockerType >

qint32 KisTileHashTableIteratorTraits< T, LockerType >::nextNonEmptyList ( qint32 startIdx )

inlineprotected

Definition at line 205 of file kis_tile_hash_table.h.

                                             {
        qint32 idx = startIdx;
 
        while (idx < KisTileHashTableTraits<T>::TABLE_SIZE &&
                !m_hashTable->m_hashTable[idx]) {
            idx++;
        }
 
        return idx;
    }

References KisTileHashTableTraits< T >::m_hashTable, and KisTileHashTableIteratorTraits< T, LockerType >::m_hashTable.

◆ tile()

template<class T , class LockerType >

TileTypeSP KisTileHashTableIteratorTraits< T, LockerType >::tile ( ) const

inline

Definition at line 167 of file kis_tile_hash_table.h.

                            {
        return m_tile;
    }

References KisTileHashTableIteratorTraits< T, LockerType >::m_tile.

Member Data Documentation

◆ m_hashTable

template<class T , class LockerType >

KisTileHashTableTraits<T>* KisTileHashTableIteratorTraits< T, LockerType >::m_hashTable

protected

Definition at line 201 of file kis_tile_hash_table.h.

◆ m_index

template<class T , class LockerType >

qint32 KisTileHashTableIteratorTraits< T, LockerType >::m_index

protected

Definition at line 200 of file kis_tile_hash_table.h.

◆ m_locker

template<class T , class LockerType >

LockerType KisTileHashTableIteratorTraits< T, LockerType >::m_locker

protected

Definition at line 202 of file kis_tile_hash_table.h.

◆ m_tile

template<class T , class LockerType >

TileTypeSP KisTileHashTableIteratorTraits< T, LockerType >::m_tile

protected

Definition at line 199 of file kis_tile_hash_table.h.

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

libs/image/tiles3/kis_tile_hash_table.h

Public Types

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

Member Typedef Documentation

◆ TileType

◆ TileTypeSP

Constructor & Destructor Documentation

◆ KisTileHashTableIteratorTraits()

◆ ~KisTileHashTableIteratorTraits()

Member Function Documentation

◆ deleteCurrent()

◆ isDone()

◆ moveCurrentToHashTable()

◆ next()

◆ nextNonEmptyList()

◆ tile()

Member Data Documentation

◆ m_hashTable

◆ m_index

◆ m_locker

◆ m_tile