Merge pull request #12 from lepijohnny/master

Update README.md
rizalgowandy · Mar 5, 2022 · 38cc7ac · 38cc7ac
2 parents 74d4363 + 229126a
commit 38cc7ac
Showing 1 changed file with 4 additions and 4 deletions.
diff --git a/README.md b/README.md
@@ -475,7 +475,7 @@ Returns true if all elements of a subset are contained into a collection.
 ok := lo.Every[int]([]int{0, 1, 2, 3, 4, 5}, []int{0, 2})
 // true
 
-ko := lo.Every[int]([]int{0, 1, 2, 3, 4, 5}, []int{0, 6})
+ok := lo.Every[int]([]int{0, 1, 2, 3, 4, 5}, []int{0, 6})
 // false
 ```
 
@@ -487,7 +487,7 @@ Returns true if at least 1 element of a subset is contained into a collection.
 ok := lo.Some[int]([]int{0, 1, 2, 3, 4, 5}, []int{0, 2})
 // true
 
-ko := lo.Some[int]([]int{0, 1, 2, 3, 4, 5}, []int{-1, 6})
+ok := lo.Some[int]([]int{0, 1, 2, 3, 4, 5}, []int{-1, 6})
 // false
 ```
 
@@ -578,10 +578,10 @@ min := lo.Min[int]([]int{})
 Search the maximum value of a collection.
 
 ```go
-min := lo.Max[int]([]int{1, 2, 3})
+max := lo.Max[int]([]int{1, 2, 3})
 // 3
 
-min := lo.Max[int]([]int{})
+max := lo.Max[int]([]int{})
 // 0
 ```