Case Folding for Code Search
Don't stop early: Case-folding source code at memory speed

Don't stop early: Case-folding source code at memory speed

7/31/2026 · Alexander Neubeck, Greg Orzell

What this post added

This post details optimizations for case folding in GitHub's code search engine, Blackbird. It introduces a branchless ASCII case folding implementation that achieves memory bandwidth speeds by removing early exits and leveraging vectorization. It also discusses efficient Unicode case folding by using a compact data structure and strategies for memory management to avoid heap allocations, including reserving capacity for potential string growth.

Read the original post ↗