12190156236

Committed 05 Dec 2024 11:33PM UTC coverage: 49.833% (-9.1%) from 58.933%

Build Type

github

Committed by

Commit Message

docs: update release-notes for 0.19.0

Run Details

6 of 27 new or added lines in 2 files covered. (22.22%)

25353 existing lines in 422 files now uncovered.

100197 of 201066 relevant lines covered (49.83%)

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