About: A collection of links and short
commentary, published weekly. In theory the inclusion criteria
are for it to be something I read last week (duh) and was either
particularly interesting or something I might want to refer to
Subscribe with RSS
or see my main blog for
High Performance Code 201: Hybrid Data Structures [video]How the internal fundamental data structures in LLVM are optimized, starting from pretty normal stuff like SmallVector, going to tagged unions of word-sized pointers/values. Ending up with nesting tagged unions inside other tagged unions.
base/containers library (in Chrome)Comparing different map and set types in the Chrome source code, announced in a email thread with a slightly trolly tittle of "please avoid std::unordered_map":)
Array Layouts for Comparison-Based SearchingA 40 page deep dive into the best way to organize the layout of a single array for searching. Given a data layout, what's the best possible search algorithm on actual hardware and why? (Answered on the granularity of individual CPU features, and those answers used to derive even better variants).
This is incredibly cool, and I'd love to read similar work on other data structures. Unfortunately I rarely have a need for immutable sorted sequences.