operator[]()

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

Value & fl::SortedHeapMap< Key, Value, Less >::operator[] ( const Key & key )

inline

Definition at line 395 of file map.h.

                                      {
        iterator it = find(key);
        if (it != end()) {
            return it->second;
        }
        Pair pair(key, Value());
        bool ok = data.insert(pair);
        FASTLED_ASSERT(ok, "Failed to insert into SortedHeapMap");
        return data.find(pair)->second;  // TODO: optimize.
    }