The Go Optimizations 101, Go Details & Tips 101 and Go Generics 101 books are all updated to Go 1.25. The most cost-effective way to get them is through this, this, or this book bundle in the Leanpub book store.

If you would like to learn some Go details and facts every serveral days, please follow Go 101's official Twitter account @zigo_101.

slice 1

What does the following program print?

package main

import "fmt"

func main() {
	a := [...]int{0, 1, 2, 3}
	x := a[:1]
	y := a[2:]
	x = append(x, y...)
	x = append(x, y...)
	fmt.Println(a, x)
}

Choices:

Answer: [0 2 3 3] [0 2 3 3 3]

Run it on Go play.

Key points:
  • Initially, the slice y is [2 3], and the slice x is [0] with three free element slots (in other words, its capacity is 4),
  • The 1st append call changes the slice x to [0 2 3] with one free element slot. And as the slice x and the array a share elements (before line 10), the array a is changed to [0 2 3 3]. The slice y and the array a also share elements, so the slice y is changed to [3 3].
  • For the slice x has not enough free capacity, the 2nd append call allocates a new backing array for the slice x. So the call doesn't modify the array a. The slice x is changed to [0 2 3 3 3].


(more articles ↡)

The Go 101 project is hosted on Github. Welcome to improve Go 101 articles by submitting corrections for all kinds of mistakes, such as typos, grammar errors, wording inaccuracies, description flaws, code bugs and broken links.

Tapir, the author of Go 101, has been on writing the Go 101 series books since 2016 July. New contents will be continually added to the books (and the go101.org website) from time to time. Tapir is also an indie game developer. You can also support Go 101 by playing Tapir's games:
Individual donations via PayPal are also welcome.

Articles in this book:

(more are coming ...)