GrHashMapWithCache< K, V, KeyTraits, HashT > Class Template Reference

#include <GrHashMapWithCache.h>

Inheritance diagram for GrHashMapWithCache< K, V, KeyTraits, HashT >:

Public Member Functions
int	count () const
size_t	approxBytesUsed () const
const V *	find (const K &key) const
const V *	set (K key, V val)
void	remove (K key)
void	reset ()
Public Member Functions inherited from SkNoncopyable
	SkNoncopyable ()=default
	SkNoncopyable (SkNoncopyable &&)=default
SkNoncopyable &	operator= (SkNoncopyable &&)=default

Detailed Description

template<typename K, typename V, typename KeyTraits, typename HashT = SkGoodHash>
class GrHashMapWithCache< K, V, KeyTraits, HashT >

A hash map that caches the most recently accessed entry. The API is a subset of SkHashMap, and you must provide a sentinel key that will never be present, such as SK_InvalidUniqueID.

KeyTraits must have:

• static K GetInvalidKey()

Definition at line 30 of file GrHashMapWithCache.h.

Member Function Documentation

approxBytesUsed()

template<typename K , typename V , typename KeyTraits , typename HashT = SkGoodHash>

size_t GrHashMapWithCache< K, V, KeyTraits, HashT >::approxBytesUsed ( ) const

inline

Definition at line 36 of file GrHashMapWithCache.h.

{ return fMap.approxBytesUsed(); }

count()

template<typename K , typename V , typename KeyTraits , typename HashT = SkGoodHash>

int GrHashMapWithCache< K, V, KeyTraits, HashT >::count ( ) const

inline

Definition at line 33 of file GrHashMapWithCache.h.

{ return fMap.count(); }

find()

template<typename K , typename V , typename KeyTraits , typename HashT = SkGoodHash>

const V * GrHashMapWithCache< K, V, KeyTraits, HashT >::find ( const K &  key ) const

inline

Definition at line 42 of file GrHashMapWithCache.h.

                                      {
        if (key != fLastKey) {
            fLastKey = key;
            fLastValue = fMap.find(key);
        }
        return fLastValue;
    }

remove()

template<typename K , typename V , typename KeyTraits , typename HashT = SkGoodHash>

void GrHashMapWithCache< K, V, KeyTraits, HashT >::remove ( K  key )

inline

Definition at line 63 of file GrHashMapWithCache.h.

                       {
        // Match THashMap requirement. The caller can find() if they're unsure.
        SkASSERT(fMap.find(fLastKey));
        fLastKey = std::move(key);
        fLastValue = nullptr;
        fMap.remove(fLastKey);
    }

reset()

template<typename K , typename V , typename KeyTraits , typename HashT = SkGoodHash>

void GrHashMapWithCache< K, V, KeyTraits, HashT >::reset ( )

inline

Definition at line 72 of file GrHashMapWithCache.h.

                 {
        fLastKey = KeyTraits::GetInvalidKey();
        fLastValue = nullptr;
        fMap.reset();
    }

set()

template<typename K , typename V , typename KeyTraits , typename HashT = SkGoodHash>

const V * GrHashMapWithCache< K, V, KeyTraits, HashT >::set ( K  key, V  val  )

inline

Definition at line 52 of file GrHashMapWithCache.h.

                               {
        if (fLastValue && key == fLastKey) {
            *fLastValue = std::move(val);
        } else {
            fLastKey = key;
            fLastValue = fMap.set(std::move(key), std::move(val));
        }
        return fLastValue;
    }

---

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

• third_party/skia/src/gpu/ganesh/GrHashMapWithCache.h