-
Notifications
You must be signed in to change notification settings - Fork 0
/
slice.go
140 lines (113 loc) · 2.26 KB
/
slice.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
package containers
import (
"golang.org/x/exp/slices"
)
type Slice[T any] struct {
d []T
}
func NewSlice[T any](v ...T) *Slice[T] {
return &Slice[T]{d: v}
}
func (p *Slice[T]) Reset() {
p.d = []T{}
}
func (p *Slice[T]) Append(v T) *Slice[T] {
p.d = append(p.d, v)
return p
}
func (p *Slice[T]) Prepend(v T) *Slice[T] {
p.InsertAt(0, v)
return p
}
func (p *Slice[T]) InsertAt(idx int, v T) *Slice[T] {
p.d, p.d[0] = append(p.d[:idx+1], p.d[idx:]...), v
return p
}
func (p *Slice[T]) Remove(idx int) *Slice[T] {
p.d = p.d[:idx+copy(p.d[idx:], p.d[idx+1:])]
return p
}
func (p *Slice[T]) Clone() *Slice[T] {
pp := &Slice[T]{d: make([]T, len(p.d))}
copy(pp.d, p.d)
return pp
}
func (p *Slice[T]) Sort(fn func(x, y T) int) *Slice[T] {
slices.SortStableFunc(p.d, fn)
return p
}
func (p *Slice[T]) Exists(fn func(val T) bool) bool {
for _, item := range p.d {
if fn(item) {
return true
}
}
return false
}
func (p *Slice[T]) First() T {
if len(p.d) == 0 {
var t T
return t
}
return p.d[0]
}
func (p *Slice[T]) Last() T {
nCount := len(p.d)
if nCount == 0 {
var t T
return t
}
return p.d[nCount-1]
}
func (p *Slice[T]) GetAt(idx int) T {
nCount := len(p.d)
if nCount == 0 || idx >= nCount {
var t T
return t
}
return p.d[idx]
}
func (p *Slice[T]) Values() []T {
return p.d
}
func (p *Slice[T]) Len() int {
return len(p.d)
}
func (p *Slice[T]) Enumerate(fn func(item T) error) error {
for _, item := range p.d {
if err := fn(item); err != nil {
return err
}
}
return nil
}
// Take takes the first n items of []Elem
func (p *Slice[T]) Take(nCount int) *Slice[T] {
nCount = Min(nCount, len(p.d))
return &Slice[T]{d: p.d[:nCount]}
}
// Map turns a []Elem1 to a []Elem2 using a mapping function.
func (p *Slice[T]) Map(fn func(T) T) *Slice[T] {
data := make([]T, len(p.d))
for i, v := range p.d {
data[i] = fn(v)
}
return &Slice[T]{d: data}
}
// Reduce reduces a []T to a single value of type T using a reduction function.
func (p *Slice[T]) Reduce(initializer T, f func(T, T) T) T {
r := initializer
for _, v := range p.d {
r = f(r, v)
}
return r
}
func (p *Slice[T]) Select(fn func(T) bool) *Slice[T] {
var data []T
for _, item := range p.d {
if fn(item) {
data = append(data, item)
}
}
return &Slice[T]{d: data}
}