@@ -121,7 +121,7 @@ func (v *view) NewView(
121
121
return nil , err
122
122
}
123
123
124
- newView , err := newView (v .db , v , changes )
124
+ childView , err := newView (v .db , v , changes )
125
125
if err != nil {
126
126
return nil , err
127
127
}
@@ -132,9 +132,9 @@ func (v *view) NewView(
132
132
if v .invalidated {
133
133
return nil , ErrInvalid
134
134
}
135
- v .childViews = append (v .childViews , newView )
135
+ v .childViews = append (v .childViews , childView )
136
136
137
- return newView , nil
137
+ return childView , nil
138
138
}
139
139
140
140
// Creates a new view with the given [parentTrie].
@@ -143,7 +143,7 @@ func newView(
143
143
parentTrie View ,
144
144
changes ViewChanges ,
145
145
) (* view , error ) {
146
- newView := & view {
146
+ v := & view {
147
147
root : maybe .Bind (parentTrie .getRoot (), (* node ).clone ),
148
148
db : db ,
149
149
parentTrie : parentTrie ,
@@ -164,19 +164,19 @@ func newView(
164
164
newVal = maybe .Some (slices .Clone (op .Value ))
165
165
}
166
166
}
167
- if err := newView .recordValueChange (toKey (key ), newVal ); err != nil {
167
+ if err := v .recordValueChange (toKey (key ), newVal ); err != nil {
168
168
return nil , err
169
169
}
170
170
}
171
171
for key , val := range changes .MapOps {
172
172
if ! changes .ConsumeBytes {
173
173
val = maybe .Bind (val , slices.Clone [[]byte ])
174
174
}
175
- if err := newView .recordValueChange (toKey (stringToByteSlice (key )), val ); err != nil {
175
+ if err := v .recordValueChange (toKey (stringToByteSlice (key )), val ); err != nil {
176
176
return nil , err
177
177
}
178
178
}
179
- return newView , nil
179
+ return v , nil
180
180
}
181
181
182
182
// Creates a view of the db at a historical root using the provided [changes].
@@ -189,7 +189,7 @@ func newViewWithChanges(
189
189
return nil , ErrNoChanges
190
190
}
191
191
192
- newView := & view {
192
+ v := & view {
193
193
root : changes .rootChange .after ,
194
194
db : db ,
195
195
parentTrie : db ,
@@ -198,9 +198,9 @@ func newViewWithChanges(
198
198
}
199
199
// since this is a set of historical changes, all nodes have already been calculated
200
200
// since no new changes have occurred, no new calculations need to be done
201
- newView .calculateNodesOnce .Do (func () {})
202
- newView .nodesAlreadyCalculated .Set (true )
203
- return newView , nil
201
+ v .calculateNodesOnce .Do (func () {})
202
+ v .nodesAlreadyCalculated .Set (true )
203
+ return v , nil
204
204
}
205
205
206
206
func (v * view ) getTokenSize () int {
0 commit comments