Roger E. Masse | 352e186 | 1997-01-16 22:04:10 +0000 | [diff] [blame] | 1 | #! /usr/bin/env python |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 2 | """Test script for the bsddb C module by Roger E. Masse |
| 3 | Adapted to unittest format and expanded scope by Raymond Hettinger |
Roger E. Masse | 352e186 | 1997-01-16 22:04:10 +0000 | [diff] [blame] | 4 | """ |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 5 | import os, sys |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 6 | import copy |
Roger E. Masse | 352e186 | 1997-01-16 22:04:10 +0000 | [diff] [blame] | 7 | import bsddb |
Georg Brandl | 0a7ac7d | 2008-05-26 10:29:35 +0000 | [diff] [blame] | 8 | import dbm.bsd # Just so we know it's imported |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 9 | import unittest |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 10 | from test import support |
Roger E. Masse | 352e186 | 1997-01-16 22:04:10 +0000 | [diff] [blame] | 11 | |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 12 | class TestBSDDB(unittest.TestCase): |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 13 | openflag = 'c' |
Roger E. Masse | 352e186 | 1997-01-16 22:04:10 +0000 | [diff] [blame] | 14 | |
Martin v. Löwis | 64ce505 | 2007-08-05 15:39:16 +0000 | [diff] [blame] | 15 | def do_open(self, *args, **kw): |
Jesus Cea | 3a2bd7d | 2008-09-02 02:30:21 +0000 | [diff] [blame] | 16 | # This code will be vastly improved in future bsddb 4.7.4. Meanwhile, |
| 17 | # let's live with this ugliness. XXX - jcea@jcea.es - 20080902 |
| 18 | class _ExposedProperties: |
| 19 | @property |
| 20 | def _cursor_refs(self): |
| 21 | return self.db._cursor_refs |
| 22 | |
| 23 | import collections |
| 24 | class StringKeys(collections.MutableMapping, _ExposedProperties): |
| 25 | """Wrapper around DB object that automatically encodes |
| 26 | all keys as UTF-8; the keys must be strings.""" |
| 27 | |
| 28 | def __init__(self, db): |
| 29 | self.db = db |
| 30 | |
| 31 | def __len__(self): |
| 32 | return len(self.db) |
| 33 | |
| 34 | def __getitem__(self, key): |
| 35 | return self.db[key.encode("utf-8")] |
| 36 | |
| 37 | def __setitem__(self, key, value): |
| 38 | self.db[key.encode("utf-8")] = value |
| 39 | |
| 40 | def __delitem__(self, key): |
| 41 | del self.db[key.encode("utf-8")] |
| 42 | |
| 43 | def __iter__(self): |
| 44 | for k in self.db: |
| 45 | yield k.decode("utf-8") |
| 46 | |
| 47 | def close(self): |
| 48 | self.db.close() |
| 49 | |
| 50 | def keys(self): |
| 51 | for k in self.db.keys(): |
| 52 | yield k.decode("utf-8") |
| 53 | |
| 54 | def has_key(self, key): |
| 55 | return self.db.has_key(key.encode("utf-8")) |
| 56 | |
| 57 | __contains__ = has_key |
| 58 | |
| 59 | def values(self): |
| 60 | return self.db.values() |
| 61 | |
| 62 | def items(self): |
| 63 | for k,v in self.db.items(): |
| 64 | yield k.decode("utf-8"), v |
| 65 | |
| 66 | def set_location(self, key): |
| 67 | return self.db.set_location(key.encode("utf-8")) |
| 68 | |
| 69 | def next(self): |
| 70 | key, value = self.db.next() |
| 71 | return key.decode("utf-8"), value |
| 72 | |
| 73 | def previous(self): |
| 74 | key, value = self.db.previous() |
| 75 | return key.decode("utf-8"), value |
| 76 | |
| 77 | def first(self): |
| 78 | key, value = self.db.first() |
| 79 | return key.decode("utf-8"), value |
| 80 | |
| 81 | def last(self): |
| 82 | key, value = self.db.last() |
| 83 | return key.decode("utf-8"), value |
| 84 | |
| 85 | def set_location(self, key): |
| 86 | key, value = self.db.set_location(key.encode("utf-8")) |
| 87 | return key.decode("utf-8"), value |
| 88 | |
| 89 | def sync(self): |
| 90 | return self.db.sync() |
| 91 | |
| 92 | class StringValues(collections.MutableMapping, _ExposedProperties): |
| 93 | """Wrapper around DB object that automatically encodes |
| 94 | and decodes all values as UTF-8; input values must be strings.""" |
| 95 | |
| 96 | def __init__(self, db): |
| 97 | self.db = db |
| 98 | |
| 99 | def __len__(self): |
| 100 | return len(self.db) |
| 101 | |
| 102 | def __getitem__(self, key): |
| 103 | return self.db[key].decode("utf-8") |
| 104 | |
| 105 | def __setitem__(self, key, value): |
| 106 | self.db[key] = value.encode("utf-8") |
| 107 | |
| 108 | def __delitem__(self, key): |
| 109 | del self.db[key] |
| 110 | |
| 111 | def __iter__(self): |
| 112 | return iter(self.db) |
| 113 | |
| 114 | def close(self): |
| 115 | self.db.close() |
| 116 | |
| 117 | def keys(self): |
| 118 | return self.db.keys() |
| 119 | |
| 120 | def has_key(self, key): |
| 121 | return self.db.has_key(key) |
| 122 | |
| 123 | __contains__ = has_key |
| 124 | |
| 125 | def values(self): |
| 126 | for v in self.db.values(): |
| 127 | yield v.decode("utf-8") |
| 128 | |
| 129 | def items(self): |
| 130 | for k,v in self.db.items(): |
| 131 | yield k, v.decode("utf-8") |
| 132 | |
| 133 | def set_location(self, key): |
| 134 | return self.db.set_location(key) |
| 135 | |
| 136 | def next(self): |
| 137 | key, value = self.db.next() |
| 138 | return key, value.decode("utf-8") |
| 139 | |
| 140 | def previous(self): |
| 141 | key, value = self.db.previous() |
| 142 | return key, value.decode("utf-8") |
| 143 | |
| 144 | def first(self): |
| 145 | key, value = self.db.first() |
| 146 | return key, value.decode("utf-8") |
| 147 | |
| 148 | def last(self): |
| 149 | key, value = self.db.last() |
| 150 | return key, value.decode("utf-8") |
| 151 | |
| 152 | def set_location(self, key): |
| 153 | key, value = self.db.set_location(key) |
| 154 | return key, value.decode("utf-8") |
| 155 | |
| 156 | def sync(self): |
| 157 | return self.db.sync() |
| 158 | |
Martin v. Löwis | 64ce505 | 2007-08-05 15:39:16 +0000 | [diff] [blame] | 159 | # openmethod is a list so that it's not mistaken as an instance method |
Jesus Cea | 3a2bd7d | 2008-09-02 02:30:21 +0000 | [diff] [blame] | 160 | return StringValues(StringKeys(self.openmethod[0](*args, **kw))) |
Martin v. Löwis | 64ce505 | 2007-08-05 15:39:16 +0000 | [diff] [blame] | 161 | |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 162 | def setUp(self): |
Martin v. Löwis | 64ce505 | 2007-08-05 15:39:16 +0000 | [diff] [blame] | 163 | self.f = self.do_open(self.fname, self.openflag, cachesize=32768) |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 164 | self.d = dict(q='Guido', w='van', e='Rossum', r='invented', t='Python', y='') |
Guido van Rossum | cc2b016 | 2007-02-11 06:12:03 +0000 | [diff] [blame] | 165 | for k, v in self.d.items(): |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 166 | self.f[k] = v |
Fred Drake | 004d5e6 | 2000-10-23 17:22:08 +0000 | [diff] [blame] | 167 | |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 168 | def tearDown(self): |
| 169 | self.f.sync() |
| 170 | self.f.close() |
| 171 | if self.fname is None: |
| 172 | return |
Anthony Baxter | 8388895 | 2002-04-23 02:11:05 +0000 | [diff] [blame] | 173 | try: |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 174 | os.remove(self.fname) |
Anthony Baxter | 8388895 | 2002-04-23 02:11:05 +0000 | [diff] [blame] | 175 | except os.error: |
| 176 | pass |
Roger E. Masse | 352e186 | 1997-01-16 22:04:10 +0000 | [diff] [blame] | 177 | |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 178 | def test_getitem(self): |
Guido van Rossum | cc2b016 | 2007-02-11 06:12:03 +0000 | [diff] [blame] | 179 | for k, v in self.d.items(): |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 180 | self.assertEqual(self.f[k], v) |
Roger E. Masse | 352e186 | 1997-01-16 22:04:10 +0000 | [diff] [blame] | 181 | |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 182 | def test_len(self): |
| 183 | self.assertEqual(len(self.f), len(self.d)) |
| 184 | |
| 185 | def test_change(self): |
| 186 | self.f['r'] = 'discovered' |
| 187 | self.assertEqual(self.f['r'], 'discovered') |
| 188 | self.assert_('r' in self.f.keys()) |
| 189 | self.assert_('discovered' in self.f.values()) |
| 190 | |
| 191 | def test_close_and_reopen(self): |
| 192 | if self.fname is None: |
| 193 | # if we're using an in-memory only db, we can't reopen it |
| 194 | # so finish here. |
| 195 | return |
| 196 | self.f.close() |
Martin v. Löwis | 64ce505 | 2007-08-05 15:39:16 +0000 | [diff] [blame] | 197 | self.f = self.do_open(self.fname, 'w') |
Guido van Rossum | cc2b016 | 2007-02-11 06:12:03 +0000 | [diff] [blame] | 198 | for k, v in self.d.items(): |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 199 | self.assertEqual(self.f[k], v) |
| 200 | |
| 201 | def assertSetEquals(self, seqn1, seqn2): |
Thomas Wouters | 0e3f591 | 2006-08-11 14:57:12 +0000 | [diff] [blame] | 202 | self.assertEqual(set(seqn1), set(seqn2)) |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 203 | |
| 204 | def test_mapping_iteration_methods(self): |
| 205 | f = self.f |
| 206 | d = self.d |
| 207 | self.assertSetEquals(d, f) |
| 208 | self.assertSetEquals(d.keys(), f.keys()) |
| 209 | self.assertSetEquals(d.values(), f.values()) |
| 210 | self.assertSetEquals(d.items(), f.items()) |
Guido van Rossum | cc2b016 | 2007-02-11 06:12:03 +0000 | [diff] [blame] | 211 | self.assertSetEquals(d.keys(), f.keys()) |
| 212 | self.assertSetEquals(d.values(), f.values()) |
| 213 | self.assertSetEquals(d.items(), f.items()) |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 214 | |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 215 | def test_iter_while_modifying_values(self): |
| 216 | if not hasattr(self.f, '__iter__'): |
| 217 | return |
| 218 | |
| 219 | di = iter(self.d) |
| 220 | while 1: |
| 221 | try: |
Georg Brandl | a18af4e | 2007-04-21 15:47:16 +0000 | [diff] [blame] | 222 | key = next(di) |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 223 | self.d[key] = 'modified '+key |
| 224 | except StopIteration: |
| 225 | break |
| 226 | |
| 227 | # it should behave the same as a dict. modifying values |
| 228 | # of existing keys should not break iteration. (adding |
| 229 | # or removing keys should) |
| 230 | fi = iter(self.f) |
| 231 | while 1: |
| 232 | try: |
Georg Brandl | a18af4e | 2007-04-21 15:47:16 +0000 | [diff] [blame] | 233 | key = next(fi) |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 234 | self.f[key] = 'modified '+key |
| 235 | except StopIteration: |
| 236 | break |
| 237 | |
| 238 | self.test_mapping_iteration_methods() |
| 239 | |
| 240 | def test_iteritems_while_modifying_values(self): |
| 241 | if not hasattr(self.f, 'iteritems'): |
| 242 | return |
| 243 | |
Brett Cannon | 5b8d24a | 2007-02-22 06:12:19 +0000 | [diff] [blame] | 244 | di = iter(self.d.items()) |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 245 | while 1: |
| 246 | try: |
Georg Brandl | a18af4e | 2007-04-21 15:47:16 +0000 | [diff] [blame] | 247 | k, v = next(di) |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 248 | self.d[k] = 'modified '+v |
| 249 | except StopIteration: |
| 250 | break |
| 251 | |
| 252 | # it should behave the same as a dict. modifying values |
| 253 | # of existing keys should not break iteration. (adding |
| 254 | # or removing keys should) |
Brett Cannon | 5b8d24a | 2007-02-22 06:12:19 +0000 | [diff] [blame] | 255 | fi = iter(self.f.items()) |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 256 | while 1: |
| 257 | try: |
Georg Brandl | a18af4e | 2007-04-21 15:47:16 +0000 | [diff] [blame] | 258 | k, v = next(fi) |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 259 | self.f[k] = 'modified '+v |
| 260 | except StopIteration: |
| 261 | break |
| 262 | |
| 263 | self.test_mapping_iteration_methods() |
| 264 | |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 265 | def test_first_next_looping(self): |
| 266 | items = [self.f.first()] |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 267 | for i in range(1, len(self.f)): |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 268 | items.append(self.f.next()) |
| 269 | self.assertSetEquals(items, self.d.items()) |
| 270 | |
| 271 | def test_previous_last_looping(self): |
| 272 | items = [self.f.last()] |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 273 | for i in range(1, len(self.f)): |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 274 | items.append(self.f.previous()) |
| 275 | self.assertSetEquals(items, self.d.items()) |
| 276 | |
Gregory P. Smith | 07aec08 | 2007-08-24 05:32:10 +0000 | [diff] [blame] | 277 | def test_first_while_deleting(self): |
| 278 | # Test for bug 1725856 |
| 279 | self.assert_(len(self.d) >= 2, "test requires >=2 items") |
| 280 | for _ in self.d: |
| 281 | key = self.f.first()[0] |
| 282 | del self.f[key] |
| 283 | self.assertEqual(0, len(self.f), "expected empty db after test") |
| 284 | |
| 285 | def test_last_while_deleting(self): |
| 286 | # Test for bug 1725856's evil twin |
| 287 | self.assert_(len(self.d) >= 2, "test requires >=2 items") |
| 288 | for _ in self.d: |
| 289 | key = self.f.last()[0] |
| 290 | del self.f[key] |
| 291 | self.assertEqual(0, len(self.f), "expected empty db after test") |
| 292 | |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 293 | def test_set_location(self): |
| 294 | self.assertEqual(self.f.set_location('e'), ('e', self.d['e'])) |
| 295 | |
| 296 | def test_contains(self): |
| 297 | for k in self.d: |
| 298 | self.assert_(k in self.f) |
| 299 | self.assert_('not here' not in self.f) |
| 300 | |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 301 | def test_clear(self): |
| 302 | self.f.clear() |
| 303 | self.assertEqual(len(self.f), 0) |
| 304 | |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 305 | def test__no_deadlock_first(self, debug=0): |
| 306 | # do this so that testers can see what function we're in in |
| 307 | # verbose mode when we deadlock. |
| 308 | sys.stdout.flush() |
| 309 | |
| 310 | # in pybsddb's _DBWithCursor this causes an internal DBCursor |
| 311 | # object is created. Other test_ methods in this class could |
| 312 | # inadvertently cause the deadlock but an explicit test is needed. |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 313 | if debug: print("A") |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 314 | k,v = self.f.first() |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 315 | if debug: print("B", k) |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 316 | self.f[k] = "deadlock. do not pass go. do not collect $200." |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 317 | if debug: print("C") |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 318 | # if the bsddb implementation leaves the DBCursor open during |
| 319 | # the database write and locking+threading support is enabled |
| 320 | # the cursor's read lock will deadlock the write lock request.. |
| 321 | |
| 322 | # test the iterator interface (if present) |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 323 | if hasattr(self.f, 'iteritems'): |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 324 | if debug: print("D") |
Brett Cannon | 5b8d24a | 2007-02-22 06:12:19 +0000 | [diff] [blame] | 325 | i = iter(self.f.items()) |
Georg Brandl | a18af4e | 2007-04-21 15:47:16 +0000 | [diff] [blame] | 326 | k,v = next(i) |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 327 | if debug: print("E") |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 328 | self.f[k] = "please don't deadlock" |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 329 | if debug: print("F") |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 330 | while 1: |
| 331 | try: |
Georg Brandl | a18af4e | 2007-04-21 15:47:16 +0000 | [diff] [blame] | 332 | k,v = next(i) |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 333 | except StopIteration: |
| 334 | break |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 335 | if debug: print("F2") |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 336 | |
| 337 | i = iter(self.f) |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 338 | if debug: print("G") |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 339 | while i: |
| 340 | try: |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 341 | if debug: print("H") |
Georg Brandl | a18af4e | 2007-04-21 15:47:16 +0000 | [diff] [blame] | 342 | k = next(i) |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 343 | if debug: print("I") |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 344 | self.f[k] = "deadlocks-r-us" |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 345 | if debug: print("J") |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 346 | except StopIteration: |
| 347 | i = None |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 348 | if debug: print("K") |
Gregory P. Smith | dc113a8 | 2003-11-02 09:10:16 +0000 | [diff] [blame] | 349 | |
| 350 | # test the legacy cursor interface mixed with writes |
| 351 | self.assert_(self.f.first()[0] in self.d) |
| 352 | k = self.f.next()[0] |
| 353 | self.assert_(k in self.d) |
| 354 | self.f[k] = "be gone with ye deadlocks" |
| 355 | self.assert_(self.f[k], "be gone with ye deadlocks") |
| 356 | |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 357 | def test_for_cursor_memleak(self): |
| 358 | if not hasattr(self.f, 'iteritems'): |
| 359 | return |
| 360 | |
| 361 | # do the bsddb._DBWithCursor _iter_mixin internals leak cursors? |
| 362 | nc1 = len(self.f._cursor_refs) |
| 363 | # create iterator |
Guido van Rossum | 63eecc7 | 2007-02-22 23:55:25 +0000 | [diff] [blame] | 364 | i = iter(self.f.iteritems()) |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 365 | nc2 = len(self.f._cursor_refs) |
Guido van Rossum | 63eecc7 | 2007-02-22 23:55:25 +0000 | [diff] [blame] | 366 | # use the iterator (should run to the first yield, creating the cursor) |
Georg Brandl | a18af4e | 2007-04-21 15:47:16 +0000 | [diff] [blame] | 367 | k, v = next(i) |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 368 | nc3 = len(self.f._cursor_refs) |
| 369 | # destroy the iterator; this should cause the weakref callback |
| 370 | # to remove the cursor object from self.f._cursor_refs |
| 371 | del i |
| 372 | nc4 = len(self.f._cursor_refs) |
| 373 | |
| 374 | self.assertEqual(nc1, nc2) |
| 375 | self.assertEqual(nc1, nc4) |
Guido van Rossum | 63eecc7 | 2007-02-22 23:55:25 +0000 | [diff] [blame] | 376 | self.assertEqual(nc3, nc1+1) |
Gregory P. Smith | a703a21 | 2003-11-03 01:04:41 +0000 | [diff] [blame] | 377 | |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 378 | def test_popitem(self): |
| 379 | k, v = self.f.popitem() |
| 380 | self.assert_(k in self.d) |
| 381 | self.assert_(v in self.d.values()) |
| 382 | self.assert_(k not in self.f) |
| 383 | self.assertEqual(len(self.d)-1, len(self.f)) |
| 384 | |
| 385 | def test_pop(self): |
| 386 | k = 'w' |
| 387 | v = self.f.pop(k) |
| 388 | self.assertEqual(v, self.d[k]) |
| 389 | self.assert_(k not in self.f) |
| 390 | self.assert_(v not in self.f.values()) |
| 391 | self.assertEqual(len(self.d)-1, len(self.f)) |
| 392 | |
| 393 | def test_get(self): |
| 394 | self.assertEqual(self.f.get('NotHere'), None) |
| 395 | self.assertEqual(self.f.get('NotHere', 'Default'), 'Default') |
| 396 | self.assertEqual(self.f.get('q', 'Default'), self.d['q']) |
| 397 | |
| 398 | def test_setdefault(self): |
| 399 | self.assertEqual(self.f.setdefault('new', 'dog'), 'dog') |
| 400 | self.assertEqual(self.f.setdefault('r', 'cat'), self.d['r']) |
| 401 | |
| 402 | def test_update(self): |
| 403 | new = dict(y='life', u='of', i='brian') |
| 404 | self.f.update(new) |
| 405 | self.d.update(new) |
Guido van Rossum | cc2b016 | 2007-02-11 06:12:03 +0000 | [diff] [blame] | 406 | for k, v in self.d.items(): |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 407 | self.assertEqual(self.f[k], v) |
| 408 | |
| 409 | def test_keyordering(self): |
| 410 | if self.openmethod[0] is not bsddb.btopen: |
| 411 | return |
Brett Cannon | 5b8d24a | 2007-02-22 06:12:19 +0000 | [diff] [blame] | 412 | keys = sorted(self.d.keys()) |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 413 | self.assertEqual(self.f.first()[0], keys[0]) |
| 414 | self.assertEqual(self.f.next()[0], keys[1]) |
| 415 | self.assertEqual(self.f.last()[0], keys[-1]) |
| 416 | self.assertEqual(self.f.previous()[0], keys[-2]) |
| 417 | self.assertEqual(list(self.f), keys) |
| 418 | |
| 419 | class TestBTree(TestBSDDB): |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 420 | fname = support.TESTFN |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 421 | openmethod = [bsddb.btopen] |
| 422 | |
| 423 | class TestBTree_InMemory(TestBSDDB): |
| 424 | fname = None |
| 425 | openmethod = [bsddb.btopen] |
| 426 | |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 427 | class TestBTree_InMemory_Truncate(TestBSDDB): |
| 428 | fname = None |
| 429 | openflag = 'n' |
| 430 | openmethod = [bsddb.btopen] |
| 431 | |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 432 | class TestHashTable(TestBSDDB): |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 433 | fname = support.TESTFN |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 434 | openmethod = [bsddb.hashopen] |
| 435 | |
| 436 | class TestHashTable_InMemory(TestBSDDB): |
| 437 | fname = None |
| 438 | openmethod = [bsddb.hashopen] |
| 439 | |
| 440 | ## # (bsddb.rnopen,'Record Numbers'), 'put' for RECNO for bsddb 1.85 |
| 441 | ## # appears broken... at least on |
| 442 | ## # Solaris Intel - rmasse 1/97 |
| 443 | |
| 444 | def test_main(verbose=None): |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 445 | support.run_unittest( |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 446 | TestBTree, |
| 447 | TestHashTable, |
| 448 | TestBTree_InMemory, |
| 449 | TestHashTable_InMemory, |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 450 | TestBTree_InMemory_Truncate, |
Raymond Hettinger | d55111f | 2003-09-13 05:51:09 +0000 | [diff] [blame] | 451 | ) |
| 452 | |
| 453 | if __name__ == "__main__": |
| 454 | test_main(verbose=True) |