Papaya is a fast and feature-complete concurrent hash table designed for Rust, prioritizing read-heavy workloads. It employs sharding and atomic pointers to minimize latency and improve scalability. Papaya aims to provide a lock-free API to avoid deadlocks and includes support for asynchronous operations. Incremental resizing is used to prevent latency spikes. Unique features include atomic operations like `HashMap::compute` and async support, making it suitable for various use cases.

17m read timeFrom ibraheem.ca
Post cover image
Table of contents
PhilosophyBasic DesignProbing StrategyLoad FactorDeletionMemory ReclamationResizingAdditional FeaturesComparisons

Sort: