Skip to content

Add the 'btree' benchmark. #381

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
nascheme wants to merge 5 commits into
base: main
Choose a base branch
from
Open

Add the 'btree' benchmark. #381

Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
edd2b9b
Add the 'bm_btree' benchmark.
nascheme Jan 29, 2025
bc21dbc
Remove unused methods in BTree classes.
nascheme Jan 30, 2025
52ac69d
Use 'yield from' in some places.
nascheme Jan 30, 2025
cf4ff1a
Add get_min_item() and get_max_item().
nascheme Oct 27, 2025
058c189
Bump required version to 3.9, for randbytes().
nascheme Oct 27, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Add get_min_item() and get_max_item(). 
These were removed to reduce code but they are actually needed by
delete().
  • Loading branch information
@nascheme
nascheme committed Oct 27, 2025
commit cf4ff1a81a809b627edfbed2b8b0f42bdb47142f
18 changes: 18 additions & 0 deletions pyperformance/data-files/benchmarks/bm_btree/run_benchmark.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -133,6 +133,24 @@ def get_level(self):
else:
return 1 + self.nodes[0].get_level()

def get_min_item(self):
"""() -> (key:anything, value:anything)
Return the item with the minimal key.
"""
if self.is_leaf():
return self.items[0]
else:
return self.nodes[0].get_min_item()

def get_max_item(self):
"""() -> (key:anything, value:anything)
Return the item with the maximal key.
"""
if self.is_leaf():
return self.items[-1]
else:
return self.nodes[-1].get_max_item()

def delete(self, key):
"""(key:anything)
Delete the item with this key.
Expand Down