Seems like a really substantial release to me. The new built in functions min, max, and clear are a bit surprising, even having followed the discussions around them. The perf improvements seem pretty great, I’m sure those will get much love here. Personally, I’m most excited about log/slog and the experimental fix to loop variable shadowing. I’ve never worked in a language with a sane logging ecosystem, so I think sl…
Go 1.21 Release Candidate
21–30 of 236 posts
Re: Go 1.21 Release Candidate
#22An extremely generic release.
Re: Go 1.21 Release Candidate
#23Re: Go 1.21 Release Candidate
#24Re: Go 1.21 Release Candidate
#25It is interesting to see them add things like the "clear" function for maps and slices after suggesting to simply loop and delete each key one at a time for so long. Is this a result of the generics work that makes implementation easier vs. the extra work of making a new "magic" function (like "make", etc.)?
Re: Go 1.21 Release Candidate
#26Re: Go 1.21 Release Candidate
#27Nice, my push for actually using the sha256 instructions on amd64 finally got released. 3x-4x increase in hash speed on most x86 which is really nice for content addressable storage use cases like handling container images.
Re: Go 1.21 Release Candidate
#28It is interesting to see them add things like the "clear" function for maps and slices after suggesting to simply loop and delete each key one at a time for so long. Is this a result of the generics work that makes implementation easier vs. the extra work of making a new "magic" function (like "make", etc.)?
Doubly-so when `clear` on a map actually seems to follow the convention of removing all contained elements.
Re: Go 1.21 Release Candidate
#29I enjoy Go so much. It is almost perfect language for getting things done, but I still can't understand some design choices. Does someone knows why Go uses env variables (like GOOS and GOARCH) instead command line arguments?
Re: Go 1.21 Release Candidate
#30It is interesting to see them add things like the "clear" function for maps and slices after suggesting to simply loop and delete each key one at a time for so long. Is this a result of the generics work that makes implementation easier vs. the extra work of making a new "magic" function (like "make", etc.)?