🌀 Async-first sharded hashmap for Rust.
-
Updated
Jan 17, 2025 - Rust
🌀 Async-first sharded hashmap for Rust.
High-performance containers and utilities for concurrent and asynchronous programming
Lock-free concurrent and single-threaded hash map implementations using Leapfrog probing. Currently the highest performance concurrent HashMap in Rust for certain use cases.
A simple & header-only threading library written in C++20 .
A gorutine safe ordered map implemented in Go using Generics.
A simple wrapper over MemoryCache to prevent concurrent cache missing.
Concurrent Sharded HashMap for Rust
This project implements a concurrent Key-Value (KV) Server that communicates with a multi-threaded client via a shared memory region.
Implementation of a system for building an "Inverted index" data structure, as well as systems for using this data structure.
Caching proxy server (Spring Boot CLI) that forwards requests to an origin and returns cached responses with HIT/MISS headers.
Add a description, image, and links to the concurrent-hashmap topic page so that developers can more easily learn about it.
To associate your repository with the concurrent-hashmap topic, visit your repo's landing page and select "manage topics."