Mirrors/servo
1
0
Fork 0
mirror of https://github.com/servo/servo.git synced 2025-08-05 21:50:18 +01:00
Code Issues Projects Releases Packages Wiki Activity

Implement concept of shadow including tree order

Browse source
This commit is contained in:
Fernando Jiménez Moreno 2019-01-30 16:19:40 +01:00
parent f6ba165882
commit 2e5c058463
15 changed files with 69 additions and 43 deletions
Download patch file Download diff file Expand all files Collapse all files

21
components/script/dom/document.rs
View file

@ -631,7 +631,7 @@ impl Document {
pub fn refresh_base_element(&self) {
let base = self
.upcast::<Node>()
.traverse_preorder()
.traverse_preorder(/* shadow including */ false)
.filter_map(DomRoot::downcast::<HTMLBaseElement>)
.find(|element| {
element
@ -869,7 +869,7 @@ impl Document {
};
let doc_node = self.upcast::<Node>();
doc_node
.traverse_preorder()
.traverse_preorder(/* shadow including */ false)
.filter_map(DomRoot::downcast)
.find(|node| check_anchor(&node))
.map(DomRoot::upcast)
@ -978,7 +978,7 @@ impl Document {
pub fn dirty_all_nodes(&self) {
let root = self.upcast::<Node>();
for node in root.traverse_preorder() {
for node in root.traverse_preorder(/* shadow including */ true) {
node.dirty(NodeDamage::OtherNodeDamage)
}
}
@ -2273,7 +2273,7 @@ impl Document {
/// Iterate over all iframes in the document.
pub fn iter_iframes(&self) -> impl Iterator<Item = DomRoot<HTMLIFrameElement>> {
self.upcast::<Node>()
.traverse_preorder()
.traverse_preorder(/* shadow including */ true)
.filter_map(DomRoot::downcast::<HTMLIFrameElement>)
}
@ -2837,7 +2837,7 @@ impl Document {
let maybe_node = doc.deref().map(Castable::upcast::<Node>);
let iter = maybe_node
.iter()
.flat_map(|node| node.traverse_preorder())
.flat_map(|node| node.traverse_preorder(/* shadow including */ false))
.filter(|node| callback(&node));
NodeList::new_simple_list(&self.window, iter)
}
@ -3793,7 +3793,7 @@ impl DocumentMethods for Document {
} else {
// Step 2.
root.upcast::<Node>()
.traverse_preorder()
.traverse_preorder(/* shadow including */ false)
.find(|node| node.is::<HTMLTitleElement>())
}
});
@ -3840,7 +3840,7 @@ impl DocumentMethods for Document {
} else if root.namespace() == &ns!(html) {
let elem = root
.upcast::<Node>()
.traverse_preorder()
.traverse_preorder(/* shadow including */ false)
.find(|node| node.is::<HTMLTitleElement>());
match elem {
Some(elem) => elem,
@ -4207,7 +4207,7 @@ impl DocumentMethods for Document {
{
// Step 1.
let mut elements = root
.traverse_preorder()
.traverse_preorder(/* shadow including */ false)
.filter(|node| filter_by_name(&name, &node))
.peekable();
if let Some(first) = elements.next() {
@ -4325,7 +4325,10 @@ impl DocumentMethods for Document {
}
// Step 8
for node in self.upcast::<Node>().traverse_preorder() {
for node in self
.upcast::<Node>()
.traverse_preorder(/* shadow including */ true)
{
node.upcast::<EventTarget>().remove_all_listeners();
}