robinson 0.5.21

For when you go to a lonely island and survival depends on parsing XML.
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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138

use std::fmt;
use std::slice::Iter;

use crate::{
    Document, Name, NameData,
    nodes::{Node, NodeId},
};

impl<'doc, 'input> Node<'doc, 'input> {
    pub fn has_attributes(self) -> bool {
        self.element_data()
            .is_some_and(|element| element.attributes_len != 0)
    }

    pub fn attributes(self) -> Attributes<'doc, 'input> {
        let data = self
            .element_data()
            .map(|element| {
                let start = element.attributes_start as usize;
                let end = start + element.attributes_len as usize;

                &self.doc.attributes[start..end]
            })
            .unwrap_or_default();

        Attributes {
            data: data.iter(),
            doc: self.doc,
        }
    }

    /// ```
    /// # use robinson::Document;
    /// let doc = Document::parse(r#"<root foo="bar" baz="qux"/>"#).unwrap();
    ///
    /// let baz = doc.root_element().attribute("baz");
    ///
    /// assert_eq!(baz, Some("qux"));
    pub fn attribute<N>(self, name: N) -> Option<&'doc str>
    where
        Name<'doc, 'input>: PartialEq<N>,
    {
        self.attributes()
            .find(|attribute| attribute.name() == name)
            .map(|attribute| attribute.value())
    }
}

#[derive(Clone, Copy)]
pub struct Attribute<'doc, 'input> {
    data: &'doc AttributeData<'input>,
    doc: &'doc Document<'input>,
}

impl<'doc, 'input> Attribute<'doc, 'input> {
    pub fn document(self) -> &'doc Document<'input> {
        self.doc
    }

    pub fn name(self) -> Name<'doc, 'input> {
        self.data.name.get(self.doc)
    }

    pub fn value(self) -> &'doc str {
        self.doc.strings.get(self.data.value)
    }
}

#[repr(Rust, packed)]
pub(crate) struct AttributeData<'input> {
    pub(crate) name: NameData<'input>,
    pub(crate) value: NodeId,
}

const _SIZE_OF_ATTRIBUTE_DATA: () = assert!(
    size_of::<AttributeData<'static>>()
        == size_of::<u16>() + 2 * size_of::<usize>() + size_of::<u32>()
);

#[derive(Clone)]
pub struct Attributes<'doc, 'input> {
    data: Iter<'doc, AttributeData<'input>>,
    doc: &'doc Document<'input>,
}

impl<'doc, 'input> Attributes<'doc, 'input> {
    fn get(&self, data: &'doc AttributeData<'input>) -> Attribute<'doc, 'input> {
        Attribute {
            data,
            doc: self.doc,
        }
    }
}

impl<'doc, 'input> Iterator for Attributes<'doc, 'input> {
    type Item = Attribute<'doc, 'input>;

    fn next(&mut self) -> Option<Self::Item> {
        self.data.next().map(|data| self.get(data))
    }

    fn nth(&mut self, n: usize) -> Option<Self::Item> {
        self.data.nth(n).map(|data| self.get(data))
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        self.data.size_hint()
    }
}

impl ExactSizeIterator for Attributes<'_, '_> {}

impl DoubleEndedIterator for Attributes<'_, '_> {
    fn next_back(&mut self) -> Option<Self::Item> {
        self.data.next_back().map(|data| self.get(data))
    }
}

impl fmt::Debug for Attribute<'_, '_> {
    fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
        fmt.debug_struct("Attribute")
            .field("name", &self.name())
            .field("value", &self.value())
            .finish()
    }
}

impl fmt::Debug for Attributes<'_, '_> {
    fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
        let mut fmt = fmt.debug_map();

        for attribute in self.clone() {
            fmt.entry(&attribute.name(), &attribute.value());
        }

        fmt.finish()
    }
}