erase() [2/3]

template<typename Key, typename Value, typename Compare = less<Key>, typename Allocator = allocator_slab<char>>

iterator fl::MapRedBlackTree< Key, Value, Compare, Allocator >::erase ( const_iterator first, const_iterator last )

inline

Definition at line 1305 of file rbtree.h.

                                                              {
        // Handle empty range case
        if (first == last) {
            // Convert const_iterator to iterator for empty range
            // We need to find the same position as an iterator
            if (first == mTree.cend()) {
                return mTree.end();
            }
            // For non-end iterator, find by constructing the full value_type for search
            return mTree.find(value_type(first->first, Value()));
        }
 
        // Erase elements one by one from first to last
        // Use an iterator to track position since erase returns iterator
        iterator current = mTree.erase(first); // Erase first element and get iterator to next
 
        // Continue erasing while we haven't reached last
        // We need to compare with last, but current is iterator and last is const_iterator
        // This works because iterator can be compared with const_iterator
        while (current != last) {
            current = mTree.erase(current);
        }
 
        // Return iterator following the last removed element
        return current;
    }