13198499803

Committed 07 Feb 2025 11:01AM UTC coverage: 48.745% (-10.1%) from 58.818%

Build Type

github

Committed by

Commit Message

docs: update release notes

Run Details

177 of 268 new or added lines in 4 files covered. (66.04%)

28401 existing lines in 444 files now uncovered.

99573 of 204275 relevant lines covered (48.74%)

1.03 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

75.0

/buffer/utils.go

1	package buffer
2
3	// RecycleSlice zeroes byte slice, making it fresh for another use.
4	// Zeroing the buffer using a logarithmic number of calls to the optimized copy
5	// method. Benchmarking shows this to be ~30 times faster than a for loop that
6	// sets each index to 0 for ~65KB buffers use for wire messages. Inspired by:
7	// https://stackoverflow.com/questions/30614165/is-there-analog-of-memset-in-go
8	func RecycleSlice(b []byte) {	2✔
9	if len(b) == 0 {	2✔
UNCOV 10	return	×
UNCOV 11	}	×
12
13	b[0] = 0	2✔
14	for i := 1; i < len(b); i *= 2 {	4✔
15	copy(b[i:], b[:i])	2✔
16	}	2✔
17	}