Each slot in the hash table has a control byte which can have one of three states: empty, deleted, and full. They have the following bit patterns:

bitset represents a set of slots within a group. The underlying representation uses one byte per slot, where each byte is either 0x80 if the slot is

ctrlGroup is a fixed size array of groupSize control bytes stored in a uint64. See Get() and Set() methods implemented in endian_*.go.

Allocator specifies an interface for allocating and releasing memory used by a Map. The default allocator utilizes Go's builtin make() and allows the

Group holds groupSize control bytes and slots.

Map is an unordered map from keys to values with Put, Get, Delete, and All operations. Map is inspired by Google's Swiss Tables design as implemented

Option provides an interface for passing configuration parameters for Map initialization.

bucket implements Google's Swiss Tables hash table design. A Map is composed of 1 or more buckets that are addressed using extendible hashing.

noCopy may be added to structs which must not be copied after the first use. See https://golang.org/issues/8005#issuecomment-190753527 for details.

probeSeq maintains the state for a probe sequence that iterates through the groups in a bucket. The sequence is a triangular progression of the form

From runtime/runtime2.go:eface

From internal/abi/type.go:MapType In go 1.24, this is a prefix of both abi.SwissMapType and abi.OldMapType.

From internal/abi/type.go:Type

slot holds a key and value.

slotGroup is a fixed size array of groupSize slots. The keys and values are stored interleaved in slots with a memory layout that looks like K/V/K/V/

unsafeSlice provides semi-ergonomic limited slice-like functionality without bounds checking for fixed sized slices.