| 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 26 matching lines...) Expand all Loading... |
| 37 | 37 |
| 38 static bool isLayoutObjectReparented(const LayoutObject* layoutObject) | 38 static bool isLayoutObjectReparented(const LayoutObject* layoutObject) |
| 39 { | 39 { |
| 40 if (!layoutObject->node()->isElementNode()) | 40 if (!layoutObject->node()->isElementNode()) |
| 41 return false; | 41 return false; |
| 42 if (toElement(layoutObject->node())->isInTopLayer()) | 42 if (toElement(layoutObject->node())->isInTopLayer()) |
| 43 return true; | 43 return true; |
| 44 return false; | 44 return false; |
| 45 } | 45 } |
| 46 | 46 |
| 47 void ParentDetails::didTraverseInsertionPoint(const InsertionPoint* insertionPoi
nt) | |
| 48 { | |
| 49 if (!m_insertionPoint) { | |
| 50 m_insertionPoint = insertionPoint; | |
| 51 } | |
| 52 } | |
| 53 | |
| 54 ContainerNode* parent(const Node& node, ParentDetails* details) | 47 ContainerNode* parent(const Node& node, ParentDetails* details) |
| 55 { | 48 { |
| 56 // TODO(hayato): Uncomment this once we can be sure LayoutTreeBuilderTravers
al::parent() is used only for a node in a document. | 49 // TODO(hayato): Uncomment this once we can be sure LayoutTreeBuilderTravers
al::parent() is used only for a node in a document. |
| 57 // ASSERT(node.inDocument()); | 50 // ASSERT(node.inDocument()); |
| 58 return ComposedTreeTraversal::parent(node, details); | 51 return ComposedTreeTraversal::parent(node, details); |
| 59 } | 52 } |
| 60 | 53 |
| 61 Node* nextSibling(const Node& node) | 54 Node* nextSibling(const Node& node) |
| 62 { | 55 { |
| 63 if (node.isBeforePseudoElement()) { | 56 if (node.isBeforePseudoElement()) { |
| (...skipping 179 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 243 for (size_t i = position + 1; i < topLayerElements.size(); ++i) { | 236 for (size_t i = position + 1; i < topLayerElements.size(); ++i) { |
| 244 if (LayoutObject* layoutObject = topLayerElements[i]->layoutObject()) | 237 if (LayoutObject* layoutObject = topLayerElements[i]->layoutObject()) |
| 245 return layoutObject; | 238 return layoutObject; |
| 246 } | 239 } |
| 247 return 0; | 240 return 0; |
| 248 } | 241 } |
| 249 | 242 |
| 250 } // namespace LayoutTreeBuilderTraversal | 243 } // namespace LayoutTreeBuilderTraversal |
| 251 | 244 |
| 252 } // namespace blink | 245 } // namespace blink |
| OLD | NEW |