generated from snivilised/astrolib
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
test(kernel): add universal unit tests (#64)
- Loading branch information
1 parent
bb1a6a7
commit 01885f1
Showing
3 changed files
with
302 additions
and
40 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,185 @@ | ||
| package lo | ||
|
|
||
| // Contains returns true if an element is present in a collection. | ||
| func Contains[T comparable](collection []T, element T) bool { | ||
| for _, item := range collection { | ||
| if item == element { | ||
| return true | ||
| } | ||
| } | ||
|
|
||
| return false | ||
| } | ||
|
|
||
| // ContainsBy returns true if predicate function return true. | ||
| func ContainsBy[T any](collection []T, predicate func(item T) bool) bool { | ||
| for _, item := range collection { | ||
| if predicate(item) { | ||
| return true | ||
| } | ||
| } | ||
|
|
||
| return false | ||
| } | ||
|
|
||
| // Every returns true if all elements of a subset are contained into a collection or if the subset is empty. | ||
| func Every[T comparable](collection, subset []T) bool { | ||
| for _, elem := range subset { | ||
| if !Contains(collection, elem) { | ||
| return false | ||
| } | ||
| } | ||
|
|
||
| return true | ||
| } | ||
|
|
||
| // EveryBy returns true if the predicate returns true for all of the elements in the collection or if the collection is empty. | ||
| func EveryBy[T any](collection []T, predicate func(item T) bool) bool { | ||
| for _, v := range collection { | ||
| if !predicate(v) { | ||
| return false | ||
| } | ||
| } | ||
|
|
||
| return true | ||
| } | ||
|
|
||
| // Some returns true if at least 1 element of a subset is contained into a collection. | ||
| // If the subset is empty Some returns false. | ||
| func Some[T comparable](collection, subset []T) bool { | ||
| for _, elem := range subset { | ||
| if Contains(collection, elem) { | ||
| return true | ||
| } | ||
| } | ||
|
|
||
| return false | ||
| } | ||
|
|
||
| // SomeBy returns true if the predicate returns true for any of the elements in the collection. | ||
| // If the collection is empty SomeBy returns false. | ||
| func SomeBy[T any](collection []T, predicate func(item T) bool) bool { | ||
| for _, v := range collection { | ||
| if predicate(v) { | ||
| return true | ||
| } | ||
| } | ||
|
|
||
| return false | ||
| } | ||
|
|
||
| // None returns true if no element of a subset are contained into a collection or if the subset is empty. | ||
| func None[T comparable](collection, subset []T) bool { | ||
| for _, elem := range subset { | ||
| if Contains(collection, elem) { | ||
| return false | ||
| } | ||
| } | ||
|
|
||
| return true | ||
| } | ||
|
|
||
| // NoneBy returns true if the predicate returns true for none of the elements in the collection or if the collection is empty. | ||
| func NoneBy[T any](collection []T, predicate func(item T) bool) bool { | ||
| for _, v := range collection { | ||
| if predicate(v) { | ||
| return false | ||
| } | ||
| } | ||
|
|
||
| return true | ||
| } | ||
|
|
||
| // Intersect returns the intersection between two collections. | ||
| func Intersect[T comparable](list1, list2 []T) []T { | ||
| result := []T{} | ||
| seen := map[T]struct{}{} | ||
|
|
||
| for _, elem := range list1 { | ||
| seen[elem] = struct{}{} | ||
| } | ||
|
|
||
| for _, elem := range list2 { | ||
| if _, ok := seen[elem]; ok { | ||
| result = append(result, elem) | ||
| } | ||
| } | ||
|
|
||
| return result | ||
| } | ||
|
|
||
| // Difference returns the difference between two collections. | ||
| // The first value is the collection of element absent of list2. | ||
| // The second value is the collection of element absent of list1. | ||
| func Difference[T comparable](list1, list2 []T) (left, right []T) { | ||
| left = []T{} | ||
| right = []T{} | ||
|
|
||
| seenLeft := map[T]struct{}{} | ||
| seenRight := map[T]struct{}{} | ||
|
|
||
| for _, elem := range list1 { | ||
| seenLeft[elem] = struct{}{} | ||
| } | ||
|
|
||
| for _, elem := range list2 { | ||
| seenRight[elem] = struct{}{} | ||
| } | ||
|
|
||
| for _, elem := range list1 { | ||
| if _, ok := seenRight[elem]; !ok { | ||
| left = append(left, elem) | ||
| } | ||
| } | ||
|
|
||
| for _, elem := range list2 { | ||
| if _, ok := seenLeft[elem]; !ok { | ||
| right = append(right, elem) | ||
| } | ||
| } | ||
|
|
||
| return left, right | ||
| } | ||
|
|
||
| // Union returns all distinct elements from given collections. | ||
| // result returns will not change the order of elements relatively. | ||
| func Union[T comparable](lists ...[]T) []T { | ||
| result := []T{} | ||
| seen := map[T]struct{}{} | ||
|
|
||
| for _, list := range lists { | ||
| for _, e := range list { | ||
| if _, ok := seen[e]; !ok { | ||
| seen[e] = struct{}{} | ||
| result = append(result, e) | ||
| } | ||
| } | ||
| } | ||
|
|
||
| return result | ||
| } | ||
|
|
||
| // Without returns slice excluding all given values. | ||
| func Without[T comparable](collection []T, exclude ...T) []T { | ||
| result := make([]T, 0, len(collection)) | ||
| for _, e := range collection { | ||
| if !Contains(exclude, e) { | ||
| result = append(result, e) | ||
| } | ||
| } | ||
| return result | ||
| } | ||
|
|
||
| // WithoutEmpty returns slice excluding empty values. | ||
| func WithoutEmpty[T comparable](collection []T) []T { | ||
| var empty T | ||
|
|
||
| result := make([]T, 0, len(collection)) | ||
| for _, e := range collection { | ||
| if e != empty { | ||
| result = append(result, e) | ||
| } | ||
| } | ||
|
|
||
| return result | ||
| } |