user's • Example: lookup tables • Everyone uses lookup tables • Arrays are maximally space-efficient, very time-efficient • Sorted arrays: binary_search, lower_bound, equal_range • Now you can use constexpr • span is like a pair of T* and size_t, but better • spans are implicitly constructible from arrays and vectors • Avoids ownership confusion, accidental pointer arithmetic • span  span; (bit_cast, rotating/counting, power-of-2) • Several PRs by barcharcraz • make_shared() For Arrays • GH-309 by AdamBucior, tested by Weheineman • midpoint(), lerp() • Paolo Torres and BillyONeal

fc::Array h3; }; Foo* f = fc::make(3, 17, 8)(); • Non-trivial types • Multiple arrays • Correct alignment • Exception safety • Allocators • Customizable handles • More…Thank you! Twitter:

of at run time auto m { ctre::match<"[a-z]+([0-9]+)">(str) }; “The Shapes of Multi- Dimensional Arrays” -- Vincent Reverdy Thursday, September 17 • 09:0057 [[likely]], [[unlikely]]  Hints for the