56 lines
1.3 KiB
Go
56 lines
1.3 KiB
Go
|
package dht
|
||
|
|
|
||
|
|
import (
|
||
|
|
"math/big"
|
||
|
|
)
|
||
|
|
|
||
|
|
// TODO: The bitcounting is a relic of the old and incorrect distance
|
||
|
|
// calculation. It is still useful in some tests but should eventually be
|
||
|
|
// replaced with actual distances.
|
||
|
|
|
||
|
|
// How many bits?
|
||
|
|
func bitCount(n big.Int) int {
|
||
|
|
var count int = 0
|
||
|
|
for _, b := range n.Bytes() {
|
||
|
|
count += int(bitCounts[b])
|
||
|
|
}
|
||
|
|
return count
|
||
|
|
}
|
||
|
|
|
||
|
|
// The bit counts for each byte value (0 - 255).
|
||
|
|
var bitCounts = []int8{
|
||
|
|
// Generated by Java BitCount of all values from 0 to 255
|
||
|
|
0, 1, 1, 2, 1, 2, 2, 3,
|
||
|
|
1, 2, 2, 3, 2, 3, 3, 4,
|
||
|
|
1, 2, 2, 3, 2, 3, 3, 4,
|
||
|
|
2, 3, 3, 4, 3, 4, 4, 5,
|
||
|
|
1, 2, 2, 3, 2, 3, 3, 4,
|
||
|
|
2, 3, 3, 4, 3, 4, 4, 5,
|
||
|
|
2, 3, 3, 4, 3, 4, 4, 5,
|
||
|
|
3, 4, 4, 5, 4, 5, 5, 6,
|
||
|
|
1, 2, 2, 3, 2, 3, 3, 4,
|
||
|
|
2, 3, 3, 4, 3, 4, 4, 5,
|
||
|
|
2, 3, 3, 4, 3, 4, 4, 5,
|
||
|
|
3, 4, 4, 5, 4, 5, 5, 6,
|
||
|
|
2, 3, 3, 4, 3, 4, 4, 5,
|
||
|
|
3, 4, 4, 5, 4, 5, 5, 6,
|
||
|
|
3, 4, 4, 5, 4, 5, 5, 6,
|
||
|
|
4, 5, 5, 6, 5, 6, 6, 7,
|
||
|
|
1, 2, 2, 3, 2, 3, 3, 4,
|
||
|
|
2, 3, 3, 4, 3, 4, 4, 5,
|
||
|
|
2, 3, 3, 4, 3, 4, 4, 5,
|
||
|
|
3, 4, 4, 5, 4, 5, 5, 6,
|
||
|
|
2, 3, 3, 4, 3, 4, 4, 5,
|
||
|
|
3, 4, 4, 5, 4, 5, 5, 6,
|
||
|
|
3, 4, 4, 5, 4, 5, 5, 6,
|
||
|
|
4, 5, 5, 6, 5, 6, 6, 7,
|
||
|
|
2, 3, 3, 4, 3, 4, 4, 5,
|
||
|
|
3, 4, 4, 5, 4, 5, 5, 6,
|
||
|
|
3, 4, 4, 5, 4, 5, 5, 6,
|
||
|
|
4, 5, 5, 6, 5, 6, 6, 7,
|
||
|
|
3, 4, 4, 5, 4, 5, 5, 6,
|
||
|
|
4, 5, 5, 6, 5, 6, 6, 7,
|
||
|
|
4, 5, 5, 6, 5, 6, 6, 7,
|
||
|
|
5, 6, 6, 7, 6, 7, 7, 8,
|
||
|
|
}
|