I don’t think it’s so complex. Without i := i, there’s only one i. With i := i, ... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		xiaq on Sept 19, 2023 \| parent \| context \| favorite \| on: Fixing for loops in Go 1.22 I don’t think it’s so complex. Without i := i, there’s only one i. With i := i, there’s one i per iteration. Closure captures are always by reference. Heap vs stack allocation don’t affect the language semantics.

kevincox on Sept 20, 2023 [–]

Yup. The linked article is a little confused. It thinks that an optimization to pass by value is affecting the behavior. In reality it only passes by value when it is indistinguishable from passing by reference (and it thinks it would be cheaper).

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact