assemblist 1.1.0

Define your builder patterns as you use them.
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

use proc_macro2::TokenStream;
use std::result::Result;

use super::{ordered_gens::OrderedGenericList, usual_args::UsualArg};
use crate::model::section::Section;

pub struct BrowsingChain<'a> {
    depth: usize,
    section: &'a Section,
    args: Vec<UsualArg>,
    gen_list: OrderedGenericList,
    previous: Option<&'a BrowsingChain<'a>>,
}

impl<'a> BrowsingChain<'a> {
    pub fn new(section: &'a Section) -> Result<BrowsingChain<'a>, TokenStream> {
        Self::create(None, section)
    }

    pub fn concat(&'a self, section: &'a Section) -> Result<BrowsingChain<'a>, TokenStream> {
        Self::create(Some(self), section)
    }

    pub fn create(
        previous: Option<&'a BrowsingChain<'a>>,
        section: &'a Section,
    ) -> Result<BrowsingChain<'a>, TokenStream> {
        let args = UsualArg::extract_usual_args(&section.inputs)?;
        let depth = match previous {
            Some(previous) => previous.depth + 1,
            None => 0,
        };
        let gen_list = match previous {
            Some(previous) => {
                OrderedGenericList::augment(Some(&previous.gen_list), &section.generics)
            }
            None => OrderedGenericList::augment(None, &section.generics),
        };
        let chain = BrowsingChain {
            previous,
            section,
            args,
            gen_list,
            depth,
        };
        Ok(chain)
    }

    pub fn depth(&self) -> usize {
        self.depth
    }

    pub fn section(&self) -> &Section {
        self.section
    }

    pub fn args(&self) -> &Vec<UsualArg> {
        &self.args
    }

    pub fn generics(&self) -> &OrderedGenericList {
        &self.gen_list
    }

    pub fn previous(&'a self) -> Option<&'a BrowsingChain<'a>> {
        self.previous
    }

    pub fn is_last(&self) -> bool {
        self.previous.is_none()
    }
}

impl<'a> IntoIterator for &'a BrowsingChain<'a> {
    type Item = &'a BrowsingChain<'a>;

    type IntoIter = BrowsingChainIterator<'a>;

    fn into_iter(self) -> Self::IntoIter {
        BrowsingChainIterator { chain: Some(self) }
    }
}

pub struct BrowsingChainIterator<'a> {
    chain: Option<&'a BrowsingChain<'a>>,
}

impl<'a> Iterator for BrowsingChainIterator<'a> {
    type Item = &'a BrowsingChain<'a>;

    fn next(&mut self) -> Option<Self::Item> {
        match self.chain {
            Some(current) => {
                self.chain = current.previous;
                Some(current)
            }
            None => None,
        }
    }
}