use crate::file::{LookupTreeNode, MutableSection, SectionBody, SectionId}; use crate::parser::{ParsedSectionHeader, SectionHeaderName}; use crate::{lookup, File}; use std::collections::HashMap; /// Private helper functions impl<'event> File<'event> { /// Adds a new section to the config file. pub(crate) fn push_section_internal( &mut self, header: ParsedSectionHeader<'event>, section: SectionBody<'event>, ) -> MutableSection<'_, 'event> { let new_section_id = SectionId(self.section_id_counter); self.section_headers.insert(new_section_id, header.clone()); self.sections.insert(new_section_id, section); let lookup = self.section_lookup_tree.entry(header.name).or_default(); let mut found_node = false; if let Some(subsection_name) = header.subsection_name { for node in lookup.iter_mut() { if let LookupTreeNode::NonTerminal(subsection) = node { found_node = true; subsection // Clones the cow, not the inner borrowed str. .entry(subsection_name.clone()) .or_default() .push(new_section_id); break; } } if !found_node { let mut map = HashMap::new(); map.insert(subsection_name, vec![new_section_id]); lookup.push(LookupTreeNode::NonTerminal(map)); } } else { for node in lookup.iter_mut() { if let LookupTreeNode::Terminal(vec) = node { found_node = true; vec.push(new_section_id); break; } } if !found_node { lookup.push(LookupTreeNode::Terminal(vec![new_section_id])); } } self.section_order.push_back(new_section_id); self.section_id_counter += 1; self.sections.get_mut(&new_section_id).map(MutableSection::new).unwrap() } /// Returns the mapping between section and subsection name to section ids. pub(crate) fn section_ids_by_name_and_subname<'lookup>( &self, section_name: impl Into>, subsection_name: Option<&'lookup str>, ) -> Result, lookup::existing::Error> { let section_name = section_name.into(); let section_ids = self .section_lookup_tree .get(§ion_name) .ok_or(lookup::existing::Error::SectionMissing)?; let mut maybe_ids = None; // Don't simplify if and matches here -- the for loop currently needs // `n + 1` checks, while the if and matches will result in the for loop // needing `2n` checks. if let Some(subsection_name) = subsection_name { for node in section_ids { if let LookupTreeNode::NonTerminal(subsection_lookup) = node { maybe_ids = subsection_lookup.get(subsection_name); break; } } } else { for node in section_ids { if let LookupTreeNode::Terminal(subsection_lookup) = node { maybe_ids = Some(subsection_lookup); break; } } } maybe_ids .map(Vec::to_owned) .ok_or(lookup::existing::Error::SubSectionMissing) } pub(crate) fn section_ids_by_name<'lookup>( &self, section_name: impl Into>, ) -> Result, lookup::existing::Error> { let section_name = section_name.into(); self.section_lookup_tree .get(§ion_name) .map(|lookup| { lookup .iter() .flat_map(|node| match node { LookupTreeNode::Terminal(v) => v.clone(), LookupTreeNode::NonTerminal(v) => v.values().flatten().copied().collect(), }) .collect() }) .ok_or(lookup::existing::Error::SectionMissing) } // TODO: add note indicating that probably a lot if not all information about the original files is currently lost, // so can't be written back. This will probably change a lot during refactor, so it's not too important now. pub(crate) fn append(&mut self, mut other: Self) { let mut section_indices: Vec<_> = other.section_headers.keys().cloned().collect(); // header keys are numeric and ascend in insertion order, hence sorting them gives the order // in which they appear in the config file. section_indices.sort(); for section_index in section_indices { let section_header = other.section_headers.remove(§ion_index).expect("present"); self.push_section( section_header.name.0, section_header.subsection_name, other.sections.remove(§ion_index).expect("present"), ); } } }