btrees_oobtree_key_value_storage_with_range_search.py

1from BTrees.OOBTree import OOBTree
2
3# Create a new BTree instance (Object-to-Object)
4t = OOBTree()
5
6# Add some data
7t.update({
8    'apple': 'red',
9    'banana': 'yellow',
10    'cherry': 'red',
11    'date': 'brown',
12    'eggplant': 'purple'
13})
14
15# Access values by key
16print(f"The color of an apple is: {t['apple']}")
17
18# Check for existence
19if 'banana' in t:
20    print("Banana is in the tree")
21
22# Range searching: Get all items from 'b' to 'e'
23print("Items from 'b' to 'e':")
24for key, value in t.items('b', 'e'):
25    print(f"{key}: {value}")
26
27# Minimum and maximum keys
28print(f"Minimum key: {t.minKey()}")
29print(f"Maximum key: {t.maxKey()}")