59 lines
1.7 KiB
Rust
59 lines
1.7 KiB
Rust
use std::error::Error;
|
|
|
|
use byteorder::{ReadBytesExt, WriteBytesExt};
|
|
use meilidb_core::shared_data_cursor::{SharedDataCursor, FromSharedDataCursor};
|
|
use meilidb_core::write_to_bytes::WriteToBytes;
|
|
use meilidb_core::data::DocIds;
|
|
|
|
use crate::database::RankedMap;
|
|
|
|
pub enum WriteRankedMapEvent<'a> {
|
|
RemovedDocuments(&'a DocIds),
|
|
UpdatedDocuments(&'a RankedMap),
|
|
}
|
|
|
|
impl<'a> WriteToBytes for WriteRankedMapEvent<'a> {
|
|
fn write_to_bytes(&self, bytes: &mut Vec<u8>) {
|
|
match self {
|
|
WriteRankedMapEvent::RemovedDocuments(doc_ids) => {
|
|
let _ = bytes.write_u8(0);
|
|
doc_ids.write_to_bytes(bytes);
|
|
},
|
|
WriteRankedMapEvent::UpdatedDocuments(ranked_map) => {
|
|
let _ = bytes.write_u8(1);
|
|
bincode::serialize_into(bytes, ranked_map).unwrap()
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
pub enum ReadRankedMapEvent {
|
|
RemovedDocuments(DocIds),
|
|
UpdatedDocuments(RankedMap),
|
|
}
|
|
|
|
impl ReadRankedMapEvent {
|
|
pub fn updated_documents(self) -> Option<RankedMap> {
|
|
use ReadRankedMapEvent::*;
|
|
match self {
|
|
RemovedDocuments(_) => None,
|
|
UpdatedDocuments(ranked_map) => Some(ranked_map),
|
|
}
|
|
}
|
|
}
|
|
|
|
impl FromSharedDataCursor for ReadRankedMapEvent {
|
|
type Error = Box<Error>;
|
|
|
|
fn from_shared_data_cursor(cursor: &mut SharedDataCursor) -> Result<Self, Self::Error> {
|
|
match cursor.read_u8()? {
|
|
0 => DocIds::from_shared_data_cursor(cursor).map(ReadRankedMapEvent::RemovedDocuments),
|
|
1 => {
|
|
let ranked_map = bincode::deserialize_from(cursor)?;
|
|
Ok(ReadRankedMapEvent::UpdatedDocuments(ranked_map))
|
|
},
|
|
_ => unreachable!(),
|
|
}
|
|
}
|
|
}
|