vtracker 1.0.0

For tracking the relationship between group membership changes across versions.
Documentation 
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292

###############################################################################
#                                                                             #
#    This program 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 3 of the License, or        #
#    (at your option) any later version.                                      #
#                                                                             #
#    This program 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 this program. If not, see <http://www.gnu.org/licenses/>.     #
#                                                                             #
###############################################################################

import unittest

from vtracker import VTracker
from vtracker.exceptions import MissingVersion, DuplicateEntity


class TestVTracker(unittest.TestCase):

    def test___init__(self):
        vt = VTracker(('a', 'b', 'c'))
        self.assertDictEqual({'a': 0, 'b': 1, 'c': 2}, vt._ver_to_idx)
        self.assertTupleEqual(('a', 'b', 'c'), vt._idx_to_ver)
        self.assertEqual(0, len(vt._uid_to_node))
        self.assertEqual(0, len(vt._uid_to_edge))

    def test_add(self):
        """
        +--------------+--------+--------------+
        |     1        |   2    |      3       |
        +--------------+--------+--------------+
        | a: x         | a: x   | a: y         |
        |              | b: y,z |              |
        | Missing: y,z |        | Missing: x,z |
        +--------------+--------+--------------+
        """
        vt = VTracker(('1', '2', '3'))
        vt.add('x', {'1': 'a', '2': 'a'})
        vt.add('y', {'2': 'b', '3': 'a'})
        vt.add('z', {'2': 'b'})
        mis = vt.str_na

        # Check the nodes
        self.assertEqual(len(vt._graph._nodes), 6)
        n_1_x = vt._graph.get_node(('1', 'a'))
        self.assertSetEqual(n_1_x._edges_in, set())
        self.assertSetEqual(n_1_x._edges_out, {(('1', 'a'), ('2', 'a'))})
        self.assertSetEqual(n_1_x.attrs['uid'], {'x'})

        n_1_yz = vt._graph.get_node(('1', mis))
        self.assertSetEqual(n_1_yz._edges_in, set())
        self.assertSetEqual(n_1_yz._edges_out, {(('1', mis), ('2', 'b'))})
        self.assertSetEqual(n_1_yz.attrs['uid'], {'y', 'z'})

        n_2_x = vt._graph.get_node(('2', 'a'))
        self.assertSetEqual(n_2_x._edges_in, {(('1', 'a'), ('2', 'a'))})
        self.assertSetEqual(n_2_x._edges_out, {(('2', 'a'), ('3', mis))})
        self.assertSetEqual(n_2_x.attrs['uid'], {'x'})

        n_2_yz = vt._graph.get_node(('2', 'b'))
        self.assertSetEqual(n_2_yz._edges_in, {(('1', mis), ('2', 'b'))})
        self.assertSetEqual(n_2_yz._edges_out, {(('2', 'b'), ('3', 'a')),
                                                (('2', 'b'), ('3', mis))})
        self.assertSetEqual(n_2_yz.attrs['uid'], {'y', 'z'})

        n_3_y = vt._graph.get_node(('3', 'a'))
        self.assertSetEqual(n_3_y._edges_in, {(('2', 'b'), ('3', 'a'))})
        self.assertSetEqual(n_3_y._edges_out, set())
        self.assertSetEqual(n_3_y.attrs['uid'], {'y'})

        n_3_xz = vt._graph.get_node(('3', mis))
        self.assertSetEqual(n_3_xz._edges_in, {(('2', 'a'), ('3', mis)),
                                               (('2', 'b'), ('3', mis))})
        self.assertSetEqual(n_3_xz._edges_out, set())
        self.assertSetEqual(n_3_xz.attrs['uid'], {'x', 'z'})

        # Check the edges
        self.assertEqual(len(vt._graph._edges), 5)
        e_1a_2a = vt._graph.get_edge(('1', 'a'), ('2', 'a'))
        self.assertSetEqual(e_1a_2a.attrs['uid'], {'x'})

        e_mis1_2b = vt._graph.get_edge(('1', mis), ('2', 'b'))
        self.assertSetEqual(e_mis1_2b.attrs['uid'], {'y', 'z'})

        e_2a_3mis = vt._graph.get_edge(('2', 'a'), ('3', mis))
        self.assertSetEqual(e_2a_3mis.attrs['uid'], {'x'})

        e_2b_3mis = vt._graph.get_edge(('2', 'b'), ('3', mis))
        self.assertSetEqual(e_2b_3mis.attrs['uid'], {'z'})

        e_2b_3a = vt._graph.get_edge(('2', 'b'), ('3', 'a'))
        self.assertSetEqual(e_2b_3a.attrs['uid'], {'y'})

        # Check the node indices
        self.assertSetEqual(vt._uid_to_node['x'], {('1', 'a'), ('2', 'a'), ('3', mis)})
        self.assertSetEqual(vt._uid_to_node['y'], {('1', mis), ('2', 'b'), ('3', 'a')})
        self.assertSetEqual(vt._uid_to_node['z'], {('1', mis), ('2', 'b'), ('3', mis)})

        # Check the edge indices
        self.assertSetEqual(vt._uid_to_edge['x'], {(('1', 'a'), ('2', 'a')),
                                                   (('2', 'a'), ('3', mis))})
        self.assertSetEqual(vt._uid_to_edge['y'], {(('1', mis), ('2', 'b')),
                                                   (('2', 'b'), ('3', 'a'))})
        self.assertSetEqual(vt._uid_to_edge['z'], {(('1', mis), ('2', 'b')),
                                                   (('2', 'b'), ('3', mis))})

    def test_add_raises_MissingVersion(self):
        vt = VTracker(('1', '2', '3'))
        self.assertRaises(MissingVersion, vt.add, 'x', {'1': 'a', '9': 'a'})

    def test_add_raises_DuplicateEntity(self):
        vt = VTracker(('1', '2', '3'))
        vt.add('x', {'1': 'a', '2': 'a', '3': 'a'})
        self.assertRaises(DuplicateEntity, vt.add, 'x', {'1': 'a'})

    def test__build_uid_paths(self):
        """
        +--------------+--------+--------------+
        |     1        |   2    |      3       |
        +--------------+--------+--------------+
        | a: x         | a: x   | a: y         |
        |              | b: y,z |              |
        | Missing: y,z |        | Missing: x,z |
        +--------------+--------+--------------+
        """
        vt = VTracker(('1', '2', '3'))
        vt.add('x', {'1': 'a', '2': 'a'})
        vt.add('y', {'2': 'b', '3': 'a'})
        vt.add('z', {'2': 'b'})
        mis = vt.str_na
        nodes, edges = vt._build_uid_paths()

        # Check node highlighting
        node_x = set()
        node_x.add(vt._graph.get_node(('1', 'a'))._node_id)
        node_x.add(vt._graph.get_node(('2', 'a'))._node_id)
        node_x.add(vt._graph.get_node(('3', mis))._node_id)
        self.assertSetEqual(node_x, nodes['x'])

        node_y = set()
        node_y.add(vt._graph.get_node(('1', mis))._node_id)
        node_y.add(vt._graph.get_node(('2', 'b'))._node_id)
        node_y.add(vt._graph.get_node(('3', 'a'))._node_id)
        self.assertSetEqual(node_y, nodes['y'])

        node_z = set()
        node_z.add(vt._graph.get_node(('1', mis))._node_id)
        node_z.add(vt._graph.get_node(('2', 'b'))._node_id)
        node_z.add(vt._graph.get_node(('3', mis))._node_id)
        self.assertSetEqual(node_z, nodes['z'])

        # Check edge highlighting
        edge_x = set()
        edge_x.add(vt._graph.get_edge(('1', 'a'), ('2', 'a'))._edge_id)
        edge_x.add(vt._graph.get_edge(('2', 'a'), ('3', mis))._edge_id)
        self.assertSetEqual(edge_x, edges['x'])

        edge_y = set()
        edge_y.add(vt._graph.get_edge(('1', mis), ('2', 'b'))._edge_id)
        edge_y.add(vt._graph.get_edge(('2', 'b'), ('3', 'a'))._edge_id)
        self.assertSetEqual(edge_y, edges['y'])

        edge_z = set()
        edge_z.add(vt._graph.get_edge(('1', mis), ('2', 'b'))._edge_id)
        edge_z.add(vt._graph.get_edge(('2', 'b'), ('3', mis))._edge_id)
        self.assertSetEqual(edge_z, edges['z'])

    def test_as_sankey_json(self):
        """
        +--------------+--------+--------------+
        |     1        |   2    |      3       |
        +--------------+--------+--------------+
        | a: x         | a: x   | a: y         |
        |              | b: y,z |              |
        | Missing: y,z |        | Missing: x,z |
        +--------------+--------+--------------+
        """
        vt = VTracker(('1', '2', '3'))
        vt.add('x', {'1': 'a', '2': 'a'})
        vt.add('y', {'2': 'b', '3': 'a'})
        vt.add('z', {'2': 'b'})
        mis = vt.str_na
        nodes, edges = vt._build_uid_paths()

        # Convert the sankey results to a dict for easy checking
        sankey_json = vt.as_sankey_json()
        test_nodes = {x['id']: x for x in sankey_json['nodes']}
        test_edges = {x['id']: x for x in sankey_json['links']}

        nodes_exp = dict()
        id_a1 = vt._graph.get_node(('1', 'a'))._node_id
        nodes_exp[id_a1] = {'id': id_a1,
                            'name': 'a',
                            'col': '1',
                            'total': 1,
                            'linkHighlightId': list(edges['x']),
                            'nodeHighlightId': list(nodes['x'])}

        id_mis_1 = vt._graph.get_node(('1', mis))._node_id
        nodes_exp[id_mis_1] = {'id': id_mis_1,
                               'name': mis,
                               'col': '1',
                               'total': 2,
                               'linkHighlightId': list(edges['y'].union(edges['z'])),
                               'nodeHighlightId': list(nodes['y'].union(nodes['z']))}

        id_a2 = vt._graph.get_node(('2', 'a'))._node_id
        nodes_exp[id_a2] = {'id': id_a2,
                            'name': 'a',
                            'col': '2',
                            'total': 1,
                            'linkHighlightId': list(edges['x']),
                            'nodeHighlightId': list(nodes['x'])}

        id_b2 = vt._graph.get_node(('2', 'b'))._node_id
        nodes_exp[id_b2] = {'id': id_b2,
                            'name': 'b',
                            'col': '2',
                            'total': 2,
                            'linkHighlightId': list(edges['y'].union(edges['z'])),
                            'nodeHighlightId': list(nodes['y'].union(nodes['z']))}

        id_a3 = vt._graph.get_node(('3', 'a'))._node_id
        nodes_exp[id_a3] = {'id': id_a3,
                            'name': 'a',
                            'col': '3',
                            'total': 1,
                            'linkHighlightId': list(edges['y']),
                            'nodeHighlightId': list(nodes['y'])}

        id_mis_3 = vt._graph.get_node(('3', mis))._node_id
        nodes_exp[id_mis_3] = {'id': id_mis_3,
                               'name': mis,
                               'col': '3',
                               'total': 2,
                               'linkHighlightId': list(edges['x'].union(edges['z'])),
                               'nodeHighlightId': list(nodes['x'].union(nodes['z']))}

        for exp_node_id, exp_node in nodes_exp.items():
            test_node = test_nodes[exp_node_id]
            self.assertDictEqual(exp_node, test_node)

        edges_exp = dict()
        id_1 = vt._graph.get_edge(('1', 'a'), ('2', 'a'))._edge_id
        edges_exp[id_1] = {'id': id_1,
                           'source': vt._graph.get_node(('1', 'a'))._node_id,
                           'target': vt._graph.get_node(('2', 'a'))._node_id,
                           'value': 1,
                           'linkHighlightId': list(edges['x']),
                           'nodeHighlightId': list(nodes['x'])}

        id_2 = vt._graph.get_edge(('1', mis), ('2', 'b'))._edge_id
        edges_exp[id_2] = {'id': id_2,
                           'source': vt._graph.get_node(('1', mis))._node_id,
                           'target': vt._graph.get_node(('2', 'b'))._node_id,
                           'value': 2,
                           'linkHighlightId': list(edges['y'].union(edges['z'])),
                           'nodeHighlightId': list(nodes['y'].union(nodes['z']))}

        id_3 = vt._graph.get_edge(('2', 'a'), ('3', mis))._edge_id
        edges_exp[id_3] = {'id': id_3,
                           'source': vt._graph.get_node(('2', 'a'))._node_id,
                           'target': vt._graph.get_node(('3', mis))._node_id,
                           'value': 1,
                           'linkHighlightId': list(edges['x']),
                           'nodeHighlightId': list(nodes['x'])}

        id_4 = vt._graph.get_edge(('2', 'b'), ('3', 'a'))._edge_id
        edges_exp[id_4] = {'id': id_4,
                           'source': vt._graph.get_node(('2', 'b'))._node_id,
                           'target': vt._graph.get_node(('3', 'a'))._node_id,
                           'value': 1,
                           'linkHighlightId': list(edges['y']),
                           'nodeHighlightId': list(nodes['y'])}

        id_5 = vt._graph.get_edge(('2', 'b'), ('3', mis))._edge_id
        edges_exp[id_5] = {'id': id_5,
                           'source': vt._graph.get_node(('2', 'b'))._node_id,
                           'target': vt._graph.get_node(('3', mis))._node_id,
                           'value': 1,
                           'linkHighlightId': list(edges['z']),
                           'nodeHighlightId': list(nodes['z'])}

        for exp_edge_id, exp_edge in edges_exp.items():
            test_edge = test_edges[exp_edge_id]
            self.assertDictEqual(exp_edge, test_edge)