forked from pkg/errors
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathaggregate.go
More file actions
188 lines (147 loc) · 2.88 KB
/
aggregate.go
File metadata and controls
188 lines (147 loc) · 2.88 KB
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
package errors
import (
"bytes"
"fmt"
"strconv"
)
type MessageCountMap map[string]int
type Aggregate interface {
error
Errors() []error
Is(error) bool
}
func NewAggregate(errs []error) Aggregate {
if errs == nil {
return nil
}
e := make([]error, 0)
for _, err := range errs {
if err != nil {
e = append(e, err)
}
}
if len(e) == 0 {
return nil
}
return aggregate(e)
}
type aggregate []error
func (agg aggregate) Error() string {
s := NewString()
agg.visit(func(e error) bool {
message := e.Error()
s.Insert(message)
return false
})
b := bytes.NewBuffer(nil)
ss := make([]string, 0)
for key := range s {
ss = append(ss, key)
}
for i, v := range ss {
if i == len(ss)-1 {
b.WriteString("[" + strconv.Itoa(i+1) + "]" + v)
} else {
b.WriteString("[" + strconv.Itoa(i+1) + "]" + v + "; ")
}
}
return b.String()
}
func (agg aggregate) Errors() []error {
return []error(agg)
}
func (agg aggregate) Is(target error) bool {
return agg.visit(func(e error) bool {
return Is(e, target)
})
}
func (agg aggregate) visit(f func(error) bool) bool {
for _, err := range agg {
switch err := err.(type) {
case aggregate:
if err.visit(f) {
return true
}
case Aggregate:
for _, e := range err.Errors() {
if f(e) {
return true
}
}
default:
if f(err) {
return true
}
}
}
return false
}
type Matcher func(error) bool
func FilterOut(err error, matchers ...Matcher) error {
if err == nil {
return nil
}
if err, ok := err.(Aggregate); ok {
return NewAggregate(filter(err, matchers...))
}
for _, matcher := range matchers {
if matcher(err) {
return nil
}
}
return err
}
func filter(agg Aggregate, matchers ...Matcher) []error {
errs := make([]error, 0, len(agg.Errors()))
for _, err := range agg.Errors() {
if err = FilterOut(err, matchers...); err != nil {
errs = append(errs, err)
}
}
return errs
}
func Flatten(agg Aggregate) Aggregate {
new := make([]error, 0, len(agg.Errors()))
for _, err := range agg.Errors() {
if e, ok := err.(Aggregate); ok {
new = append(new, Flatten(e).Errors()...)
} else {
new = append(new, err)
}
}
return NewAggregate(new)
}
func MessageCountMapToAggregate(theMap MessageCountMap) Aggregate {
errs := make([]error, 0, len(theMap))
for key, value := range theMap {
if value >= 1 {
errs = append(errs, fmt.Errorf(key))
}
}
return NewAggregate(errs)
}
func Reduce(err error) error {
if agg, ok := err.(Aggregate); ok {
errs := agg.Errors()
switch len(errs) {
case 0:
return nil
case 1:
return errs[0]
}
}
return err
}
func AggregateGoRoutines(fns ...func() error) Aggregate {
errs := make([]error, 0, len(fns))
errsChan := make(chan error, len(fns))
for _, fn := range fns {
go func(f func() error) {
errsChan <- f()
}(fn)
}
for err := range errsChan {
errs = append(errs, err)
}
return NewAggregate(errs)
}