insert()

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

void fl::HashMap< Key, T, Hash, KeyEqual, INLINED_COUNT >::insert ( const Key & key, const T & value )

inline

Definition at line 200 of file hash_map.h.

                                                {
        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(_buckets.size() * 2);
            }
        }
        size_t idx;
        bool is_new;
        fl::pair<size_t, 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, "HashMap::insert: invalid index at "
                                            << idx << " which is " << npos);
            _buckets[idx].value = value;
        }
    }

Referenced by fl::HashMap< Key, T, Hash, KeyEqual >::rehash().

Here is the caller graph for this function: