-
Notifications
You must be signed in to change notification settings - Fork 273
/
max.go
178 lines (168 loc) · 3.51 KB
/
max.go
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
175
176
177
178
package funk
import "strings"
// MaxInt validates the input, compares the elements and returns the maximum element in an array/slice.
// It accepts []int
// It returns int
func MaxInt(i []int) int {
if len(i) == 0 {
panic("arg is an empty array/slice")
}
var max int
for idx := 0; idx < len(i); idx++ {
item := i[idx]
if idx == 0 {
max = item
continue
}
if item > max {
max = item
}
}
return max
}
// MaxInt8 validates the input, compares the elements and returns the maximum element in an array/slice.
// It accepts []int8
// It returns int8
func MaxInt8(i []int8) int8 {
if len(i) == 0 {
panic("arg is an empty array/slice")
}
var max int8
for idx := 0; idx < len(i); idx++ {
item := i[idx]
if idx == 0 {
max = item
continue
}
if item > max {
max = item
}
}
return max
}
// MaxInt16 validates the input, compares the elements and returns the maximum element in an array/slice.
// It accepts []int16
// It returns int16
func MaxInt16(i []int16) int16 {
if len(i) == 0 {
panic("arg is an empty array/slice")
}
var max int16
for idx := 0; idx < len(i); idx++ {
item := i[idx]
if idx == 0 {
max = item
continue
}
if item > max {
max = item
}
}
return max
}
// MaxInt32 validates the input, compares the elements and returns the maximum element in an array/slice.
// It accepts []int32
// It returns int32
func MaxInt32(i []int32) int32 {
if len(i) == 0 {
panic("arg is an empty array/slice")
}
var max int32
for idx := 0; idx < len(i); idx++ {
item := i[idx]
if idx == 0 {
max = item
continue
}
if item > max {
max = item
}
}
return max
}
// MaxInt64 validates the input, compares the elements and returns the maximum element in an array/slice.
// It accepts []int64
// It returns int64
func MaxInt64(i []int64) int64 {
if len(i) == 0 {
panic("arg is an empty array/slice")
}
var max int64
for idx := 0; idx < len(i); idx++ {
item := i[idx]
if idx == 0 {
max = item
continue
}
if item > max {
max = item
}
}
return max
}
// MaxFloat32 validates the input, compares the elements and returns the maximum element in an array/slice.
// It accepts []float32
// It returns float32
func MaxFloat32(i []float32) float32 {
if len(i) == 0 {
panic("arg is an empty array/slice")
}
var max float32
for idx := 0; idx < len(i); idx++ {
item := i[idx]
if idx == 0 {
max = item
continue
}
if item > max {
max = item
}
}
return max
}
// MaxFloat64 validates the input, compares the elements and returns the maximum element in an array/slice.
// It accepts []float64
// It returns float64
func MaxFloat64(i []float64) float64 {
if len(i) == 0 {
panic("arg is an empty array/slice")
}
var max float64
for idx := 0; idx < len(i); idx++ {
item := i[idx]
if idx == 0 {
max = item
continue
}
if item > max {
max = item
}
}
return max
}
// MaxString validates the input, compares the elements and returns the maximum element in an array/slice.
// It accepts []string
// It returns string
func MaxString(i []string) string {
if len(i) == 0 {
panic("arg is an empty array/slice")
}
var max string
for idx := 0; idx < len(i); idx++ {
item := i[idx]
if idx == 0 {
max = item
continue
}
max = compareStringsMax(max, item)
}
return max
}
// compareStrings uses the strings.Compare method to compare two strings, and returns the greater one.
func compareStringsMax(max, current string) string {
r := strings.Compare(strings.ToLower(max), strings.ToLower(current))
if r > 0 {
return max
}
return current
}