A fast, memory efficient hash map for C++
-
Updated
Jun 13, 2026 - C++
A fast, memory efficient hash map for C++
An unordered C++ data container providing fast iteration/insertion/erasure while maintaining pointer/iterator validity to non-erased elements regardless of insertions/erasures. Provides higher-performance than std:: library containers for high-modification scenarios with unordered data.
Greg's Template Library of useful classes.
C++11/20 library that provides static_vector, small_vector, static_map, small_map, flat_map, static_flat_map, small_flat_map, static_unordered_map, small_unordered_map, etc.
Test equality of unordered sequences
Secure (with AEAD) version of USTP, called USTP-Secure (ustps://)
A Swift package filling the gaps left by the Standard Library. Production-ready data structures with clean APIs, protocol-oriented design, Sendable conformance, and COW semantics where it matters. Performance-first, zero dependencies.
Recreated SSH over USTPS
Toolkit for hashing user-defined types for use in hash maps, sets, etc.
Reliable unordered transport over UDP with selective retransmission and no transport-level HoL blocking. (ustp://)
To associate your repository with the unordered topic, visit your repo's landing page and select "manage topics."