forked from expressoman/ewa
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathselector_corrections_sort.go
173 lines (139 loc) · 3.42 KB
/
selector_corrections_sort.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
package ewa
import "sort"
type byCorrection func(m1, m2 Correction) bool
type correctionSorter struct {
waves Corrections
sortFn byCorrection
}
func (ws *correctionSorter) Len() int {
return len(ws.waves)
}
func (ws *correctionSorter) Swap(i, j int) {
ws.waves[i], ws.waves[j] = ws.waves[j], ws.waves[i]
}
func (ws *correctionSorter) Less(i, j int) bool {
return ws.sortFn(ws.waves[i], ws.waves[j])
}
func newCorrectionSorter(selector SelectorCorrections, fn byCorrection) *correctionSorter {
return &correctionSorter{
waves: selector.Corr,
sortFn: fn,
}
}
//ByDegree sorting of impulses
func (in SelectorCorrections) ByDegree(asc bool) SelectorCorrections {
sorter := newCorrectionSorter(in, func(i, j Correction) bool {
if asc {
return i.Degree() < j.Degree()
}
return i.Degree() > j.Degree()
})
sort.Sort(sorter)
return in
}
//ByDuration sorting of impulses
func (in SelectorCorrections) ByDuration(asc bool) SelectorCorrections {
sorter := newCorrectionSorter(in, func(i, j Correction) bool {
if asc {
return i.Duration() < j.Duration()
}
return i.Duration() > j.Duration()
})
sort.Sort(sorter)
return in
}
//ByLen sorting of impulses
func (in SelectorCorrections) ByLen(asc bool) SelectorCorrections {
sorter := newCorrectionSorter(in, func(i, j Correction) bool {
if asc {
return i.Len() < j.Len()
}
return i.Len() > j.Len()
})
sort.Sort(sorter)
return in
}
//ByRetrace sorting of impulses
func (in SelectorCorrections) ByRetrace(val float64, asc bool) SelectorCorrections {
sorter := newCorrectionSorter(in, func(i, j Correction) bool {
if asc {
if i.Up() {
return i.Retrace(val) < j.Retrace(val)
}
return i.Retrace(val) > j.Retrace(val)
}
if i.Up() {
return i.Retrace(val) > j.Retrace(val)
}
return i.Retrace(val) < j.Retrace(val)
})
sort.Sort(sorter)
return in
}
//ByBegins sorting of impulses
func (in SelectorCorrections) ByBegins(asc bool) SelectorCorrections {
sorter := newCorrectionSorter(in, func(i, j Correction) bool {
if asc {
return j.Begins().After(i.Begins())
}
return i.Begins().After(j.Begins())
})
sort.Sort(sorter)
return in
}
//ByEnds sorting of impulses
func (in SelectorCorrections) ByEnds(asc bool) SelectorCorrections {
sorter := newCorrectionSorter(in, func(i, j Correction) bool {
if asc {
return j.Ends().After(i.Ends())
}
return i.Ends().After(j.Ends())
})
sort.Sort(sorter)
return in
}
//ByStarts sorting of impulses
func (in SelectorCorrections) ByStarts(asc bool) SelectorCorrections {
sorter := newCorrectionSorter(in, func(i, j Correction) bool {
if asc {
if i.Up() {
return i.Starts() < j.Starts()
}
return i.Starts() > j.Starts()
}
if i.Up() {
return i.Starts() > j.Starts()
}
return i.Starts() < j.Starts()
})
sort.Sort(sorter)
return in
}
//ByTops sorting of impulses
func (in SelectorCorrections) ByTops(asc bool) SelectorCorrections {
sorter := newCorrectionSorter(in, func(i, j Correction) bool {
if asc {
if i.Up() {
return i.Tops() < j.Tops()
}
return i.Tops() < j.Tops()
}
if i.Up() {
return i.Tops() > j.Tops()
}
return i.Tops() > j.Tops()
})
sort.Sort(sorter)
return in
}
//BySlope sorting of impulses
func (in SelectorCorrections) BySlope(asc bool) SelectorCorrections {
sorter := newCorrectionSorter(in, func(i, j Correction) bool {
if asc {
return i.Slope() < j.Slope()
}
return i.Slope() > j.Slope()
})
sort.Sort(sorter)
return in
}