operator[]()

template<typename Key, typename T, typename Hash = Hash<Key>, typename KeyEqual = EqualTo<Key>, int INLINED_COUNT = FASTLED_HASHMAP_INLINED_COUNT>

T & fl::HashMapLru< Key, T, Hash, KeyEqual, INLINED_COUNT >::operator[] ( const Key & key )

inline

Definition at line 93 of file hash_map_lru.h.

                                  {
        // If we're at capacity and this is a new key, evict oldest
        auto curr = mCurrentTime++;
 
        auto entry = mMap.find_value(key);
        if (entry) {
            // Update access time
            entry->last_access_time = curr;
            return entry->value;
        }
 
        if (mMap.size() >= mMaxSize) {
            evictOldest();
        }
 
        // Get or create entry and update timestamp
        // mCurrentTime++;
        ValueWithTimestamp &vwt = mMap[key];
        vwt.last_access_time = curr;
        return vwt.value;
    }

References evictOldest(), fl::HashMapLru< Key, T, Hash, KeyEqual, INLINED_COUNT >::ValueWithTimestamp::last_access_time, mCurrentTime, mMap, mMaxSize, and fl::HashMapLru< Key, T, Hash, KeyEqual, INLINED_COUNT >::ValueWithTimestamp::value.

Here is the call graph for this function: