| 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 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 64 static Node* previousSibling(const Node&); | 64 static Node* previousSibling(const Node&); |
| 65 static Node* previous(const Node&, const Node* stayWithin); | 65 static Node* previous(const Node&, const Node* stayWithin); |
| 66 static Node* next(const Node&, const Node* stayWithin); | 66 static Node* next(const Node&, const Node* stayWithin); |
| 67 static Node* nextSkippingChildren(const Node&, const Node* stayWithin); | 67 static Node* nextSkippingChildren(const Node&, const Node* stayWithin); |
| 68 static LayoutObject* parentLayoutObject(const Node&); | 68 static LayoutObject* parentLayoutObject(const Node&); |
| 69 static LayoutObject* nextSiblingLayoutObject( | 69 static LayoutObject* nextSiblingLayoutObject( |
| 70 const Node&, | 70 const Node&, |
| 71 int32_t limit = kTraverseAllSiblings); | 71 int32_t limit = kTraverseAllSiblings); |
| 72 static LayoutObject* previousSiblingLayoutObject( | 72 static LayoutObject* previousSiblingLayoutObject( |
| 73 const Node&, | 73 const Node&, |
| 74 int32_t limit = kTraverseAllSiblings); | 74 int32_t limit = kTraverseAllSiblings, |
| 75 bool* ranOutOfSiblings = nullptr); |
| 75 static LayoutObject* nextInTopLayer(const Element&); | 76 static LayoutObject* nextInTopLayer(const Element&); |
| 76 | 77 |
| 77 static inline Element* parentElement(const Node& node) { | 78 static inline Element* parentElement(const Node& node) { |
| 78 ContainerNode* found = parent(node); | 79 ContainerNode* found = parent(node); |
| 79 return found && found->isElementNode() ? toElement(found) : 0; | 80 return found && found->isElementNode() ? toElement(found) : 0; |
| 80 } | 81 } |
| 81 }; | 82 }; |
| 82 | 83 |
| 83 } // namespace blink | 84 } // namespace blink |
| 84 | 85 |
| 85 #endif | 86 #endif |
| OLD | NEW |