forked from regen-network/mainnet
-
Notifications
You must be signed in to change notification settings - Fork 0
/
merge.go
104 lines (88 loc) · 2.05 KB
/
merge.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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
package main
import (
"fmt"
"sort"
"time"
)
func MergeAccounts(accounts []Account) ([]Account, error) {
accMap := make(map[string]Account)
for _, acc := range accounts {
if len(acc.Distributions) == 0 {
return []Account{}, fmt.Errorf("account must have atleast one distribution: %v", acc)
}
addrStr := acc.Address.String()
existing, ok := accMap[addrStr]
var newAcc Account
if ok {
var err error
newAcc, err = mergeTwoAccounts(acc, existing)
if err != nil {
return nil, err
}
err = newAcc.Validate()
if err != nil {
return nil, fmt.Errorf("error merging two accounts: %w", err)
}
} else {
newAcc = acc
}
accMap[addrStr] = newAcc
}
// sort addresses
addrs := make([]string, 0, len(accMap))
for addr := range accMap {
addrs = append(addrs, addr)
}
sort.Strings(addrs)
res := make([]Account, 0, len(accMap))
for _, addr := range addrs {
res = append(res, accMap[addr])
}
return res, nil
}
func mergeTwoAccounts(acc1, acc2 Account) (Account, error) {
if !acc1.Address.Equals(acc2.Address) {
return Account{}, fmt.Errorf("%s != %s", acc1.Address, acc2.Address)
}
newTotal, err := acc1.TotalRegen.Add(acc2.TotalRegen)
if err != nil {
return Account{}, err
}
distMap := make(map[time.Time]Distribution)
for _, dist := range acc1.Distributions {
distMap[dist.Time] = dist
}
for _, dist := range acc2.Distributions {
t := dist.Time
amount := dist.Regen
existing, ok := distMap[t]
if ok {
amount, err = amount.Add(existing.Regen)
if err != nil {
return Account{}, err
}
}
distMap[t] = Distribution{
Time: t,
Regen: amount,
}
}
// sort times
var times []time.Time
for t := range distMap {
times = append(times, t)
}
sort.Slice(times, func(i, j int) bool {
return times[i].Before(times[j])
})
// put distributions in sorted order
var distributions []Distribution
for _, t := range times {
distributions = append(distributions, distMap[t])
}
return Account{
Address: acc1.Address,
TotalRegen: newTotal,
Distributions: distributions,
}, nil
}