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
|
package util
import (
"fmt"
"reflect"
)
// generic function that returns true if elt is in slice.
// panics if slice is not of Kind reflect.Slice
func SliceContains(slice, elt interface{}) bool {
if slice == nil {
return false
}
v := reflect.ValueOf(slice)
if v.Kind() != reflect.Slice {
panic(fmt.Sprintf("Cannot call SliceContains on a non-slice %#v of "+
"kind %#v", slice, v.Kind().String()))
}
for i := 0; i < v.Len(); i++ {
if reflect.DeepEqual(v.Index(i).Interface(), elt) {
return true
}
}
return false
}
// StringSliceContains reports whether str is in the slice.
func StringSliceContains(slice []string, str string) bool {
return StringSliceIndex(slice, str) != -1
}
// StringSliceContains returns the first index at which the given element
// can be found in the slice, or -1 if it is not present.
func StringSliceIndex(slice []string, str string) int {
i := -1
for j, v := range slice {
if v == str {
i = j
break
}
}
return i
}
// generic function that returns number of instances of 'elt' in 'slice'.
// panics if slice is not of Kind reflect.Slice
func SliceCount(slice, elt interface{}) int {
v := reflect.ValueOf(slice)
if v.Kind() != reflect.Slice {
panic(fmt.Sprintf("Cannot call SliceCount on a non-slice %#v of kind "+
"%#v", slice, v.Kind().String()))
}
counter := 0
for i := 0; i < v.Len(); i++ {
if reflect.DeepEqual(v.Index(i).Interface(), elt) {
counter++
}
}
return counter
}
|
