: Data structures are laid out contiguously where possible, reducing cache misses. For example, a bfd3::small_vector might avoid heap allocation for small sizes.
struct Task : public bfd3::IntrusiveListNode<Task> int priority; void execute(); ; Bfd3 core library