72 lines
1.4 KiB
Rust
72 lines
1.4 KiB
Rust
|
use std::sync::Arc;
|
||
|
|
use serde::{Serialize, Deserialize};
|
||
|
|
use async_trait::async_trait;
|
||
|
|
use tokio::sync::RwLock;
|
||
|
|
|
||
|
|
use crate::data::*;
|
||
|
|
use crate::table::*;
|
||
|
|
use crate::server::Garage;
|
||
|
|
|
||
|
|
|
||
|
|
#[derive(PartialEq, Clone, Debug, Serialize, Deserialize)]
|
||
|
|
pub struct Version {
|
||
|
|
// Primary key
|
||
|
|
pub version: UUID,
|
||
|
|
|
||
|
|
// Actual data: the blocks for this version
|
||
|
|
pub deleted: bool,
|
||
|
|
pub blocks: Vec<VersionBlock>,
|
||
|
|
|
||
|
|
// Back link to bucket+key so that we can figure if
|
||
|
|
// this was deleted later on
|
||
|
|
pub bucket: String,
|
||
|
|
pub key: String,
|
||
|
|
}
|
||
|
|
|
||
|
|
#[derive(PartialEq, Clone, Debug, Serialize, Deserialize)]
|
||
|
|
pub struct VersionBlock {
|
||
|
|
pub offset: u64,
|
||
|
|
pub hash: Hash,
|
||
|
|
}
|
||
|
|
|
||
|
|
impl Entry<Hash, EmptySortKey> for Version {
|
||
|
|
fn partition_key(&self) -> &Hash {
|
||
|
|
&self.version
|
||
|
|
}
|
||
|
|
fn sort_key(&self) -> &EmptySortKey {
|
||
|
|
&EmptySortKey
|
||
|
|
}
|
||
|
|
|
||
|
|
fn merge(&mut self, other: &Self) {
|
||
|
|
if other.deleted {
|
||
|
|
self.deleted = true;
|
||
|
|
self.blocks.clear();
|
||
|
|
} else if !self.deleted {
|
||
|
|
for bi in other.blocks.iter() {
|
||
|
|
match self.blocks.binary_search_by(|x| x.offset.cmp(&bi.offset)) {
|
||
|
|
Ok(_) => (),
|
||
|
|
Err(pos) => {
|
||
|
|
self.blocks.insert(pos, bi.clone());
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
pub struct VersionTable {
|
||
|
|
pub garage: RwLock<Option<Arc<Garage>>>,
|
||
|
|
}
|
||
|
|
|
||
|
|
#[async_trait]
|
||
|
|
impl TableFormat for VersionTable {
|
||
|
|
type P = Hash;
|
||
|
|
type S = EmptySortKey;
|
||
|
|
type E = Version;
|
||
|
|
|
||
|
|
async fn updated(&self, old: Option<&Self::E>, new: &Self::E) {
|
||
|
|
//unimplemented!()
|
||
|
|
// TODO
|
||
|
|
}
|
||
|
|
}
|