operator[]()

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

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

inline

Definition at line 103 of file flat_map.h.

                                                  {
        auto it = lower_bound(key);
        if (it != end() && !mLess(key, it->first) && !mLess(it->first, key)) {
            return it->second;
        }
        // Key not found, insert it with default value
        bool success = mData.insert(it, value_type(key, Value()));
        FASTLED_ASSERT(success, "Insert failed in flat_map::operator[]");
        // Find the newly inserted element
        it = find(key);
        return it->second;
    }