VictoriaMetrics Observability Blog

Blog posts

• 

  • Go @ VictoriaMetrics
  • Open Source Tech

  How Go’s Built-in Map Works with Swiss Tables

  Go 1.24 replaced the built-in map’s bucket-based runtime with Swiss Tables. This article explains groups, control bytes, H1 and H2, probing, table growth, directories, deletion, load factor, and the experimental split-group layout.

• 

  • Go @ VictoriaMetrics
  • Open Source Tech

  Understanding Go's sync.Map from API to Hash Trie

  Go’s sync.Map now uses a hash trie. This article builds the implementation from a normal map, then explains lock-free reads, fine-grained writer locking, collisions, retries, deletion, Clear, Range, and the trade-offs against map plus RWMutex.

• 

  • Go @ VictoriaMetrics
  • Open Source Tech

  Go sync.Map: The Right Tool for the Right Job

  Go’s sync.Map isn’t a magic bullet for all concurrent map needs. It’s got some good tricks up its sleeve, like handling reads without locking, but it’s not always the best choice. This article dives into how sync.Map works under the hood, from its two-map system to the bottom line of expunged entries.

• 

  • Go @ VictoriaMetrics
  • Open Source Tech

  Go Maps Explained: How Key-Value Pairs Are Actually Stored

  Map is a built-in type that acts as a key-value storage. Unlike arrays where you’re stuck with keys as increasing indices like 0, 1, 2, and so on, with maps, the key can be any comparable type.