Explore >> Select a destination
|
You are here 
|
infinitedigits.co | ||
| | | | |
blog.nuculabs.de
|
|
| | | | | 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. | |
| | | | |
www.integralist.co.uk
|
|
| | | | | The following code doesn't do what you might expect: package main import "fmt" func main() { var i *impl fmt.Println("i == nil:", i == nil) what(i) } type impl struct{} func (i *impl) do() {} func what(i interface{ do() }) { fmt.Println("i == nil:", i == nil) } If you expected the what function to print i == nil: true, then keep reading... Typed Nils The behavior observed is due to the way interfaces and nil values interact in Go. | |
| | | | |
schadokar.dev
|
|
| | | | | Convert Hexadecimal to Decimal and Decimal to Hexadecimal | |
| | | | |
blog.pkh.me
|
|
| | | |||
