1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
/*
*
* This abstraction goal is to leverage all the semantic of Garage K2V+S3,
* to be as tailored as possible to it ; it aims to be a zero-cost abstraction
* compared to when we where directly using the K2V+S3 client.
*
* My idea: we can encapsulate the causality token
* into the object system so it is not exposed.
*/
pub mod in_memory;
pub mod garage;
pub enum Selector<'a> {
Range{ begin: &'a str, end: &'a str },
Filter(u64),
}
pub enum Alternative {
Tombstone,
Value(Vec<u8>),
}
type ConcurrentValues = Vec<Alternative>;
#[derive(Debug)]
pub enum Error {
NotFound,
Internal,
}
pub trait Sto: Sized {
type Builder: RowBuilder<Self>;
type Store: RowStore<Self>;
type Ref: RowRef<Self>;
type Value: RowValue<Self>;
}
pub struct Engine<T: Sto> {
pub bucket: String,
pub row: T::Builder,
}
pub enum AnyEngine {
InMemory(Engine<in_memory::MemTypes>),
Garage(Engine<garage::GrgTypes>),
}
impl AnyEngine {
pub fn engine<X: Sto>(&self) -> &Engine<X> {
match self {
Self::InMemory(x) => x,
Self::Garage(x) => x,
}
}
}
// ------ Row Builder
pub trait RowBuilder<R: Sto>
{
fn row_store(&self) -> R::Store;
}
// ------ Row Store
pub trait RowStore<R: Sto>
{
fn new_row(&self, partition: &str, sort: &str) -> R::Ref;
}
// ------- Row Item
pub trait RowRef<R: Sto>
{
fn set_value(&self, content: Vec<u8>) -> R::Value;
async fn fetch(&self) -> Result<R::Value, Error>;
async fn rm(&self) -> Result<(), Error>;
async fn poll(&self) -> Result<Option<R::Value>, Error>;
}
pub trait RowValue<R: Sto>
{
fn to_ref(&self) -> R::Ref;
fn content(&self) -> ConcurrentValues;
async fn push(&self) -> Result<(), Error>;
}
|
