14743371247

Committed 29 Apr 2025 11:33PM UTC coverage: 57.4% (-11.6%) from 69.035%

Build Type

github

Committed by

Commit Message

Merge 04600045f into f21e3f3ee

Run Details

99 of 114 new or added lines in 4 files covered. (86.84%)

30210 existing lines in 458 files now uncovered.

95436 of 166266 relevant lines covered (57.4%)

0.61 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) {	1✔
9	if len(b) == 0 {	1✔
UNCOV 10	return	×
UNCOV 11	}	×
12
13	b[0] = 0	1✔
14	for i := 1; i < len(b); i *= 2 {	2✔
15	copy(b[i:], b[:i])	1✔
16	}	1✔
17	}