mirror of
https://github.com/scylladb/scylladb.git
synced 2026-04-22 01:20:39 +00:00
5abddc8568
There's a perf_bptree test that compares B+ tree collection with std::set and std::map ones. There will come more, also the "patterns" to compare are not just "fill with keys" and "drain to empty", so here's the perf_collection test, that measures timings of - fill with keys - drain key by key - empty with .clear() call - full scan with iterator - insert-and-remove of a single element for currently used collections - std::set - std::map - intrusive_set_external_comparator - bplus::tree * https://github.com/xemul/scylla/tree/br-perf-collection-test: test: Generalize perf_bptree into perf_collection perf_collection: Clear collection between itartions perf_collection: Add intrusive_set_external_comparator perf_collection: Add test for single element insertion perf_collection: Add test for destruction with .clear() perf_collection: Add test for full scan time