mirror of
https://github.com/meilisearch/meilisearch.git
synced 2024-12-02 18:15:38 +08:00
142 lines
4.0 KiB
Rust
142 lines
4.0 KiB
Rust
|
use std::collections::{HashMap, HashSet};
|
||
|
|
||
|
use crate::{FieldsMap, FieldId, SResult, SchemaAttr};
|
||
|
|
||
|
pub type IndexedPos = SchemaAttr;
|
||
|
|
||
|
#[derive(Default)]
|
||
|
pub struct Schema {
|
||
|
fields_map: FieldsMap,
|
||
|
|
||
|
identifier: FieldId,
|
||
|
ranked: HashSet<FieldId>,
|
||
|
displayed: HashSet<FieldId>,
|
||
|
|
||
|
indexed: Vec<FieldId>,
|
||
|
indexed_map: HashMap<FieldId, IndexedPos>,
|
||
|
}
|
||
|
|
||
|
impl Schema {
|
||
|
|
||
|
pub fn with_identifier<S: Into<String>>(name: S) -> Schema {
|
||
|
let mut schema = Schema::default();
|
||
|
let field_id = schema.fields_map.insert(name.into()).unwrap();
|
||
|
schema.identifier = field_id;
|
||
|
|
||
|
schema
|
||
|
}
|
||
|
|
||
|
pub fn identifier(&self) -> String {
|
||
|
self.fields_map.get_name(self.identifier).unwrap().to_string()
|
||
|
}
|
||
|
|
||
|
pub fn get_id<S: Into<String>>(&self, name: S) -> Option<&FieldId> {
|
||
|
self.fields_map.get_id(name)
|
||
|
}
|
||
|
|
||
|
pub fn get_name<I: Into<SchemaAttr>>(&self, id: I) -> Option<&String> {
|
||
|
self.fields_map.get_name(id)
|
||
|
}
|
||
|
|
||
|
pub fn contains<S: Into<String>>(&self, name: S) -> bool {
|
||
|
match self.fields_map.get_id(name.into()) {
|
||
|
Some(_) => true,
|
||
|
None => false,
|
||
|
}
|
||
|
}
|
||
|
|
||
|
pub fn get_or_create_empty<S: Into<String>>(&mut self, name: S) -> SResult<FieldId> {
|
||
|
self.fields_map.insert(name)
|
||
|
}
|
||
|
|
||
|
pub fn get_or_create<S: Into<String> + std::clone::Clone>(&mut self, name: S) -> SResult<FieldId> {
|
||
|
match self.fields_map.get_id(name.clone()) {
|
||
|
Some(id) => {
|
||
|
Ok(*id)
|
||
|
}
|
||
|
None => {
|
||
|
self.set_indexed(name.clone())?;
|
||
|
self.set_displayed(name)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
pub fn set_ranked<S: Into<String>>(&mut self, name: S) -> SResult<FieldId> {
|
||
|
let id = self.fields_map.insert(name.into())?;
|
||
|
self.ranked.insert(id);
|
||
|
Ok(id)
|
||
|
}
|
||
|
|
||
|
pub fn set_displayed<S: Into<String>>(&mut self, name: S) -> SResult<FieldId> {
|
||
|
let id = self.fields_map.insert(name.into())?;
|
||
|
self.displayed.insert(id);
|
||
|
Ok(id)
|
||
|
}
|
||
|
|
||
|
pub fn set_indexed<S: Into<String>>(&mut self, name: S) -> SResult<(FieldId, IndexedPos)> {
|
||
|
let id = self.fields_map.insert(name.into())?;
|
||
|
let pos = self.indexed.len() as u16;
|
||
|
self.indexed.push(id);
|
||
|
self.indexed_map.insert(id, pos.into());
|
||
|
Ok((id, pos.into()))
|
||
|
}
|
||
|
|
||
|
pub fn is_ranked<S: Into<String>>(&self, name: S) -> Option<&FieldId> {
|
||
|
match self.fields_map.get_id(name.into()) {
|
||
|
Some(id) => self.ranked.get(id),
|
||
|
None => None,
|
||
|
}
|
||
|
}
|
||
|
|
||
|
pub fn is_displayed<S: Into<String>>(&self, name: S) -> Option<&FieldId> {
|
||
|
match self.fields_map.get_id(name.into()) {
|
||
|
Some(id) => self.displayed.get(id),
|
||
|
None => None,
|
||
|
}
|
||
|
}
|
||
|
|
||
|
pub fn is_indexed<S: Into<String>>(&self, name: S) -> Option<&IndexedPos> {
|
||
|
match self.fields_map.get_id(name.into()) {
|
||
|
Some(id) => self.indexed_map.get(id),
|
||
|
None => None,
|
||
|
}
|
||
|
}
|
||
|
|
||
|
pub fn id_is_ranked(&self, id: FieldId) -> bool {
|
||
|
self.ranked.get(&id).is_some()
|
||
|
}
|
||
|
|
||
|
pub fn id_is_displayed(&self, id: FieldId) -> bool {
|
||
|
self.displayed.get(&id).is_some()
|
||
|
}
|
||
|
|
||
|
pub fn id_is_indexed(&self, id: FieldId) -> Option<&IndexedPos> {
|
||
|
self.indexed_map.get(&id)
|
||
|
}
|
||
|
|
||
|
pub fn update_ranked<S: Into<String>>(&mut self, data: impl IntoIterator<Item = S>) -> SResult<()> {
|
||
|
self.ranked = HashSet::new();
|
||
|
for name in data {
|
||
|
self.set_ranked(name)?;
|
||
|
}
|
||
|
Ok(())
|
||
|
}
|
||
|
|
||
|
pub fn update_displayed<S: Into<String>>(&mut self, data: impl IntoIterator<Item = S>) -> SResult<()> {
|
||
|
self.displayed = HashSet::new();
|
||
|
for name in data {
|
||
|
self.set_displayed(name)?;
|
||
|
}
|
||
|
Ok(())
|
||
|
}
|
||
|
|
||
|
pub fn update_indexed<S: Into<String>>(&mut self, data: Vec<S>) -> SResult<()> {
|
||
|
self.indexed = Vec::new();
|
||
|
self.indexed_map = HashMap::new();
|
||
|
for name in data {
|
||
|
self.set_indexed(name)?;
|
||
|
}
|
||
|
Ok(())
|
||
|
}
|
||
|
}
|