Go 1.24 uses Swiss Table, what are they?

Go's v1.24 introduced a new hash table implementation called Swiss Table, which improves efficiency and memory usage by using a cache-friendly approach and linear probing with SIMD instructions. Unlike the old Map's chaining strategy, Swiss Table keeps collision data nearby, speeding up comparisons and insertions. A new technique called Elastic Hashing has been proposed, which could potentially offer better performance than the current methods. Benchmarks show significant improvements in lookup and insertion times with the new Swiss Table.