sync version

README.md

@@ -543,7 +543,7 @@ interleaved := lo.Interleave([]int{1}, []int{2, 5, 8}, []int{3, 6}, []int{4, 7,
 // []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
 ```
 
-[[play](https://go.dev/play/p/DDhlwrShbwe)]
+[[play](https://go.dev/play/p/-RJkTLQEDVt)]
 
 ### Shuffle
 
@@ -1824,7 +1824,7 @@ str, index, ok := lo.FindLastIndexOf([]string{"foobar"}, func(i string) bool {
 
 ### FindOrElse
 
-Search an element in a slice based on a predicate. It returns element and true if element was found.
+Search an element in a slice based on a predicate. It returns the element if found or a given fallback value otherwise.
 
 ```go
 str := lo.FindOrElse([]string{"a", "b", "c", "d"}, "x", func(i string) bool {
@@ -2048,7 +2048,7 @@ result := lo.TernaryF(false, func() string { return "a" }, func() string { retur
 // "b"
 ```
 
-Useful to avoid nil-pointer dereferencing in intializations, or avoid running unnecessary code
+Useful to avoid nil-pointer dereferencing in initializations, or avoid running unnecessary code
 
 ```go
 var s *string

retry.go

@@ -239,7 +239,7 @@ type transactionStep[T any] struct {
 	onRollback func(T) T
 }
 
-// NewTransaction instanciate a new transaction.
+// NewTransaction instantiate a new transaction.
 func NewTransaction[T any]() *Transaction[T] {
 	return &Transaction[T]{
 		steps: []transactionStep[T]{},

retry_test.go

@@ -404,7 +404,7 @@ func TestDebounceBy(t *testing.T) {
 	mu.Unlock()
 }
 
-func TestTransation(t *testing.T) {
+func TestTransaction(t *testing.T) {
 	is := assert.New(t)
 
 	// no error

slice.go

@@ -232,7 +232,7 @@ func Flatten[T any](collection [][]T) []T {
 }
 
 // Interleave round-robin alternating input slices and sequentially appending value at index into result
-// Play: https://go.dev/play/p/DDhlwrShbwe
+// Play: https://go.dev/play/p/-RJkTLQEDVt
 func Interleave[T any](collections ...[]T) []T {
 	if len(collections) == 0 {
 		return []T{}