equal_range() [1/2]

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

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

inline

Definition at line 432 of file map.h.

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