anyreader_walker/
utils.rs

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
use crate::EntryDetails;
use std::path::{Path, PathBuf};

/// A utility struct to keep track of the current archive stack.
/// This is useful when processing nested archives - it supports
/// pushing and popping archives from the stack, and provides the
/// current nested path - including all previous nested paths.
///
/// # Example
/// ```
/// # use std::path::Path;
/// # use anyreader_walker::{ArchiveStack, EntryDetails};
/// let mut stack = ArchiveStack::new();
/// stack.push_details(EntryDetails::new("first.tar", 5));
/// stack.push_details(EntryDetails::new("second.tar", 10));
/// stack.push_details(EntryDetails::new("third.tar", 7));
/// assert_eq!(stack.root_path(), Path::new("first.tar"));
/// assert_eq!(stack.nested_path(), Path::new("second.tar/third.tar"));
/// assert_eq!(stack.current_depth(), 3);
/// stack.pop_details();
/// assert_eq!(stack.nested_path(), Path::new("second.tar"));
/// ```
#[derive(Debug, Default)]
pub struct ArchiveStack {
    stack: smallvec::SmallVec<[EntryDetails; 6]>,
}

impl ArchiveStack {
    pub fn new() -> Self {
        Self::default()
    }

    pub fn last_entry(&self) -> Option<&EntryDetails> {
        self.stack.last()
    }

    pub fn push_details(&mut self, details: EntryDetails) {
        self.stack.push(details);
    }

    pub fn pop_details(&mut self) -> Option<EntryDetails> {
        self.stack.pop()
    }

    pub fn current_depth(&self) -> usize {
        self.stack.len()
    }

    pub fn is_empty(&self) -> bool {
        self.stack.is_empty()
    }

    pub fn full_path(&self) -> PathBuf {
        PathBuf::from_iter(self.stack.iter().map(|d| d.path.as_path()))
    }

    pub fn root_path(&self) -> &Path {
        self.stack
            .first()
            .map(|d| d.path.as_path())
            .unwrap_or(Path::new(""))
    }

    pub fn nested_path(&self) -> PathBuf {
        PathBuf::from_iter(self.nested_path_iter())
    }

    pub fn nested_path_iter(&self) -> impl Iterator<Item = &Path> {
        self.stack.iter().skip(1).map(|d| d.path.as_path())
    }
}