-
-
Notifications
You must be signed in to change notification settings - Fork 83
/
hash.go
79 lines (64 loc) · 1.3 KB
/
hash.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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
package ktable
import (
"net/netip"
"time"
)
type hashKeyspace struct {
keyspace[[]HashPeer, HashOption, Hash, *hash]
}
type Hash interface {
keyspaceItem
Peers() []HashPeer
Dropped() bool
}
type hash struct {
id ID
peers map[string]HashPeer
discoveredAt time.Time
//lastRequestedAt time.Time
droppedReason error
reverseMap *reverseMap
}
type HashPeer struct {
Addr netip.AddrPort
}
type HashOption interface {
apply(*hash)
}
var _ keyspaceItemPrivate[[]HashPeer, HashOption, Hash] = (*hash)(nil)
func (h *hash) update(peers []HashPeer) {
for _, p := range peers {
h.peers[p.Addr.Addr().String()] = p
h.reverseMap.putAddrHashes(p.Addr.Addr(), h.id)
}
}
func (h *hash) apply(option HashOption) {
option.apply(h)
}
func (h *hash) drop(reason error) {
h.droppedReason = reason
for _, addr := range h.peers {
if info, ok := h.reverseMap.addrs[addr.Addr.Addr().String()]; ok {
info.dropHashes(h.id)
}
}
}
func (h *hash) public() Hash {
return h
}
func (h *hash) hasPeers() bool {
return len(h.peers) > 0
}
func (h *hash) ID() ID {
return h.id
}
func (h *hash) Peers() []HashPeer {
peers := make([]HashPeer, 0, len(h.peers))
for _, p := range h.peers {
peers = append(peers, p)
}
return peers
}
func (h *hash) Dropped() bool {
return h.droppedReason != nil
}