aboutsummaryrefslogtreecommitdiffstats
path: root/components/script/dom/nodelist.rs
diff options
context:
space:
mode:
Diffstat (limited to 'components/script/dom/nodelist.rs')
-rw-r--r--components/script/dom/nodelist.rs12
1 files changed, 6 insertions, 6 deletions
diff --git a/components/script/dom/nodelist.rs b/components/script/dom/nodelist.rs
index b5db05945ca..2ed127dd2dc 100644
--- a/components/script/dom/nodelist.rs
+++ b/components/script/dom/nodelist.rs
@@ -109,7 +109,7 @@ impl ChildrenList {
}
pub fn len(&self) -> u32 {
- self.node.root().children_count()
+ self.node.children_count()
}
pub fn item(&self, index: u32) -> Option<Root<Node>> {
@@ -121,7 +121,7 @@ impl ChildrenList {
}
if index == 0u32 {
// Item is first child if any, not worth updating last visited.
- return self.node.root().GetFirstChild();
+ return self.node.GetFirstChild();
}
let last_index = self.last_index.get();
if index == last_index {
@@ -137,7 +137,7 @@ impl ChildrenList {
} else if index > last_index {
if index == len - 1u32 {
// Item is parent's last child, not worth updating last visited.
- return Some(self.node.root().GetLastChild().unwrap());
+ return Some(self.node.GetLastChild().unwrap());
}
if index <= last_index + (len - last_index) / 2u32 {
// Item is closer to the last visited child and follows it.
@@ -147,7 +147,7 @@ impl ChildrenList {
} else {
// Item is closer to parent's last child and obviously
// precedes it.
- self.node.root().GetLastChild().unwrap()
+ self.node.GetLastChild().unwrap()
.inclusively_preceding_siblings()
.nth((len - index - 1u32) as usize).unwrap()
}
@@ -159,7 +159,7 @@ impl ChildrenList {
} else {
// Item is closer to parent's first child and obviously follows it.
debug_assert!(index < last_index / 2u32);
- self.node.root().GetFirstChild().unwrap()
+ self.node.GetFirstChild().unwrap()
.inclusively_following_siblings()
.nth(index as usize)
.unwrap()
@@ -263,7 +263,7 @@ impl ChildrenList {
}
fn reset(&self) {
- self.last_visited.set(self.node.root().GetFirstChild().as_ref().map(Root::r));
+ self.last_visited.set(self.node.GetFirstChild().r());
self.last_index.set(0u32);
}
}