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
|
# Copyright 2016-2017 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/>.
#
# =*= License: GPL-3+ =*=
import unittest
import obnamlib
class CowTreeTests(unittest.TestCase):
def setUp(self):
self.ls = obnamlib.InMemoryLeafStore()
self.cow = obnamlib.CowTree()
self.cow.set_leaf_store(self.ls)
def test_has_no_keys_initially(self):
self.assertEqual(list(self.cow.keys()), [])
def test_lookup_returns_none_if_key_is_missing(self):
self.assertEqual(self.cow.lookup(42), None)
def test_returns_keyvalue_that_has_been_inserted(self):
key = 'fookey'
value = 'barvalue'
self.cow.insert(key, value)
self.assertEqual(self.cow.lookup(key), value)
self.assertEqual(list(self.cow.keys()), [key])
def test_removes_only_key_in_blob(self):
key = 'fookey'
value = 'barvalue'
self.cow.insert(key, value)
self.cow.remove(key)
self.assertEqual(list(self.cow.keys()), [])
def test_removes_one_of_the_keys_in_blob(self):
key = 'fookey'
value = 'barvalue'
key2 = 'fookey2'
value2 = 'barvalue2'
self.cow.insert(key, value)
self.cow.insert(key2, value2)
self.cow.remove(key)
self.assertEqual(list(self.cow.keys()), [key2])
self.assertEqual(self.cow.lookup(key), None)
def test_inserts_many_keys(self):
N = 10
self.cow.set_max_leaf_size(N/3)
keyvalues = [
('key-{}'.format(i), 'value-{}'.format(i))
for i in range(N)
]
# Insert in reverse order in order to exercise all the code
# paths in _LeafList.find_leaf_for_key.
for key, value in reversed(keyvalues):
self.cow.insert(key, value)
self.cow.commit()
for key, value in keyvalues:
self.assertEqual(self.cow.lookup(key), value)
def test_commits_changes_persistently(self):
key = 'fookey'
value = 'barvalue'
self.cow.insert(key, value)
list_id = self.cow.commit()
cow2 = obnamlib.CowTree()
cow2.set_leaf_store(self.ls)
cow2.set_list_node(list_id)
self.assertEqual(list(cow2.keys()), [key])
self.assertEqual(cow2.lookup(key), value)
def test_iterates_over_leaf_keys(self):
key = 'fookey'
value = 'barvalue'
self.cow.insert(key, value)
self.assertEqual(list(self.cow.keys()), [key])
|
