Improvements to matching algorithm
This commit is contained in:
parent
1828414f21
commit
3a6ab38c43
|
|
@ -7,6 +7,10 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
|
||||||
|
|
||||||
## Unreleased
|
## Unreleased
|
||||||
|
|
||||||
|
### Added
|
||||||
|
|
||||||
|
- Manpages for each subcommand.
|
||||||
|
|
||||||
### Fixed
|
### Fixed
|
||||||
|
|
||||||
- `cd -` on fish shells.
|
- `cd -` on fish shells.
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@ name = "zoxide"
|
||||||
version = "0.6.0"
|
version = "0.6.0"
|
||||||
authors = ["Ajeet D'Souza <98ajeet@gmail.com>"]
|
authors = ["Ajeet D'Souza <98ajeet@gmail.com>"]
|
||||||
edition = "2018"
|
edition = "2018"
|
||||||
description = "A faster way to navigate your filesystem"
|
description = "A smarter cd command"
|
||||||
repository = "https://github.com/ajeetdsouza/zoxide/"
|
repository = "https://github.com/ajeetdsouza/zoxide/"
|
||||||
license = "MIT"
|
license = "MIT"
|
||||||
keywords = ["cli"]
|
keywords = ["cli"]
|
||||||
|
|
|
||||||
|
|
@ -2,7 +2,7 @@
|
||||||
|
|
||||||
[![crates.io][crates.io-badge]][crates.io]
|
[![crates.io][crates.io-badge]][crates.io]
|
||||||
|
|
||||||
> A faster way to navigate your filesystem
|
> A smarter cd command
|
||||||
|
|
||||||
`zoxide` is a blazing fast replacement for your `cd` command, inspired by
|
`zoxide` is a blazing fast replacement for your `cd` command, inspired by
|
||||||
[`z`][z] and [`z.lua`][z.lua]. It keeps track of the directories you use most
|
[`z`][z] and [`z.lua`][z.lua]. It keeps track of the directories you use most
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
.TH "zoxide" "1" "2021-04-12" "zoxide" "zoxide"
|
.TH "zoxide" "1" "2021-04-12" "zoxide" "zoxide"
|
||||||
.SH NAME
|
.SH NAME
|
||||||
zoxide - a faster way to navigate your filesystem
|
zoxide - a smarter cd command
|
||||||
.SH SYNOPSIS
|
.SH SYNOPSIS
|
||||||
.B zoxide \fISUBCOMMAND [OPTIONS]\fR
|
.B zoxide \fISUBCOMMAND [OPTIONS]\fR
|
||||||
.SH DESCRIPTION
|
.SH DESCRIPTION
|
||||||
|
|
|
||||||
|
|
@ -8,36 +8,25 @@ impl Query {
|
||||||
I: IntoIterator<Item = S>,
|
I: IntoIterator<Item = S>,
|
||||||
S: AsRef<str>,
|
S: AsRef<str>,
|
||||||
{
|
{
|
||||||
Query(
|
Query(keywords.into_iter().map(|s: S| to_lowercase(s)).collect())
|
||||||
keywords
|
|
||||||
.into_iter()
|
|
||||||
.map(|s: S| s.as_ref().to_lowercase())
|
|
||||||
.collect(),
|
|
||||||
)
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn keywords(&self) -> &[String] {
|
|
||||||
&self.0
|
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn matches<S: AsRef<str>>(&self, path: S) -> bool {
|
pub fn matches<S: AsRef<str>>(&self, path: S) -> bool {
|
||||||
let path = path.as_ref().to_lowercase();
|
let keywords = &self.0;
|
||||||
let keywords = self.keywords();
|
let keywords_last = match keywords.last() {
|
||||||
|
Some(keyword) => keyword,
|
||||||
let get_filenames = || {
|
None => return true,
|
||||||
let query_name = Path::new(keywords.last()?).file_name()?.to_str().unwrap();
|
|
||||||
let dir_name = Path::new(&path).file_name()?.to_str().unwrap();
|
|
||||||
Some((query_name, dir_name))
|
|
||||||
};
|
};
|
||||||
|
|
||||||
if let Some((query_name, dir_name)) = get_filenames() {
|
let path = to_lowercase(path);
|
||||||
if !dir_name.contains(query_name) {
|
|
||||||
return false;
|
let query_name = get_filename(keywords_last);
|
||||||
}
|
let dir_name = get_filename(&path);
|
||||||
|
if !dir_name.contains(query_name) {
|
||||||
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
let mut subpath = path.as_str();
|
let mut subpath = path.as_str();
|
||||||
|
|
||||||
for keyword in keywords.iter() {
|
for keyword in keywords.iter() {
|
||||||
match subpath.find(keyword) {
|
match subpath.find(keyword) {
|
||||||
Some(idx) => subpath = &subpath[idx + keyword.len()..],
|
Some(idx) => subpath = &subpath[idx + keyword.len()..],
|
||||||
|
|
@ -49,6 +38,30 @@ impl Query {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
fn get_filename(path: &str) -> &str {
|
||||||
|
if cfg!(windows) {
|
||||||
|
Path::new(path)
|
||||||
|
.file_name()
|
||||||
|
.unwrap_or_default()
|
||||||
|
.to_str()
|
||||||
|
.unwrap_or_default()
|
||||||
|
} else {
|
||||||
|
match path.rfind('/') {
|
||||||
|
Some(idx) => &path[idx + 1..],
|
||||||
|
None => path,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fn to_lowercase<S: AsRef<str>>(s: S) -> String {
|
||||||
|
let s = s.as_ref();
|
||||||
|
if s.is_ascii() {
|
||||||
|
s.to_ascii_lowercase()
|
||||||
|
} else {
|
||||||
|
s.to_lowercase()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
#[cfg(test)]
|
#[cfg(test)]
|
||||||
mod tests {
|
mod tests {
|
||||||
use super::Query;
|
use super::Query;
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue