Fork of https://github.com/oxigraph/oxigraph.git for the purpose of NextGraph project
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
309 lines
9.8 KiB
309 lines
9.8 KiB
//! TODO: This storage is dramatically naive.
|
|
|
|
use crate::storage::StorageError;
|
|
use std::cell::RefCell;
|
|
use std::collections::{BTreeMap, HashMap};
|
|
use std::error::Error;
|
|
use std::mem::transmute;
|
|
use std::rc::{Rc, Weak};
|
|
use std::sync::{Arc, RwLock, RwLockWriteGuard};
|
|
|
|
pub struct ColumnFamilyDefinition {
|
|
pub name: &'static str,
|
|
pub use_iter: bool,
|
|
pub min_prefix_size: usize,
|
|
pub unordered_writes: bool,
|
|
}
|
|
|
|
#[derive(Clone)]
|
|
pub struct Db(Arc<RwLock<HashMap<ColumnFamily, BTreeMap<Vec<u8>, Vec<u8>>>>>);
|
|
|
|
impl Db {
|
|
#[allow(clippy::unnecessary_wraps)]
|
|
pub fn new(column_families: Vec<ColumnFamilyDefinition>) -> Result<Self, StorageError> {
|
|
let mut trees = HashMap::new();
|
|
for cf in column_families {
|
|
trees.insert(ColumnFamily(cf.name), BTreeMap::default());
|
|
}
|
|
trees.entry(ColumnFamily("default")).or_default(); // We make sure that "default" key exists.
|
|
Ok(Self(Arc::new(RwLock::new(trees))))
|
|
}
|
|
|
|
#[allow(clippy::unwrap_in_result)]
|
|
pub fn column_family(&self, name: &'static str) -> Option<ColumnFamily> {
|
|
let name = ColumnFamily(name);
|
|
(self.0.read().unwrap().contains_key(&name)).then(|| name)
|
|
}
|
|
|
|
#[must_use]
|
|
pub fn snapshot(&self) -> Reader {
|
|
Reader(InnerReader::Simple(Arc::clone(&self.0)))
|
|
}
|
|
|
|
#[allow(clippy::unwrap_in_result)]
|
|
pub fn transaction<'a, 'b: 'a, T, E: Error + 'static + From<StorageError>>(
|
|
&'b self,
|
|
f: impl Fn(Transaction<'a>) -> Result<T, E>,
|
|
) -> Result<T, E> {
|
|
f(Transaction(Rc::new(RefCell::new(self.0.write().unwrap()))))
|
|
}
|
|
}
|
|
|
|
#[derive(Clone, Ord, PartialOrd, Eq, PartialEq, Hash)]
|
|
pub struct ColumnFamily(&'static str);
|
|
|
|
pub struct Reader(InnerReader);
|
|
|
|
enum InnerReader {
|
|
Simple(Arc<RwLock<HashMap<ColumnFamily, BTreeMap<Vec<u8>, Vec<u8>>>>>),
|
|
Transaction(
|
|
Weak<RefCell<RwLockWriteGuard<'static, HashMap<ColumnFamily, BTreeMap<Vec<u8>, Vec<u8>>>>>>,
|
|
),
|
|
}
|
|
|
|
impl Reader {
|
|
#[allow(clippy::unwrap_in_result)]
|
|
pub fn get(
|
|
&self,
|
|
column_family: &ColumnFamily,
|
|
key: &[u8],
|
|
) -> Result<Option<Vec<u8>>, StorageError> {
|
|
match &self.0 {
|
|
InnerReader::Simple(reader) => Ok(reader
|
|
.read()
|
|
.unwrap()
|
|
.get(column_family)
|
|
.and_then(|cf| cf.get(key).cloned())),
|
|
InnerReader::Transaction(reader) => {
|
|
if let Some(reader) = reader.upgrade() {
|
|
Ok((*reader)
|
|
.borrow()
|
|
.get(column_family)
|
|
.and_then(|cf| cf.get(key).cloned()))
|
|
} else {
|
|
Err(StorageError::Other(
|
|
"The transaction is already ended".into(),
|
|
))
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#[allow(clippy::unwrap_in_result)]
|
|
pub fn contains_key(
|
|
&self,
|
|
column_family: &ColumnFamily,
|
|
key: &[u8],
|
|
) -> Result<bool, StorageError> {
|
|
match &self.0 {
|
|
InnerReader::Simple(reader) => Ok(reader
|
|
.read()
|
|
.unwrap()
|
|
.get(column_family)
|
|
.map_or(false, |cf| cf.contains_key(key))),
|
|
InnerReader::Transaction(reader) => {
|
|
if let Some(reader) = reader.upgrade() {
|
|
Ok((*reader)
|
|
.borrow()
|
|
.get(column_family)
|
|
.map_or(false, |cf| cf.contains_key(key)))
|
|
} else {
|
|
Err(StorageError::Other(
|
|
"The transaction is already ended".into(),
|
|
))
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
pub fn iter(&self, column_family: &ColumnFamily) -> Result<Iter, StorageError> {
|
|
self.scan_prefix(column_family, &[])
|
|
}
|
|
|
|
#[allow(clippy::unwrap_in_result)]
|
|
pub fn scan_prefix(
|
|
&self,
|
|
column_family: &ColumnFamily,
|
|
prefix: &[u8],
|
|
) -> Result<Iter, StorageError> {
|
|
let data: Vec<_> = match &self.0 {
|
|
InnerReader::Simple(reader) => {
|
|
let trees = reader.read().unwrap();
|
|
let tree = if let Some(tree) = trees.get(column_family) {
|
|
tree
|
|
} else {
|
|
return Ok(Iter {
|
|
iter: Vec::new().into_iter(),
|
|
current: None,
|
|
});
|
|
};
|
|
if prefix.is_empty() {
|
|
tree.iter().map(|(k, v)| (k.clone(), v.clone())).collect()
|
|
} else {
|
|
tree.range(prefix.to_vec()..)
|
|
.take_while(|(k, _)| k.starts_with(prefix))
|
|
.map(|(k, v)| (k.clone(), v.clone()))
|
|
.collect()
|
|
}
|
|
}
|
|
InnerReader::Transaction(reader) => {
|
|
if let Some(reader) = reader.upgrade() {
|
|
let trees = (*reader).borrow();
|
|
let tree = if let Some(tree) = trees.get(column_family) {
|
|
tree
|
|
} else {
|
|
return Ok(Iter {
|
|
iter: Vec::new().into_iter(),
|
|
current: None,
|
|
});
|
|
};
|
|
if prefix.is_empty() {
|
|
tree.iter().map(|(k, v)| (k.clone(), v.clone())).collect()
|
|
} else {
|
|
tree.range(prefix.to_vec()..)
|
|
.take_while(|(k, _)| k.starts_with(prefix))
|
|
.map(|(k, v)| (k.clone(), v.clone()))
|
|
.collect()
|
|
}
|
|
} else {
|
|
return Err(StorageError::Other(
|
|
"The transaction is already ended".into(),
|
|
));
|
|
}
|
|
}
|
|
};
|
|
let mut iter = data.into_iter();
|
|
let current = iter.next();
|
|
Ok(Iter { iter, current })
|
|
}
|
|
|
|
#[allow(clippy::unwrap_in_result)]
|
|
pub fn len(&self, column_family: &ColumnFamily) -> Result<usize, StorageError> {
|
|
match &self.0 {
|
|
InnerReader::Simple(reader) => Ok(reader
|
|
.read()
|
|
.unwrap()
|
|
.get(column_family)
|
|
.map_or(0, BTreeMap::len)),
|
|
InnerReader::Transaction(reader) => {
|
|
if let Some(reader) = reader.upgrade() {
|
|
Ok((*reader)
|
|
.borrow()
|
|
.get(column_family)
|
|
.map_or(0, BTreeMap::len))
|
|
} else {
|
|
Err(StorageError::Other(
|
|
"The transaction is already ended".into(),
|
|
))
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#[allow(clippy::unwrap_in_result)]
|
|
pub fn is_empty(&self, column_family: &ColumnFamily) -> Result<bool, StorageError> {
|
|
match &self.0 {
|
|
InnerReader::Simple(reader) => Ok(reader
|
|
.read()
|
|
.unwrap()
|
|
.get(column_family)
|
|
.map_or(true, BTreeMap::is_empty)),
|
|
InnerReader::Transaction(reader) => {
|
|
if let Some(reader) = reader.upgrade() {
|
|
Ok((*reader)
|
|
.borrow()
|
|
.get(column_family)
|
|
.map_or(true, BTreeMap::is_empty))
|
|
} else {
|
|
Err(StorageError::Other(
|
|
"The transaction is already ended".into(),
|
|
))
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
pub struct Transaction<'a>(
|
|
Rc<RefCell<RwLockWriteGuard<'a, HashMap<ColumnFamily, BTreeMap<Vec<u8>, Vec<u8>>>>>>,
|
|
);
|
|
|
|
impl Transaction<'_> {
|
|
#[allow(unsafe_code, clippy::useless_transmute)]
|
|
pub fn reader(&self) -> Reader {
|
|
// This transmute is safe because we take a weak reference and the only Rc reference used is guarded by the lifetime.
|
|
Reader(InnerReader::Transaction(Rc::downgrade(unsafe {
|
|
transmute(&self.0)
|
|
})))
|
|
}
|
|
|
|
#[allow(clippy::unnecessary_wraps)]
|
|
pub fn contains_key_for_update(
|
|
&self,
|
|
column_family: &ColumnFamily,
|
|
key: &[u8],
|
|
) -> Result<bool, StorageError> {
|
|
Ok((*self.0)
|
|
.borrow()
|
|
.get(column_family)
|
|
.map_or(false, |cf| cf.contains_key(key)))
|
|
}
|
|
|
|
#[allow(clippy::unnecessary_wraps, clippy::unwrap_in_result)]
|
|
pub fn insert(
|
|
&mut self,
|
|
column_family: &ColumnFamily,
|
|
key: &[u8],
|
|
value: &[u8],
|
|
) -> Result<(), StorageError> {
|
|
self.0
|
|
.borrow_mut()
|
|
.get_mut(column_family)
|
|
.unwrap()
|
|
.insert(key.into(), value.into());
|
|
Ok(())
|
|
}
|
|
|
|
pub fn insert_empty(
|
|
&mut self,
|
|
column_family: &ColumnFamily,
|
|
key: &[u8],
|
|
) -> Result<(), StorageError> {
|
|
self.insert(column_family, key, &[])
|
|
}
|
|
|
|
#[allow(clippy::unnecessary_wraps, clippy::unwrap_in_result)]
|
|
pub fn remove(&mut self, column_family: &ColumnFamily, key: &[u8]) -> Result<(), StorageError> {
|
|
self.0
|
|
.borrow_mut()
|
|
.get_mut(column_family)
|
|
.unwrap()
|
|
.remove(key);
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
pub struct Iter {
|
|
iter: std::vec::IntoIter<(Vec<u8>, Vec<u8>)>,
|
|
current: Option<(Vec<u8>, Vec<u8>)>,
|
|
}
|
|
|
|
impl Iter {
|
|
pub fn key(&self) -> Option<&[u8]> {
|
|
Some(&self.current.as_ref()?.0)
|
|
}
|
|
|
|
#[allow(dead_code)]
|
|
pub fn value(&self) -> Option<&[u8]> {
|
|
Some(&self.current.as_ref()?.1)
|
|
}
|
|
|
|
pub fn next(&mut self) {
|
|
self.current = self.iter.next();
|
|
}
|
|
|
|
#[allow(clippy::unnecessary_wraps, clippy::unused_self)]
|
|
pub fn status(&self) -> Result<(), StorageError> {
|
|
Ok(())
|
|
}
|
|
}
|
|
|