b-table

Crates.iob-table
lib.rsb-table
created_at2023-07-24 18:25:53.729113
updated_at2023-12-20 05:50:13.567579
descriptionA persistent database table based on b-tree
homepage
repositoryhttps://github.com/haydnv/b-table
max_upload_size
id924845
Haydn Vestal

documentation

README

# b-table A persistent database table based on [b-tree](https://github.com/haydnv/b-tree), with support for multiple indices. Example usage: ```rust use b_table::{Collator, Schema, TableLock}; enum ColumnValue { U64(u64), Str(String), } # ... // note: b-table provides a Schema trait but not a struct which implements it let schema = Schema::new( ["zero", "one", "two", "value"], [ ("index_one", ["one", "zero", "two"]), ("index_two", ["two", "zero", "one"]), ] ); let key: Vec = vec![0.into(), 0.into(), 0.into()]; let value: Vec = vec!["value".into()]; let table = TableLock::create(schema, Collator::new(), dir)?; { let mut table = table.write().await; // or table.try_write()? table.upsert(key.clone(), value.clone()).await?; assert_eq!(table.get_value(key.clone())).await?, Ok(Some(value.clone())); } let mut expected_row = key; expected_row.extend(value); { let order = &["two", "one", "zero"]; let range = [("one", 0)].into_iter().collect(); let table = table.read().await; // or table.try_read()? let mut rows = table.rows(order, range, Some(&["value"]))?; assert_eq!(rows.try_next().await, Ok(Some(expected_row))); } ```
Commit count: 98

cargo fmt