Chromium Code Reviews| 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 30 matching lines...) Expand all Loading... | |
| 41 class LayoutUnit; | 41 class LayoutUnit; |
| 42 class LayoutObject; | 42 class LayoutObject; |
| 43 class VisiblePosition; | 43 class VisiblePosition; |
| 44 struct CompositedSelectionBound; | 44 struct CompositedSelectionBound; |
| 45 | 45 |
| 46 class RenderedPosition { | 46 class RenderedPosition { |
| 47 public: | 47 public: |
| 48 RenderedPosition(); | 48 RenderedPosition(); |
| 49 explicit RenderedPosition(const VisiblePosition&); | 49 explicit RenderedPosition(const VisiblePosition&); |
| 50 explicit RenderedPosition(const Position&, EAffinity); | 50 explicit RenderedPosition(const Position&, EAffinity); |
| 51 explicit RenderedPosition(const PositionInComposedTree&, EAffinity); | |
|
tkent
2015/06/24 08:03:14
remove |explicit|
yosin_UTC9
2015/06/24 09:09:04
Done.
| |
| 51 bool isEquivalent(const RenderedPosition&) const; | 52 bool isEquivalent(const RenderedPosition&) const; |
| 52 | 53 |
| 53 bool isNull() const { return !m_layoutObject; } | 54 bool isNull() const { return !m_layoutObject; } |
| 54 RootInlineBox* rootBox() { return m_inlineBox ? &m_inlineBox->root() : 0; } | 55 RootInlineBox* rootBox() { return m_inlineBox ? &m_inlineBox->root() : 0; } |
| 55 | 56 |
| 56 unsigned char bidiLevelOnLeft() const; | 57 unsigned char bidiLevelOnLeft() const; |
| 57 unsigned char bidiLevelOnRight() const; | 58 unsigned char bidiLevelOnRight() const; |
| 58 RenderedPosition leftBoundaryOfBidiRun(unsigned char bidiLevelOfRun); | 59 RenderedPosition leftBoundaryOfBidiRun(unsigned char bidiLevelOfRun); |
| 59 RenderedPosition rightBoundaryOfBidiRun(unsigned char bidiLevelOfRun); | 60 RenderedPosition rightBoundaryOfBidiRun(unsigned char bidiLevelOfRun); |
| 60 | 61 |
| (...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 110 , m_prevLeafChild(uncachedInlineBox()) | 111 , m_prevLeafChild(uncachedInlineBox()) |
| 111 , m_nextLeafChild(uncachedInlineBox()) | 112 , m_nextLeafChild(uncachedInlineBox()) |
| 112 { | 113 { |
| 113 } | 114 } |
| 114 | 115 |
| 115 CORE_EXPORT bool layoutObjectContainsPosition(LayoutObject*, const Position&); | 116 CORE_EXPORT bool layoutObjectContainsPosition(LayoutObject*, const Position&); |
| 116 | 117 |
| 117 }; | 118 }; |
| 118 | 119 |
| 119 #endif // RenderedPosition_h | 120 #endif // RenderedPosition_h |
| OLD | NEW |