jobber 0.10.5

Command line tool for tracking work time
Documentation 
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

//! Positions within the database.

use itertools::Itertools;

/// Range between two Positions (including both ends).
pub struct PositionalRanges(Vec<(usize, usize)>);

impl PositionalRanges {
    /// Create empty positional range.
    pub const fn new() -> Self {
        Self(Vec::new())
    }
    // Return `true` if list is emtpy.
    pub fn is_empty(&self) -> bool {
        self.0.is_empty()
    }
    /// Add new position to list.
    pub fn push(&mut self, item: (usize, usize)) {
        self.0.push(item)
    }
    /// Return last position in list.
    pub fn last(&self) -> Option<&(usize, usize)> {
        self.0.last()
    }
    /// Return last position in list as mutable.
    pub fn last_mut(&mut self) -> Option<&mut (usize, usize)> {
        self.0.last_mut()
    }
}

impl std::fmt::Display for PositionalRanges {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(
            f,
            "{}",
            self.0
                .iter()
                .map(|(f, t)| {
                    if f == t {
                        format!("{f}", f = f + 1)
                    } else {
                        format!("{f}-{t}", f = f + 1, t = t + 1)
                    }
                })
                .join(",")
        )
    }
}

/// List of positions (indexes) within the database.
#[derive(Clone, Debug)]
pub struct Positions(Vec<usize>);

impl Positions {
    pub fn into_ranges(&self) -> PositionalRanges {
        let mut ranges = PositionalRanges::new();
        for pos in self {
            if ranges.is_empty() {
                ranges.push((pos, pos));
            } else if ranges.last().unwrap().1 == (pos - 1) {
                ranges.last_mut().unwrap().1 = pos;
            } else {
                ranges.push((pos, pos));
            }
        }
        ranges
    }
    /// Return read-only iterator.
    pub fn iter(&self) -> core::slice::Iter<'_, usize> {
        self.0.iter()
    }
    /// Return `true` if list contains position
    pub fn contains(&self, position: &usize) -> bool {
        self.0.contains(position)
    }
}

/// Iterator over positions.
pub struct PositionsIterator<'a> {
    positions: &'a Positions,
    index: usize,
}

impl<'a> Iterator for PositionsIterator<'a> {
    type Item = usize;

    fn next(&mut self) -> Option<Self::Item> {
        if let Some(position) = self.positions.0.get(self.index) {
            self.index += 1;
            Some(*position)
        } else {
            None
        }
    }
}

impl<'a> IntoIterator for &'a Positions {
    type Item = usize;
    type IntoIter = PositionsIterator<'a>;

    fn into_iter(self) -> Self::IntoIter {
        PositionsIterator {
            positions: self,
            index: 0,
        }
    }
}

impl FromIterator<usize> for Positions {
    fn from_iter<T: IntoIterator<Item = usize>>(iter: T) -> Self {
        let mut positions = Positions(Vec::new());
        for i in iter {
            positions.0.push(i)
        }
        positions
    }
}

impl std::fmt::Display for Positions {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}", self.into_ranges())
    }
}