at() [2/2]

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

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

inline

Definition at line 351 of file map.h.

                                          {
        const_iterator it = find(key);
        FASTLED_ASSERT(it != end(), "SortedHeapMap::at: key not found");
        return it->second;
    }