google-sparsehash ☆

« Back to VersTracker

Description:
Extremely memory-efficient hash_map implementation

Type: Formula | Tracked Since: Dec 28, 2025

Links: Homepage | formulae.brew.sh

Category: Developer tools

Tags: c++ hash-table data-structures performance memory-efficient

Install: brew install google-sparsehash

About:
Google Sparsehash provides two dense hash_map implementations that are compatible with the SGI STL hash_map. These containers offer extremely low memory overhead—often just 2 bits per entry—while maintaining competitive performance, making them ideal for large-scale data structures.

Key Features:

Minimal memory footprint (2 bits per entry overhead)
STL-compatible dense_hash_map and dense_hash_set
High performance with linear probing
Support for empty key and deleted key placeholders

Use Cases:

Large-scale in-memory data processing
Memory-constrained applications and embedded systems
High-performance computing workloads

Alternatives:

libcuckoo – Provides cuckoo hashing but with higher memory usage
absl::flat_hash_map – Google's newer implementation with similar performance characteristics

Version History

Detected	Version	Rev	Change	Commit