← Home · All topics

Hash Tables

2 GoKawiil briefs on this topic

Blog post explains how VMs speed up object attribute access beyond hash tables

A technical write-up walks through why dynamic languages like Python, Ruby, and JavaScript often implement object attributes as hash tables, then details the performance costs of that approach. The piece argues that hashing, probing, and the extra memory indirection needed to reach a separate field-storage table make simple attribute lookups far slower than they should be.

bernsteinbear.com · 2026-10-22

Go 1.24 rebuilds built-in maps using Swiss Tables data structure

A technical deep-dive explains how Go 1.24 replaced its previous map runtime implementation with one based on Swiss Tables, a hashing design originally popularized by Google. The article breaks down the internal Map struct, showing how fields like 'used' let operations such as len(m) run in constant time, and how copying a map variable simply copies a pointer to shared underlying storage.

victoriametrics.com · 2026-09-03