erase() [2/3]

template<typename Key, typename Hash = Hash<Key>, typename KeyEqual = EqualTo<Key>>

iterator fl::unordered_set< Key, Hash, KeyEqual >::erase ( const_iterator pos )

inline

Definition at line 133 of file unordered_set.h.

                                       {
        // Extract the key from the const_iterator before erasing
        Key key = *pos;
        data.erase(key);
        // Find the next element after erasing
        return find(key);
    }

References data, find(), and pos.

Here is the call graph for this function: