meilisearch/meilisearch-schema/src/schema.rs

use std::collections::{HashMap, HashSet};

use serde::{Serialize, Deserialize};

use crate::{FieldsMap, FieldId, SResult, Error, IndexedPos};

#[derive(Clone, Debug, Default, Serialize, Deserialize)]
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 set_identifier(&mut self, id: String) -> SResult<()> {
        match self.get_id(id.clone()) {
            Some(id) => {
                self.identifier = id;
                Ok(())
            },
            None => Err(Error::FieldNameNotFound(id))
        }
    }

    pub fn get_id<S: Into<String>>(&self, name: S) -> Option<FieldId> {
        self.fields_map.get_id(name)
    }

    pub fn get_name<I: Into<FieldId>>(&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 get_ranked(&self) -> HashSet<FieldId> {
        self.ranked.clone()
    }

    pub fn get_ranked_name(&self) -> HashSet<String> {
        self.ranked.iter().filter_map(|a| self.get_name(*a)).collect()
    }

    pub fn get_displayed(&self) -> HashSet<FieldId> {
        self.displayed.clone()
    }

    pub fn get_displayed_name(&self) -> HashSet<String> {
        self.displayed.iter().filter_map(|a| self.get_name(*a)).collect()
    }

    pub fn get_indexed(&self) -> Vec<FieldId> {
        self.indexed.clone()
    }

    pub fn get_indexed_name(&self) -> Vec<String> {
        self.indexed.iter().filter_map(|a| self.get_name(*a)).collect()
    }

    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 remove_ranked<S: Into<String>>(&mut self, name: S) {
        if let Some(id) = self.fields_map.get_id(name.into()) {
            self.ranked.remove(&id);
        }
    }

    pub fn remove_displayed<S: Into<String>>(&mut self, name: S) {
        if let Some(id) = self.fields_map.get_id(name.into()) {
            self.displayed.remove(&id);
        }
    }

    pub fn remove_indexed<S: Into<String>>(&mut self, name: S) {
        if let Some(id) = self.fields_map.get_id(name.into()) {
            self.indexed_map.remove(&id);
            self.indexed.retain(|x| *x != id);
        }
    }

    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).map(|s| *s),
            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).map(|s| *s),
            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).map(|s| *s),
            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 indexed_pos_to_field_id<I: Into<IndexedPos>>(&self, pos: I) -> Option<FieldId> {
        let indexed_pos = pos.into().0 as usize;
        if indexed_pos < self.indexed.len() {
            Some(self.indexed[indexed_pos as usize])
        } else {
            None
        }
    }

    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(())
    }
}