5 unstable releases
0.3.0 | Aug 13, 2024 |
---|---|
0.2.1 | Dec 20, 2023 |
0.2.0 | Nov 6, 2023 |
0.1.1 | Sep 3, 2023 |
0.1.0 | Jul 24, 2023 |
#697 in Database interfaces
45 downloads per month
Used in 6 crates
(via tc-collection)
79KB
2K
SLoC
b-table
A persistent database table based on b-tree, with support for multiple indices.
Example usage:
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<ColumnValue> = vec![0.into(), 0.into(), 0.into()];
let value: Vec<ColumnValue> = 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)));
}
Dependencies
~4–11MB
~109K SLoC