39c2a55942
* port statediff from 9b7fd9af80/statediff/statediff.go; minor fixes
* integrating state diff extracting, building, and persisting into geth processes
* work towards persisting created statediffs in ipfs; based off github.com/vulcanize/eth-block-extractor
* Add a state diff service
* Remove diff extractor from blockchain
* Update imports
* Move statediff on/off check to geth cmd config
* Update starting state diff service
* Add debugging logs for creating diff
* Add statediff extractor and builder tests and small refactoring
* Start to write statediff to a CSV
* Restructure statediff directory
* Pull CSV publishing methods into their own file
* Reformatting due to go fmt
* Add gomega to vendor dir
* Remove testing focuses
* Update statediff tests to use golang test pkg
instead of ginkgo
- builder_test
- extractor_test
- publisher_test
* Use hexutil.Encode instead of deprecated common.ToHex
* Remove OldValue from DiffBigInt and DiffUint64 fields
* Update builder test
* Remove old storage value from updated accounts
* Remove old values from created/deleted accounts
* Update publisher to account for only storing current account values
* Update service loop and fetching previous block
* Update testing
- remove statediff ginkgo test suite file
- move mocks to their own dir
* Updates per go fmt
* Updates to tests
* Pass statediff mode and path in through cli
* Return filename from publisher
* Remove some duplication in builder
* Remove code field from state diff output
this is the contract byte code, and it can still be obtained by querying
the db by the codeHash
* Consolidate acct diff structs for updated & updated/deleted accts
* Include block number in csv filename
* Clean up error logging
* Cleanup formatting, spelling, etc
* Address PR comments
* Add contract address and storage value to csv
* Refactor accumulating account row in csv publisher
* Add DiffStorage struct
* Add storage key to csv
* Address PR comments
* Fix publisher to include rows for accounts that don't have store updates
* Update builder test after merging in release/1.8
* Update test contract to include storage on contract intialization
- so that we're able to test that storage diffing works for created and
deleted accounts (not just updated accounts).
* Factor out a common trie iterator method in builder
81 lines
2.1 KiB
Go
81 lines
2.1 KiB
Go
package matchers
|
|
|
|
import (
|
|
"fmt"
|
|
"reflect"
|
|
|
|
"github.com/onsi/gomega/format"
|
|
"github.com/onsi/gomega/matchers/support/goraph/bipartitegraph"
|
|
)
|
|
|
|
type ConsistOfMatcher struct {
|
|
Elements []interface{}
|
|
}
|
|
|
|
func (matcher *ConsistOfMatcher) Match(actual interface{}) (success bool, err error) {
|
|
if !isArrayOrSlice(actual) && !isMap(actual) {
|
|
return false, fmt.Errorf("ConsistOf matcher expects an array/slice/map. Got:\n%s", format.Object(actual, 1))
|
|
}
|
|
|
|
elements := matcher.Elements
|
|
if len(matcher.Elements) == 1 && isArrayOrSlice(matcher.Elements[0]) {
|
|
elements = []interface{}{}
|
|
value := reflect.ValueOf(matcher.Elements[0])
|
|
for i := 0; i < value.Len(); i++ {
|
|
elements = append(elements, value.Index(i).Interface())
|
|
}
|
|
}
|
|
|
|
matchers := []interface{}{}
|
|
for _, element := range elements {
|
|
matcher, isMatcher := element.(omegaMatcher)
|
|
if !isMatcher {
|
|
matcher = &EqualMatcher{Expected: element}
|
|
}
|
|
matchers = append(matchers, matcher)
|
|
}
|
|
|
|
values := matcher.valuesOf(actual)
|
|
|
|
if len(values) != len(matchers) {
|
|
return false, nil
|
|
}
|
|
|
|
neighbours := func(v, m interface{}) (bool, error) {
|
|
match, err := m.(omegaMatcher).Match(v)
|
|
return match && err == nil, nil
|
|
}
|
|
|
|
bipartiteGraph, err := bipartitegraph.NewBipartiteGraph(values, matchers, neighbours)
|
|
if err != nil {
|
|
return false, err
|
|
}
|
|
|
|
return len(bipartiteGraph.LargestMatching()) == len(values), nil
|
|
}
|
|
|
|
func (matcher *ConsistOfMatcher) valuesOf(actual interface{}) []interface{} {
|
|
value := reflect.ValueOf(actual)
|
|
values := []interface{}{}
|
|
if isMap(actual) {
|
|
keys := value.MapKeys()
|
|
for i := 0; i < value.Len(); i++ {
|
|
values = append(values, value.MapIndex(keys[i]).Interface())
|
|
}
|
|
} else {
|
|
for i := 0; i < value.Len(); i++ {
|
|
values = append(values, value.Index(i).Interface())
|
|
}
|
|
}
|
|
|
|
return values
|
|
}
|
|
|
|
func (matcher *ConsistOfMatcher) FailureMessage(actual interface{}) (message string) {
|
|
return format.Message(actual, "to consist of", matcher.Elements)
|
|
}
|
|
|
|
func (matcher *ConsistOfMatcher) NegatedFailureMessage(actual interface{}) (message string) {
|
|
return format.Message(actual, "not to consist of", matcher.Elements)
|
|
}
|