Jun Wu 69a6c18747 indexedlog: normalize benchmarks to use 204800 entries ... Summary: This makes it easier to compare benchmark results between abstractions. A sample of the result is listed below. Comparing to radixbuf, which is highly optimized and less flexible, indexedlog is about 10x slower on insertion, and about 3x slower on lookup. indexedlog: index insertion (owned key) 90.201 ms index insertion (referred key) 81.567 ms index flush 50.285 ms index lookup (memory) 25.201 ms index lookup (disk, no verify) 31.325 ms index lookup (disk, verified) 46.893 ms log insertion 18.421 ms log insertion (no checksum) 12.106 ms log insertion with index 110.143 ms log flush 8.783 ms log iteration (memory) 6.444 ms log iteration (disk) 6.719 ms raidxbuf: index insertion 11.874 ms index lookup 8.495 ms Differential Revision: D14635330 fbshipit-source-id: 28b3f33b87f4e882cb3839c37a2a11b8ac80d3e9		2019-03-27 16:29:58 -07:00
..
bench.rs	indexedlog: normalize benchmarks to use 204800 entries	2019-03-27 16:29:58 -07:00