-
Notifications
You must be signed in to change notification settings - Fork 0
/
strings.go
130 lines (105 loc) · 2.16 KB
/
strings.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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
// Package stringx
// Date: 2023/4/10 14:49
// Author: Amu
// Description:
package stringx
import "github.com/pkg/errors"
var (
ErrInvalidStartPosition = errors.New("start position is invalid")
ErrInvalidStopPosition = errors.New("stop position is invalid")
)
func Contains(list []string, str string) bool {
for _, each := range list {
if each == str {
return true
}
}
return false
}
func Filter(s string, filter func(r rune) bool) string {
var n int
chars := []rune(s)
for i, x := range chars {
if n < i {
chars[n] = x
}
if !filter(x) {
n++
}
}
return string(chars[:n])
}
func HasEmpty(args ...string) bool {
for _, arg := range args {
if len(arg) == 0 {
return true
}
}
return false
}
func NotEmpty(args ...string) bool {
return !HasEmpty(args...)
}
func Remove(strings []string, strs ...string) []string {
out := append([]string(nil), strings...)
for _, str := range strs {
var n int
for _, v := range out {
if v != str {
out[n] = v
n++
}
}
out = out[:n]
}
return out
}
func Reverse(s string) string {
runes := []rune(s)
for from, to := 0, len(runes)-1; from < to; from, to = from+1, to-1 {
runes[from], runes[to] = runes[to], runes[from]
}
return string(runes)
}
// Substr returns runes between start and stop [start, stop) regardless of the chars are ascii or utf8
func Substr(str string, start int, stop int) (string, error) {
rs := []rune(str)
length := len(rs)
if start < 0 || start > length {
return "", ErrInvalidStartPosition
}
if stop < 0 || stop > length {
return "", ErrInvalidStopPosition
}
return string(rs[start:stop]), nil
}
func TakeOne(valid, or string) string {
if len(valid) > 0 {
return valid
} else {
return or
}
}
func TakeWithPriority(fns ...func() string) string {
for _, fn := range fns {
val := fn()
if len(val) > 0 {
return val
}
}
return ""
}
func Union(first, second []string) []string {
set := make(map[string]struct{})
for _, each := range first {
set[each] = struct{}{}
}
for _, each := range second {
set[each] = struct{}{}
}
merged := make([]string, 0, len(set))
for k := range set {
merged = append(merged, k)
}
return merged
}