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 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
67 LayoutObject* nextSiblingLayoutObject(const Node&); | 67 LayoutObject* nextSiblingLayoutObject(const Node&); |
68 LayoutObject* previousSiblingLayoutObject(const Node&); | 68 LayoutObject* previousSiblingLayoutObject(const Node&); |
69 LayoutObject* nextInTopLayer(const Element&); | 69 LayoutObject* nextInTopLayer(const Element&); |
70 | 70 |
71 inline Element* parentElement(const Node& node) | 71 inline Element* parentElement(const Node& node) |
72 { | 72 { |
73 ContainerNode* found = parent(node); | 73 ContainerNode* found = parent(node); |
74 return found && found->isElementNode() ? toElement(found) : 0; | 74 return found && found->isElementNode() ? toElement(found) : 0; |
75 } | 75 } |
76 | 76 |
77 } | 77 } // namespace LayoutTreeBuilderTraversal |
78 | 78 |
79 } // namespace blink | 79 } // namespace blink |
80 | 80 |
81 #endif | 81 #endif |
OLD | NEW |