@@ -74,7 +74,7 @@ func runKnownQueriesFast(b *testing.B, t *iavl.MutableTree, keys [][]byte) {
74
74
isFastCacheEnabled , err := t .IsFastCacheEnabled () // to ensure fast storage is enabled
75
75
require .NoError (b , err )
76
76
require .True (b , isFastCacheEnabled )
77
- l := int32 (len (keys ))
77
+ l := int32 (len (keys )) //nolint: gosec // used in testing
78
78
for i := 0 ; i < b .N ; i ++ {
79
79
q := keys [mrand .Int31n (l )]
80
80
_ , err := t .Get (q )
@@ -116,7 +116,7 @@ func runKnownQueriesSlow(b *testing.B, t *iavl.MutableTree, keys [][]byte) {
116
116
require .NoError (b , err )
117
117
require .False (b , isFastCacheEnabled )
118
118
b .StartTimer ()
119
- l := int32 (len (keys ))
119
+ l := int32 (len (keys )) //nolint: gosec // used in testing
120
120
for i := 0 ; i < b .N ; i ++ {
121
121
q := keys [mrand .Int31n (l )]
122
122
index , value , err := itree .GetWithIndex (q )
@@ -173,7 +173,7 @@ func iterate(b *testing.B, itr corestore.Iterator, expectedSize int) {
173
173
// }
174
174
175
175
func runUpdate (b * testing.B , t * iavl.MutableTree , dataLen , blockSize int , keys [][]byte ) * iavl.MutableTree {
176
- l := int32 (len (keys ))
176
+ l := int32 (len (keys )) //nolint: gosec // used in testing
177
177
for i := 1 ; i <= b .N ; i ++ {
178
178
key := keys [mrand .Int31n (l )]
179
179
_ , err := t .Set (key , randBytes (dataLen ))
@@ -202,7 +202,7 @@ func runUpdate(b *testing.B, t *iavl.MutableTree, dataLen, blockSize int, keys [
202
202
203
203
// runBlock measures time for an entire block, not just one tx
204
204
func runBlock (b * testing.B , t * iavl.MutableTree , keyLen , dataLen , blockSize int , keys [][]byte ) * iavl.MutableTree {
205
- l := int32 (len (keys ))
205
+ l := int32 (len (keys )) //nolint: gosec // used in testing
206
206
207
207
// XXX: This was adapted to work with VersionedTree but needs to be re-thought.
208
208
0 commit comments