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
|
/*
* This file is part of Go Responsiveness.
*
* Go Responsiveness is free software: you can redistribute it and/or modify it under
* the terms of the GNU General Public License as published by the Free Software Foundation,
* either version 2 of the License, or (at your option) any later version.
* Go Responsiveness is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
* PARTICULAR PURPOSE. See the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with Go Responsiveness. If not, see <https://www.gnu.org/licenses/>.
*/
package series
import (
"github.com/network-quality/goresponsiveness/utilities"
"golang.org/x/exp/constraints"
)
func SeriesStandardDeviation[Data utilities.Number, Bucket constraints.Ordered](s WindowSeries[Data, Bucket]) (bool, float64) {
complete := s.Complete()
inputValues := s.GetValues()
actualValues := utilities.Filter(inputValues, func(d utilities.Optional[Data]) bool {
return utilities.IsSome[Data](d)
})
values := utilities.Fmap(actualValues, func(d utilities.Optional[Data]) Data { return utilities.GetSome[Data](d) })
return complete, utilities.CalculateStandardDeviation[Data](values)
}
func Percentile[Data utilities.Number, Bucket constraints.Ordered](s WindowSeries[Data, Bucket], p uint) (bool, Data) {
complete := s.Complete()
inputValues := s.GetValues()
actualValues := utilities.Filter(inputValues, func(d utilities.Optional[Data]) bool {
return utilities.IsSome[Data](d)
})
values := utilities.Fmap(actualValues, func(d utilities.Optional[Data]) Data { return utilities.GetSome[Data](d) })
return complete, utilities.CalculatePercentile(values, p)
}
func AllSequentialIncreasesLessThan[Data utilities.Number, Bucket constraints.Ordered](s WindowSeries[Data, Bucket], limit float64,
) (bool, bool, float64) {
complete := s.Complete()
inputValues := s.GetValues()
actualValues := utilities.Filter(utilities.Reverse(inputValues), func(d utilities.Optional[Data]) bool {
return utilities.IsSome[Data](d)
})
values := utilities.Fmap(actualValues, func(d utilities.Optional[Data]) Data { return utilities.GetSome[Data](d) })
result, actualLimit := utilities.AllSequentialIncreasesLessThan(values, limit)
return complete, result, actualLimit
}
func CalculateAverage[Data utilities.Number, Bucket constraints.Ordered](s WindowSeries[Data, Bucket]) (bool, float64) {
complete := s.Complete()
inputValues := s.GetValues()
actualValues := utilities.Filter(inputValues, func(d utilities.Optional[Data]) bool {
return utilities.IsSome[Data](d)
})
values := utilities.Fmap(actualValues, func(d utilities.Optional[Data]) Data { return utilities.GetSome[Data](d) })
return complete, utilities.CalculateAverage(values)
}
func TrimmedMean[Data utilities.Number, Bucket constraints.Ordered](s WindowSeries[Data, Bucket], trim int) (bool, float64, []Data) {
complete := s.Complete()
inputValues := s.GetValues()
actualValues := utilities.Filter(inputValues, func(d utilities.Optional[Data]) bool {
return utilities.IsSome[Data](d)
})
values := utilities.Fmap(actualValues, func(d utilities.Optional[Data]) Data { return utilities.GetSome[Data](d) })
trimmedMean, trimmedElements := utilities.TrimmedMean(values, trim)
return complete, trimmedMean, trimmedElements
}
|
