src.elv.sh/pkg/persistent/hashmap.collisionNode.entries (field)

12 uses

	src.elv.sh/pkg/persistent/hashmap (current package)
		hashmap.go#L519: 	entries []mapEntry
		hashmap.go#L527: 				n.hash, replaceEntry(n.entries, uint32(idx), k, v)}, false
		hashmap.go#L529: 		newEntries := make([]mapEntry, len(n.entries)+1)
		hashmap.go#L530: 		copy(newEntries[:len(n.entries)], n.entries[:])
		hashmap.go#L531: 		newEntries[len(n.entries)] = mapEntry{k, v}
		hashmap.go#L544: 	if len(n.entries) == 1 {
		hashmap.go#L547: 	return &collisionNode{n.hash, withoutEntry(n.entries, uint32(idx))}, true
		hashmap.go#L555: 	return n.entries[idx].value, true
		hashmap.go#L559: 	for i, entry := range n.entries {
		hashmap.go#L577: 	entry := it.n.entries[it.index]
		hashmap.go#L582: 	return it.index < len(it.n.entries)