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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
use crate::matcher::{MatchScope, Matcher, Matches};
use crate::Document;
use crate::Node;
use crate::Selection;
use std::collections::HashSet;
use std::vec::IntoIter;
impl Document {
/// Gets the descendants of the root document node in the current, filter by a selector.
/// It returns a new selection object containing these matched elements.
///
/// # Panics
///
/// Panics if failed to parse the given CSS selector.
pub fn select(&self, sel: &str) -> Selection {
let matcher = Matcher::new(sel).expect("Invalid CSS selector");
let root = self.tree.root();
Selection {
nodes: Matches::from_one(root, matcher.clone(), MatchScope::IncludeNode).collect(),
}
}
/// Alias for `select`, it gets the descendants of the root document node in the current, filter by a selector.
/// It returns a new selection object containing these matched elements.
///
/// # Panics
///
/// Panics if failed to parse the given CSS selector.
pub fn nip(&self, sel: &str) -> Selection {
self.select(sel)
}
/// Gets the descendants of the root document node in the current, filter by a selector.
/// It returns a new selection object containing these matched elements.
pub fn try_select(&self, sel: &str) -> Option<Selection> {
match Matcher::new(sel) {
Ok(matcher) => {
let root = self.tree.root();
let nodes: Vec<Node> =
Matches::from_one(root, matcher.clone(), MatchScope::ChildrenOnly).collect();
if nodes.len() > 0 {
Some(Selection { nodes })
} else {
None
}
}
Err(_) => None,
}
}
/// Gets the descendants of the root document node in the current, filter by a matcher.
/// It returns a new selection object containing these matched elements.
pub fn select_matcher<'a, 'b>(&'a self, matcher: &'b Matcher) -> Selection<'a> {
let root = self.tree.root();
let nodes = Matches::from_one(root, matcher.clone(), MatchScope::IncludeNode).collect();
Selection { nodes }
}
}
impl<'a> Selection<'a> {
/// Gets the descendants of each element in the current set of matched
/// elements, filter by a selector. It returns a new Selection object
/// containing these matched elements.
///
/// # Panics
///
/// Panics if failed to parse the given CSS selector.
pub fn select(&self, sel: &str) -> Selection<'a> {
let matcher = Matcher::new(sel).expect("Invalid CSS seletor");
Selection {
nodes: Matches::from_list(
self.nodes.clone().into_iter(),
matcher,
MatchScope::ChildrenOnly,
)
.collect(),
}
}
/// Alias for `select`, it gets the descendants of each element in the current set of matched
/// elements, filter by a selector. It returns a new Selection object
/// containing these matched elements.
///
/// # Panics
///
/// Panics if failed to parse the given CSS selector.
pub fn nip(&self, sel: &str) -> Selection<'a> {
self.select(sel)
}
/// Gets the descendants of each element in the current set of matched
/// elements, filter by a selector. It returns a new Selection object
/// containing these matched elements.
pub fn try_select(&self, sel: &str) -> Option<Selection<'a>> {
match Matcher::new(sel) {
Ok(matcher) => {
let nodes: Vec<Node> = Matches::from_list(
self.nodes.clone().into_iter(),
matcher,
MatchScope::ChildrenOnly,
)
.collect();
if nodes.len() > 0 {
Some(Selection { nodes })
} else {
None
}
}
Err(_) => None,
}
}
/// Gets the descendants of each element in the current set of matched
/// elements, filter by a matcher. It returns a new Selection object
/// containing these matched elements.
pub fn select_matcher(&self, matcher: &Matcher) -> Selection<'a> {
Selection {
nodes: Matches::from_list(
self.nodes.clone().into_iter(),
matcher.clone(),
MatchScope::ChildrenOnly,
)
.collect(),
}
}
/// Returns a slice of underlying nodes.
pub fn nodes(&self) -> &[Node<'a>] {
&self.nodes
}
/// Creates an iterator over these matched elements.
pub fn iter(&self) -> Selections<Node<'a>> {
Selections::new(self.nodes.clone().into_iter())
}
/// Gets the parent of each element in the selection. It returns a
/// mew Selection object containing these elements.
pub fn parent(&self) -> Selection<'a> {
let mut result = Vec::with_capacity(self.length());
let mut set = HashSet::with_capacity(self.length());
for node in self.nodes() {
if let Some(parent) = node.parent() {
if !set.contains(&parent.id) {
set.insert(parent.id);
result.push(parent);
}
}
}
Self { nodes: result }
}
/// Gets the child elements of each element in the selection.
/// It returns a new Selection object containing these elements.
pub fn children(&self) -> Selection<'a> {
let mut result = Vec::with_capacity(self.length());
let mut set = HashSet::with_capacity(self.length());
for node in self.nodes() {
for child in node.children() {
if !set.contains(&child.id) && child.is_element() {
set.insert(child.id);
result.push(child);
}
}
}
Self { nodes: result }
}
#[deprecated(since = "0.1.6", note = "Please use `next_sibling`")]
/// Gets the immediately following sibling of each element in the
/// selection. It returns a new Selection object containing these elements.
pub fn next(&self) -> Selection<'a> {
self.next_sibling()
}
/// Gets the immediately following sibling of each element in the
/// selection. It returns a new Selection object containing these elements.
pub fn next_sibling(&self) -> Selection<'a> {
let mut result = Vec::with_capacity(self.length());
let mut set = HashSet::with_capacity(self.length());
for node in self.nodes() {
if let Some(sibling) = node.next_element_sibling() {
if !set.contains(&sibling.id) {
set.insert(sibling.id);
result.push(sibling);
}
}
}
Self { nodes: result }
}
/// Gets the immediately previous sibling of each element in the
/// selection. It returns a new Selection object containing these elements.
pub fn prev_sibling(&self) -> Selection<'a> {
let mut result = Vec::with_capacity(self.length());
let mut set = HashSet::with_capacity(self.length());
for node in self.nodes() {
if let Some(sibling) = node.prev_element_sibling() {
if !set.contains(&sibling.id) {
set.insert(sibling.id);
result.push(sibling);
}
}
}
Self { nodes: result }
}
/// Reduces the set of matched elements to the first in the set.
/// It returns a new selection object, and an empty selection object if the
/// selection is empty.
pub fn first(&self) -> Selection<'a> {
if self.length() > 0 {
Selection::from(self.nodes[0].clone())
} else {
Default::default()
}
}
/// Reduces the set of matched elements to the last in the set.
/// It returns a new selection object, and an empty selection object if the
/// selection is empty.
pub fn last(&self) -> Selection<'a> {
if self.length() > 0 {
Selection::from(self.nodes[self.length() - 1].clone())
} else {
Default::default()
}
}
/// Retrieves the underlying node at the specified index.
pub fn get(&self, index: usize) -> Option<&Node<'a>> {
self.nodes.get(index)
}
}
/// Iterator over a collection of matched elements.
pub struct Selections<I> {
iter: IntoIter<I>,
}
impl<I> Selections<I> {
fn new(iter: IntoIter<I>) -> Self {
Self { iter }
}
}
impl<'a> Iterator for Selections<Node<'a>> {
type Item = Selection<'a>;
fn next(&mut self) -> Option<Self::Item> {
self.iter.next().map(Selection::from)
}
}
impl<'a> DoubleEndedIterator for Selections<Node<'a>> {
fn next_back(&mut self) -> Option<Self::Item> {
self.iter.next_back().map(Selection::from)
}
}