chore: fix some function names and typo in comment

Signed-off-by: wangjingcun <wangjingcun@aliyun.com>

Author: wangjingcun

batch_test.go

@@ -40,7 +40,7 @@ func testBatchWithFlusher(t *testing.T) {
 
 	batchWithFlusher := NewBatchWithFlusher(db, DefaultOptions().FlushThreshold)
 
-	// we'll try to to commit 10MBs (1000 * 10KBs each entries) of data into the db
+	// we'll try to commit 10MBs (1000 * 10KBs each entries) of data into the db
 	for keyNonce := uint16(0); keyNonce < 1000; keyNonce++ {
 		// each value is 10 KBs of zero bytes
 		key := makeKey(keyNonce)

cmd/iaviewer/README.md

@@ -6,7 +6,7 @@ Below is a brief introduction to the tool.
 
 ## Installation
 
-Once this is merged into the offical repo, master, you should be able to do:
+Once this is merged into the official repo, master, you should be able to do:
 
 ```shell
 go get github.com/cosmos/iavl
@@ -42,7 +42,7 @@ Now, if you run `ls -l`, you should see two directories... `bns-a.db` and `bns-b
 iaviewer versions ./bns-a.db ""
 ```
 
-This should print out a list of 20 versions of the code. Note the the iavl tree will persist multiple
+This should print out a list of 20 versions of the code. Note the iavl tree will persist multiple
 historical versions, which is a great aid in forensic queries (thanks Tendermint team!). For the rest
 of the cases, we will consider only the last two versions, 190257 (last one where they match) and 190258
 (where they are different).

immutable_tree.go

@@ -208,7 +208,7 @@ func (t *ImmutableTree) Get(key []byte) ([]byte, error) {
 
 	// otherwise skipFastStorageUpgrade is true or
 	// the cached node was updated later than the current tree. In this case,
-	// we need to use the regular stategy for reading from the current tree to avoid staleness.
+	// we need to use the regular strategy for reading from the current tree to avoid staleness.
 	_, result, err := t.root.get(t, key)
 	return result, err
 }

internal/encoding/encoding.go

@@ -28,7 +28,7 @@ var uvarintPool = &sync.Pool{
 	},
 }
 
-// decodeBytes decodes a varint length-prefixed byte slice, returning it along with the number
+// DecodeBytes decodes a varint length-prefixed byte slice, returning it along with the number
 // of input bytes read.
 // Assumes bz will not be mutated.
 func DecodeBytes(bz []byte) ([]byte, int, error) {
@@ -55,7 +55,7 @@ func DecodeBytes(bz []byte) ([]byte, int, error) {
 	return bz[n:end], end, nil
 }
 
-// decodeUvarint decodes a varint-encoded unsigned integer from a byte slice, returning it and the
+// DecodeUvarint decodes a varint-encoded unsigned integer from a byte slice, returning it and the
 // number of bytes decoded.
 func DecodeUvarint(bz []byte) (uint64, int, error) {
 	u, n := binary.Uvarint(bz)
@@ -71,7 +71,7 @@ func DecodeUvarint(bz []byte) (uint64, int, error) {
 	return u, n, nil
 }
 
-// decodeVarint decodes a varint-encoded integer from a byte slice, returning it and the number of
+// DecodeVarint decodes a varint-encoded integer from a byte slice, returning it and the number of
 // bytes decoded.
 func DecodeVarint(bz []byte) (int64, int, error) {
 	i, n := binary.Varint(bz)

iterator.go

@@ -164,7 +164,7 @@ func (t *traversal) next() (*Node, error) {
 		return node, nil
 	}
 
-	// Keep traversing and expanding the remaning delayed nodes. A-4.
+	// Keep traversing and expanding the remaining delayed nodes. A-4.
 	return t.next()
 }
 

mutable_tree_test.go

@@ -974,7 +974,7 @@ func TestFastStorageReUpgradeProtection_ForceUpgradeFirstTime_NoForceSecondTime_
 	batchMock.EXPECT().Write().Return(nil).Times(1)
 	batchMock.EXPECT().Close().Return(nil).Times(1)
 
-	// iterMock is used to mock the underlying db iterator behing fast iterator
+	// iterMock is used to mock the underlying db iterator behind fast iterator
 	// Here, we want to mock the behavior of deleting fast nodes from disk when
 	// force upgrade is detected.
 	iterMock.EXPECT().Valid().Return(true).Times(1)
@@ -994,7 +994,7 @@ func TestFastStorageReUpgradeProtection_ForceUpgradeFirstTime_NoForceSecondTime_
 	iterMock.EXPECT().Next().Return().Times(1)
 	iterMock.EXPECT().Error().Return(nil).Times(1)
 	iterMock.EXPECT().Valid().Return(false).Times(1)
-	// Call Valid after first iteraton
+	// Call Valid after first iteration
 	iterMock.EXPECT().Valid().Return(false).Times(1)
 	iterMock.EXPECT().Close().Return(nil).Times(1)
 

testutils_test.go

@@ -283,7 +283,7 @@ func setupMirrorForIterator(t *testing.T, config *iteratorTestConfig, tree *Muta
 	return mirror
 }
 
-// assertIterator confirms that the iterator returns the expected values desribed by mirror in the same order.
+// assertIterator confirms that the iterator returns the expected values described by mirror in the same order.
 // mirror is a slice containing slices of the form [key, value]. In other words, key at index 0 and value at index 1.
 func assertIterator(t *testing.T, itr corestore.Iterator, mirror [][]string, ascending bool) {
 	startIdx, endIdx := 0, len(mirror)-1

v2/internal/encoding.go

@@ -28,7 +28,7 @@ var uvarintPool = &sync.Pool{
 	},
 }
 
-// decodeBytes decodes a varint length-prefixed byte slice, returning it along with the number
+// DecodeBytes decodes a varint length-prefixed byte slice, returning it along with the number
 // of input bytes read.
 func DecodeBytes(bz []byte) ([]byte, int, error) {
 	s, n, err := DecodeUvarint(bz)
@@ -56,7 +56,7 @@ func DecodeBytes(bz []byte) ([]byte, int, error) {
 	return bz2, end, nil
 }
 
-// decodeUvarint decodes a varint-encoded unsigned integer from a byte slice, returning it and the
+// DecodeUvarint decodes a varint-encoded unsigned integer from a byte slice, returning it and the
 // number of bytes decoded.
 func DecodeUvarint(bz []byte) (uint64, int, error) {
 	u, n := binary.Uvarint(bz)
@@ -72,7 +72,7 @@ func DecodeUvarint(bz []byte) (uint64, int, error) {
 	return u, n, nil
 }
 
-// decodeVarint decodes a varint-encoded integer from a byte slice, returning it and the number of
+// DecodeVarint decodes a varint-encoded integer from a byte slice, returning it and the number of
 // bytes decoded.
 func DecodeVarint(bz []byte) (int64, int, error) {
 	i, n := binary.Varint(bz)

v2/iterator.go

@@ -33,7 +33,7 @@ type Iterator interface {
 	// Error returns the last error encountered by the iterator, if any.
 	Error() error
 
-	// Close closes the iterator, relasing any allocated resources.
+	// Close closes the iterator, releasing any allocated resources.
 	Close() error
 }