// 1. 創(chuàng)建一維數(shù)組
// 元素都是默認(rèn)值
var arr1 [3]int
// 指定長(zhǎng)度并設(shè)置初始值
var arr2 = [3]int{1, 2, 3}
var arr3 [3]int = [3]int{1, 2, 3}
// 自動(dòng)推導(dǎo)數(shù)組長(zhǎng)度
var arr4 = [...]int{1, 2, 3}
// 指定特定下標(biāo)的元素的值，其他的為默認(rèn)值
var arr5 = [3]int{1: 9}
// 2. 創(chuàng)建多維數(shù)組 與一維數(shù)組類似，不再贅述
var arr6 = [3][2]int{{1, 2}, {3, 4}, {5, 6}}
fmt.Println(arr1)
fmt.Println(arr2)
fmt.Println(arr3)
fmt.Println(arr4)
fmt.Println(arr5)
fmt.Println(arr6)

var arr = [3]int{1, 2, 3}
fmt.Println(arr)
arr[2] = 9
fmt.Println(arr)

var arr = [3]int{1, 2, 3}
for i := 0; i < len(arr); i++ {
	fmt.Println(arr[i])
}

var arr = [3]int{1, 2, 3}
for index, value := range arr {
	fmt.Printf("index:%d value:%d\n", index, value)
}

var arr = [3]int{1, 2, 3}
var arr2 = [3]int{1, 2, 3}
fmt.Println(arr == arr2)
var arr3 = [...]int{1, 2, 3}
fmt.Println(arr == arr3)
var arr4 = [...]int{1, 2, 4}
fmt.Println(arr == arr4)

var arr = [3]int{1, 2, 3}
var arr5 = [...]int{1, 2}
fmt.Println(arr == arr5)

type slice struct {
    array unsafe.Pointer //指向數(shù)組的指針
    len int //切片的長(zhǎng)度，可以理解為切片表示的元素的個(gè)數(shù)
    cap int //容量，指針?biāo)赶虻臄?shù)組長(zhǎng)度（從指針位置向后）
}

//直接聲明并賦值
s0 := []int{1, 2, 3, 4, 5}
//通過數(shù)組或者切片獲取
arr := [...]int{1, 2, 3, 4, 5}
s1 := s0[:] // 切片 s0 中的全部元素
s2 := s0[:2] // 切片 s0 第一個(gè)元素到第二個(gè)元素
s3 := arr[3:] // 數(shù)組 arr 從第四個(gè)元素開始向后的所有元素
s4 := arr[0:0] // 創(chuàng)建一個(gè)空切片
//通過 make(t Type, size ...IntegerType) 初始化，
//接受的第一個(gè) int 表示切片長(zhǎng)度，第二個(gè)表示容量大小。如果只有一個(gè)int參數(shù)則默認(rèn)長(zhǎng)度和容量是相同的
s5 := make([]int, 5) //創(chuàng)建一個(gè)長(zhǎng)度為 5 切片，
s6 := make([]int, 5, 8) //創(chuàng)建一個(gè)長(zhǎng)度為 5 容量為 8 的int型切片（長(zhǎng)度為5的部分會(huì)被初始化為默認(rèn)值）
fmt.Println(s0, s1, s2, s3, s4, s5 ,s6)

//直接聲明并賦值
s0 := []int{1, 2, 3, 4, 5}
fmt.Println(s0)
s0[0] = 999
fmt.Println(s0)

s0 := []int{1, 2, 3, 4, 5}
s1 := s0[1:3] //第二個(gè)元素到第三個(gè)元素
fmt.Printf("len: %d\n", len(s1))
fmt.Printf("cap: %d\n", cap(s1))
fmt.Println(s1 )

s0 := []int{1, 2, 3, 4, 5}
s1 := s0[1:3]
s2 := s1[:cap(s1)]
fmt.Printf("len: %d\n", len(s2))
fmt.Printf("cap: %d\n", cap(s2))
fmt.Println(s2)

s0 := []int{1, 2, 3, 4, 5}
s0 = append(s0, 6, 7, 8, 9, 10) //追加元素
fmt.Printf("len: %d\n", len(s0))
fmt.Printf("cap: %d\n", cap(s0))
fmt.Println(s0)
s1 := []int{11, 12, 13, 14, 15}
s0 = append(s0, s1...) //追加切片，切片需要解包
fmt.Printf("len: %d\n", len(s0))
fmt.Printf("cap: %d\n", cap(s0))
fmt.Println(s0)

s0 := make([]int, 1000)
fmt.Printf("len: %d, cap: %d\n", len(s0), cap(s0))
s0 = append(s0, make([]int, 200)...)
fmt.Printf("len: %d, cap: %d\n", len(s0), cap(s0))
s0 = append(s0, make([]int, 400)...)
fmt.Printf("len: %d, cap: %d\n", len(s0), cap(s0))

func growslice(et *_type, old slice, cap int) slice {
	...
newcap := old.cap
	doublecap := newcap + newcap
	if cap > doublecap {
		newcap = cap
	} else {
		const threshold = 256
		if old.cap < threshold {
			newcap = doublecap //小容量直接擴(kuò)容到兩倍容量
		} else {
			// Check 0 < newcap to detect overflow
			// and prevent an infinite loop.
			for 0 < newcap && newcap < cap {
				// Transition from growing 2x for small slices
				// to growing 1.25x for large slices. This formula
				// gives a smooth-ish transition between the two.
				//大容量取消了 1.25 倍擴(kuò)容，選擇了一個(gè)更為平滑的擴(kuò)容方案
				newcap += (newcap + 3*threshold) / 4
			}
			// Set newcap to the requested cap when
			// the newcap calculation overflowed.
			if newcap <= 0 {
				newcap = cap
			}
		}
	}
	var overflow bool
	var lenmem, newlenmem, capmem uintptr
	// Specialize for common values of et.size.
	// For 1 we don't need any division/multiplication.
	// For goarch.PtrSize, compiler will optimize division/multiplication into a shift by a constant.
	// For powers of 2, use a variable shift.
	switch {
	case et.size == 1:
		lenmem = uintptr(old.len)
		newlenmem = uintptr(cap)
		capmem = roundupsize(uintptr(newcap))
		overflow = uintptr(newcap) > maxAlloc
		newcap = int(capmem)
	case et.size == goarch.PtrSize:
		lenmem = uintptr(old.len) * goarch.PtrSize
		newlenmem = uintptr(cap) * goarch.PtrSize
		capmem = roundupsize(uintptr(newcap) * goarch.PtrSize)
		overflow = uintptr(newcap) > maxAlloc/goarch.PtrSize
		newcap = int(capmem / goarch.PtrSize)
	case isPowerOfTwo(et.size):
		var shift uintptr
		if goarch.PtrSize == 8 {
			// Mask shift for better code generation.
			shift = uintptr(sys.Ctz64(uint64(et.size))) & 63
		} else {
			shift = uintptr(sys.Ctz32(uint32(et.size))) & 31
		}
		lenmem = uintptr(old.len) << shift
		newlenmem = uintptr(cap) << shift
		capmem = roundupsize(uintptr(newcap) << shift)
		overflow = uintptr(newcap) > (maxAlloc >> shift)
		newcap = int(capmem >> shift)
	default:
		lenmem = uintptr(old.len) * et.size
		newlenmem = uintptr(cap) * et.size
		capmem, overflow = math.MulUintptr(et.size, uintptr(newcap))
		capmem = roundupsize(capmem)
		newcap = int(capmem / et.size)
	}
	...
    return slice{p, old.len, newcap}
}