-
Notifications
You must be signed in to change notification settings - Fork 0
/
collection.go
185 lines (159 loc) · 3.04 KB
/
collection.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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
package collection
import (
"fmt"
"strings"
)
type Collection[T comparable] struct {
arr []T
}
func Collect[T comparable](t []T) *Collection[T] {
return &Collection[T]{
arr: t,
}
}
func (c *Collection[T]) Map(f func(T, int64) T) *Collection[T] {
var tmp []T
for k, v := range c.arr {
tmp = append(tmp, f(v, int64(k)))
}
c.arr = tmp
return c
}
func (c *Collection[T]) Filter(f func(T, int64) bool) *Collection[T] {
var tmp []T
for k, v := range c.arr {
if f(v, int64(k)) {
tmp = append(tmp, v)
}
}
c.arr = tmp
return c
}
func (c *Collection[T]) Shift() *Collection[T] {
c.arr = c.arr[1:]
return c
}
func (c *Collection[T]) Pop() *Collection[T] {
c.arr = c.arr[:len(c.arr)-1]
return c
}
func (c *Collection[T]) Reverse() *Collection[T] {
var result []T
for i := len(c.arr) - 1; i >= 0; i-- {
result = append(result, c.arr[i])
}
c.arr = result
return c
}
func (c *Collection[T]) Join(sep string) string {
sb := strings.Builder{}
for k, v := range c.arr {
sb.WriteString(fmt.Sprintf("%v", v))
if len(c.arr) > k+1 {
sb.WriteString(sep)
}
}
return sb.String()
}
func (c *Collection[T]) Remove(index int64) *Collection[T] {
c.arr = append(c.arr[:index], c.arr[index+1:]...)
return c
}
func (c *Collection[T]) ToList() []T {
return c.arr
}
func (c *Collection[T]) First() T {
return c.arr[0]
}
func (c *Collection[T]) Last() T {
return c.arr[len(c.arr)-1]
}
func (c *Collection[T]) Get(index int64) T {
return c.arr[index]
}
func (c *Collection[T]) Contains(value T) bool {
for _, v := range c.arr {
if value == v {
return true
}
}
return false
}
func Map[T interface{}](t []T, f func(T, int) T) []T {
var tp []T
for k, v := range t {
tp = append(tp, f(v, k))
}
return tp
}
func Filter[T interface{}](t []T, f func(T, int) bool) []T {
var o []T
for k, v := range t {
if f(v, k) {
o = append(o, v)
}
}
return o
}
func Concat[T interface{}](t1 []T, t2 []T) []T {
return append(t1[:], t2[:]...)
}
func Shift[T interface{}](arr []T) []T {
if len(arr) > 0 {
return arr[1:]
}
return arr
}
func Remove[T interface{}](arr []T, index int) []T {
if index < len(arr) {
arr = append(arr[:index], arr[index+1:]...)
}
return arr
}
func Pop[T interface{}](arr []T) []T {
if len(arr) > 0 {
return arr[:len(arr)-1]
}
return arr
}
func Set[T any](arr []T) []T {
var sets []T
for _, v := range arr {
exist := false
for _, v2 := range sets {
if fmt.Sprintf("%v", v) == fmt.Sprintf("%v", v2) {
exist = true
break
}
}
if !exist {
sets = append(sets, v)
}
}
return sets
}
func Join[T interface{}](tab []T, sep string) string {
sb := strings.Builder{}
for k, v := range tab {
sb.WriteString(fmt.Sprintf("%v", v))
if len(tab) > k+1 {
sb.WriteString(sep)
}
}
return sb.String()
}
func Reverse[T interface{}](arr []T) []T {
var result []T
for i := len(arr) - 1; i >= 0; i-- {
result = append(result, arr[i])
}
return result
}
func Of[T comparable](t ...T) *Collection[T] {
return &Collection[T]{
arr: t,
}
}
func ListOf[T comparable](items ...T) []T {
return items
}