blob: 1dbd251c3b45a7a1aa0448d171a55b940709b1e1 (
plain)
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
|
use std::path::PathBuf;
/// A Vec of pathbuf of visited files.
/// It's mostly used as a stack but we want to avoid multiple instances of the
/// same path and visit in a certain order.
/// A `BTreeSet` may be used instead.
/// We also need to drop the queue, which isn't easy with a BTreeSet...
#[derive(Default, Clone)]
pub struct History {
/// The visited paths
pub visited: Vec<PathBuf>,
/// The currently selected index. By default it's the last one.
pub index: usize,
}
impl History {
/// Add a new path in the stack, without duplicates, and select the last
/// one.
pub fn push(&mut self, path: &PathBuf) {
if !self.visited.contains(path) {
self.visited.push(path.to_owned());
self.index = self.len() - 1
}
}
/// True if nothing was visited. Shouldn't be the case...
pub fn is_empty(&self) -> bool {
self.visited.is_empty()
}
/// Number of visited paths.
pub fn len(&self) -> usize {
self.visited.len()
}
/// Select the next visited path.
pub fn next(&mut self) {
if self.is_empty() {
self.index = 0
} else if self.index > 0 {
self.index -= 1;
} else {
self.index = self.len() - 1
}
}
/// Select the previously visited path.
pub fn prev(&mut self) {
if self.is_empty() {
self.index = 0;
} else {
self.index = (self.index + 1) % self.len()
}
}
/// Returns the currently selected visited path.
pub fn selected(&self) -> Option<PathBuf> {
if self.index < self.len() {
Some(self.visited[self.index].clone())
} else {
None
}
}
/// Drop the last visited paths from the stack, after the selected one.
/// Used to go back a few steps in time.
pub fn drop_queue(&mut self) {
if self.is_empty() {
return;
}
let final_length = self.len() - self.index;
self.visited.truncate(final_length);
if self.is_empty() {
self.index = 0
} else {
self.index = self.len() - 1
}
}
}
|
