-
Notifications
You must be signed in to change notification settings - Fork 1
/
string.go
101 lines (90 loc) · 2.03 KB
/
string.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
// This file was automatically generated by genny.
// Any changes will be lost if this file is regenerated.
// see https://github.com/cheekybits/genny
package xslice
// ContainString check if target is in ss
func ContainString(s []string, target string) bool {
for _, val := range s {
if val == target {
return true
}
}
return false
}
// RemoveString remove empty target elements from ss
func RemoveString(s []string, target string) []string {
var offset int
for index, val := range s {
if val == target {
s[offset], s[index] = s[index], s[offset]
offset++
}
}
return s[offset:]
}
// ReverseString reverse the input slice
func ReverseString(s []string) []string {
if len(s) < 2 {
return s
}
start := 0
end := len(s) - 1
for start < end {
tmp := s[start]
s[start] = s[end]
s[end] = tmp
start++
end--
}
return s
}
// DiffString computes the difference of two slices
// return a slice containing all the entries from s1 but not in s2
func DiffString(s1 []string, s2 []string) []string {
ret := make([]string, 0)
for _, val := range s1 {
if !ContainString(s2, val) {
ret = append(ret, val)
}
}
return ret
}
// IntersectString computes the intersection of two slices
// return a slice containing the entries exist in s1 and s2
func IntersectString(s1 []string, s2 []string) []string {
ret := make([]string, 0)
for _, val := range s1 {
if ContainString(s2, val) {
ret = append(ret, val)
}
}
return ret
}
// UniqueString Removes duplicate values from slice
func UniqueString(s1 []string) []string {
unique := make(map[string]interface{})
for _, val := range s1 {
unique[val] = nil
}
ret := make([]string, 0, len(unique))
for key := range unique {
ret = append(ret, key)
}
return ret
}
// MergeString merge one or more arrays
func MergeString(s1 []string, s2 ...[]string) []string {
if len(s2) == 0 {
return s1
}
size := len(s1)
for _, s := range s2 {
size += len(s)
}
ret := make([]string, 0, size)
ret = append(ret, s1...)
for _, s := range s2 {
ret = append(ret, s...)
}
return ret
}