| Crates.io | cobt |
| lib.rs | cobt |
| version | 0.1.1 |
| created_at | 2025-10-16 17:53:03.563756+00 |
| updated_at | 2025-10-16 17:58:16.751752+00 |
| description | A Cache-Oblivious B-Tree implementation in Rust |
| homepage | |
| repository | https://github.com/Toby-Faucher/cobt |
| max_upload_size | |
| id | 1886470 |
| size | 53,439 |
To start with cobt, add the following to your Cargo.toml file:
[dependencies]
cobt = "0.1"
and add this to you can use it your project:
use cobt::CacheObliviousBTree;
fn main() {
let mut tree = CacheObliviousBTree::new();
for i in 0..20 {
tree.insert(i, format!("value_{}", i));
}
println!("Tree Size {}", tree.len());
for i in [0, 5, 10, 15, 19, 25] {
match tree.search(&i) {
Some(v) => println!("Key {}: {}", i, v),
None => println!("Key {}, not found", i),
}
}
}
Contributions are welcome! Please see CONTRIBUTING.md for guidelines on how to contribute to this project.
Whether you're fixing bugs, adding features, improving documentation, or reporting issues, your help is appreciated.
This project is licensed under the MIT License - see the LICENSE file for details.