Introduce EphemeralRange::nodes() helper to traverse over a range.

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

 /*
  * 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 36 matching lines @@
 // |InsertionPoint::isActive()| for details of active insertion points, since
 // they aren't appeared in the flat tree. |assertPrecondition()| and
 // |assertPostCondition()| check this condition.
 //
 // FIXME: Make some functions inline to optimise the performance.
 // https://bugs.webkit.org/show_bug.cgi?id=82702
 class CORE_EXPORT FlatTreeTraversal {
     STATIC_ONLY(FlatTreeTraversal);
 public:
     typedef LayoutTreeBuilderTraversal::ParentDetails ParentTraversalDetails;
+    using TraversalNodeType = Node;

[Andrey Kraynov, 2016/08/16 10:02:11]

This is to use FlatTreeTraversal in the same way as NodeTraversal.

[yosin_UTC9, 2016/08/17 01:45:31]

ACK

 
     static Node* next(const Node&);
     static Node* next(const Node&, const Node* stayWithin);
     static Node* previous(const Node&);
 
     static Node* firstChild(const Node&);
     static Node* lastChild(const Node&);
     static bool hasChildren(const Node&);
 
     static ContainerNode* parent(const Node&, ParentTraversalDetails* = 0);
@@ skipping 236 matching lines @@
 }
 
 inline Node* FlatTreeTraversal::traverseLastChild(const Node& node)
 {
     return traverseChild(node, TraversalDirectionBackward);
 }
 
 } // namespace blink
 
 #endif