Function insert

src/fl/stl/unordered_map.h:324–351

insert or overwrite - returns pair iterator points to element, bool is true if inserted, false if updated

    // insert or overwrite - returns pair<iterator, bool>
    // iterator points to element, bool is true if inserted, false if updated
    pair<iterator, bool> insert(const Key &key, const T &value) {
        const bool will_rehash = needs_rehash();
        if (will_rehash) {
            // if half the buckets are tombstones, rehash inline to prevent
            // memory spill over into the heap.
            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(key);
        idx = p.first;
        is_new = p.second;
        if (is_new) {
            _buckets[idx].key = key;
            _buckets[idx].value = value;
            mark_occupied(idx);
            ++_size;
        } else {
            FASTLED_ASSERT(idx != npos(), "unordered_map::insert: invalid index at "
                                            << idx << " which is " << npos());
            _buckets[idx].value = value;
        }
        return {iterator(this, idx), is_new};
    }

    // Move version of insert - returns pair<iterator, bool>
    // iterator points to element, bool is true if inserted, false if updated