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
|
// Copyright 2018 The dexon-consensus Authors
// This file is part of the dexon-consensus library.
//
// The dexon-consensus library is free software: you can redistribute it
// and/or modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation, either version 3 of the License,
// or (at your option) any later version.
//
// The dexon-consensus library 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 Lesser
// General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the dexon-consensus library. If not, see
// <http://www.gnu.org/licenses/>.
package simulation
import (
"math"
"sort"
)
func calculateMeanStdDeviationFloat64s(a []float64) (float64, float64) {
sum := float64(0)
for _, i := range a {
sum += i
}
mean := sum / float64(len(a))
dev := float64(0)
for _, i := range a {
dev += (i - mean) * (i - mean)
}
dev = math.Sqrt(dev / float64(len(a)))
return mean, dev
}
func calculateMeanStdDeviationInts(a []int) (float64, float64) {
floats := []float64{}
for _, i := range a {
floats = append(floats, float64(i))
}
return calculateMeanStdDeviationFloat64s(floats)
}
func getMinMedianMaxInts(a []int) (int, int, int) {
aCopied := make([]int, len(a))
copy(aCopied, a)
sort.Ints(aCopied)
return aCopied[0], aCopied[len(aCopied)/2], aCopied[len(aCopied)-1]
}
func getMinMedianMaxFloat64s(a []float64) (float64, float64, float64) {
aCopied := make([]float64, len(a))
copy(aCopied, a)
sort.Float64s(aCopied)
return aCopied[0], aCopied[len(aCopied)/2], aCopied[len(aCopied)-1]
}
|
