Editing: Indent command: Do not insert BLOCKQUOTE under the root HTML element.

third_party/WebKit/Source/core/dom/NodeTraversal.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc.
  * All rights reserved.
  * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved.
  * (http://www.torchmobile.com/)
  * Copyright (C) 2014 Samsung Electronics. All rights reserved.
  *
@@ skipping 103 matching lines @@
   }
   static Node* childAt(const ContainerNode& parent, unsigned index) {
     return childAtTemplate(parent, index);
   }
 
   // These functions are provided for matching with |FlatTreeTraversal|.
   static bool hasChildren(const Node& parent) { return firstChild(parent); }
   static bool isDescendantOf(const Node& node, const Node& other) {
     return node.isDescendantOf(&other);
   }
+  static bool contains(const ContainerNode& container, const Node& other) {
+    return container.contains(&other);

[yosin_UTC9, 2017/03/17 10:06:13]

Since there is no unit test for ContainerNode::contains(). Could you move this
patch and add test "NodeTraversal.cpp"?

+  }
   static Node* firstChild(const Node& parent) { return parent.firstChild(); }
   static Node* lastChild(const Node& parent) { return parent.lastChild(); }
   static Node* nextSibling(const Node& node) { return node.nextSibling(); }
   static Node* previousSibling(const Node& node) {
     return node.previousSibling();
   }
   static ContainerNode* parent(const Node& node) { return node.parentNode(); }
   static Node* commonAncestor(const Node& nodeA, const Node& nodeB);
   static unsigned index(const Node& node) { return node.nodeIndex(); }
   static unsigned countChildren(const Node& parent) {
@@ skipping 258 matching lines @@
 inline Node* NodeTraversal::childAtTemplate(NodeType& parent, unsigned index) {
   Node* child = parent.firstChild();
   while (child && index--)
     child = child->nextSibling();
   return child;
 }
 
 }  // namespace blink
 
 #endif