Lint

AccumulateNetwork · Oct 3, 2023 · ab80209 · ab80209
1 parent 6d531fc
commit ab80209
Show file tree

Hide file tree

Showing 3 changed files with 13 additions and 10 deletions.
diff --git a/pkg/database/bpt/bpt_receipt_test.go b/pkg/database/bpt/bpt_receipt_test.go
@@ -31,9 +31,10 @@ func TestBPT_receipt(t *testing.T) {
 	var keys, values common.RandHash     //     use the default sequence for keys
 	values.SetSeed([]byte{1, 2, 3})      //     use a different sequence for values
 	for i := 0; i < numberEntries; i++ { // For the number of Entries specified for the BPT
-		chainID := keys.NextAList()                    //      Get a key, keep a list
-		value := values.NextA()                        //      Get some value (don't really care what it is)
-		bpt.Insert(record.KeyFromHash(chainID), value) //      Insert the Key with the value into the BPT
+		chainID := keys.NextAList()                           //      Get a key, keep a list
+		value := values.NextA()                               //      Get some value (don't really care what it is)
+		err := bpt.Insert(record.KeyFromHash(chainID), value) //      Insert the Key with the value into the BPT
+		require.NoError(t, err)
 	}
 	require.NoError(t, bpt.Commit())
 

diff --git a/pkg/database/bpt/bpt_savestate_test.go b/pkg/database/bpt/bpt_savestate_test.go
@@ -1,4 +1,4 @@
-// Copyright 2022 The Accumulate Authors
+// Copyright 2023 The Accumulate Authors
 //
 // Use of this source code is governed by an MIT-style
 // license that can be found in the LICENSE file or at
@@ -47,7 +47,8 @@ func TestSaveState(t *testing.T) {
 		hash := sha256.Sum256(value)
 		err := storeTx.Put(record.KeyFromHash(hash), value)
 		require.NoError(t, err)
-		bpt.Insert(record.KeyFromHash(chainID), hash) //      Insert the Key with the value into the BPT
+		err = bpt.Insert(record.KeyFromHash(chainID), hash) //      Insert the Key with the value into the BPT
+		require.NoError(t, err)
 	}
 	require.NoError(t, bpt.Commit())
 	storeTx = BDB.Begin(nil, true)
@@ -58,7 +59,7 @@ func TestSaveState(t *testing.T) {
 	require.NoError(t, err)
 	defer f.Close()
 
-	SaveSnapshotV1(bpt, f, func(key storage.Key, hash [32]byte) ([]byte, error) {
+	err = SaveSnapshotV1(bpt, f, func(key storage.Key, hash [32]byte) ([]byte, error) {
 		return storeTx.Get(record.KeyFromHash(hash))
 	})
 	require.NoError(t, err)

diff --git a/pkg/database/bpt/iterate_test.go b/pkg/database/bpt/iterate_test.go
@@ -1,4 +1,4 @@
-// Copyright 2022 The Accumulate Authors
+// Copyright 2023 The Accumulate Authors
 //
 // Use of this source code is governed by an MIT-style
 // license that can be found in the LICENSE file or at
@@ -35,9 +35,10 @@ func GetRangeFor(t *testing.T, numberEntries, rangeNum int) {
 	var keys, values common.RandHash           //     use the default sequence for keys
 	values.SetSeed([]byte{1, 2, 3})            //     use a different sequence for values
 	for i := 0; i < numberEntries; i++ {       // For the number of Entries specified for the BPT
-		chainID := keys.NextAList()                    //      Get a key, keep a list
-		value := values.NextA()                        //      Get some value (don't really care what it is)
-		bpt.Insert(record.KeyFromHash(chainID), value) //      Insert the Key with the value into the BPT
+		chainID := keys.NextAList()                           //      Get a key, keep a list
+		value := values.NextA()                               //      Get some value (don't really care what it is)
+		err := bpt.Insert(record.KeyFromHash(chainID), value) //      Insert the Key with the value into the BPT
+		require.NoError(t, err)
 	}
 
 	cnt := 0