@@ -1388,7 +1388,7 @@ func makeAccountTrieNoStorage(n int) (string, *trie.Trie, entrySlice) {
1388
1388
1389
1389
// Commit the state changes into db and re-create the trie
1390
1390
// for accessing later.
1391
- root , nodes , _ := accTrie .Commit (false )
1391
+ root , nodes := accTrie .Commit (false )
1392
1392
db .Update (trie .NewWithNodeSet (nodes ))
1393
1393
1394
1394
accTrie , _ = trie .New (trie .StateTrieID (root ), db )
@@ -1450,7 +1450,7 @@ func makeBoundaryAccountTrie(n int) (string, *trie.Trie, entrySlice) {
1450
1450
1451
1451
// Commit the state changes into db and re-create the trie
1452
1452
// for accessing later.
1453
- root , nodes , _ := accTrie .Commit (false )
1453
+ root , nodes := accTrie .Commit (false )
1454
1454
db .Update (trie .NewWithNodeSet (nodes ))
1455
1455
1456
1456
accTrie , _ = trie .New (trie .StateTrieID (root ), db )
@@ -1496,7 +1496,7 @@ func makeAccountTrieWithStorageWithUniqueStorage(accounts, slots int, code bool)
1496
1496
sort .Sort (entries )
1497
1497
1498
1498
// Commit account trie
1499
- root , set , _ := accTrie .Commit (true )
1499
+ root , set := accTrie .Commit (true )
1500
1500
nodes .Merge (set )
1501
1501
1502
1502
// Commit gathered dirty nodes into database
@@ -1561,7 +1561,7 @@ func makeAccountTrieWithStorage(accounts, slots int, code, boundary bool) (strin
1561
1561
sort .Sort (entries )
1562
1562
1563
1563
// Commit account trie
1564
- root , set , _ := accTrie .Commit (true )
1564
+ root , set := accTrie .Commit (true )
1565
1565
nodes .Merge (set )
1566
1566
1567
1567
// Commit gathered dirty nodes into database
@@ -1603,7 +1603,7 @@ func makeStorageTrieWithSeed(owner common.Hash, n, seed uint64, db *trie.Databas
1603
1603
entries = append (entries , elem )
1604
1604
}
1605
1605
sort .Sort (entries )
1606
- root , nodes , _ := trie .Commit (false )
1606
+ root , nodes := trie .Commit (false )
1607
1607
return root , nodes , entries
1608
1608
}
1609
1609
@@ -1654,7 +1654,7 @@ func makeBoundaryStorageTrie(owner common.Hash, n int, db *trie.Database) (commo
1654
1654
entries = append (entries , elem )
1655
1655
}
1656
1656
sort .Sort (entries )
1657
- root , nodes , _ := trie .Commit (false )
1657
+ root , nodes := trie .Commit (false )
1658
1658
return root , nodes , entries
1659
1659
}
1660
1660
0 commit comments