contains()

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

bool fl::SortedHeapMap< Key, Value, Less >::contains ( const Key & key ) const

inline

Definition at line 318 of file map.h.

                                        {
        return has(key);
    }