erase() [2/3]

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

iterator fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::erase ( const_iterator first, const_iterator last )

inline

Definition at line 573 of file unordered_map.h.

                                                                           {
        if (first._map != this || last._map != this) {
            return end(); // Invalid iterators
        }
 
        // Erase each element in the range
        // We need to convert const_iterator to iterator for the return value
        iterator current(this, first._idx);
        current.advance_to_occupied();
 
        while (current != end() && current._idx < last._idx) {
            fl::size idx_to_erase = current._idx;
            ++current;
            current.advance_to_occupied();
 
            // Erase the element at idx_to_erase
            mark_deleted(idx_to_erase);
            --_size;
            ++_tombstones;
        }
 
        return current;
    }