16001467686

Committed 01 Jul 2025 01:58PM UTC coverage: 57.216% (-10.4%) from 67.568%

Build Type

push

github

Committed by

Commit Message

Merge pull request #10011 from ellemouton/graphRefactor

refactor+graph/db: refactor preparations required for incoming SQL migration code

Run Details

18 of 69 new or added lines in 2 files covered. (26.09%)

29385 existing lines in 460 files now uncovered.

97484 of 170380 relevant lines covered (57.22%)

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