forked from cdarwin/go-koans
-
Notifications
You must be signed in to change notification settings - Fork 0
/
about_slices.go
23 lines (16 loc) · 1003 Bytes
/
about_slices.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
package go_koans
func aboutSlices() {
fruits := []string{"apple", "orange", "mango"}
assert(fruits[0] == "apple") // slices seem like arrays
assert(len(fruits) == 3) // in nearly all respects
tasty_fruits := fruits[1:3] // we can even slice slices
assert(tasty_fruits[0] == "orange") // slices of slices also share the underlying data
pregnancy_slots := []string{"baby", "baby", "lemon"}
assert(cap(pregnancy_slots) == 3) // the capacity is initially the length
pregnancy_slots = append(pregnancy_slots, "baby!")
assert(len(pregnancy_slots) == 4) // slices can be extended with append(), much like realloc in C
assert(cap(pregnancy_slots) == 6) // but with better optimizations
pregnancy_slots = append(pregnancy_slots, "another baby!?", "yet another, oh dear!", "they must be Catholic")
assert(len(pregnancy_slots) == 7) // append() can take N arguments to append to the slice
assert(cap(pregnancy_slots) == 12) // the capacity optimizations have a guessable algorithm
}