OLD | NEW |
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 |
(...skipping 37 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
48 | 48 |
49 bool operator==(const ParentDetails& other) | 49 bool operator==(const ParentDetails& other) |
50 { | 50 { |
51 return m_insertionPoint == other.m_insertionPoint; | 51 return m_insertionPoint == other.m_insertionPoint; |
52 } | 52 } |
53 | 53 |
54 private: | 54 private: |
55 const InsertionPoint* m_insertionPoint; | 55 const InsertionPoint* m_insertionPoint; |
56 }; | 56 }; |
57 | 57 |
58 ContainerNode* parent(const Node*); | 58 ContainerNode* parent(const Node*, ParentDetails* = 0); |
59 ContainerNode* parent(const Node*, ParentDetails*); | |
60 bool contains(const ContainerNode*, const Node*); | 59 bool contains(const ContainerNode*, const Node*); |
61 Node* nextSibling(const Node*); | 60 Node* nextSibling(const Node*); |
62 Node* previousSibling(const Node*); | 61 Node* previousSibling(const Node*); |
63 Node* previous(const Node*, const Node* stayWithin); | 62 Node* previous(const Node*, const Node* stayWithin); |
64 Node* next(const Node*, const Node* stayWithin); | 63 Node* next(const Node*, const Node* stayWithin); |
65 RenderObject* nextSiblingRenderer(const Node*); | 64 RenderObject* nextSiblingRenderer(const Node*); |
66 RenderObject* previousSiblingRenderer(const Node*); | 65 RenderObject* previousSiblingRenderer(const Node*); |
67 RenderObject* nextInTopLayer(const Element*); | 66 RenderObject* nextInTopLayer(const Element*); |
68 | 67 |
69 inline ContainerNode* parent(const Node* node) | |
70 { | |
71 ParentDetails unusedDetails; | |
72 return parent(node, &unusedDetails); | |
73 } | |
74 | |
75 inline Element* parentElement(const Node* node) | 68 inline Element* parentElement(const Node* node) |
76 { | 69 { |
77 ParentDetails unusedDetails; | 70 ParentDetails unusedDetails; |
78 Node* found = parent(node, &unusedDetails); | 71 Node* found = parent(node, &unusedDetails); |
79 return found && found->isElementNode() ? toElement(found) : 0; | 72 return found && found->isElementNode() ? toElement(found) : 0; |
80 } | 73 } |
81 | 74 |
82 } | 75 } |
83 | 76 |
84 } // namespace blink | 77 } // namespace blink |
85 | 78 |
86 #endif | 79 #endif |
OLD | NEW |