equal_range() [2/2]

template<typename Key, typename Value, typename Less = fl::less<Key>>

fl::pair< const_iterator, const_iterator > fl::SortedHeapMap< Key, Value, Less >::equal_range ( const Key & key ) const

inline

Definition at line 438 of file map.h.

                                                                             {
        const_iterator lower = lower_bound(key);
        const_iterator upper = upper_bound(key);
        return fl::pair<const_iterator, const_iterator>(lower, upper);
    }