stdmap

type HashIter struct {
	Key         unsafe.Pointer // Must be in first position.  Write nil to indicate iteration end (see cmd/compile/internal/walk/range.go).
	Elem        unsafe.Pointer // Must be in second position (see cmd/compile/internal/walk/range.go).
	T           *abi.MapType
	H           *hmap
	Buckets     unsafe.Pointer // bucket ptr at hash_iter initialization time
	Bptr        *bmap          // current bucket
	Overflow    *[]*bmap       // keeps overflow buckets of hmap.buckets alive
	OldOverflow *[]*bmap       // keeps overflow buckets of hmap.oldbuckets alive
	StartBucket uintptr        // bucket iteration started at
	Offset      uint8          // intra-bucket offset to start from during iteration (should be big enough to hold bucketCnt-1)
	Wrapped     bool           // already wrapped around from end of bucket array to beginning
	B           uint8
	I           uint8
	Bucket      uintptr
	CheckBucket uintptr
}

type HashMap struct {
	// Note: the format of the hmap is also encoded in cmd/compile/internal/reflectdata/reflect.go.
	// Make sure this stays in sync with the compiler's definition.
	Count     int // # live cells == size of map.  Must be first (used by len() builtin)
	Flags     uint8
	B         uint8  // log_2 of # of buckets (can hold up to loadFactor * 2^B items)
	Noverflow uint16 // approximate number of overflow buckets; see incrnoverflow for details
	Hash0     uint32 // hash seed

	Nevacuate uintptr // progress counter for evacuation (buckets less than this have been evacuated)

	Extra *mapextra // optional fields
	// contains filtered or unexported fields
}

type MapBucket struct {
	// contains filtered or unexported fields
}

type MapExtra struct {
	// contains filtered or unexported fields
}