42 lines
1.1 KiB
Rust
42 lines
1.1 KiB
Rust
use std::io::{Read, Write};
|
|
|
|
use hashbrown::HashMap;
|
|
use meilisearch_schema::SchemaAttr;
|
|
use serde::{Deserialize, Serialize};
|
|
|
|
use crate::{DocumentId, Number};
|
|
|
|
#[derive(Debug, Default, Clone, PartialEq, Eq, Serialize, Deserialize)]
|
|
#[serde(transparent)]
|
|
pub struct RankedMap(HashMap<(DocumentId, SchemaAttr), Number>);
|
|
|
|
impl RankedMap {
|
|
pub fn len(&self) -> usize {
|
|
self.0.len()
|
|
}
|
|
|
|
pub fn is_empty(&self) -> bool {
|
|
self.0.is_empty()
|
|
}
|
|
|
|
pub fn insert(&mut self, document: DocumentId, attribute: SchemaAttr, number: Number) {
|
|
self.0.insert((document, attribute), number);
|
|
}
|
|
|
|
pub fn remove(&mut self, document: DocumentId, attribute: SchemaAttr) {
|
|
self.0.remove(&(document, attribute));
|
|
}
|
|
|
|
pub fn get(&self, document: DocumentId, attribute: SchemaAttr) -> Option<Number> {
|
|
self.0.get(&(document, attribute)).cloned()
|
|
}
|
|
|
|
pub fn read_from_bin<R: Read>(reader: R) -> bincode::Result<RankedMap> {
|
|
bincode::deserialize_from(reader).map(RankedMap)
|
|
}
|
|
|
|
pub fn write_to_bin<W: Write>(&self, writer: W) -> bincode::Result<()> {
|
|
bincode::serialize_into(writer, &self.0)
|
|
}
|
|
}
|