trie: fix misspell+lint

core/state/state_object.go

@@ -278,7 +278,7 @@ func (s *stateObject) finalise() {
 func (s *stateObject) updateTrie(db Database) Trie {
 	// Make sure all dirty slots are finalized into the pending storage area
 	s.finalise()
-	if len(s.pendingStorage) == 0{
+	if len(s.pendingStorage) == 0 {
 		return s.trie
 	}
 	// Track the amount of time wasted on updating the storge trie
@@ -310,7 +310,7 @@ func (s *stateObject) updateTrie(db Database) Trie {
 
 // UpdateRoot sets the trie root to the current root hash of
 func (s *stateObject) updateRoot(db Database) {
-	if s.updateTrie(db) == nil{
+	if s.updateTrie(db) == nil {
 		// No changes, storage trie is not even loaded
 		return
 	}
@@ -324,7 +324,7 @@ func (s *stateObject) updateRoot(db Database) {
 // CommitTrie the storage trie of the object to db.
 // This updates the trie root.
 func (s *stateObject) CommitTrie(db Database) error {
-	if s.updateTrie(db) == nil{
+	if s.updateTrie(db) == nil {
 		// No changes, storage trie is not even loaded
 		return nil
 	}

trie/pure_committer.go

@@ -42,8 +42,8 @@ type Leaf struct {
 // internal preallocated temp space, and also a callback that is invoked when
 // leaves are committed. The leafs are passed through the `leafCh`,  to allow
 // some level of paralellism.
-// By 'some level' of paralellism, it's still the case that all leaves will be
-// processed sequentially - onleaf will never be called in paralell or out of order.
+// By 'some level' of parallelism, it's still the case that all leaves will be
+// processed sequentially - onleaf will never be called in parallel or out of order.
 type committer struct {
 	tmp sliceBuffer
 	sha keccakState