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

17 uses

	src.elv.sh/pkg/persistent/hashmap (current package)
		hashmap.go#L239: 			newNode.entries[j].value = child
		hashmap.go#L297: 	entries []mapEntry
		hashmap.go#L350: 	newNode.nChildren = len(n.entries) + 1
		hashmap.go#L355: 			entry := n.entries[j]
		hashmap.go#L372: 	return &bitmapNode{n.bitmap ^ bit, withoutEntry(n.entries, idx)}
		hashmap.go#L383: 	return &bitmapNode{n.bitmap, replaceEntry(n.entries, i, entry.key, entry.value)}
		hashmap.go#L397: 		nEntries := len(n.entries)
		hashmap.go#L404: 		newEntries := make([]mapEntry, len(n.entries)+1)
		hashmap.go#L405: 		copy(newEntries[:idx], n.entries[:idx])
		hashmap.go#L407: 		copy(newEntries[idx+1:], n.entries[idx:])
		hashmap.go#L411: 	entry := n.entries[idx]
		hashmap.go#L434: 	entry := n.entries[idx]
		hashmap.go#L460: 	entry := n.entries[idx]
		hashmap.go#L483: 	if it.index < len(it.n.entries) {
		hashmap.go#L484: 		entry := it.n.entries[it.index]
		hashmap.go#L499: 	entry := it.n.entries[it.index]
		hashmap.go#L504: 	return it.index < len(it.n.entries)