Support display: contents for elements, first-line and first-letter pseudos.

third_party/WebKit/Source/core/dom/LayoutTreeBuilderTraversal.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 18 matching lines @@
 
 #include "core/CoreExport.h"
 #include "core/dom/Element.h"
 #include "core/dom/shadow/InsertionPoint.h"
 #include <cstdint>
 
 namespace blink {
 
 class LayoutObject;
 
-namespace LayoutTreeBuilderTraversal {
+class CORE_EXPORT LayoutTreeBuilderTraversal {
+ public:
+  static const int32_t kTraverseAllSiblings = -2;
+  class ParentDetails {
+    STACK_ALLOCATED();
 
-const int32_t kTraverseAllSiblings = -2;
+   public:
+    ParentDetails() : m_insertionPoint(nullptr) {}
 
-class ParentDetails {
-  STACK_ALLOCATED();
+    const InsertionPoint* insertionPoint() const { return m_insertionPoint; }
 
- public:
-  ParentDetails() : m_insertionPoint(nullptr) {}
+    void didTraverseInsertionPoint(const InsertionPoint*);
 
-  const InsertionPoint* insertionPoint() const { return m_insertionPoint; }
+    bool operator==(const ParentDetails& other) {
+      return m_insertionPoint == other.m_insertionPoint;
+    }
 
-  void didTraverseInsertionPoint(const InsertionPoint*);
+   private:
+    Member<const InsertionPoint> m_insertionPoint;
+  };
 
-  bool operator==(const ParentDetails& other) {
-    return m_insertionPoint == other.m_insertionPoint;
+  static ContainerNode* parent(const Node&, ParentDetails* = nullptr);
+  static ContainerNode* layoutParent(const Node&, ParentDetails* = nullptr);
+  static Node* firstChild(const Node&);
+  static Node* nextSibling(const Node&);
+  static Node* previousSibling(const Node&);
+  static Node* previous(const Node&, const Node* stayWithin);
+  static Node* next(const Node&, const Node* stayWithin);
+  static Node* nextSkippingChildren(const Node&, const Node* stayWithin);
+  static LayoutObject* parentLayoutObject(const Node&);
+  static LayoutObject* nextSiblingLayoutObject(
+      const Node&,
+      int32_t limit = kTraverseAllSiblings);
+  static LayoutObject* previousSiblingLayoutObject(
+      const Node&,
+      int32_t limit = kTraverseAllSiblings);
+  static LayoutObject* nextInTopLayer(const Element&);
+
+  static inline Element* parentElement(const Node& node) {
+    ContainerNode* found = parent(node);
+    return found && found->isElementNode() ? toElement(found) : 0;
   }
-
- private:
-  Member<const InsertionPoint> m_insertionPoint;
 };
 
-CORE_EXPORT ContainerNode* parent(const Node&, ParentDetails* = 0);
-CORE_EXPORT Node* firstChild(const Node&);
-CORE_EXPORT Node* nextSibling(const Node&);
-Node* previousSibling(const Node&);
-Node* previous(const Node&, const Node* stayWithin);
-Node* next(const Node&, const Node* stayWithin);
-Node* nextSkippingChildren(const Node&, const Node* stayWithin);
-LayoutObject* nextSiblingLayoutObject(const Node&,
-                                      int32_t limit = kTraverseAllSiblings);
-LayoutObject* previousSiblingLayoutObject(const Node&,
-                                          int32_t limit = kTraverseAllSiblings);
-LayoutObject* nextInTopLayer(const Element&);
-
-inline Element* parentElement(const Node& node) {
-  ContainerNode* found = parent(node);
-  return found && found->isElementNode() ? toElement(found) : 0;
-}
-
-}  // namespace LayoutTreeBuilderTraversal
-
 }  // namespace blink
 
 #endif