Method insertElement

hashmap.go:245–274

(element *ListElement[Key, Value], hash uintptr, key Key, value Value)

}

func (m *Map[Key, Value]) insertElement(element *ListElement[Key, Value], hash uintptr, key Key, value Value) bool {
	var existed, inserted bool

	for {
		store := m.store.Load()
		searchStart := store.item(element.keyHash)

		if !inserted { // if retrying after insert during grow, do not add to list again
			_, existed, inserted = m.linkedList.Add(searchStart, hash, key, value)
			if existed {
				return false
			}

			if !inserted {
				continue // a concurrent add did interfere, try again
			}
		}

		count := store.addItem(element)
		currentStore := m.store.Load()
		if store != currentStore { // retry insert in case of insert during grow
			continue
		}

		if m.isResizeNeeded(store, count) && m.resizing.CompareAndSwap(0, 1) {
			go m.grow(0, true)
		}
		return true
	}
}

// deleteElement deletes an element from index.
func (m *Map[Key, Value]) deleteElement(element *ListElement[Key, Value]) {