/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

www.rickyterrell.com
| | bruceeckel.com
3.7 parsecs away

Travel
| |
| | cukic.co
5.0 parsecs away

Travel
| | Author of the 'Functional Programming in C++' book, KDE developer and Free/Libre Software enthusiast.
| | web.cecs.pdx.edu
3.7 parsecs away

Travel
| | [AI summary] This academic paper discusses extensions to the Hindley/Milner type system, focusing on higher-order polymorphism and type overloading to improve modularity and reusability in functional programming languages.
| | blog.nuculabs.de
31.2 parsecs away

Travel
| Hi In this article I want to highlight a simple pattern for sorting a slice in Go on multiple keys. Given the following structure, let's say we want to sort it in ascending order after Version, Generation and Time. 1 2 3 4 5 type TheStruct struct { Generation int Time int Version int } The way we sort slices in Go is by using the sort interface or one of the sort.Slice functions. To sort the slice after the above criteria we'll call slice.Sort with the following function.