Rename Node::inShadowIncludingDocument() to Node::isConnected()

third_party/WebKit/Source/core/dom/shadow/FlatTreeTraversal.cpp

 /*
  * Copyright (C) 2012 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Neither the name of Google Inc. nor the names of its
@@ skipping 261 matching lines @@
         assertPostcondition(previousSibling);
         return previousSibling;
     }
     return previousAncestorSiblingPostOrder(current, stayWithin);
 }
 
 bool FlatTreeTraversal::isDescendantOf(const Node& node, const Node& other)
 {
     assertPrecondition(node);
     assertPrecondition(other);
-    if (!hasChildren(other) || node.inShadowIncludingDocument() != other.inShadowIncludingDocument())
+    if (!hasChildren(other) || node.isConnected() != other.isConnected())
         return false;
     for (const ContainerNode* n = traverseParent(node); n; n = traverseParent(*n)) {
         if (n == other)
             return true;
     }
     return false;
 }
 
 Node* FlatTreeTraversal::commonAncestor(const Node& nodeA, const Node& nodeB)
 {
@@ skipping 59 matching lines @@
 Node& FlatTreeTraversal::lastWithinOrSelf(const Node& node)
 {
     assertPrecondition(node);
     Node* lastDescendant = lastWithin(node);
     Node& result = lastDescendant ? *lastDescendant : const_cast<Node&>(node);
     assertPostcondition(&result);
     return result;
 }
 
 } // namespace blink