Benchmark common patterns in Go to figure out what has better performance

• Environment
  • Macbook Air M2 chip with 8GB RAM and 256GB SSD
  • benchmark for 0.1 second

summary

It is better to use string builder, especially in the for loop, to concatenate the strings. If we write string + string in the for loop, the process will takes a long time to allocate memories for the intermediate strings.

summary

The ns/op of RuneToString is 3 times greater than StringToRune. The ns/op of ByteToString is just slightly slower than that of StringToByte. Just be careful when using string conversion, especially double conversion (string -> rune -> string).

summary

Just use slices.SortFunc. Obviously, slices.SortFunc is faster and no additional memory consumption than sort.Slice.

summary

Just use slices.SortStableFunc. Obviously, slices.SortStableFunc is faster and no additional memory consumption than sort.SliceStable.

summary

There is no significant difference among each benchmarks. However, division is slightly slower than multiplication, regardless of whether you use int64 or float64 data types.

summary

1. The access speed is the fastest if we know the expected length of a slice and use make([]struct{}, n) to initialize length and capacity at first.
2. Be aware of using slices of pointer, because they are extremely slow.
3. Using slices of interface is the worst case.

Go will pad the structure to their largest field alignment guarantees. See T5 in structure_padding.go for more information.