-
Notifications
You must be signed in to change notification settings - Fork 175
/
execution_tree.go
150 lines (119 loc) · 3.91 KB
/
execution_tree.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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
// Code generated by mockery v2.21.4. DO NOT EDIT.
package mempool
import (
flow "github.com/onflow/flow-go/model/flow"
mempool "github.com/onflow/flow-go/module/mempool"
mock "github.com/stretchr/testify/mock"
)
// ExecutionTree is an autogenerated mock type for the ExecutionTree type
type ExecutionTree struct {
mock.Mock
}
// AddReceipt provides a mock function with given fields: receipt, block
func (_m *ExecutionTree) AddReceipt(receipt *flow.ExecutionReceipt, block *flow.Header) (bool, error) {
ret := _m.Called(receipt, block)
var r0 bool
var r1 error
if rf, ok := ret.Get(0).(func(*flow.ExecutionReceipt, *flow.Header) (bool, error)); ok {
return rf(receipt, block)
}
if rf, ok := ret.Get(0).(func(*flow.ExecutionReceipt, *flow.Header) bool); ok {
r0 = rf(receipt, block)
} else {
r0 = ret.Get(0).(bool)
}
if rf, ok := ret.Get(1).(func(*flow.ExecutionReceipt, *flow.Header) error); ok {
r1 = rf(receipt, block)
} else {
r1 = ret.Error(1)
}
return r0, r1
}
// AddResult provides a mock function with given fields: result, block
func (_m *ExecutionTree) AddResult(result *flow.ExecutionResult, block *flow.Header) error {
ret := _m.Called(result, block)
var r0 error
if rf, ok := ret.Get(0).(func(*flow.ExecutionResult, *flow.Header) error); ok {
r0 = rf(result, block)
} else {
r0 = ret.Error(0)
}
return r0
}
// HasReceipt provides a mock function with given fields: receipt
func (_m *ExecutionTree) HasReceipt(receipt *flow.ExecutionReceipt) bool {
ret := _m.Called(receipt)
var r0 bool
if rf, ok := ret.Get(0).(func(*flow.ExecutionReceipt) bool); ok {
r0 = rf(receipt)
} else {
r0 = ret.Get(0).(bool)
}
return r0
}
// LowestHeight provides a mock function with given fields:
func (_m *ExecutionTree) LowestHeight() uint64 {
ret := _m.Called()
var r0 uint64
if rf, ok := ret.Get(0).(func() uint64); ok {
r0 = rf()
} else {
r0 = ret.Get(0).(uint64)
}
return r0
}
// PruneUpToHeight provides a mock function with given fields: newLowestHeight
func (_m *ExecutionTree) PruneUpToHeight(newLowestHeight uint64) error {
ret := _m.Called(newLowestHeight)
var r0 error
if rf, ok := ret.Get(0).(func(uint64) error); ok {
r0 = rf(newLowestHeight)
} else {
r0 = ret.Error(0)
}
return r0
}
// ReachableReceipts provides a mock function with given fields: resultID, blockFilter, receiptFilter
func (_m *ExecutionTree) ReachableReceipts(resultID flow.Identifier, blockFilter mempool.BlockFilter, receiptFilter mempool.ReceiptFilter) ([]*flow.ExecutionReceipt, error) {
ret := _m.Called(resultID, blockFilter, receiptFilter)
var r0 []*flow.ExecutionReceipt
var r1 error
if rf, ok := ret.Get(0).(func(flow.Identifier, mempool.BlockFilter, mempool.ReceiptFilter) ([]*flow.ExecutionReceipt, error)); ok {
return rf(resultID, blockFilter, receiptFilter)
}
if rf, ok := ret.Get(0).(func(flow.Identifier, mempool.BlockFilter, mempool.ReceiptFilter) []*flow.ExecutionReceipt); ok {
r0 = rf(resultID, blockFilter, receiptFilter)
} else {
if ret.Get(0) != nil {
r0 = ret.Get(0).([]*flow.ExecutionReceipt)
}
}
if rf, ok := ret.Get(1).(func(flow.Identifier, mempool.BlockFilter, mempool.ReceiptFilter) error); ok {
r1 = rf(resultID, blockFilter, receiptFilter)
} else {
r1 = ret.Error(1)
}
return r0, r1
}
// Size provides a mock function with given fields:
func (_m *ExecutionTree) Size() uint {
ret := _m.Called()
var r0 uint
if rf, ok := ret.Get(0).(func() uint); ok {
r0 = rf()
} else {
r0 = ret.Get(0).(uint)
}
return r0
}
type mockConstructorTestingTNewExecutionTree interface {
mock.TestingT
Cleanup(func())
}
// NewExecutionTree creates a new instance of ExecutionTree. It also registers a testing interface on the mock and a cleanup function to assert the mocks expectations.
func NewExecutionTree(t mockConstructorTestingTNewExecutionTree) *ExecutionTree {
mock := &ExecutionTree{}
mock.Mock.Test(t)
t.Cleanup(func() { mock.AssertExpectations(t) })
return mock
}