Have Node::highestAncestor() return a reference

Source/core/dom/ContainerNode.h

Index: Source/core/dom/ContainerNode.h
diff --git a/Source/core/dom/ContainerNode.h b/Source/core/dom/ContainerNode.h
index 65f0e04c65ed3f8dc91b8eae8fbf62c9b84ec52a..8c8e4a9fed3c8b56fec6917afea54da7a69e84b2 100644
--- a/Source/core/dom/ContainerNode.h
+++ b/Source/core/dom/ContainerNode.h
@@ -243,13 +243,14 @@ inline Node* Node::lastChild() const
     return toContainerNode(this)->lastChild();
 }
 
-inline Node* Node::highestAncestor() const
+inline Node& Node::highestAncestor() const
 {
     Node* node = const_cast<Node*>(this);
     Node* highest = node;
     for (; node; node = node->parentNode())
         highest = node;
-    return highest;
+    ASSERT(highest);

[adamk, 2014/02/26 20:37:23]

This ASSERT is basically checking that the for loop above is correctly
structured. That doesn't seem worthwhile to me.

[Inactive, 2014/02/26 21:00:01]

Done.

+    return *highest;
 }
 
 inline Node* Node::parentElementOrShadowRoot() const