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

use std::{
    collections::HashMap,
    fmt::{self, Display, Formatter},
    iter,
    rc::Rc,
};

use log::error;

#[derive(Default, Debug, PartialEq, Eq, Hash)]
pub struct Tag {
    name: Rc<String>,
    prefixes: Vec<Rc<String>>,
}

impl Tag {
    pub fn new(name: Rc<String>, prefixes: Vec<Rc<String>>) -> Self {
        Self { name, prefixes }
    }

    pub fn get_name(&self) -> Rc<String> {
        self.name.clone()
    }

    pub fn get_prefixes(&self) -> &Vec<Rc<String>> {
        &self.prefixes
    }
}

#[derive(Default, Debug)]
pub struct Element {
    tag: Tag,
    attrs: HashMap<String, String>,
    children: Vec<Element>,
    level: u32,
}

impl Element {
    pub fn new(tag: Tag, attrs: HashMap<String, String>) -> Self {
        Self {
            tag,
            attrs,
            children: Vec::new(),
            level: 0,
        }
    }

    pub fn append(&mut self, element: Self) {
        self.children.push(element)
    }

    pub fn set_level(&mut self, level: u32) {
        self.level = level;
    }

    pub fn get_attributes(&self) -> &HashMap<String, String> {
        &self.attrs
    }

    pub fn get_tag(&self) -> &Tag {
        &self.tag
    }

    pub fn get_children(&self) -> &Vec<Self> {
        &self.children
    }
}

impl Display for Element {
    fn fmt(&self, formatter: &mut Formatter) -> Result<(), fmt::Error> {
        let tabs = iter::repeat("\t")
            .take(self.level as usize)
            .collect::<String>();
        writeln!(formatter, "{}Element: {}", tabs, self.tag.get_name())?;

        for c in &self.children {
            write!(formatter, "{}", c)?;
        }

        Ok(())
    }
}

#[derive(Default, Debug)]
pub struct ElementContainer {
    stack: Vec<Element>,
    root: Option<Element>,
}

impl ElementContainer {
    pub fn start_element(&mut self, mut element: Element) {
        element.set_level(self.stack.len() as u32);
        self.stack.push(element);
    }

    pub fn end_element(&mut self) {
        self.stack
            .pop()
            .and_then(|element| {
                if self.stack.is_empty() {
                    self.root = Some(element);
                } else {
                    // Append child to current element
                    let last_element = self.stack.len();
                    self.stack[last_element - 1].append(element);
                }

                Some(())
            })
            .unwrap_or_else(|| {
                error!("Received an end element event with an empty stack");
            });
    }

    pub fn get_root(&self) -> &Option<Element> {
        &self.root
    }
}