// utils/utils.go package utils // Map 映射函数 func Map[T, U any](s []T, f func(T) U) []U { result := make([]U, len(s)) for i, v := range s { result[i] = f(v) } return result } // Filter 过滤函数 func Filter[T any](s []T, f func(T) bool) []T { var result []T for _, v := range s { if f(v) { result = append(result, v) } } return result } // Reduce 归约函数 func Reduce[T, U any](s []T, initial U, f func(U, T) U) U { result := initial for _, v := range s { result = f(result, v) } return result } // Stack 泛型栈 type Stack[T any] struct { elements []T } func NewStack[T any]() *Stack[T] { return &Stack[T]{} } func (s *Stack[T]) Push(v T) { s.elements = append(s.elements, v) } func (s *Stack[T]) Pop() (T, bool) { if len(s.elements) == 0 { var zero T return zero, false } v := s.elements[len(s.elements)-1] s.elements = s.elements[:len(s.elements)-1] return v, true } func (s *Stack[T]) Len() int { return len(s.elements) }
// main.go package main import ( "fmt""github.com/yourusername/generic-utils/utils" ) func main() { // 测试Map函数 ints := []int{1, 2, 3, 4, 5} squared := utils.Map(ints, func(x int) int { return x * x }) fmt.Println("Map:", squared) // 输出: [1491625] // 测试Filter函数 even := utils.Filter(ints, func(x int) bool { return x%2 == 0 }) fmt.Println("Filter:", even) // 输出: [24] // 测试Reduce函数 sum := utils.Reduce(ints, 0, func(a, b int) int { return a + b }) fmt.Println("Reduce:", sum) // 输出: 15 // 测试Stack stack := utils.NewStack[int]() stack.Push(1) stack.Push(2) stack.Push(3) fmt.Println("Stack len:", stack.Len()) // 输出: 3if v, ok := stack.Pop(); ok { fmt.Println("Pop:", v) // 输出: 3 } fmt.Println("Stack len:", stack.Len()) // 输出: 2 }