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
|
# Copyright 2010 Lars Wirzenius
#
# 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 hashlib
import shutil
import tempfile
import unittest
import obnamlib
class ChecksumTreeTests(unittest.TestCase):
def setUp(self):
self.tempdir = tempfile.mkdtemp()
fs = obnamlib.LocalFS(self.tempdir)
self.hooks = obnamlib.HookManager()
self.hooks.new('repository-toplevel-init')
self.checksum = hashlib.md5('foo').digest()
self.tree = obnamlib.ChecksumTree(fs, 'x', len(self.checksum),
obnamlib.DEFAULT_NODE_SIZE,
obnamlib.DEFAULT_UPLOAD_QUEUE_SIZE,
obnamlib.DEFAULT_LRU_SIZE, self)
def tearDown(self):
self.tree.commit()
shutil.rmtree(self.tempdir)
def test_is_empty_initially(self):
self.assertEqual(self.tree.find(self.checksum), [])
def test_finds_checksums(self):
self.tree.add(self.checksum, 1, 3)
self.tree.add(self.checksum, 2, 4)
self.assertEqual(sorted(self.tree.find(self.checksum)), [1, 2])
def test_finds_only_the_right_checksums(self):
self.tree.add(self.checksum, 1, 2)
self.tree.add(self.checksum, 3, 4)
self.tree.add(hashlib.md5('bar').digest(), 5, 6)
self.assertEqual(sorted(self.tree.find(self.checksum)), [1, 3])
def test_removes_checksum(self):
self.tree.add(self.checksum, 1, 3)
self.tree.add(self.checksum, 2, 4)
self.tree.remove(self.checksum, 2, 4)
self.assertEqual(self.tree.find(self.checksum), [1])
def test_adds_same_id_only_once(self):
self.tree.add(self.checksum, 1, 2)
self.tree.add(self.checksum, 1, 2)
self.assertEqual(self.tree.find(self.checksum), [1])
def test_unknown_chunk_is_not_used(self):
self.assertFalse(self.tree.chunk_is_used(self.checksum, 0))
def test_known_chunk_is_used(self):
self.tree.add(self.checksum, 0, 1)
self.assertTrue(self.tree.chunk_is_used(self.checksum, 0))
|
