Fast sorted collections for Swift using in-memory B-trees
Appears on
Quick read
Latest capture 2026-10-24 09:44
Compare the starting count and capture dates, not just the percentage. How to read GitHub star growth. Missing history is not zero growth.
Archive status reflects the last catalog sync, not a maintenance assessment. Check recent releases, issue responses, and fit for your project with the repository shortlisting checklist.
0 paths
Agent instructions and tool configuration found in this repository.
No config files detected.
2 observed captures since 2026-10-24. Observed captures are shown by default.
Stars from first capture 0
Observed captures only
All tracked data
Observed snapshots
Observed snapshots
Nearest indexed repositories by embedding similarity.
Ninety-Nine Problems in Kotlin
BuntDB is an embeddable, in-memory key/value database for Go with custom indexing and geospatial support
High performance nearest neighbor data structures (KDTree and BallTree) and algorithms for Julia.
A Rust crate and Python library for packed, immutable, zero-copy spatial indexes.
Techniques and numbers for estimating system's performance from first-principles
Wide NoSQL benchmark for RocksDB, LevelDB, Redis, WiredTiger and MongoDB extending the Yahoo Cloud Serving Benchmark
