The Rust std lib HashMap is powered by the hashbrown crate which is also a port of Swiss Tables. At a brief glance Ruby&#x2F;Python don’t use this approach but I don’t see any reason why they couldn’t.

I guess it took a bit longer to get it adopted within Go because of some additional challenges:<a href="https:&#x2F;&#x2F;go.dev&#x2F;blog&#x2F;swisstable#go-challenges" rel="nofollow">https:&#x2F;&#x2F;go.dev&#x2F;blog&#x2F;swisstable#go-challenges</a>

It&#x27;s the &quot;map&quot; builtin. Go has a scripting-language-esque attitude of &quot;you can build most things with arrays and hash tables&quot;. It doesn&#x27;t completely preclude getting deeper but that&#x27;s the general starting point.

Go is much older than Swiss Tables. Since the hash table is a widely used container type and Go aspires to having a sort of &quot;kitchen sink&quot; stdlib I assume Go 1.0 had a hash table, and it can&#x27;t be a Swiss Table because those weren&#x27;t invented yet.

swiss tables were invented by engineers working at google&#x27;s zurich office, hence the nameim surprised that go, a programming language also from google, wasn&#x27;t using them!for an excellent talk on the development of swiss tables i highly recommend this talk by Matt Kulukundis at CppCon 2017: &quot;Designing a fast, efficient, cache-friendly hash table, step by step&quot; 
<a href="https:&#x2F;&#x2F;youtu.be&#x2F;ncHmEUmJZf4" rel="nofollow">https:&#x2F;&#x2F;youtu.be&#x2F;ncHmEUmJZf4</a>

How Swiss tables work in Go built-in map