src.elv.sh/pkg/persistent/hashmap.bitmapNode.bitmap (field)
13 uses
src.elv.sh/pkg/persistent/hashmap (current package)
hashmap.go#L238: newNode.bitmap |= 1 << uint(i)
hashmap.go#L296: bitmap uint32
hashmap.go#L354: if (n.bitmap>>i)&1 != 0 {
hashmap.go#L369: if n.bitmap == bit {
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#L394: idx := index(n.bitmap, bit)
hashmap.go#L395: if n.bitmap&bit == 0 {
hashmap.go#L408: return &bitmapNode{n.bitmap | bit, newEntries}, true
hashmap.go#L430: if n.bitmap&bit == 0 {
hashmap.go#L433: idx := index(n.bitmap, bit)
hashmap.go#L456: if n.bitmap&bit == 0 {
hashmap.go#L459: idx := index(n.bitmap, bit)