B− tree: 15x faster than std::set

> static B-trees to speed up binary searching in sorted array.

what? they never heard of perfect hashes? constant beats logarithmic with larger arrays, and linear anyway.

and maybe it wasn' that good of an idea to reject fast switch statements for sparse tables for C/C++ compilers. I think the llvm patch was proposed 2004

but sets/maps in the std are known to be on the extreme slow side, due to pointer stability guarantees. swisstable is also 10x faster than unordered_map