-
Notifications
You must be signed in to change notification settings - Fork 1
/
slice_error.go
228 lines (192 loc) · 4.84 KB
/
slice_error.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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
// Code generated by go generate; DO NOT EDIT.
// This file was generated by robots at 2020-04-08 01:37:41.233332 +0000 UTC.
package golist
import (
"fmt"
"math/rand"
"time"
)
// SliceError is a slice of type error.
type SliceError struct {
data []error
}
// NewSliceError returns a pointer to a new SliceError initialized with the specified elements.
func NewSliceError(elems ...error) *SliceError {
s := new(SliceError)
s.data = make([]error, len(elems))
for i := 0; i < len(elems); i++ {
s.data[i] = elems[i]
}
return s
}
// Append adds the elements to the end of SliceError.
func (s *SliceError) Append(elems ...error) *SliceError {
if s == nil {
return nil
}
s.data = append(s.data, elems...)
return s
}
// Prepend adds the elements to the beginning of SliceError.
func (s *SliceError) Prepend(elems ...error) *SliceError {
if s == nil {
return nil
}
s.data = append(elems, s.data...)
return s
}
// At returns the element in SliceError at the specified index.
func (s *SliceError) At(index int) error {
if s.data == nil || len(s.data) == 0 {
panic("SliceError does not contain any elements")
}
if index >= len(s.data) || index < 0 {
panic(fmt.Sprintf("index %d outside the range of SliceError", index))
}
return s.data[index]
}
// Set sets the element of SliceError at the specified index.
func (s *SliceError) Set(index int, elem error) *SliceError {
if s == nil {
return nil
}
s.data[index] = elem
return s
}
// Insert inserts the elements into SliceError at the specified index.
func (s *SliceError) Insert(index int, elems ...error) *SliceError {
if s == nil {
return nil
}
// Grow the slice by the number of elements (using the zero value)
var zero error
for i := 0; i < len(elems); i++ {
s.data = append(s.data, zero)
}
// Use copy to move the upper part of the slice out of the way and open a hole.
copy(s.data[index+len(elems):], s.data[index:])
// Store the new values
for i := 0; i < len(elems); i++ {
s.data[index+i] = elems[i]
}
// Return the result.
return s
}
// Remove removes the element from SliceError at the specified index.
func (s *SliceError) Remove(index int) *SliceError {
if s == nil {
return nil
}
s.data = append(s.data[:index], s.data[index+1:]...)
return s
}
// Filter removes elements from SliceError that do not satisfy the filter function.
func (s *SliceError) Filter(fn func(elem error) bool) *SliceError {
if s == nil {
return nil
}
data := s.data[:0]
for _, elem := range s.data {
if fn(elem) {
data = append(data, elem)
}
}
s.data = data
return s
}
// Transform modifies each element of SliceError according to the specified function.
func (s *SliceError) Transform(fn func(elem error) error) *SliceError {
if s == nil {
return nil
}
for i, elem := range s.data {
s.data[i] = fn(elem)
}
return s
}
// Unique modifies SliceError to keep only the first occurrence of each element (removing any duplicates).
func (s *SliceError) Unique() *SliceError {
if s == nil {
return nil
}
seen := make(map[error]struct{})
data := s.data[:0]
for _, elem := range s.data {
if _, ok := seen[elem]; !ok {
data = append(data, elem)
seen[elem] = struct{}{}
}
}
s.data = data
return s
}
// Reverse reverses the order of the elements of SliceError.
func (s *SliceError) Reverse() *SliceError {
if s == nil {
return nil
}
for i := len(s.data)/2 - 1; i >= 0; i-- {
opp := len(s.data) - 1 - i
s.Swap(i, opp)
}
return s
}
// Shuffle randomly shuffles the order of the elements in SliceError.
func (s *SliceError) Shuffle(seed int64) *SliceError {
if s == nil {
return nil
}
if seed == 0 {
seed = time.Now().UnixNano()
}
r := rand.New(rand.NewSource(seed))
r.Shuffle(s.Count(), s.Swap)
return s
}
// Data returns the raw elements of SliceError.
func (s *SliceError) Data() []error {
if s == nil {
return nil
}
return s.data
}
// Count returns the number of elements in SliceError.
func (s *SliceError) Count() int {
return len(s.data)
}
// Len returns the number of elements in SliceError (alias for Count).
func (s *SliceError) Len() int {
return s.Count()
}
// Swap swaps the elements in SliceError specified by the indices i and j.
func (s *SliceError) Swap(i, j int) {
s.data[i], s.data[j] = s.data[j], s.data[i]
}
// Clone performs a deep copy of SliceError and returns it
func (s *SliceError) Clone() *SliceError {
if s == nil {
return nil
}
s2 := new(SliceError)
s2.data = make([]error, len(s.data))
copy(s2.data, s.data)
return s2
}
// Equal returns true if the SliceError is logically equivalent to the specified SliceError.
func (s *SliceError) Equal(s2 *SliceError) bool {
if s == s2 {
return true
}
if s == nil || s2 == nil {
return false // has to be false because s == s2 tested earlier
}
if len(s.data) != len(s2.data) {
return false
}
for i, elem := range s.data {
if elem != s2.data[i] {
return false
}
}
return true
}