MCPcopy Create free account
hub / github.com/KentBeck/BPlusTree3 / keys

Method keys

python/bplustree/bplus_tree.py:449–452  ·  view source on GitHub ↗

Return an iterator over keys in the given range

(self, start_key=None, end_key=None)

Source from the content-addressed store, hash-verified

447 return deleted is not None
448
449 def keys(self, start_key=None, end_key=None) -> Iterator[Any]:
450 """Return an iterator over keys in the given range"""
451 for key, _ in self.items(start_key, end_key):
452 yield key
453
454 def values(self, start_key=None, end_key=None) -> Iterator[Any]:
455 """Return an iterator over values in the given range"""

Callers 15

test_keys_iteratorMethod · 0.95
demo_dict_migrationFunction · 0.95
demo_api_compatibilityFunction · 0.95
mainFunction · 0.95
benchmark_memory_usageFunction · 0.95
clearMethod · 0.95
run_capacity_sweepFunction · 0.45
test_empty_treeFunction · 0.45

Calls 1

itemsMethod · 0.95

Tested by 15

test_keys_iteratorMethod · 0.76
run_capacity_sweepFunction · 0.36
test_empty_treeFunction · 0.36
test_single_itemFunction · 0.36
test_random_insert_smallFunction · 0.36
test_iteration_orderFunction · 0.36
test_string_keysFunction · 0.36