Class BTreeDict

tests/test_btree.py:8–12 · view source on GitHub ↗

Source from the content-addressed store, hash-verified

6
7
8	class BTreeDict(btree.BTreeDict):
9	# We mostly test with an in-order optimized BTreeDict with t=3 as that's how we
10	# generated the data.
11	def __init__(self, *, t=3, original=None):
12	super().__init__(t=t, original=original, in_order=True)
13
14
15	def add_keys(b, keys):

test_replaceFunction · 0.70

test_min_maxFunction · 0.70

test_nonexistentFunction · 0.70

test_in_orderFunction · 0.70

test_random_treesFunction · 0.70

test_cowFunction · 0.70

test_cow_minimalityFunction · 0.70

test_cursor_seekFunction · 0.70

test_cursor_seek_before_and_afterFunction · 0.70

test_cursor_reversing_in_parentnodeFunction · 0.70

test_cursor_empty_tree_seeksFunction · 0.70

test_parkingFunction · 0.70

no outgoing calls

test_replaceFunction · 0.56

test_min_maxFunction · 0.56

test_nonexistentFunction · 0.56

test_in_orderFunction · 0.56

test_random_treesFunction · 0.56

test_cowFunction · 0.56

test_cow_minimalityFunction · 0.56

test_cursor_seekFunction · 0.56

test_cursor_seek_before_and_afterFunction · 0.56

test_cursor_reversing_in_parentnodeFunction · 0.56

test_cursor_empty_tree_seeksFunction · 0.56

test_parkingFunction · 0.56

searching dependent graphs…