Faster Go maps with Swiss Tables

// This program demonstrates the new Swiss Table map implementation in Go 1.24.
// It creates a map, inserts many entries, and measures lookup speed.
// The code runs unchanged in Go 1.27.1, which already includes the Swiss Tables.

package main

import (
	"fmt"
	"math/rand"
	"time"
)

func main() {
	const n = 1_000_000
	m := make(map[int]int, n)

	// Fill the map with random keys.
	start := time.Now()
	for i := 0; i < n; i++ {
		m[rand.Int()] = i
	}
	fmt.Printf("Insertion time: %v\n", time.Since(start))

	// Look up all keys to exercise the new map internals.
	start = time.Now()
	sum := 0
	for k := range m {
		sum += m[k]
	}
	fmt.Printf("Lookup time: %v, sum: %d\n", time.Since(start), sum)
}