clap-v3 3.0.0-beta.1

A simple to use, efficient, and full-featured Command Line Argument Parser
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

#[derive(Debug)]
struct Child<T> {
    id: T,
    children: Option<Vec<usize>>,
}

impl<T> Child<T> {
    fn new(id: T) -> Self {
        Child { id, children: None }
    }
}

#[derive(Debug)]
pub struct ChildGraph<T>(Vec<Child<T>>);

impl<T> ChildGraph<T>
where
    T: Sized + PartialEq + Copy + Clone,
{
    pub fn with_capacity(s: usize) -> Self {
        ChildGraph(Vec::with_capacity(s))
    }

    pub fn insert(&mut self, req: T) -> usize {
        if !self.contains(req) {
            let idx = self.0.len();
            self.0.push(Child::new(req));
            idx
        } else {
            self.0
                .iter()
                .enumerate()
                .find(|(_, e)| e.id == req)
                .map(|(i, _)| i)
                .unwrap()
        }
    }

    pub fn insert_child(&mut self, parent: usize, child: T) -> usize {
        let c_idx = self.0.len();
        self.0.push(Child::new(child));
        let parent = &mut self.0[parent];
        if let Some(ref mut v) = parent.children {
            v.push(c_idx);
        } else {
            let mut v = Vec::with_capacity(5);
            v.push(c_idx);
            parent.children = Some(v);
        }

        c_idx
    }

    pub fn iter(&self) -> impl Iterator<Item = &T> {
        self.0.iter().map(|r| &r.id)
    }

    pub fn contains(&self, req: T) -> bool {
        self.0.iter().any(|r| r.id == req)
    }
}