當切片傳遞時，很難預測底層原始數組是否正在發生變異，或者原始數組的副本是否正在發生變異a = [3]int {0, 1, 2}s = a[:]s[0] = 10a[0] == s[0] // trues = append(s, 3)s[0] = 20a[0] == s[0] // false假設今天我有這樣的處理a = [3]int {0, 1, 2}s = some_func(a[:]) // returns sliceprocess(s) // a is getting mutated because so far some_func hasn't caused the underlying array to be copied現在明天a = [3]int {0, 1, 2}s = some_func(a[:]) // returns slice, does append operationsprocess(s) // a is not getting mutated because some_func caused the underlying array to be copied那么切片的最佳實踐是什么？