News for hackers. Stuff that matters.
Re:Go Proposal: first-class support for sorting slices by interactiv on Tuesday August 16, 2016 @12:48PM (#12298702)
yep, I wrote this :

https://github.com/Mparaiso/lodash-go

which is in theory "runtime type safe" in the sense that is yields an error if types do not match , but it uses reflection which leads to a huge performance hit.

The irony is that Go is a perfectly capable functional language when one opts out of Go type system. (Don't use that package, this is not idiomatic Go).

Re:Go Proposal: first-class support for sorting slices by burntsushi on Tuesday August 16, 2016 @01:17PM (#12298934)
Re:Go Proposal: first-class support for sorting slices by interactiv on Tuesday August 16, 2016 @01:37PM (#12299069)
Yes, if you look at the source code I use unification to tell whether types match or not.
Re:Go Proposal: first-class support for sorting slices by burntsushi on Wednesday August 24, 2016 @06:24PM (#12355716)
You're doing a lot of repeated work though. I was trying to point out this function, which does unification in a generic context, given some function type: https://godoc.org/github.com/BurntSushi/ty#Check ... For example, it reduces a lot of the reflection boiler plate: https://github.com/BurntSushi/ty/blob/master/fun/list.go#L80