> Specifically, one of the fascinating Tantivy optimizations is the > branchless binary search: https://quickwit.io/blog/search-a-sorted-block. >
This is an interesting post, thanks for sharing, Mike. I remember when people did such low-level tricks frequently (but on much simpler processors and fairly consistent hardware) and it always makes me wonder whether all the moving blocks involved here (rust, llvm, actual hardware) make it sane - any change in any of these layers may affect the outcome (and debugging what actually happened will be a nightmare...). I like it though - nice intellectual exercise and some assembly dumps for a change. ;) D. >
