v0 := byte((v >> 24) & 0xFF)
	nextIP = net.IPv4(v0, v1, v2, v3)
	return ret
}

func drainN(c chan string, n int) {
	for n > 0 {
		n--
		<-c
	}
}

func BenchmarkControllers(b *testing.B) {
	log.FindScope("krt").SetOutputLevel(log.InfoLevel)
	watch.DefaultChanSize = 100_000
	initialPods := []*v1.Pod{}
	for i := 0; i < 1000; i++ {
		initialPods = append(initialPods, &v1.Pod{

such as loop unrolling.
Similarly, `krt` can make complex optimizations in one place, so each controller implementation doesn't, which is likely to increase
the amount of optimizations applied.

The `BenchmarkControllers` puts this to the test, comparing an *ideal* hand-written controller to one written in `krt`.
While the numbers are likely to change over time, at the time of writing the overhead for `krt` is roughly 10%:

```text