at() [1/2]

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

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

inline

Definition at line 345 of file map.h.

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