counter/counter_test.go at master · fnargesian/counter · GitHub

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
package counter

import "testing"

func TestCounter(t *testing.T) {
	testData := []string{"a", "b", "b", "c", "c", "d", "e", "e", "e", "f"}
	counter := NewCounter()
	for i := range testData {
		counter.Update(testData[i])
	}

	if counter.Total() != len(testData) {
		t.Error("Incorrect total count")
	}

	elems, freqs := counter.Freqs()
	for i := range freqs {
		if elems[i] == "a" && freqs[i] != 1 {
			t.Fail()
		}
		if elems[i] == "b" && freqs[i] != 2 {
			t.Fail()
		}
		if elems[i] == "c" && freqs[i] != 2 {
			t.Fail()
		}
		if elems[i] == "d" && freqs[i] != 1 {
			t.Fail()
		}
		if elems[i] == "e" && freqs[i] != 3 {
			t.Fail()
		}
	}
	elems, probs := counter.Probs()
	for i := range freqs {
		if elems[i] == "a" && probs[i] != 0.1 {
			t.Fail()
		}
		if elems[i] == "b" && probs[i] != 0.2 {
			t.Fail()
		}
		if elems[i] == "c" && probs[i] != 0.2 {
			t.Fail()
		}
		if elems[i] == "d" && probs[i] != 0.1 {
			t.Fail()
		}
		if elems[i] == "e" && probs[i] != 0.3 {
			t.Fail()
		}
	}
	c := counter.Unique()
	if c != 6 {
		t.Error(c)
	}

	var a string
	fn := func(s interface{}) error {
		a += s.(string)
		return nil
	}
	if err := counter.Apply(fn); err != nil {
		t.Fail()
	}
	t.Logf(a)
	if len(a) != 6 {
		t.Fail()
	}
}

func TestPairCounter(t *testing.T) {
	testData1 := []string{"a", "b", "b", "c", "c", "d", "e", "e", "f", "f"}
	testData2 := []string{"o", "p", "p", "q", "q", "r", "s", "t", "t", "v"}
	counter1 := NewCounter()
	counter2 := NewCounter()
	pairCounter := NewPairCounter()
	for i := range testData1 {
		counter1.Update(testData1[i])
		counter2.Update(testData2[i])
		pairCounter.Update(testData1[i], testData2[i])
	}

	if pairCounter.Total() != len(testData1) {
		t.Error("Incorrect total count")
	}
	if pairCounter.Unique() != 8 {
		t.Error("Incorrect unique count")
	}

	e1 := counter1.Entropy()
	e2 := counter2.Entropy()
	je := pairCounter.JointEntropy()
	t.Log(e1)
	t.Log(e2)
	t.Log(je)
	if je < e1 || je < e2 {
		t.Error("Joint entropy must be greater or equal to entropy")
	}
	if e1+e2 < je {
		t.Error("Sum of entropies must be greater or equal to joint entropy")
	}
}

func TestBinaryOperator(t *testing.T) {
	testData1 := []string{"a", "b", "b", "c", "d"}
	testData2 := []string{"b", "b", "c", "c", "e"}
	counter1 := NewCounter()
	counter2 := NewCounter()
	for i := range testData1 {
		counter1.Update(testData1[i])
		counter2.Update(testData2[i])
	}
	// intersection counter
	intersectCounter := counter1.Intersect(counter2)
	elems, freqs := intersectCounter.Freqs()
	for i := range freqs {
		if elems[i] == "a" && freqs[i] != 0 {
			t.Fail()
		}
		if elems[i] == "b" && freqs[i] != 2 {
			t.Fail()
		}
		if elems[i] == "c" && freqs[i] != 1 {
			t.Fail()
		}
		if elems[i] == "d" && freqs[i] != 0 {
			t.Fail()
		}
		if elems[i] == "e" && freqs[i] != 0 {
			t.Fail()
		}
	}
	// difference counter
	differenceCounter := counter1.Difference(counter2)
	elems, freqs = differenceCounter.Freqs()
	for i := range freqs {
		if elems[i] == "a" && freqs[i] != 1 {
			t.Fail()
		}
		if elems[i] == "b" && freqs[i] != 0 {
			t.Fail()
		}
		if elems[i] == "c" && freqs[i] != 0 {
			t.Fail()
		}
		if elems[i] == "d" && freqs[i] != 1 {
			t.Fail()
		}
		if differenceCounter.Has("e") {
			t.Fail()
		}
	}
}