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
|
package signer
import (
"sort"
"github.com/theupdateframework/go-tuf/pkg/keys"
)
// ByIDs implements sort.Interface for []keys.Signer based on
// the sorted public IDs() for each Signer. This facilitates
// deterministic order of signatures, which prevents tests
// that use fixtures from being flaky.
type ByIDs []keys.Signer
func (b ByIDs) Len() int {
return len(b)
}
func (b ByIDs) Swap(i, j int) {
b[i], b[j] = b[j], b[i]
}
func (b ByIDs) Less(i, j int) bool {
ids := b[i].PublicData().IDs()
iIDs := make([]string, len(ids))
copy(iIDs, ids)
sort.Strings(iIDs)
ids = b[j].PublicData().IDs()
jIDs := make([]string, len(ids))
copy(jIDs, ids)
sort.Strings(jIDs)
minLen := len(iIDs)
if len(jIDs) < minLen {
minLen = len(jIDs)
}
// Compare iIDs[:minLen] to jIDs[:minLen] element-wise.
for c := 0; c < minLen; c++ {
if iIDs[c] == jIDs[c] {
continue
}
return iIDs[c] < jIDs[c]
}
// iIDs[:minLen] is equal to jIDs[:minLen], so sort based on length.
return len(iIDs) < len(jIDs)
}
|
