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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
use crate::node::{Attribute, Node};
use std::fmt::Debug;
#[derive(Clone, Debug, PartialEq, Default)]
pub struct Element<NS, TAG, LEAF, ATT, VAL>
where
NS: PartialEq + Clone + Debug,
TAG: PartialEq + Clone + Debug,
LEAF: PartialEq + Clone + Debug,
ATT: PartialEq + Clone + Debug,
VAL: PartialEq + Clone + Debug,
{
pub namespace: Option<NS>,
pub tag: TAG,
pub attrs: Vec<Attribute<NS, ATT, VAL>>,
pub children: Vec<Node<NS, TAG, LEAF, ATT, VAL>>,
pub self_closing: bool,
}
impl<NS, TAG, LEAF, ATT, VAL> Element<NS, TAG, LEAF, ATT, VAL>
where
NS: PartialEq + Clone + Debug,
TAG: PartialEq + Clone + Debug,
LEAF: PartialEq + Clone + Debug,
ATT: PartialEq + Clone + Debug,
VAL: PartialEq + Clone + Debug,
{
pub fn new(
namespace: Option<NS>,
tag: TAG,
attrs: impl IntoIterator<Item = Attribute<NS, ATT, VAL>>,
children: impl IntoIterator<Item = Node<NS, TAG, LEAF, ATT, VAL>>,
self_closing: bool,
) -> Self {
Self {
namespace,
tag,
attrs: attrs.into_iter().collect(),
children: children.into_iter().collect(),
self_closing,
}
}
pub fn add_attributes(
&mut self,
attrs: impl IntoIterator<Item = Attribute<NS, ATT, VAL>>,
) {
self.attrs.extend(attrs)
}
pub fn add_children(
&mut self,
children: impl IntoIterator<Item = Node<NS, TAG, LEAF, ATT, VAL>>,
) {
let mut new_children: Vec<Node<NS, TAG, LEAF, ATT, VAL>> =
children.into_iter().collect();
self.children.append(&mut new_children);
}
pub fn get_children(&self) -> &[Node<NS, TAG, LEAF, ATT, VAL>] {
&self.children
}
pub fn children_mut(&mut self) -> &mut [Node<NS, TAG, LEAF, ATT, VAL>] {
&mut self.children
}
pub fn swap_remove_child(
&mut self,
index: usize,
) -> Node<NS, TAG, LEAF, ATT, VAL> {
self.children.swap_remove(index)
}
pub fn swap_children(&mut self, a: usize, b: usize) {
self.children.swap(a, b)
}
pub fn take_children(self) -> Vec<Node<NS, TAG, LEAF, ATT, VAL>> {
self.children
}
pub fn get_attributes(&self) -> &[Attribute<NS, ATT, VAL>] {
&self.attrs
}
pub fn take_attributes(self) -> Vec<Attribute<NS, ATT, VAL>> {
self.attrs
}
pub fn namespace(&self) -> Option<&NS> {
self.namespace.as_ref()
}
pub fn tag(&self) -> &TAG {
&self.tag
}
pub fn take_tag(self) -> TAG {
self.tag
}
pub fn set_tag(&mut self, tag: TAG) {
self.tag = tag;
}
pub fn remove_attribute(&mut self, key: &ATT) {
self.attrs.retain(|att| att.name != *key)
}
pub fn set_attributes(
&mut self,
attrs: impl IntoIterator<Item = Attribute<NS, ATT, VAL>>,
) {
for attr in attrs {
self.remove_attribute(&attr.name);
self.attrs.push(attr);
}
}
pub fn merge_attributes(
&mut self,
new_attrs: impl IntoIterator<Item = Attribute<NS, ATT, VAL>>,
) {
for new_att in new_attrs {
if let Some(existing_attr) =
self.attrs.iter_mut().find(|att| att.name == new_att.name)
{
existing_attr.value.extend(new_att.value);
} else {
self.attrs.push(new_att);
}
}
}
pub fn get_attribute_value(&self, name: &ATT) -> Option<Vec<&VAL>> {
let result: Vec<&VAL> = self
.attrs
.iter()
.filter(|att| att.name == *name)
.flat_map(|att| att.value())
.collect();
if result.is_empty() {
None
} else {
Some(result)
}
}
}