Merge pull request #748 from AtomicInnovation321/main

muti: fix typos

Author: guggero

commitment/commitment_test.go

@@ -1413,7 +1413,7 @@ func TestTapCommitmentUpsertMaxVersion(t *testing.T) {
 }
 
 // TestTapCommitmentDeleteMaxVersion tests that when we delete commitments, the
-// max version is also udpated.
+// max version is also updated.
 func TestTapCommitmentDeleteMaxVersion(t *testing.T) {
 	t.Parallel()
 
@@ -1474,7 +1474,7 @@ func TestAssetCommitmentUpsertMaxVersion(t *testing.T) {
 }
 
 // TestAssetCommitmentDeleteMaxVersion tests that when we delete commitments,
-// the max version is also udpated.
+// the max version is also updated.
 func TestAssetCommitmentDeleteMaxVersion(t *testing.T) {
 	t.Parallel()
 

fn/func.go

@@ -95,14 +95,14 @@ func CopyAll[T Copyable[T]](xs []T) []T {
 }
 
 // CopyableErr is a generic interface for a type that's able to return a deep copy
-// of itself. This is identical to Copyable, but shuold be used in cases where
+// of itself. This is identical to Copyable, but should be used in cases where
 // the copy method can return an error.
 type CopyableErr[T any] interface {
 	Copy() (T, error)
 }
 
 // CopyAllErr creates a new slice where each item of the slice is a deep copy of
-// the elements of the input slice. This is identical to CopyAll, but shuold be
+// the elements of the input slice. This is identical to CopyAll, but should be
 // used in cases where the copy method can return an error.
 func CopyAllErr[T CopyableErr[T]](xs []T) ([]T, error) {
 	var err error

mssmt/store.go

@@ -76,7 +76,7 @@ type TreeStoreUpdateTx interface {
 // along with a 'New()' method which is responsible for initializing a
 // particular TreeStore concrete implementation.
 type TreeStoreDriver struct {
-	// Name is the anme of the minting store driver.
+	// Name is the name of the minting store driver.
 	Name string
 
 	// New creates a new concrete instance of the TreeStore given a set of

mssmt/tree.go

@@ -210,7 +210,7 @@ func (t *FullTree) insert(tx TreeStoreUpdateTx, key *[hashSize]byte,
 
 	// With our new root updated, we can update the leaf node within the
 	// store. If we've inserted an empty leaf, then the leaf node found at
-	// the given key is being deleted, otherise it's being inserted.
+	// the given key is being deleted, otherwise it's being inserted.
 	if leaf.IsEmpty() {
 		if err := tx.DeleteLeaf(*key); err != nil {
 			return nil, err

universe/syncer.go

@@ -338,7 +338,7 @@ func (s *SimpleSyncer) syncRoot(ctx context.Context, remoteRoot Root,
 		return err
 	}
 
-	// If this is a tranfer tree, then we'll collect all the items as we
+	// If this is a transfer tree, then we'll collect all the items as we
 	// need to sort them to ensure we can validate them in dep order.
 	if !isIssuanceTree {
 		transferLeaves := fn.Collect(transferLeafProofs)