-
-
Notifications
You must be signed in to change notification settings - Fork 16
/
util.go
63 lines (54 loc) · 1.61 KB
/
util.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
/*
Copyright 2023 Avi Zimmerman <avi.zimmerman@gmail.com>
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
// Package common contains common utility functions.
package common
import (
"fmt"
"math"
)
// Pointer returns a pointer to the given value.
func Pointer[T any](t T) *T {
return &t
}
// UpsertSlice with insert the given item into a slice if it does not exist,
// otherwise it will update the existing item and return the updated slice.
func UpsertSlice[T comparable](sl []T, item T) []T {
for i, v := range sl {
if v == item {
sl[i] = item
return sl
}
}
return append(sl, item)
}
// PrettyByteSize returns a human-readable string of the given byte size.
func PrettyByteSize(bf float64) string {
for _, unit := range []string{"", "Ki", "Mi", "Gi", "Ti", "Pi", "Ei", "Zi"} {
if math.Abs(bf) < 1024.0 {
return fmt.Sprintf("%3.1f%sB", bf, unit)
}
bf /= 1024.0
}
return fmt.Sprintf("%.1fYiB", bf)
}
// AllUnique returns true if all elements in the given slice are unique.
func AllUnique[T comparable](sl []T) bool {
seen := make(map[T]bool)
for _, v := range sl {
if seen[v] {
return false
}
seen[v] = true
}
return true
}