Java切片单偶数,go – 为什么具有奇数的切片容量与具有偶数的行为不同

简短的回答

它将切片容量四舍五入以填充分配的内存块.

答案很长

我们来看看Go1.5.1源代码：

s := l1

if n := len(l1) + len(l2) - cap(s); n > 0 {

s = growslice_n(s, n)

}

s = s[:len(l1)+len(l2)]

memmove(&s[len(l1)], &l2[0], len(l2)*sizeof(T))

更进一步,我们发现：

newcap := old.cap

if newcap+newcap < cap {

newcap = cap

} else {

for {

if old.len < 1024 {

newcap += newcap

} else {

newcap += newcap / 4

}

if newcap >= cap {

break

}

}

}

/* [...] */

capmem := roundupsize(uintptr(newcap) * uintptr(et.size))

newcap = int(capmem / uintptr(et.size))

// Returns size of the memory block that mallocgc will allocate if you ask for the size.

func roundupsize(size uintptr) uintptr {

if size < _MaxSmallSize {

if size <= 1024-8 {

return uintptr(class_to_size[size_to_class8[(size+7)>>3]])

} else {

return uintptr(class_to_size[size_to_class128[(size-1024+127)>>7]])

}

}

if size+_PageSize < size {

return size

}

return round(size, _PageSize)

}

When growing slice take into account size of the allocated memory block.