> But you ended up making much stronger and untrue claim that one can't write re-usable iteration logic in Go. Not at all. Are you telling me that `v.Next()` c

> But you ended up making much stronger and untrue claim that one can't write re-usable iteration logic in Go. Not at all. Are you telling me that `v.Next()` can be written in a reusable way for different data structures? Nonsense. `v.Next()` will have a single, bound return type. So at that point you're re-implementing iterators for anything you want to iterate on. Furthermore, lets say I want to `v.Next().Map()`. How can I write a Map function in a reusable way? The entirety of your iterator chain would have to be custom implemented for the one data structure you're using. Or you throw your entire type information away and use `interface{}`. With Go, your limit of reusability is hand writing the entire iterator implementation per type. Which is hardly reusable in my view. I touched on this when I mentioned creating separate functions for these patterns. That's all you're doing here - creating custom methods to make something look like, but not behave like an actual iterator. No Map support, no Filter, no .. anything. All you made was a loop, and a hand written one. I'm not trying to be overly negative here. However saying Go has an iterator pattern is imo strongly misleading.