cobt 0.1.1

A Cache-Oblivious B-Tree implementation in Rust
Documentation
  • Coverage
  • 100%
    2 out of 2 items documented1 out of 1 items with examples
  • Size
  • Source code size: 52.94 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 1.59 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 13s Average build duration of successful builds.
  • all releases: 14s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Toby-Faucher/cobt
    0 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • Toby-Faucher

Table of Contents

Quickstart

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),
        }
    }
}

Contributing

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.

License

This project is licensed under the MIT License - see the LICENSE file for details.