No, Go has about the fastest loops you could want, implemented in the obvious wa... | Hacker News

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

		jerf on Dec 25, 2018 \| parent \| context \| favorite \| on: Sloc Cloc and Code Revisited – Optimizing an Alrea... No, Go has about the fastest loops you could want, implemented in the obvious way at the asm level. (That is, not that Go's loops are any more extra magical fast than any other compiled language, but they are not slow as in some dynamic languages.) The focus is there because that's where you get wins, in any language.

vanderZwan on Dec 25, 2018 [–]

Depending on the type of loop there might be runtime boundary checks, but they can be avoided in many cases IIRC.

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