575 lines · 18.3 KB · Rust
RawDownload
use aho_corasick::{AhoCorasick, AhoCorasickBuilder};use anyhow::Result;use client::proto;use fancy_regex::{Captures, Regex, RegexBuilder};use gpui::Entity;use language::{Buffer, BufferSnapshot, CharKind};use smol::future::yield_now;use std::{    borrow::Cow,    io::{BufRead, BufReader, Read},    ops::Range,    path::Path,    sync::{Arc, LazyLock},};use text::Anchor;use util::paths::PathMatcher; #[derive(Debug)]pub enum SearchResult {    Buffer {        buffer: Entity<Buffer>,        ranges: Vec<Range<Anchor>>,    },    LimitReached,} #[derive(Clone, Copy, PartialEq)]pub enum SearchInputKind {    Query,    Include,    Exclude,} #[derive(Clone, Debug)]pub struct SearchInputs {    query: Arc<str>,    files_to_include: PathMatcher,    files_to_exclude: PathMatcher,    match_full_paths: bool,    buffers: Option<Vec<Entity<Buffer>>>,} impl SearchInputs {    pub fn as_str(&self) -> &str {        self.query.as_ref()    }    pub fn files_to_include(&self) -> &PathMatcher {        &self.files_to_include    }    pub fn files_to_exclude(&self) -> &PathMatcher {        &self.files_to_exclude    }    pub fn buffers(&self) -> &Option<Vec<Entity<Buffer>>> {        &self.buffers    }}#[derive(Clone, Debug)]pub enum SearchQuery {    Text {        search: AhoCorasick,        replacement: Option<String>,        whole_word: bool,        case_sensitive: bool,        include_ignored: bool,        inner: SearchInputs,    },     Regex {        regex: Regex,        replacement: Option<String>,        multiline: bool,        whole_word: bool,        case_sensitive: bool,        include_ignored: bool,        one_match_per_line: bool,        inner: SearchInputs,    },} static WORD_MATCH_TEST: LazyLock<Regex> = LazyLock::new(|| {    RegexBuilder::new(r"\B")        .build()        .expect("Failed to create WORD_MATCH_TEST")}); impl SearchQuery {    /// Create a text query    ///    /// If `match_full_paths` is true, include/exclude patterns will always be matched against fully qualified project paths beginning with a project root.    /// If `match_full_paths` is false, patterns will be matched against full paths only when the project has multiple roots.    pub fn text(        query: impl ToString,        whole_word: bool,        case_sensitive: bool,        include_ignored: bool,        files_to_include: PathMatcher,        files_to_exclude: PathMatcher,        match_full_paths: bool,        buffers: Option<Vec<Entity<Buffer>>>,    ) -> Result<Self> {        let query = query.to_string();        if !case_sensitive && !query.is_ascii() {            // AhoCorasickBuilder doesn't support case-insensitive search with unicode characters            // Fallback to regex search as recommended by            // https://docs.rs/aho-corasick/1.1/aho_corasick/struct.AhoCorasickBuilder.html#method.ascii_case_insensitive            return Self::regex(                regex::escape(&query),                whole_word,                case_sensitive,                include_ignored,                false,                files_to_include,                files_to_exclude,                false,                buffers,            );        }        let search = AhoCorasickBuilder::new()            .ascii_case_insensitive(!case_sensitive)            .build([&query])?;        let inner = SearchInputs {            query: query.into(),            files_to_exclude,            files_to_include,            match_full_paths,            buffers,        };        Ok(Self::Text {            search,            replacement: None,            whole_word,            case_sensitive,            include_ignored,            inner,        })    }     /// Create a regex query    ///    /// If `match_full_paths` is true, include/exclude patterns will be matched against fully qualified project paths    /// beginning with a project root name. If false, they will be matched against project-relative paths (which don't start    /// with their respective project root).    pub fn regex(        query: impl ToString,        whole_word: bool,        case_sensitive: bool,        include_ignored: bool,        one_match_per_line: bool,        files_to_include: PathMatcher,        files_to_exclude: PathMatcher,        match_full_paths: bool,        buffers: Option<Vec<Entity<Buffer>>>,    ) -> Result<Self> {        let mut query = query.to_string();        let initial_query = Arc::from(query.as_str());        if whole_word {            let mut word_query = String::new();            if let Some(first) = query.get(0..1) {                if WORD_MATCH_TEST.is_match(first).is_ok_and(|x| !x) {                    word_query.push_str("\\b");                }            }            word_query.push_str(&query);            if let Some(last) = query.get(query.len() - 1..) {                if WORD_MATCH_TEST.is_match(last).is_ok_and(|x| !x) {                    word_query.push_str("\\b");                }            }            query = word_query        }         let multiline = query.contains('\n') || query.contains("\\n");        let regex = RegexBuilder::new(&query)            .case_insensitive(!case_sensitive)            .build()?;        let inner = SearchInputs {            query: initial_query,            files_to_exclude,            files_to_include,            match_full_paths,            buffers,        };        Ok(Self::Regex {            regex,            replacement: None,            multiline,            whole_word,            case_sensitive,            include_ignored,            inner,            one_match_per_line,        })    }     pub fn from_proto(message: proto::SearchQuery) -> Result<Self> {        if message.regex {            Self::regex(                message.query,                message.whole_word,                message.case_sensitive,                message.include_ignored,                false,                deserialize_path_matches(&message.files_to_include)?,                deserialize_path_matches(&message.files_to_exclude)?,                message.match_full_paths,                None, // search opened only don't need search remote            )        } else {            Self::text(                message.query,                message.whole_word,                message.case_sensitive,                message.include_ignored,                deserialize_path_matches(&message.files_to_include)?,                deserialize_path_matches(&message.files_to_exclude)?,                false,                None, // search opened only don't need search remote            )        }    }     pub fn with_replacement(mut self, new_replacement: String) -> Self {        match self {            Self::Text {                ref mut replacement,                ..            }            | Self::Regex {                ref mut replacement,                ..            } => {                *replacement = Some(new_replacement);                self            }        }    }     pub fn to_proto(&self) -> proto::SearchQuery {        proto::SearchQuery {            query: self.as_str().to_string(),            regex: self.is_regex(),            whole_word: self.whole_word(),            case_sensitive: self.case_sensitive(),            include_ignored: self.include_ignored(),            files_to_include: self.files_to_include().sources().join(","),            files_to_exclude: self.files_to_exclude().sources().join(","),            match_full_paths: self.match_full_paths(),        }    }     pub(crate) fn detect(        &self,        mut reader: BufReader<Box<dyn Read + Send + Sync>>,    ) -> Result<bool> {        if self.as_str().is_empty() {            return Ok(false);        }         match self {            Self::Text { search, .. } => {                let mat = search.stream_find_iter(reader).next();                match mat {                    Some(Ok(_)) => Ok(true),                    Some(Err(err)) => Err(err.into()),                    None => Ok(false),                }            }            Self::Regex {                regex, multiline, ..            } => {                if *multiline {                    let mut text = String::new();                    if let Err(err) = reader.read_to_string(&mut text) {                        Err(err.into())                    } else {                        Ok(regex.find(&text)?.is_some())                    }                } else {                    for line in reader.lines() {                        let line = line?;                        if regex.find(&line)?.is_some() {                            return Ok(true);                        }                    }                    Ok(false)                }            }        }    }    /// Returns the replacement text for this `SearchQuery`.    pub fn replacement(&self) -> Option<&str> {        match self {            SearchQuery::Text { replacement, .. } | SearchQuery::Regex { replacement, .. } => {                replacement.as_deref()            }        }    }    /// Replaces search hits if replacement is set. `text` is assumed to be a string that matches this `SearchQuery` exactly, without any leftovers on either side.    pub fn replacement_for<'a>(&self, text: &'a str) -> Option<Cow<'a, str>> {        match self {            SearchQuery::Text { replacement, .. } => replacement.clone().map(Cow::from),            SearchQuery::Regex {                regex, replacement, ..            } => {                if let Some(replacement) = replacement {                    static TEXT_REPLACEMENT_SPECIAL_CHARACTERS_REGEX: LazyLock<Regex> =                        LazyLock::new(|| Regex::new(r"\\\\|\\n|\\t").unwrap());                    let replacement = TEXT_REPLACEMENT_SPECIAL_CHARACTERS_REGEX.replace_all(                        replacement,                        |c: &Captures| match c.get(0).unwrap().as_str() {                            r"\\" => "\\",                            r"\n" => "\n",                            r"\t" => "\t",                            x => unreachable!("Unexpected escape sequence: {}", x),                        },                    );                    Some(regex.replace(text, replacement))                } else {                    None                }            }        }    }     pub async fn search(        &self,        buffer: &BufferSnapshot,        subrange: Option<Range<usize>>,    ) -> Vec<Range<usize>> {        const YIELD_INTERVAL: usize = 20000;         if self.as_str().is_empty() {            return Default::default();        }         let range_offset = subrange.as_ref().map(|r| r.start).unwrap_or(0);        let rope = if let Some(range) = subrange {            buffer.as_rope().slice(range)        } else {            buffer.as_rope().clone()        };         let mut matches = Vec::new();        match self {            Self::Text {                search, whole_word, ..            } => {                for (ix, mat) in search                    .stream_find_iter(rope.bytes_in_range(0..rope.len()))                    .enumerate()                {                    if (ix + 1) % YIELD_INTERVAL == 0 {                        yield_now().await;                    }                     let mat = mat.unwrap();                    if *whole_word {                        let classifier = buffer.char_classifier_at(range_offset + mat.start());                         let prev_kind = rope                            .reversed_chars_at(mat.start())                            .next()                            .map(|c| classifier.kind(c));                        let start_kind =                            classifier.kind(rope.chars_at(mat.start()).next().unwrap());                        let end_kind =                            classifier.kind(rope.reversed_chars_at(mat.end()).next().unwrap());                        let next_kind = rope.chars_at(mat.end()).next().map(|c| classifier.kind(c));                        if (Some(start_kind) == prev_kind && start_kind == CharKind::Word)                            || (Some(end_kind) == next_kind && end_kind == CharKind::Word)                        {                            continue;                        }                    }                    matches.push(mat.start()..mat.end())                }            }             Self::Regex {                regex, multiline, ..            } => {                if *multiline {                    let text = rope.to_string();                    for (ix, mat) in regex.find_iter(&text).enumerate() {                        if (ix + 1) % YIELD_INTERVAL == 0 {                            yield_now().await;                        }                         if let Ok(mat) = mat {                            matches.push(mat.start()..mat.end());                        }                    }                } else {                    let mut line = String::new();                    let mut line_offset = 0;                    for (chunk_ix, chunk) in rope.chunks().chain(["\n"]).enumerate() {                        if (chunk_ix + 1) % YIELD_INTERVAL == 0 {                            yield_now().await;                        }                         for (newline_ix, text) in chunk.split('\n').enumerate() {                            if newline_ix > 0 {                                for mat in regex.find_iter(&line).flatten() {                                    let start = line_offset + mat.start();                                    let end = line_offset + mat.end();                                    matches.push(start..end);                                }                                 line_offset += line.len() + 1;                                line.clear();                            }                            line.push_str(text);                        }                    }                }            }        }         matches    }     pub fn is_empty(&self) -> bool {        self.as_str().is_empty()    }     pub fn as_str(&self) -> &str {        self.as_inner().as_str()    }     pub fn whole_word(&self) -> bool {        match self {            Self::Text { whole_word, .. } => *whole_word,            Self::Regex { whole_word, .. } => *whole_word,        }    }     pub fn case_sensitive(&self) -> bool {        match self {            Self::Text { case_sensitive, .. } => *case_sensitive,            Self::Regex { case_sensitive, .. } => *case_sensitive,        }    }     pub fn include_ignored(&self) -> bool {        match self {            Self::Text {                include_ignored, ..            } => *include_ignored,            Self::Regex {                include_ignored, ..            } => *include_ignored,        }    }     pub fn is_regex(&self) -> bool {        matches!(self, Self::Regex { .. })    }     pub fn files_to_include(&self) -> &PathMatcher {        self.as_inner().files_to_include()    }     pub fn files_to_exclude(&self) -> &PathMatcher {        self.as_inner().files_to_exclude()    }     pub fn buffers(&self) -> Option<&Vec<Entity<Buffer>>> {        self.as_inner().buffers.as_ref()    }     pub fn is_opened_only(&self) -> bool {        self.as_inner().buffers.is_some()    }     pub fn filters_path(&self) -> bool {        !(self.files_to_exclude().sources().is_empty()            && self.files_to_include().sources().is_empty())    }     pub fn match_full_paths(&self) -> bool {        self.as_inner().match_full_paths    }     /// Check match full paths to determine whether you're required to pass a fully qualified    /// project path (starts with a project root).    pub fn match_path(&self, file_path: &Path) -> bool {        let mut path = file_path.to_path_buf();        loop {            if self.files_to_exclude().is_match(&path) {                return false;            } else if self.files_to_include().sources().is_empty()                || self.files_to_include().is_match(&path)            {                return true;            } else if !path.pop() {                return false;            }        }    }    pub fn as_inner(&self) -> &SearchInputs {

Lines 1–500 of 575.