erase() [3/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 ( iterator it )

inline

Definition at line 555 of file unordered_map.h.

                                {
        if (it == end() || it._map != this) {
            return end(); // Invalid iterator
        }
 
        // Mark the current position as deleted
        mark_deleted(it._idx);
        --_size;
        ++_tombstones;
 
        // Advance to next valid element and return iterator to it
        ++it._idx;
        it.advance_to_occupied();
        return it;
    }