google-sparsehash
brew install google-sparsehash
v2.0.4
BSD-3-Clause
Extremely memory-efficient hash_map implementation
36
30-day installs · #5413
68
90-day · #6537
246
365-day · #6845
1.6k
★ GitHub stars · updated 4y ago
Links
- https://github.com/sparsehash/sparsehash
- GitHub: sparsehash/sparsehash
- Brew formula source: Formula/g/google-sparsehash.rb
Raw metadata
{
"aliases": [],
"alternatives": [],
"build_dependencies": [],
"categories": [],
"caveats": null,
"conflicts_with": [],
"dependencies": [],
"deprecated": 0,
"deprecation_reason": null,
"desc": "Extremely memory-efficient hash_map implementation",
"disable_reason": null,
"disabled": 0,
"enrichment_fetched_at": "2026-06-20T23:38:19+00:00",
"first_seen": "2026-06-20T23:34:18+00:00",
"full_name": "google-sparsehash",
"github_default_branch": "master",
"github_last_commit_at": "2021-11-30T02:30:00Z",
"github_readme_excerpt": "This directory contains several hash-map implementations, similar in\nAPI to SGI\u0027s hash_map class, but with different performance\ncharacteristics. sparse_hash_map uses very little space overhead, 1-2\nbits per entry. dense_hash_map is very fast, particulary on lookup.\n(sparse_hash_set and dense_hash_set are the set versions of these\nroutines.) On the other hand, these classes have requirements that\nmay not make them appropriate for all applications.\n\nAll these implementation use a hashtable with internal quadratic\nprobing. This method is space-efficient -- there is no pointer\noverhead -- and time-efficient for good hash functions.\n\nCOMPILING\n---------\nTo compile test applications with these classes, run ./configure\nfollowed by make. To install these header files on your system, run\n\u0027make install\u0027. (On Windows, the instructions are different; see\nREADME_windows.txt.) See INSTALL for more details.\n\nThis code should work on any modern C++ system. It has been tested on\nLinux (Ubuntu, Fedora, RedHat, Debian), Solaris 10 x86, FreeBSD 6.0,\nOS X 10.3 and 10.4, and Windows under both VC++7 and VC++8.\n\nUSING\n-----\nSee the html files in the doc directory for small example programs\nthat use these classes. It\u0027s enough to just include the header file:\n\n #include \u003csparsehash/sparse_hash_map\u003e // or sparse_hash_set, dense_hash_map, ...\n google::sparse_hash_set\u003cint, int\u003e number_mapper;\n\nand use the class the way you would other hash-map implementations.\n(Though see \"API\" below for caveats.)\n\nBy default (you can change it via a flag to ./configure), these hash\nimplementations are defined in the google namespace.\n\nAPI\n---\nThe API for sparse_hash_map, dense_hash_map, sparse_hash_set, and\ndense_hash_set, are a superset of the API of SGI\u0027s hash_map class.\nSee doc/sparse_hash_map.html, et al., for more information about the\nAPI.\n\nThe usage of these classes differ from SGI\u0027s hash_map, and other\nhashtable implementations, in the following major ways:\n\n1) dense_hash_map requires yo",
"github_repo": "sparsehash/sparsehash",
"github_stars": 1601,
"github_topics": [],
"homepage": "https://github.com/sparsehash/sparsehash",
"homepage_og_description": null,
"homepage_og_image": null,
"homepage_title": null,
"installs_30d": 36,
"installs_365d": 246,
"installs_90d": 68,
"keg_only": 0,
"keg_only_reason": null,
"last_seen": "2026-06-20T23:34:18+00:00",
"license": "BSD-3-Clause",
"llm_generated_at": null,
"llm_model": null,
"name": "google-sparsehash",
"oldnames": [],
"one_liner": null,
"optional_dependencies": [],
"rank_30d": 5413,
"rank_365d": 6845,
"rank_90d": 6537,
"raw_hash": "29cbbf0f42455094",
"recommended_dependencies": [],
"revision": 0,
"ruby_source_path": "Formula/g/google-sparsehash.rb",
"tap": "homebrew/core",
"test_dependencies": [],
"uses_from_macos": [],
"version_head": "HEAD",
"version_stable": "2.0.4",
"versioned_formulae": [],
"why_use_this": null
}