73 lines
1.9 KiB
Go
73 lines
1.9 KiB
Go
|
// Copyright 2019 The go-ethereum Authors
|
||
|
|
// This file is part of the go-ethereum library.
|
||
|
|
//
|
||
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
||
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
||
|
|
// the Free Software Foundation, either version 3 of the License, or
|
||
|
|
// (at your option) any later version.
|
||
|
|
//
|
||
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
||
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
// GNU Lesser General Public License for more details.
|
||
|
|
//
|
||
|
|
// You should have received a copy of the GNU Lesser General Public License
|
||
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
||
|
|
|
||
|
|
// Contains a batch of utility type declarations used by the tests. As the node
|
||
|
|
// operates on unique types, a lot of them are needed to check various features.
|
||
|
|
|
||
|
|
package statediff
|
||
|
|
|
||
|
|
import (
|
||
|
|
"sort"
|
||
|
|
"strings"
|
||
|
|
)
|
||
|
|
|
||
|
|
func sortKeys(data AccountMap) []string {
|
||
|
|
keys := make([]string, 0, len(data))
|
||
|
|
for key := range data {
|
||
|
|
keys = append(keys, key)
|
||
|
|
}
|
||
|
|
sort.Strings(keys)
|
||
|
|
|
||
|
|
return keys
|
||
|
|
}
|
||
|
|
|
||
|
|
// findIntersection finds the set of strings from both arrays that are equivalent
|
||
|
|
// a and b must first be sorted
|
||
|
|
// this is used to find which keys have been both "deleted" and "created" i.e. they were updated
|
||
|
|
func findIntersection(a, b []string) []string {
|
||
|
|
lenA := len(a)
|
||
|
|
lenB := len(b)
|
||
|
|
iOfA, iOfB := 0, 0
|
||
|
|
updates := make([]string, 0)
|
||
|
|
if iOfA >= lenA || iOfB >= lenB {
|
||
|
|
return updates
|
||
|
|
}
|
||
|
|
for {
|
||
|
|
switch strings.Compare(a[iOfA], b[iOfB]) {
|
||
|
|
// -1 when a[iOfA] < b[iOfB]
|
||
|
|
case -1:
|
||
|
|
iOfA++
|
||
|
|
if iOfA >= lenA {
|
||
|
|
return updates
|
||
|
|
}
|
||
|
|
// 0 when a[iOfA] == b[iOfB]
|
||
|
|
case 0:
|
||
|
|
updates = append(updates, a[iOfA])
|
||
|
|
iOfA++
|
||
|
|
iOfB++
|
||
|
|
if iOfA >= lenA || iOfB >= lenB {
|
||
|
|
return updates
|
||
|
|
}
|
||
|
|
// 1 when a[iOfA] > b[iOfB]
|
||
|
|
case 1:
|
||
|
|
iOfB++
|
||
|
|
if iOfB >= lenB {
|
||
|
|
return updates
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|