try_emplace() [1/2]

template<typename Key, typename T, typename Hash = Hash<Key>, typename KeyEqual = EqualTo<Key>, int INLINED_COUNT = FASTLED_HASHMAP_INLINED_COUNT>

template<typename... Args>

pair< iterator, bool > fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::try_emplace ( const Key & k, Args &&... args )

inline

Definition at line 489 of file unordered_map.h.

                                                                   {
        const bool will_rehash = needs_rehash();
        if (will_rehash) {
            if (_tombstones > _size) {
                rehash_inline_no_resize();
            } else {
                rehash_internal(_buckets.size() * 2);
            }
        }
        fl::size idx;
        bool is_new;
        fl::pair<fl::size, bool> p = find_slot(k);
        idx = p.first;
        is_new = p.second;
        if (is_new) {
            // Key doesn't exist, construct in place
            _buckets[idx].key = k;
            _buckets[idx].value = T(fl::forward<Args>(args)...);
            mark_occupied(idx);
            ++_size;
        }
        // If not new, key already exists - don't construct value, just return existing iterator
        return {iterator(this, idx), is_new};
    }