evictOldest()

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

void fl::HashMapLru< Key, T, Hash, KeyEqual, INLINED_COUNT >::evictOldest ( )

inlineprivate

Definition at line 143 of file unordered_map_lru.h.

                       {
        if (mMap.empty())
            return;
 
        // Find the entry with the oldest timestamp
        Key oldest_key;
        // Use (max)() to prevent macro expansion by Arduino.h's max macro
        u32 oldest_time = (fl::numeric_limits<u32>::max)();
        bool found = false;
 
        for (auto it = mMap.begin(); it != mMap.end(); ++it) {
            const auto &entry = *it;
            const ValueWithTimestamp &vwt = entry.second;
 
            if (vwt.last_access_time < oldest_time) {
                oldest_time = vwt.last_access_time;
                oldest_key = entry.first;
                found = true;
            }
        }
 
        // Remove the oldest entry
        if (found) {
            mMap.remove(oldest_key);
        }
    }

Referenced by fl::HashMapLru< Args, fl::shared_ptr< Impl > >::insert(), fl::HashMapLru< Args, fl::shared_ptr< Impl > >::operator[](), and fl::HashMapLru< Args, fl::shared_ptr< Impl > >::setMaxSize().

Here is the caller graph for this function: