1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
|
use {
super::CommandParts,
crate::{
app::{
AppContext,
AppState,
},
path,
verb::PrefixSearchResult,
},
std::io,
};
/// find the longest common start of a and b
fn common_start<'l>(a: &'l str, b: &str) -> &'l str {
for i in 0..a.len().min(b.len()) {
if a.as_bytes()[i] != b.as_bytes()[i] {
return &a[..i];
}
}
a
}
/// how an input can be completed
#[derive(Debug)]
pub enum Completions {
/// no completion found
None,
/// all possible completions have this common root
Common(String),
/// a list of possible completions
List(Vec<String>),
}
impl Completions {
fn from_list(
completions: Vec<String>,
) -> Self {
let mut iter = completions.iter();
let mut common: &str = match iter.next() {
Some(s) => &s,
_ => { return Self::None; }
};
for c in iter {
common = common_start(common, c);
}
if common.is_empty() {
Self::List(completions)
} else {
Self::Common(common.to_string())
}
}
/// the wholes are assumed to all start with start.
fn for_wholes(
start: &str,
wholes: Vec<&str>,
) -> Self {
let completions = wholes.iter()
.map(|w|
if w.starts_with(start) {
&w[start.len()..]
} else {
// this might become a feature but right now it's a bug
warn!("unexpected non completing whole: {:?}", w);
*w
}
)
.map(|c| c.to_string())
.collect();
Self::from_list(completions)
}
fn for_verb(
start: &str,
con: &AppContext,
) -> Self {
match con.verb_store.search(start) {
PrefixSearchResult::NoMatch => {
Self::None
}
PrefixSearchResult::Match(name, _) => {
if start.len() >= name.len() {
debug_assert!(name == start);
Self::None
} else {
Self::Common(name[start.len()..].to_string())
}
}
PrefixSearchResult::Matches(completions) => Self::for_wholes(
start,
completions,
),
}
}
fn for_path(
arg: &str,
_con: &AppContext,
state: &dyn AppState,
) -> io::Result<Self> {
let c = regex!(r"^(.*?)([^/]*)$").captures(arg).unwrap();
let parent_part = &c[1];
let child_part = &c[2];
let parent = path::path_from(state.selected_path(), parent_part);
if !parent.exists() {
debug!("no path completion possible because {:?} doesn't exist", &parent);
return Ok(Self::None);
}
let mut children = Vec::new();
for entry in parent.read_dir()? {
let entry = entry?;
let mut name = entry.file_name().to_string_lossy().to_string();
if !child_part.is_empty() {
if !name.starts_with(child_part) {
continue;
}
if name==child_part && entry.file_type()?.is_dir() {
name = "/".to_string();
} else {
name.drain(0..child_part.len());
}
}
children.push(name);
}
Ok(Self::from_list(children))
}
fn for_arg(
arg: &str,
con: &AppContext,
state: &dyn AppState,
) -> Self {
// in the future we might offer completion of other types
// of arguments, maybe user supplied, but there's no use case
// now so we'll just assume the user wants to complete a path.
if arg.contains(' ') {
Self::None
} else {
match Self::for_path(arg, con, state) {
Ok(c) => c,
Err(e) => {
warn!("Error while trying to complete path: {:?}", e);
Self::None
}
}
}
}
pub fn for_input(
parts: &CommandParts,
con: &AppContext,
state: &dyn AppState,
) -> Self {
match &parts.verb_invocation {
Some(invocation) if !invocation.is_empty() => {
match &invocation.args {
None => {
// looking into verb completion
Self::for_verb(&invocation.name, con)
}
Some(args) if !args.is_empty() => {
// looking into arg completion
Self::for_arg(args, con, state)
}
_ => {
// nothing possible
Self::None
}
}
}
_ => Self::None, // no possible completion if no verb invocation
}
}
}
|