use std::collections::{HashMap, HashSet}; use serde::{Serialize, Deserialize}; use crate::{FieldsMap, FieldId, SResult, Error, IndexedPos}; #[derive(Clone, Debug, Serialize, Deserialize)] pub struct Schema { fields_map: FieldsMap, identifier: FieldId, ranked: HashSet, displayed: HashSet, indexed: Vec, indexed_map: HashMap, must_index_new_fields: bool, } impl Schema { pub fn with_identifier>(name: S) -> Schema { let mut fields_map = FieldsMap::default(); let field_id = fields_map.insert(name.into()).unwrap(); Schema { fields_map, identifier: field_id, ranked: HashSet::new(), displayed: HashSet::new(), indexed: Vec::new(), indexed_map: HashMap::new(), must_index_new_fields: true, } } 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>(&self, name: S) -> Option { self.fields_map.get_id(name) } pub fn get_name>(&self, id: I) -> Option { self.fields_map.get_name(id) } pub fn contains>(&self, name: S) -> bool { self.fields_map.get_id(name.into()).is_some() } pub fn get_or_create_empty>(&mut self, name: S) -> SResult { self.fields_map.insert(name) } pub fn get_or_create + std::clone::Clone>(&mut self, name: S) -> SResult { match self.fields_map.get_id(name.clone()) { Some(id) => { Ok(id) } None => { if self.must_index_new_fields { self.set_indexed(name.clone())?; self.set_displayed(name) } else { self.fields_map.insert(name.clone()) } } } } pub fn get_ranked(&self) -> HashSet { self.ranked.clone() } pub fn get_ranked_name(&self) -> HashSet { self.ranked.iter().filter_map(|a| self.get_name(*a)).collect() } pub fn get_displayed(&self) -> HashSet { self.displayed.clone() } pub fn get_displayed_name(&self) -> HashSet { self.displayed.iter().filter_map(|a| self.get_name(*a)).collect() } pub fn get_indexed(&self) -> Vec { self.indexed.clone() } pub fn get_indexed_name(&self) -> Vec { self.indexed.iter().filter_map(|a| self.get_name(*a)).collect() } pub fn set_ranked>(&mut self, name: S) -> SResult { let id = self.fields_map.insert(name.into())?; self.ranked.insert(id); Ok(id) } pub fn set_displayed>(&mut self, name: S) -> SResult { let id = self.fields_map.insert(name.into())?; self.displayed.insert(id); Ok(id) } pub fn set_indexed>(&mut self, name: S) -> SResult<(FieldId, IndexedPos)> { let id = self.fields_map.insert(name.into())?; if let Some(indexed_pos) = self.indexed_map.get(&id) { return Ok((id, *indexed_pos)) }; 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>(&mut self, name: S) { if let Some(id) = self.fields_map.get_id(name.into()) { self.ranked.remove(&id); } } pub fn remove_displayed>(&mut self, name: S) { if let Some(id) = self.fields_map.get_id(name.into()) { self.displayed.remove(&id); } } pub fn remove_indexed>(&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>(&self, name: S) -> Option { match self.fields_map.get_id(name.into()) { Some(id) => self.ranked.get(&id).map(|s| *s), None => None, } } pub fn is_displayed>(&self, name: S) -> Option { match self.fields_map.get_id(name.into()) { Some(id) => self.displayed.get(&id).map(|s| *s), None => None, } } pub fn is_indexed>(&self, name: S) -> Option { 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>(&self, pos: I) -> Option { 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>(&mut self, data: impl IntoIterator) -> SResult<()> { self.ranked = HashSet::new(); for name in data { self.set_ranked(name)?; } Ok(()) } pub fn update_displayed>(&mut self, data: impl IntoIterator) -> SResult<()> { self.displayed = HashSet::new(); for name in data { self.set_displayed(name)?; } Ok(()) } pub fn update_indexed>(&mut self, data: Vec) -> SResult<()> { self.indexed = Vec::new(); self.indexed_map = HashMap::new(); for name in data { self.set_indexed(name)?; } Ok(()) } pub fn must_index_new_fields(&self) -> bool { self.must_index_new_fields } pub fn set_must_index_new_fields(&mut self, value: bool) { self.must_index_new_fields = value; } }