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
|
# 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 os
import shutil
import tempfile
import unittest
import larch
class ForestTests(unittest.TestCase):
def setUp(self):
self.codec = larch.NodeCodec(3)
self.ns = larch.NodeStoreMemory(64, self.codec)
self.forest = larch.Forest(self.ns)
def test_new_node_ids_grow(self):
id1 = self.forest.new_id()
id2 = self.forest.new_id()
self.assertEqual(id1 + 1, id2)
def test_has_no_trees_initially(self):
self.assertEqual(self.forest.trees, [])
def test_creates_a_tree(self):
t = self.forest.new_tree()
self.assert_(isinstance(t, larch.BTree))
self.assertEqual(self.forest.trees, [t])
def test_clones_a_tree(self):
t1 = self.forest.new_tree()
t2 = self.forest.new_tree(t1)
self.assertNotEqual(t1.root.id, t2.root.id)
def test_clones_can_be_changed_independently(self):
t1 = self.forest.new_tree()
t2 = self.forest.new_tree(t1)
t1.insert('foo', 'foo')
self.assertNotEqual(t1.root.id, t2.root.id)
def test_clones_do_not_clash_in_new_node_ids(self):
t1 = self.forest.new_tree()
t2 = self.forest.new_tree(t1)
node1 = t1._new_leaf([], [])
node2 = t2._new_leaf([], [])
self.assertEqual(node1.id + 1, node2.id)
def test_is_persistent(self):
t1 = self.forest.new_tree()
t1.insert('foo', 'bar')
self.forest.commit()
f2 = larch.Forest(self.ns)
self.assertEqual([t.root.id for t in f2.trees], [t1.root.id])
def test_removes_trees(self):
t1 = self.forest.new_tree()
self.forest.remove_tree(t1)
self.assertEqual(self.forest.trees, [])
def test_remove_tree_removes_nodes_for_tree_as_well(self):
t = self.forest.new_tree()
t.insert('foo', 'bar')
self.forest.commit()
self.assertNotEqual(self.ns.list_nodes(), [])
self.forest.remove_tree(t)
self.assertEqual(self.ns.list_nodes(), [])
def test_changes_work_across_commit(self):
t1 = self.forest.new_tree()
t1.insert('000', 'foo')
t1.insert('001', 'bar')
t2 = self.forest.new_tree(t1)
t2.insert('002', 'foobar')
t2.remove('000')
self.forest.commit()
f2 = larch.Forest(self.ns)
t1a, t2a = f2.trees
self.assertEqual(t1.root.id, t1a.root.id)
self.assertEqual(t2.root.id, t2a.root.id)
self.assertEqual(t1a.lookup('000'), 'foo')
self.assertEqual(t1a.lookup('001'), 'bar')
self.assertRaises(KeyError, t2a.lookup, '000')
self.assertEqual(t2a.lookup('001'), 'bar')
self.assertEqual(t2a.lookup('002'), 'foobar')
def test_committing_single_empty_tree_works(self):
self.forest.new_tree()
self.assertEqual(self.forest.commit(), None)
def test_read_metadata_works_after_removed_and_committed(self):
t1 = self.forest.new_tree()
t1.insert('foo', 'foo')
self.forest.commit()
self.forest.remove_tree(t1)
self.forest.commit()
f2 = larch.Forest(self.ns)
self.assertEqual(f2.trees, [])
def test_commit_puts_key_and_node_sizes_in_metadata(self):
self.forest.commit()
self.assertEqual(self.ns.get_metadata('key_size'), 3)
self.assertEqual(self.ns.get_metadata('node_size'), 64)
class OpenForestTests(unittest.TestCase):
def setUp(self):
self.key_size = 3
self.node_size = 64
self.tempdir = tempfile.mkdtemp()
def tearDown(self):
shutil.rmtree(self.tempdir)
def test_creates_new_forest(self):
f = larch.open_forest(key_size=self.key_size, node_size=self.node_size,
dirname=self.tempdir, allow_writes=True)
self.assertEqual(f.node_store.codec.key_bytes, self.key_size)
self.assertEqual(f.node_store.node_size, self.node_size)
def test_fail_if_metadata_missing_key_size(self):
with open(os.path.join(self.tempdir, 'metadata'), 'w') as f:
f.write('[metadata]\n')
f.write('format=1/1\n')
f.write('node_size=%s\n' % self.node_size)
self.assertRaises(larch.MetadataMissingKey, larch.open_forest,
key_size=self.key_size, node_size=None,
dirname=self.tempdir, allow_writes=False)
def test_fail_if_metadata_missing_node_size(self):
with open(os.path.join(self.tempdir, 'metadata'), 'w') as f:
f.write('[metadata]\n')
f.write('format=1/1\n')
f.write('key_size=%s\n' % self.key_size)
self.assertRaises(larch.MetadataMissingKey, larch.open_forest,
key_size=self.key_size, node_size=None,
dirname=self.tempdir, allow_writes=False)
def test_fail_if_existing_tree_has_incompatible_key_size(self):
f = larch.open_forest(key_size=self.key_size, node_size=self.node_size,
dirname=self.tempdir, allow_writes=True)
f.commit()
self.assertRaises(larch.BadKeySize,
larch.open_forest,
key_size=self.key_size + 1,
node_size=self.node_size,
dirname=self.tempdir,
allow_writes=True)
def test_opens_existing_tree_with_incompatible_node_size(self):
f = larch.open_forest(allow_writes=True, key_size=self.key_size,
node_size=self.node_size, dirname=self.tempdir)
f.commit()
new_size = self.node_size + 1
f2 = larch.open_forest(key_size=self.key_size,
node_size=new_size,
dirname=self.tempdir,
allow_writes=True)
self.assertEqual(int(f2.node_store.get_metadata('node_size')),
self.node_size)
def test_opens_existing_tree_with_compatible_key_and_node_size(self):
f = larch.open_forest(key_size=self.key_size, node_size=self.node_size,
dirname=self.tempdir, allow_writes=True)
f.commit()
f2 = larch.open_forest(key_size=self.key_size,
node_size=self.node_size,
dirname=self.tempdir,
allow_writes=True)
self.assert_(True)
def test_opens_existing_tree_without_node_and_key_sizes_given(self):
f = larch.open_forest(allow_writes=True, key_size=self.key_size,
node_size=self.node_size, dirname=self.tempdir)
f.commit()
f2 = larch.open_forest(dirname=self.tempdir, allow_writes=True)
self.assertEqual(f2.node_store.node_size, self.node_size)
self.assertEqual(f2.node_store.codec.key_bytes, self.key_size)
def test_fails_with_new_tree_unless_node_and_key_sizes_given(self):
self.assertRaises(AssertionError,
larch.open_forest,
dirname=self.tempdir)
class BadKeySizeTests(unittest.TestCase):
def test_both_sizes_in_error_message(self):
e = larch.BadKeySize(123, 456)
self.assert_('123' in str(e))
self.assert_('456' in str(e))
class BadNodeSizeTests(unittest.TestCase):
def test_both_sizes_in_error_message(self):
e = larch.BadNodeSize(123, 456)
self.assert_('123' in str(e))
self.assert_('456' in str(e))
|
