-
Notifications
You must be signed in to change notification settings - Fork 342
/
Copy pathdistance.go
59 lines (53 loc) · 1.65 KB
/
distance.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
// Copyright 2020 The Swarm Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package swarm
import (
"errors"
"math/big"
)
// Distance returns the distance between address x and address y as a (comparable) big integer using the distance metric defined in the swarm specification.
// Fails if not all addresses are of equal length.
func Distance(x, y []byte) (*big.Int, error) {
distanceBytes, err := DistanceRaw(x, y)
if err != nil {
return nil, err
}
r := big.NewInt(0)
r.SetBytes(distanceBytes)
return r, nil
}
// DistanceRaw returns the distance between address x and address y in big-endian binary format using the distance metric defined in the swarm specfication.
// Fails if not all addresses are of equal length.
func DistanceRaw(x, y []byte) ([]byte, error) {
if len(x) != len(y) {
return nil, errors.New("address length must match")
}
c := make([]byte, len(x))
for i, addr := range x {
c[i] = addr ^ y[i]
}
return c, nil
}
// DistanceCmp compares x and y to a in terms of the distance metric defined in the swarm specfication.
// it returns:
// 1 if x is closer to a than y
// 0 if x and y are equally far apart from a (this means that x and y are the same address)
// -1 if x is farther from a than y
// Fails if not all addresses are of equal length.
func DistanceCmp(a, x, y []byte) (int, error) {
if len(a) != len(x) || len(a) != len(y) {
return 0, errors.New("address length must match")
}
for i := range a {
dx := x[i] ^ a[i]
dy := y[i] ^ a[i]
if dx == dy {
continue
} else if dx < dy {
return 1, nil
}
return -1, nil
}
return 0, nil
}