-
Notifications
You must be signed in to change notification settings - Fork 263
/
slices.go
69 lines (59 loc) · 1.64 KB
/
slices.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
/*
* Copyright 2022 The Dragonfly Authors
*
* 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 slices
// Contains returns true if an element is present in a collection.
func Contains[T comparable](s []T, e T) bool {
for _, v := range s {
if v == e {
return true
}
}
return false
}
// FindDuplicate returns duplicate element in a collection.
func FindDuplicate[T comparable](s []T) (T, bool) {
visited := make(map[T]struct{})
for _, v := range s {
if _, ok := visited[v]; ok {
return v, true
}
visited[v] = struct{}{}
}
var zero T
return zero, false
}
// RemoveDuplicates removes duplicate element in a collection.
func RemoveDuplicates[T comparable](s []T) []T {
var result []T
visited := make(map[T]bool, len(s))
for _, v := range s {
if !visited[v] {
visited[v] = true
result = append(result, v)
}
}
return result
}
// Remove removes an element from a collection.
func Remove[T comparable](s []T, i int) []T {
return append(s[:i], s[i+1:]...)
}
// Reverse reverses elements in a collection.
func Reverse[S ~[]T, T any](s S) {
for i, j := 0, len(s)-1; i < j; i, j = i+1, j-1 {
s[i], s[j] = s[j], s[i]
}
}