A fast, thread-safe C hashmap with lazy sorting

Name: A fast, thread-safe C hashmap with lazy sorting
Availability: InStock
Author: jaguarwan

by jaguarwan·May 20, 2026·3 points·0 comments

Visit Project View on HN

AI Analysis

●MidNiche Gem

Thread-safe C hashmap with lazy sorting, but the benchmark repo lacks the actual library code.

Strengths

•Lazy sort feature enables stable traversal order similar to Java's LinkedHashMap.
•Optimized specifically for fast retrieval of pointer values from string keys.
•Comprehensive benchmark suite covers insert, update, retrieve, and miss workloads.

Weaknesses

•Main library code lives in a separate repository, creating friction for evaluation.
•Thread-safety overhead may outweigh benefits for single-threaded use cases.

Post Description

You can play with it here: https://godbolt.org/z/h4ffsWdq8 The main repo is here: https://github.com/RaphaelPrevost/ASKL

Similar Projects

Education●Mid

Interactive demos of sorting algorithms with runtime comparisons

Sorting visualizer when Visualgo and dozens of alternatives already exist.

Niche Gem

chrka

102mo ago

Developer Tools●Mid

JavaScript Performance Benchmarking

jsPerf has owned JavaScript benchmarking for 15 years — this is a cleaner clone without differentiation.

Cozy

emurlin

212mo ago

Developer Tools●Mid

Kreuzberg Comparative Benchmarks

The site weaponizes a compact set of benchmarks — throughput, RAM, cold-start, F1 score and install footprint — and even publishes raw JSON on GitHub, which makes it immediately useful for teams comparing ingestion options. Kreuzberg's Rust implementation posts jaw-dropping numbers against common tools; that's interesting, but the page leaves out crucial reproducibility details (datasets, seed runs, environment configs) you'd want before trusting the magnitude of those gaps.

Niche GemWizardry

nhirschfeld

104mo ago

AI/ML●●Solid