@@ -115,7 +115,7 @@ type NodeIterator interface {
115
115
// Before adding a similar mechanism to any other place in Geth, consider
116
116
// making trie.Database an interface and wrapping at that level. It's a huge
117
117
// refactor, but it could be worth it if another occurrence arises.
118
- AddResolver (ethdb.KeyValueStore )
118
+ AddResolver (ethdb.KeyValueReader )
119
119
}
120
120
121
121
// nodeIteratorState represents the iteration state at one particular Node of the
@@ -134,7 +134,7 @@ type nodeIterator struct {
134
134
path []byte // Path to the current Node
135
135
err error // Failure set in case of an internal error in the iterator
136
136
137
- resolver ethdb.KeyValueStore // Optional intermediate resolver above the disk layer
137
+ resolver ethdb.KeyValueReader // Optional intermediate resolver above the disk layer
138
138
}
139
139
140
140
// errIteratorEnd is stored in nodeIterator.err when iteration is done.
@@ -159,7 +159,7 @@ func newNodeIterator(trie *Trie, start []byte) NodeIterator {
159
159
return it
160
160
}
161
161
162
- func (it * nodeIterator ) AddResolver (resolver ethdb.KeyValueStore ) {
162
+ func (it * nodeIterator ) AddResolver (resolver ethdb.KeyValueReader ) {
163
163
it .resolver = resolver
164
164
}
165
165
@@ -548,7 +548,7 @@ func (it *differenceIterator) Path() []byte {
548
548
return it .b .Path ()
549
549
}
550
550
551
- func (it * differenceIterator ) AddResolver (resolver ethdb.KeyValueStore ) {
551
+ func (it * differenceIterator ) AddResolver (resolver ethdb.KeyValueReader ) {
552
552
panic ("not implemented" )
553
553
}
554
554
@@ -659,7 +659,7 @@ func (it *unionIterator) Path() []byte {
659
659
return (* it .items )[0 ].Path ()
660
660
}
661
661
662
- func (it * unionIterator ) AddResolver (resolver ethdb.KeyValueStore ) {
662
+ func (it * unionIterator ) AddResolver (resolver ethdb.KeyValueReader ) {
663
663
panic ("not implemented" )
664
664
}
665
665
0 commit comments