refractor: use internal Intersect function.
This commit is contained in:
parent
3b82cc36ba
commit
b0f6f15a9e
3 changed files with 69 additions and 3 deletions
|
|
@ -82,6 +82,25 @@ func RemoveDuplicate[T comparable](inlist []T) []T {
|
|||
return list
|
||||
}
|
||||
|
||||
// Intersect returns the intersection between two collections.
|
||||
// From https://github.com/samber/lo
|
||||
func Intersect[T comparable](list1 []T, 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
|
||||
}
|
||||
|
||||
// CopyTo recursivelly copy all files from a source path to a destination path.
|
||||
func CopyTo(src *paths.Path, dst *paths.Path) error {
|
||||
files, err := src.ReadDirRecursiveFiltered(nil,
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue