A fast, memory efficient hash map for C++
-
Updated
May 1, 2020 - C++
A fast, memory efficient hash map for C++
Java Collections till the last breadcrumb of memory and performance
A lock-free, eventually consistent, concurrent multi-value map.
Blazing fast concurrent HashMap for Rust.
CLRS study. Codes are written with golang.
TypeScript-STL (Standard Template Library, migrated from C++)
The Capsule Hash Trie Collections Library
A semi compile-/run-time associative map container with compile-time lookup and run-time storage
The dream fast hash function and random number generators that passed SMHasher, BigCrush and practrand.
A gulp of low latency Java
Library of generic and type safe containers in pure C language (C99 or C11) for a wide collection of container (comparable to the C++ STL).
Easy to use, header only, macro generated, generic and type-safe Data Structures in C
Containers backed by std.experimental.allocator
Templated type-safe hashmap implementation in C using open addressing and linear probing for collision resolution.
An open addressing linear probing hash table, tuned for delete heavy workloads
Fairly basic redis-like hashmap implementation on top of a epoll TCP server.
A C++14 compile-time/constexpr map and hash map with minimal binary footprint
This is a learning note | Java基础,JVM,源码,大数据,面经
Persistent HashMap for TypeScript
Simple BlockChain DEMO in JAVA
Non-blocking hash map in Rust
Generic type-safe vector, hash map, and concurrent queue for C
Add a description, image, and links to the hashmap topic page so that developers can more easily learn about it.
To associate your repository with the hashmap topic, visit your repo's landing page and select "manage topics."