1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
package main
import (
"fmt"
"constraints"
"sync"
)
// 1. 基本泛型函数
func Max[T constraints.Ordered](a, b T) T {
if a > b {
return a
}
return b
}
func Min[T constraints.Ordered](a, b T) T {
if a < b {
return a
}
return b
}
// 2. 多类型参数的泛型函数
func Pair[T, U any](first T, second U) (T, U) {
return first, second
}
// 3. 泛型切片操作
func Map[T, U any](slice []T, fn func(T) U) []U {
result := make([]U, len(slice))
for i, v := range slice {
result[i] = fn(v)
}
return result
}
func Filter[T any](slice []T, predicate func(T) bool) []T {
var result []T
for _, v := range slice {
if predicate(v) {
result = append(result, v)
}
}
return result
}
func Reduce[T, U any](slice []T, initial U, fn func(U, T) U) U {
result := initial
for _, v := range slice {
result = fn(result, v)
}
return result
}
// 4. 泛型查找函数
func Find[T comparable](slice []T, target T) (int, bool) {
for i, v := range slice {
if v == target {
return i, true
}
}
return -1, false
}
func Contains[T comparable](slice []T, target T) bool {
_, found := Find(slice, target)
return found
}
// 5. 泛型排序
func BubbleSort[T constraints.Ordered](slice []T) {
n := len(slice)
for i := 0; i < n-1; i++ {
for j := 0; j < n-i-1; j++ {
if slice[j] > slice[j+1] {
slice[j], slice[j+1] = slice[j+1], slice[j]
}
}
}
}
func main() {
// 1. 基本泛型函数使用
fmt.Println("=== 基本泛型函数 ===")
// 整数比较
fmt.Printf("Max(10, 20) = %d\n", Max(10, 20))
fmt.Printf("Min(10, 20) = %d\n", Min(10, 20))
// 浮点数比较
fmt.Printf("Max(3.14, 2.71) = %.2f\n", Max(3.14, 2.71))
fmt.Printf("Min(3.14, 2.71) = %.2f\n", Min(3.14, 2.71))
// 字符串比较
fmt.Printf("Max(\"apple\", \"banana\") = %s\n", Max("apple", "banana"))
fmt.Printf("Min(\"apple\", \"banana\") = %s\n", Min("apple", "banana"))
// 2. 多类型参数
fmt.Println("\n=== 多类型参数 ===")
intStr := Pair(42, "hello")
fmt.Printf("Pair(42, \"hello\") = %v\n", intStr)
floatBool := Pair(3.14, true)
fmt.Printf("Pair(3.14, true) = %v\n", floatBool)
// 3. 泛型切片操作
fmt.Println("\n=== 泛型切片操作 ===")
numbers := []int{1, 2, 3, 4, 5}
// Map操作：平方
squares := Map(numbers, func(x int) int {
return x * x
})
fmt.Printf("平方: %v -> %v\n", numbers, squares)
// Map操作：转换为字符串
strings := Map(numbers, func(x int) string {
return fmt.Sprintf("num_%d", x)
})
fmt.Printf("转字符串: %v -> %v\n", numbers, strings)
// Filter操作：过滤偶数
evens := Filter(numbers, func(x int) bool {
return x%2 == 0
})
fmt.Printf("偶数: %v -> %v\n", numbers, evens)
// Reduce操作：求和
sum := Reduce(numbers, 0, func(acc, x int) int {
return acc + x
})
fmt.Printf("求和: %v -> %d\n", numbers, sum)
// Reduce操作：求积
product := Reduce(numbers, 1, func(acc, x int) int {
return acc * x
})
fmt.Printf("求积: %v -> %d\n", numbers, product)
// 4. 查找操作
fmt.Println("\n=== 查找操作 ===")
fruits := []string{"apple", "banana", "cherry", "date"}
if index, found := Find(fruits, "cherry"); found {
fmt.Printf("找到 'cherry' 在索引 %d\n", index)
} else {
fmt.Println("未找到 'cherry'")
}
fmt.Printf("包含 'banana': %t\n", Contains(fruits, "banana"))
fmt.Printf("包含 'grape': %t\n", Contains(fruits, "grape"))
// 5. 泛型排序
fmt.Println("\n=== 泛型排序 ===")
intSlice := []int{64, 34, 25, 12, 22, 11, 90}
fmt.Printf("排序前: %v\n", intSlice)
BubbleSort(intSlice)
fmt.Printf("排序后: %v\n", intSlice)
floatSlice := []float64{3.14, 2.71, 1.41, 1.73}
fmt.Printf("排序前: %v\n", floatSlice)
BubbleSort(floatSlice)
fmt.Printf("排序后: %v\n", floatSlice)
stringSlice := []string{"zebra", "apple", "banana", "cherry"}
fmt.Printf("排序前: %v\n", stringSlice)
BubbleSort(stringSlice)
fmt.Printf("排序后: %v\n", stringSlice)
}
|