/brz/remove-bazaar

To get this branch, use:
bzr branch http://gegoxaren.bato24.eu/bzr/brz/remove-bazaar

« back to all changes in this revision

Viewing changes to breezy/tests/test__btree_serializer.py

  • Committer: Jelmer Vernooij
  • Date: 2018-11-11 04:08:32 UTC
  • mto: (7143.16.20 even-more-cleanups)
  • mto: This revision was merged to the branch mainline in revision 7175.
  • Revision ID: jelmer@jelmer.uk-20181111040832-nsljjynzzwmznf3h
Run autopep8.

Show diffs side-by-side

added added

removed removed

Lines of Context:
breezy/tests/test__btree_serializer.py
62
62
    def test_to_hex(self):
63
63
        raw_bytes = b''.join(map(int2byte, range(256)))
64
64
        for i in range(0, 240, 20):
65
 
            self.assertHexlify(raw_bytes[i:i+20])
66
 
        self.assertHexlify(raw_bytes[240:]+raw_bytes[0:4])
 
65
            self.assertHexlify(raw_bytes[i:i + 20])
 
66
        self.assertHexlify(raw_bytes[240:] + raw_bytes[0:4])
67
67
 
68
68
    def test_from_hex(self):
69
69
        self.assertUnhexlify(b'0123456789abcdef0123456789abcdef01234567')
72
72
        self.assertUnhexlify(b'123456789ABCDEF0123456789ABCDEF012345678')
73
73
        hex_chars = binascii.hexlify(b''.join(map(int2byte, range(256))))
74
74
        for i in range(0, 480, 40):
75
 
            self.assertUnhexlify(hex_chars[i:i+40])
76
 
        self.assertUnhexlify(hex_chars[480:]+hex_chars[0:8])
 
75
            self.assertUnhexlify(hex_chars[i:i + 40])
 
76
        self.assertUnhexlify(hex_chars[480:] + hex_chars[0:8])
77
77
 
78
78
    def test_from_invalid_hex(self):
79
79
        self.assertFailUnhexlify(b'123456789012345678901234567890123456789X')
86
86
 
87
87
_hex_form = b'123456789012345678901234567890abcdefabcd'
88
88
 
 
89
 
89
90
class Test_KeyToSha1(TestBtreeSerializer):
90
91
 
91
92
    def assertKeyToSha1(self, expected, key):
121
122
 
122
123
    def test_invalid_not_hex(self):
123
124
        self.assertKeyToSha1(None,
124
 
            (b'sha1:abcdefghijklmnopqrstuvwxyz12345678901234',))
 
125
                             (b'sha1:abcdefghijklmnopqrstuvwxyz12345678901234',))
125
126
 
126
127
 
127
128
class Test_Sha1ToKey(TestBtreeSerializer):
216
217
        self.assertEqual([b'12345678901 1234567890 0 1',
217
218
                          b'2147483648 2147483647 0 1',
218
219
                          b'4294967296 4294967295 4294967294 1',
219
 
                         ], [x[1][0] for x in leaf.all_items()])
 
220
                          ], [x[1][0] for x in leaf.all_items()])
220
221
 
221
222
    def test_many_key_leaf(self):
222
223
        leaf = self.module._parse_into_chk(_multi_key_content, 1, 0)
283
284
            lines.append(b'%s\0\0%d %d %d %d\n' % (key_str, i, i, i, i))
284
285
        data = b''.join(lines)
285
286
        leaf = self.module._parse_into_chk(data, 1, 0)
286
 
        self.assertEqual(24-7, leaf.common_shift)
 
287
        self.assertEqual(24 - 7, leaf.common_shift)
287
288
        offsets = leaf._get_offsets()
288
289
        # This is the interesting bits for each entry
289
290
        lst = [x // 2 for x in range(500)]
290
 
        expected_offsets = [x * 2 for x in range(128)] + [255]*129
 
291
        expected_offsets = [x * 2 for x in range(128)] + [255] * 129
291
292
        self.assertEqual(expected_offsets, offsets)
292
293
        # We truncate because offsets is an unsigned char. So the bisection
293
294
        # will just say 'greater than the last one' for all the rest