Iterators in Go 1.23: how to use them and how fast are they?
summary
The talk explains the new iterator feature added in Go 1.23 (aka ‘range over funcs’), why it was introduced and the language motivation. It presents microbenchmarks comparing iterator performance to channels and discusses practical usage patterns and where iterators can be useful.
AI-written summary · about
chapters (16)
- 0:00Introduction
- 1:10What are Go iterators
- 3:39iter package and Seq types
- 7:38Why use iterators
- 9:03Iterators and coroutines
- 13:02Iterator performance
- 17:41Iterator edge cases
- 22:40Iterators and concurrency
- 25:49Error handling in iterators
- 27:58Resource management
- 29:43Iterators in pipelines
- 33:13Next and Stop functions
- 35:48Pairwise data processing
- 36:29Future of Go iterators
- 38:57Complexity and adaptation
- 40:01Q&A
related talks
53mIterators in Go 1.23: how to use them and how fast are they?
29mThe Why of Iterator Design
21mThe Loop War: Iterators vs. Traditional Loop
46mGoing Loopy: Iteration in Go
40mSqueezing Maximum Performance Out of Go
01h 05mGenerics, Reflection, and Efficient Collections
21mFunctional Go?
28mIdiomatic Go Tricks