13043384202

Committed 30 Jan 2025 12:49AM UTC coverage: 48.841% (-9.9%) from 58.777%

Build Type

github

Committed by

Commit Message

docs: add release notes.

Run Details

28 of 45 new or added lines in 3 files covered. (62.22%)

28177 existing lines in 437 files now uncovered.

99712 of 204157 relevant lines covered (48.84%)

1.02 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	}