#![allow(clippy::extra_unused_lifetimes, clippy::needless_lifetimes)] use std::{ collections::HashSet, sync::{Mutex, MutexGuard}, }; use crate::wchar::prelude::*; use once_cell::sync::Lazy; use crate::parse_constants::SourceRange; #[cfg(test)] use crate::tests::prelude::*; use pcre2::utf32::Regex; static ABBRS: Lazy> = Lazy::new(|| Mutex::new(Default::default())); pub fn with_abbrs(cb: impl FnOnce(&AbbreviationSet) -> R) -> R { let abbrs_g = ABBRS.lock().unwrap(); cb(&abbrs_g) } pub fn with_abbrs_mut(cb: impl FnOnce(&mut AbbreviationSet) -> R) -> R { let mut abbrs_g = ABBRS.lock().unwrap(); cb(&mut abbrs_g) } pub fn abbrs_get_set() -> MutexGuard<'static, AbbreviationSet> { ABBRS.lock().unwrap() } /// Controls where in the command line abbreviations may expand. #[derive(Debug, PartialEq, Clone, Copy)] pub enum Position { Command, // expand in command position Anywhere, // expand in any token } #[derive(Debug)] pub struct Abbreviation { // Abbreviation name. This is unique within the abbreviation set. // This is used as the token to match unless we have a regex. pub name: WString, /// The key (recognized token) - either a literal or a regex pattern. pub key: WString, /// If set, use this regex to recognize tokens. /// If unset, the key is to be interpreted literally. /// Note that the fish interface enforces that regexes match the entire token; /// we accomplish this by surrounding the regex in ^ and $. pub regex: Option>, /// The commands this abbr is valid for (or empty if any) pub commands: Vec, /// Replacement string. pub replacement: WString, /// If set, the replacement is a function name. pub replacement_is_function: bool, /// Expansion position. pub position: Position, /// If set, then move the cursor to the first instance of this string in the expansion. pub set_cursor_marker: Option, /// Mark if we came from a universal variable. pub from_universal: bool, } impl Abbreviation { // Construct from a name, a key which matches a token, a replacement token, a position, and // whether we are derived from a universal variable. pub fn new( name: WString, key: WString, replacement: WString, position: Position, from_universal: bool, ) -> Self { Self { name, key, regex: None, commands: vec![], replacement, replacement_is_function: false, position, set_cursor_marker: None, from_universal, } } // Return true if this is a regex abbreviation. pub fn is_regex(&self) -> bool { self.regex.is_some() } // Return true if we match a token at a given position. pub fn matches(&self, token: &wstr, position: Position, command: &wstr) -> bool { if !self.matches_position(position) { return false; } if !self.commands.is_empty() { if !self.commands.contains(&command.to_owned()) { return false; } } match &self.regex { Some(r) => r .is_match(token.as_char_slice()) .expect("regex match should not error"), None => self.key == token, } } // Return if we expand in a given position. fn matches_position(&self, position: Position) -> bool { return self.position == Position::Anywhere || self.position == position; } } /// The result of an abbreviation expansion. #[derive(Debug, Eq, PartialEq)] pub struct Replacer { /// The string to use to replace the incoming token, either literal or as a function name. /// Exposed for testing. pub replacement: WString, /// If true, treat 'replacement' as the name of a function. pub is_function: bool, /// If set, the cursor should be moved to the first instance of this string in the expansion. pub set_cursor_marker: Option, } pub struct Replacement { /// The original range of the token in the command line. pub range: SourceRange, /// The string to replace with. pub text: WString, /// The new cursor location, or none to use the default. /// This is relative to the original range. pub cursor: Option, } impl Replacement { /// Construct a replacement from a replacer. /// The `range` is the range of the text matched by the replacer in the command line. /// The text is passed in separately as it may be the output of the replacer's function. pub fn new(range: SourceRange, mut text: WString, set_cursor_marker: Option) -> Self { let mut cursor = None; if let Some(set_cursor_marker) = set_cursor_marker { let matched = text .as_char_slice() .windows(set_cursor_marker.len()) .position(|w| w == set_cursor_marker.as_char_slice()); if let Some(start) = matched { text.replace_range(start..(start + set_cursor_marker.len()), L!("")); cursor = Some(start + range.start as usize) } } Self { range, text, cursor, } } } #[derive(Default)] pub struct AbbreviationSet { /// List of abbreviations, in definition order. abbrs: Vec, /// Set of used abbrevation names. /// This is to avoid a linear scan when adding new abbreviations. used_names: HashSet, } impl AbbreviationSet { /// Return the list of replacers for an input token, in priority order. /// The `position` is given to describe where the token was found. pub fn r#match(&self, token: &wstr, position: Position, cmd: &wstr) -> Vec { let mut result = vec![]; // Later abbreviations take precedence so walk backwards. for abbr in self.abbrs.iter().rev() { if abbr.matches(token, position, cmd) { result.push(Replacer { replacement: abbr.replacement.clone(), is_function: abbr.replacement_is_function, set_cursor_marker: abbr.set_cursor_marker.clone(), }); } } return result; } /// Return whether we would have at least one replacer for a given token. pub fn has_match(&self, token: &wstr, position: Position, cmd: &wstr) -> bool { self.abbrs .iter() .any(|abbr| abbr.matches(token, position, cmd)) } /// Add an abbreviation. Any abbreviation with the same name is replaced. pub fn add(&mut self, abbr: Abbreviation) { assert!(!abbr.name.is_empty(), "Invalid name"); let inserted = self.used_names.insert(abbr.name.clone()); if !inserted { // Name was already used, do a linear scan to find it. let index = self .abbrs .iter() .position(|a| a.name == abbr.name) .expect("Abbreviation not found though its name was present"); self.abbrs.remove(index); } self.abbrs.push(abbr); } /// Rename an abbreviation. This asserts that the old name is used, and the new name is not; the /// caller should check these beforehand with has_name(). pub fn rename(&mut self, old_name: &wstr, new_name: &wstr) { let erased = self.used_names.remove(old_name); let inserted = self.used_names.insert(new_name.to_owned()); assert!( erased && inserted, "Old name not found or new name already present" ); for abbr in self.abbrs.iter_mut() { if abbr.name == old_name { abbr.name = new_name.to_owned(); break; } } } /// Erase an abbreviation by name. /// Return true if erased, false if not found. pub fn erase(&mut self, name: &wstr) -> bool { let erased = self.used_names.remove(name); if !erased { return false; } for (index, abbr) in self.abbrs.iter().enumerate().rev() { if abbr.name == name { self.abbrs.remove(index); return true; } } panic!("Unable to find named abbreviation"); } /// Return true if we have an abbreviation with the given name. pub fn has_name(&self, name: &wstr) -> bool { self.used_names.contains(name) } /// Return a reference to the abbreviation list. pub fn list(&self) -> &[Abbreviation] { &self.abbrs } } /// Return the list of replacers for an input token, in priority order, using the global set. /// The `position` is given to describe where the token was found. pub fn abbrs_match(token: &wstr, position: Position, cmd: &wstr) -> Vec { with_abbrs(|set| set.r#match(token, position, cmd)) .into_iter() .collect() } #[test] #[serial] fn rename_abbrs() { let _cleanup = test_init(); use crate::abbrs::{Abbreviation, Position}; use crate::wchar::prelude::*; with_abbrs_mut(|abbrs_g| { let mut add = |name: &wstr, repl: &wstr, position: Position| { abbrs_g.add(Abbreviation { name: name.into(), key: name.into(), regex: None, commands: vec![], replacement: repl.into(), replacement_is_function: false, position, set_cursor_marker: None, from_universal: false, }) }; add(L!("gc"), L!("git checkout"), Position::Command); add(L!("foo"), L!("bar"), Position::Command); add(L!("gx"), L!("git checkout"), Position::Command); add(L!("yin"), L!("yang"), Position::Anywhere); assert!(!abbrs_g.has_name(L!("gcc"))); assert!(abbrs_g.has_name(L!("gc"))); abbrs_g.rename(L!("gc"), L!("gcc")); assert!(abbrs_g.has_name(L!("gcc"))); assert!(!abbrs_g.has_name(L!("gc"))); assert!(!abbrs_g.erase(L!("gc"))); assert!(abbrs_g.erase(L!("gcc"))); assert!(!abbrs_g.erase(L!("gcc"))); }) }