Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(37)

Side by Side Diff: Source/core/dom/NodeRenderingTraversal.h

Issue 1074703002: Componentization: make core/dom visible for blink_web and blink_tests. (Closed) Base URL: https://chromium.googlesource.com/chromium/blink.git@master
Patch Set: Created 5 years, 8 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
« no previous file with comments | « Source/core/dom/Microtask.h ('k') | Source/core/dom/PendingScript.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 /* 1 /*
2 * Copyright (C) 2012 Google Inc. All rights reserved. 2 * Copyright (C) 2012 Google Inc. All rights reserved.
3 * 3 *
4 * Redistribution and use in source and binary forms, with or without 4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are 5 * modification, are permitted provided that the following conditions are
6 * met: 6 * met:
7 * 7 *
8 * * Redistributions of source code must retain the above copyright 8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer. 9 * notice, this list of conditions and the following disclaimer.
10 * * Neither the name of Google Inc. nor the names of its 10 * * Neither the name of Google Inc. nor the names of its
11 * contributors may be used to endorse or promote products derived from 11 * contributors may be used to endorse or promote products derived from
12 * this software without specific prior written permission. 12 * this software without specific prior written permission.
13 * 13 *
14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */ 25 */
26 26
27 #ifndef NodeRenderingTraversal_h 27 #ifndef NodeRenderingTraversal_h
28 #define NodeRenderingTraversal_h 28 #define NodeRenderingTraversal_h
29 29
30 #include "core/CoreExport.h"
30 #include "core/dom/Element.h" 31 #include "core/dom/Element.h"
31 32
32 namespace blink { 33 namespace blink {
33 34
34 class InsertionPoint; 35 class InsertionPoint;
35 class LayoutObject; 36 class LayoutObject;
36 37
37 namespace NodeRenderingTraversal { 38 namespace NodeRenderingTraversal {
38 39
39 class ParentDetails { 40 class ParentDetails {
40 STACK_ALLOCATED(); 41 STACK_ALLOCATED();
41 public: 42 public:
42 ParentDetails() 43 ParentDetails()
43 : m_insertionPoint(nullptr) 44 : m_insertionPoint(nullptr)
44 { } 45 { }
45 46
46 const InsertionPoint* insertionPoint() const { return m_insertionPoint; } 47 const InsertionPoint* insertionPoint() const { return m_insertionPoint; }
47 48
48 void didTraverseInsertionPoint(const InsertionPoint*); 49 void didTraverseInsertionPoint(const InsertionPoint*);
49 50
50 bool operator==(const ParentDetails& other) 51 bool operator==(const ParentDetails& other)
51 { 52 {
52 return m_insertionPoint == other.m_insertionPoint; 53 return m_insertionPoint == other.m_insertionPoint;
53 } 54 }
54 55
55 private: 56 private:
56 RawPtrWillBeMember<const InsertionPoint> m_insertionPoint; 57 RawPtrWillBeMember<const InsertionPoint> m_insertionPoint;
57 }; 58 };
58 59
59 ContainerNode* parent(const Node&, ParentDetails* = 0); 60 CORE_EXPORT ContainerNode* parent(const Node&, ParentDetails* = 0);
60 bool contains(const ContainerNode&, const Node&); 61 bool contains(const ContainerNode&, const Node&);
61 Node* firstChild(const Node&); 62 CORE_EXPORT Node* firstChild(const Node&);
62 Node* nextSibling(const Node&); 63 CORE_EXPORT Node* nextSibling(const Node&);
63 Node* previousSibling(const Node&); 64 Node* previousSibling(const Node&);
64 Node* previous(const Node&, const Node* stayWithin); 65 Node* previous(const Node&, const Node* stayWithin);
65 Node* next(const Node&, const Node* stayWithin); 66 Node* next(const Node&, const Node* stayWithin);
66 Node* nextSkippingChildren(const Node&, const Node* stayWithin); 67 Node* nextSkippingChildren(const Node&, const Node* stayWithin);
67 LayoutObject* nextSiblingRenderer(const Node&); 68 LayoutObject* nextSiblingRenderer(const Node&);
68 LayoutObject* previousSiblingRenderer(const Node&); 69 LayoutObject* previousSiblingRenderer(const Node&);
69 LayoutObject* nextInTopLayer(const Element&); 70 LayoutObject* nextInTopLayer(const Element&);
70 71
71 inline Element* parentElement(const Node& node) 72 inline Element* parentElement(const Node& node)
72 { 73 {
73 ContainerNode* found = parent(node); 74 ContainerNode* found = parent(node);
74 return found && found->isElementNode() ? toElement(found) : 0; 75 return found && found->isElementNode() ? toElement(found) : 0;
75 } 76 }
76 77
77 } 78 }
78 79
79 } // namespace blink 80 } // namespace blink
80 81
81 #endif 82 #endif
OLDNEW
« no previous file with comments | « Source/core/dom/Microtask.h ('k') | Source/core/dom/PendingScript.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698