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
|
package filetree
// TODO: rewrite this to be weighted by file size
// func TestEfficencyMap(t *testing.T) {
// trees := make([]*FileTree, 3)
// for ix, _ := range trees {
// tree := NewFileTree()
// tree.AddPath("/etc/nginx/nginx.conf", FileInfo{})
// tree.AddPath("/etc/nginx/public", FileInfo{})
// trees[ix] = tree
// }
// var expectedMap = map[string]int{
// "/etc/nginx/nginx.conf": 3,
// "/etc/nginx/public": 3,
// }
// actualMap := EfficiencyMap(trees)
// if !reflect.DeepEqual(expectedMap, actualMap) {
// t.Fatalf("Expected %v but go %v", expectedMap, actualMap)
// }
// }
//
// func TestEfficiencyScore(t *testing.T) {
// trees := make([]*FileTree, 3)
// for ix, _ := range trees {
// tree := NewFileTree()
// tree.AddPath("/etc/nginx/nginx.conf", FileInfo{})
// tree.AddPath("/etc/nginx/public", FileInfo{})
// trees[ix] = tree
// }
// expected := 2.0 / 6.0
// actual := CalculateEfficiency(trees)
// if math.Abs(expected-actual) > 0.0001 {
// t.Fatalf("Expected %f but got %f", expected, actual)
// }
//
// trees = make([]*FileTree, 1)
// for ix, _ := range trees {
// tree := NewFileTree()
// tree.AddPath("/etc/nginx/nginx.conf", FileInfo{})
// tree.AddPath("/etc/nginx/public", FileInfo{})
// trees[ix] = tree
// }
// expected = 1.0
// actual = CalculateEfficiency(trees)
// if math.Abs(expected-actual) > 0.0001 {
// t.Fatalf("Expected %f but got %f", expected, actual)
// }
// }
|
