func math/bits.Len

22 uses

	math/bits (current package)
		bits.go#L25: func LeadingZeros(x uint) int { return UintSize - Len(x) }
		bits.go#L302: func Len(x uint) int {

	math/big
		nat.go#L347: 		return i*_W + bits.Len(top)

	crypto/internal/fips140/bigmod
		nat.go#L1051: 	for i := bits.UintSize - bits.Len(e) + 1; i < bits.UintSize; i++ {

	github.com/andybalholm/brotli
		fast_log.go#L17: 	return uint32(bits.Len(n)) - 1

	github.com/andybalholm/brotli/matchfinder
		bargain1.go#L91: 		insertCost := float32(bits.Len(uint(unmatched)))
		bargain1.go#L94: 			distanceCost = float32(bits.Len(uint(m.Start - m.Match)))
		bargain2.go#L102: 		insertCost := float32(bits.Len(uint(unmatched)))
		bargain2.go#L105: 			distanceCost = float32(bits.Len(uint(m.Start - m.Match)))
		bargain3.go#L108: 		insertCost := float32(bits.Len(uint(unmatched)))
		bargain3.go#L111: 			distanceCost = float32(bits.Len(uint(m.Start - m.Match)))
		pathfinder.go#L249: 			matchCost := baseMatchCost + float32(bits.Len(uint(unmatched)))
		pathfinder.go#L251: 				matchCost += float32(bits.Len(uint(m.Start - m.Match)))
		pathfinder.go#L275: 			matchCost := baseMatchCost + float32(bits.Len(uint(pending.Start-pending.Match)))

	github.com/klauspost/compress/zstd
		enc_base.go#L46: 			int32(1)<<uint(bits.Len(uint(size))), 1024)

	net/http
		h2_bundle.go#L9143: 	bits := bits.Len(uint(size))

	slices
		sort.go#L18: 	pdqsortOrdered(x, 0, n, bits.Len(uint(n)))
		sort.go#L32: 	pdqsortCmpFunc(x, 0, n, bits.Len(uint(n)), cmp)
		sort.go#L189: 	return 1 << bits.Len(uint(length))

	sort
		slice.go#L28: 	limit := bits.Len(uint(length))
		sort.go#L55: 	limit := bits.Len(uint(n))
		sort.go#L78: 	shift := uint(bits.Len(uint(length)))