blob: 8b70575aedf26fd51d006c531416897a5cdc7e32 (
plain)
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
|
/* This script is part of radix_info.
Copyright (C) 2023 Adrien Hopkins
This program is free software: you can redistribute it and/or modify
it under the terms of version 3 of the GNU General Public License
as published by the Free Software Foundation.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
package factors
import "sort"
func sortUints(s []uint) []uint {
sort.Slice(s, func(i, j int) bool { return s[i] < s[j] })
return s
}
func maxUints(s []uint) uint {
max := uint(0)
for _, n := range s {
if n > max {
max = n
}
}
return max
}
func contains[S ~[]E, E comparable](s S, e E) bool {
for _, element := range s {
if e == element {
return true
}
}
return false
}
|
