Created
December 15, 2021 17:00
-
-
Save quii/92b8ee3da3d5623eebf0d8341ca5ad89 to your computer and use it in GitHub Desktop.
learning afternoon code
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
package main | |
import "fmt" | |
func main() { | |
someNumbers := []int64{1, 2, 3} | |
someNames := []string{"John", "Chris", "Mary"} | |
fmt.Println(Reduce(someNumbers, 0, func(a, b int64) int64 { | |
return a + b | |
})) | |
fmt.Println(Reduce(someNames, "", func(a, b string) string { | |
return a + " " + b | |
})) | |
fmt.Println("lets find names beginning with J", Find(someNames, func(name string) bool { | |
return name[0] == 'J' | |
})) | |
//demo, show map (shout names) | |
fmt.Println("lets shout names", Map(someNames, func(name string) string { | |
return name + "!" | |
})) | |
} | |
func Map[T any](items []T, f func(T) T) []T { | |
result := make([]T, len(items)) | |
for i, v := range items { | |
result[i] = f(v) | |
} | |
return result | |
} | |
func Reduce[T any](numbers []T, initialValue T, fn func(T, T) T) T { | |
var result T | |
result = initialValue | |
for _, number := range numbers { | |
result = fn(result, number) | |
} | |
return result | |
} | |
func Find[T any](haystack []T, predicate func(T) bool) []T { | |
var result []T | |
for _, x := range haystack { | |
if predicate(x) { | |
result = append(result, x) | |
} | |
} | |
return result | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment