summaryrefslogtreecommitdiff
path: root/factors/factors_test.go
blob: 77c5f4ac3a11b5f1fb1fdbb2b63ba0ef92d2b5ec (plain)
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
package factors

import (
	"fmt"
	"maps"
	"math"
	"testing"
)

// Run a test with a table of cases
func tableTest[IN comparable, OUT any](t *testing.T, toTest func(IN) OUT,
	cases map[IN]OUT, equal func(OUT, OUT) bool, name string) {
	for input, expected := range cases {
		t.Run(fmt.Sprintf("%v", input), func(t *testing.T) {
			actual := toTest(input)
			if !equal(expected, actual) {
				t.Errorf("%s(%v) = %v, expect %v", name, input, actual, expected)
			}
		})
	}
}

var primeFactorCases = map[uint]PrimeFactorization{
	0:     PrimeFactorization{map[uint]uint{0: 1}},
	1:     PrimeFactorization{map[uint]uint{}},
	2:     PrimeFactorization{map[uint]uint{2: 1}},
	3:     PrimeFactorization{map[uint]uint{3: 1}},
	4:     PrimeFactorization{map[uint]uint{2: 2}},
	6:     PrimeFactorization{map[uint]uint{2: 1, 3: 1}},
	10:    PrimeFactorization{map[uint]uint{2: 1, 5: 1}},
	12:    PrimeFactorization{map[uint]uint{2: 2, 3: 1}},
	33:    PrimeFactorization{map[uint]uint{3: 1, 11: 1}},
	60:    PrimeFactorization{map[uint]uint{2: 2, 3: 1, 5: 1}},
	86400: PrimeFactorization{map[uint]uint{2: 7, 3: 3, 5: 2}},
}

func TestPrimeFactorize(t *testing.T) {
	equal := func(a, b PrimeFactorization) bool {
		return maps.Equal(a.exponents, b.exponents)
	}
	tableTest(t, PrimeFactorize, primeFactorCases, equal, "PrimeFactorize")
}

var factorCases = map[uint][]uint{
	1:  []uint{1},
	2:  []uint{1, 2},
	4:  []uint{1, 2, 4},
	6:  []uint{1, 2, 3, 6},
	10: []uint{1, 2, 5, 10},
	12: []uint{1, 2, 3, 4, 6, 12},
	13: []uint{1, 13},
	15: []uint{1, 3, 5, 15},
	18: []uint{1, 2, 3, 6, 9, 18},
	60: []uint{1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60},
}

func TestFactors(t *testing.T) {
	tableTest(t, Factors, factorCases, setEquals, "Factors")
}

var totativeRatioCases = map[uint]float64{
	1:  1.0,
	2:  0.5,
	3:  2.0 / 3.0,
	4:  0.5,
	6:  1.0 / 3.0,
	8:  0.5,
	12: 1.0 / 3.0,
}

func TestTotativeRatio(t *testing.T) {
	equals := func(a, b float64) bool { return floatEquals(a, b, 1e-15) }
	tableTest(t, TotativeRatio, totativeRatioCases, equals, "TotativeRatio")
}

var factorScoreCases = map[uint]float64{
	1:   1.0,
	2:   1.5,
	3:   4.0 / 3.0,
	4:   1.75,
	6:   2.0,
	8:   1.875,
	10:  1.8,
	12:  7.0 / 3.0,
	120: 3.0,
}

func TestFactorScore(t *testing.T) {
	// factors.Score is accurate enough that we can test for exact floats!
	tableTest(t, Score, factorScoreCases, stdEquals[float64], "Score")
}

var basicRankCases = map[uint]string{
	2: "D-", 3: "E-", 4: "C~", 5: "F+", 6: "B~",
	7: "F-", 8: "C-", 9: "E~", 10: "D+", 11: "F~", 12: "A-",
	14: "D~", 15: "E+", 18: "B-", 20: "C+", 24: "A~", 30: "B+", 60: "A+",
}

func TestBasicRank(t *testing.T) {
	tableTest(t, BasicRank, basicRankCases, stdEquals[string], "BasicRank")
}

// to be used as the equal paramater for tableTest
func stdEquals[T comparable](a, b T) bool { return a == b }

func setEquals[E comparable](a, b []E) bool {
	// use maps to simulate sets
	// aSet[a] == true means set contains a, false means not
	aSet := make(map[E]bool)
	bSet := make(map[E]bool)
	for _, i := range a {
		aSet[i] = true
	}
	for _, j := range b {
		bSet[j] = true
	}
	return maps.Equal(aSet, bSet)
}

func floatEquals(a, b, maxDelta float64) bool {
	return math.Abs(a-b) <= maxDelta*math.Max(math.Abs(a), math.Abs(b))
}