| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 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 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 74 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 85 | 85 |
| 86 RenderedPosition::RenderedPosition(const Position& position, TextAffinity affini
ty) | 86 RenderedPosition::RenderedPosition(const Position& position, TextAffinity affini
ty) |
| 87 : m_layoutObject(nullptr) | 87 : m_layoutObject(nullptr) |
| 88 , m_inlineBox(nullptr) | 88 , m_inlineBox(nullptr) |
| 89 , m_offset(0) | 89 , m_offset(0) |
| 90 , m_prevLeafChild(uncachedInlineBox()) | 90 , m_prevLeafChild(uncachedInlineBox()) |
| 91 , m_nextLeafChild(uncachedInlineBox()) | 91 , m_nextLeafChild(uncachedInlineBox()) |
| 92 { | 92 { |
| 93 if (position.isNull()) | 93 if (position.isNull()) |
| 94 return; | 94 return; |
| 95 InlineBoxPosition boxPosition = position.computeInlineBoxPosition(affinity); | 95 InlineBoxPosition boxPosition = computeInlineBoxPosition(position, affinity)
; |
| 96 m_inlineBox = boxPosition.inlineBox; | 96 m_inlineBox = boxPosition.inlineBox; |
| 97 m_offset = boxPosition.offsetInBox; | 97 m_offset = boxPosition.offsetInBox; |
| 98 if (m_inlineBox) | 98 if (m_inlineBox) |
| 99 m_layoutObject = &m_inlineBox->layoutObject(); | 99 m_layoutObject = &m_inlineBox->layoutObject(); |
| 100 else | 100 else |
| 101 m_layoutObject = layoutObjectFromPosition(position); | 101 m_layoutObject = layoutObjectFromPosition(position); |
| 102 } | 102 } |
| 103 | 103 |
| 104 RenderedPosition::RenderedPosition(const PositionInComposedTree& position, TextA
ffinity affinity) | 104 RenderedPosition::RenderedPosition(const PositionInComposedTree& position, TextA
ffinity affinity) |
| 105 : RenderedPosition(toPositionInDOMTree(position), affinity) | 105 : RenderedPosition(toPositionInDOMTree(position), affinity) |
| (...skipping 154 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 260 bool layoutObjectContainsPosition(LayoutObject* target, const Position& position
) | 260 bool layoutObjectContainsPosition(LayoutObject* target, const Position& position
) |
| 261 { | 261 { |
| 262 for (LayoutObject* layoutObject = layoutObjectFromPosition(position); layout
Object && layoutObject->node(); layoutObject = layoutObject->parent()) { | 262 for (LayoutObject* layoutObject = layoutObjectFromPosition(position); layout
Object && layoutObject->node(); layoutObject = layoutObject->parent()) { |
| 263 if (layoutObject == target) | 263 if (layoutObject == target) |
| 264 return true; | 264 return true; |
| 265 } | 265 } |
| 266 return false; | 266 return false; |
| 267 } | 267 } |
| 268 | 268 |
| 269 }; | 269 }; |
| OLD | NEW |