Benchmarks of a different dictionary containers with string as key. The goal was to find the best suitable data structure for fast file system searches.
We are using hayai as a C++ benchmarking framework. Currently we have benchmarks for:
- Deschain / ART - adaptive radix tree.
- Google's sparsehash/densehash.
- Rasmus Ekman's Ternary Tree.
- [ytakano / radix_tree] (https://github.com/ytakano/radix_tree).