| 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 229 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 240 const WillBeHeapVector<RefPtrWillBeMember<Element>>& topLayerElements = elem
ent.document().topLayerElements(); | 240 const WillBeHeapVector<RefPtrWillBeMember<Element>>& topLayerElements = elem
ent.document().topLayerElements(); |
| 241 size_t position = topLayerElements.find(&element); | 241 size_t position = topLayerElements.find(&element); |
| 242 ASSERT(position != kNotFound); | 242 ASSERT(position != kNotFound); |
| 243 for (size_t i = position + 1; i < topLayerElements.size(); ++i) { | 243 for (size_t i = position + 1; i < topLayerElements.size(); ++i) { |
| 244 if (LayoutObject* layoutObject = topLayerElements[i]->layoutObject()) | 244 if (LayoutObject* layoutObject = topLayerElements[i]->layoutObject()) |
| 245 return layoutObject; | 245 return layoutObject; |
| 246 } | 246 } |
| 247 return 0; | 247 return 0; |
| 248 } | 248 } |
| 249 | 249 |
| 250 } | 250 } // namespace LayoutTreeBuilderTraversal |
| 251 | 251 |
| 252 } // namespace | 252 } // namespace blink |
| OLD | NEW |