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
|
#! /usr/bin/env python
##############################################################################
## DendroPy Phylogenetic Computing Library.
##
## Copyright 2010-2015 Jeet Sukumaran and Mark T. Holder.
## All rights reserved.
##
## See "LICENSE.rst" for terms and conditions of usage.
##
## If you use this work or any portion thereof in published work,
## please cite it as:
##
## Sukumaran, J. and M. T. Holder. 2010. DendroPy: a Python library
## for phylogenetic computing. Bioinformatics 26: 1569-1571.
##
##############################################################################
"""
NormalizedBitmaskDict tests.
"""
import unittest
from dendropy.utility import container
class TestNormalizedBitmaskDict(unittest.TestCase):
def runTest(self):
"""Testing NormalizedBitmaskDict"""
fill_bitmask = 0xFF # 1111 1111
splits = [
((0x03, '0000 0011'), (0x03, '0000 0011')),
((0x34, '0011 0100'), (0xCB, '1100 1011')),
((0x44, '0100 0100'), (0xBB, '1011 1011')),
((0x12, '0001 0010'), (0xED, '1110 1101')),
((0x75, '0111 0101'), (0x75, '0111 0101')),
]
d = container.NormalizedBitmaskDict(fill_bitmask=fill_bitmask)
for s in splits:
d[s[0][0]] = s[0][1]
for s in splits:
self.assertIn(s[0][0], d)
self.assertIn(s[1][0], d)
self.assertEqual(d[s[0][0]], d[s[1][0]])
for k, v in d.items():
pass
del d[splits[0][0][0]]
del d[splits[1][1][0]]
self.assertNotIn(splits[0][0][0], d)
self.assertNotIn(splits[0][1][0], d)
self.assertNotIn(splits[1][0][0], d)
self.assertNotIn(splits[1][1][0], d)
if __name__ == "__main__":
unittest.main()
|
