Ranges v3 and microcontrollers, a revolution
summary
Shows a concrete run of Ranges v3 on bare metal: an output range can fail so a streaming copy returns remainder pair and code can write “as much as fits now, retry later” with timers and events. Presents a compile‑time factory that hardcodes UART pins/baud and folds adjacent register writes, cutting embedded scaffolding size 5x shrink in one port. Demonstration runs and exposes real issues—volatile/compiler quirks, tiny UART FIFOs, and incomplete chip coverage—so it’s promising but not yet a drop‑in replacement.
AI-written summary · about
chapters (9)
- 0:00Start
- 2:11microcontrollers?
- 3:20volatile
- 5:09Stack calculation on STM32F102R4
- 25:02Using an RTC
- 35:00Where inefficiency myths are born
- 37:20What can we do about it
- 39:57How do ranges help us?
- 49:48Using modern tools
related talks
58mFrom Iterators to Ranges: The Upcoming Evolution Of the STL
42mAwaiting for the ranges: C++17
01h 00mC++ Concepts and Ranges
25mLeveling up hardware production with Rust
07mC++ Hardware Register Access
54mHow to rangify your code
21mChips don't bite! An introduction to µController programming for Rusteaceans
38mOptimized String Processing in RISC-V: How Toolchain Improvements Can Boost Performance