14975891860

Committed 12 May 2025 03:10PM UTC coverage: 58.559% (-10.5%) from 69.02%

Build Type

push

github

Committed by

Commit Message

Merge pull request #9798 from ellemouton/graphFixNotificationSubs

graph/db: synchronous topology client subscriptions/cancellations

Run Details

6 of 8 new or added lines in 2 files covered. (75.0%)

28334 existing lines in 451 files now uncovered.

97366 of 166270 relevant lines covered (58.56%)

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