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 50 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
61 RenderedPosition leftBoundaryOfBidiRun(unsigned char bidiLevelOfRun); | 61 RenderedPosition leftBoundaryOfBidiRun(unsigned char bidiLevelOfRun); |
62 RenderedPosition rightBoundaryOfBidiRun(unsigned char bidiLevelOfRun); | 62 RenderedPosition rightBoundaryOfBidiRun(unsigned char bidiLevelOfRun); |
63 | 63 |
64 enum ShouldMatchBidiLevel { MatchBidiLevel, IgnoreBidiLevel }; | 64 enum ShouldMatchBidiLevel { MatchBidiLevel, IgnoreBidiLevel }; |
65 bool atLeftBoundaryOfBidiRun() const { | 65 bool atLeftBoundaryOfBidiRun() const { |
66 return atLeftBoundaryOfBidiRun(IgnoreBidiLevel, 0); | 66 return atLeftBoundaryOfBidiRun(IgnoreBidiLevel, 0); |
67 } | 67 } |
68 bool atRightBoundaryOfBidiRun() const { | 68 bool atRightBoundaryOfBidiRun() const { |
69 return atRightBoundaryOfBidiRun(IgnoreBidiLevel, 0); | 69 return atRightBoundaryOfBidiRun(IgnoreBidiLevel, 0); |
70 } | 70 } |
71 // The following two functions return true only if the current position is at
the end of the bidi run | 71 // The following two functions return true only if the current position is at |
72 // of the specified bidi embedding level. | 72 // the end of the bidi run of the specified bidi embedding level. |
73 bool atLeftBoundaryOfBidiRun(unsigned char bidiLevelOfRun) const { | 73 bool atLeftBoundaryOfBidiRun(unsigned char bidiLevelOfRun) const { |
74 return atLeftBoundaryOfBidiRun(MatchBidiLevel, bidiLevelOfRun); | 74 return atLeftBoundaryOfBidiRun(MatchBidiLevel, bidiLevelOfRun); |
75 } | 75 } |
76 bool atRightBoundaryOfBidiRun(unsigned char bidiLevelOfRun) const { | 76 bool atRightBoundaryOfBidiRun(unsigned char bidiLevelOfRun) const { |
77 return atRightBoundaryOfBidiRun(MatchBidiLevel, bidiLevelOfRun); | 77 return atRightBoundaryOfBidiRun(MatchBidiLevel, bidiLevelOfRun); |
78 } | 78 } |
79 | 79 |
80 Position positionAtLeftBoundaryOfBiDiRun() const; | 80 Position positionAtLeftBoundaryOfBiDiRun() const; |
81 Position positionAtRightBoundaryOfBiDiRun() const; | 81 Position positionAtRightBoundaryOfBiDiRun() const; |
82 | 82 |
(...skipping 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
129 m_inlineBox(box), | 129 m_inlineBox(box), |
130 m_offset(offset), | 130 m_offset(offset), |
131 m_prevLeafChild(uncachedInlineBox()), | 131 m_prevLeafChild(uncachedInlineBox()), |
132 m_nextLeafChild(uncachedInlineBox()) {} | 132 m_nextLeafChild(uncachedInlineBox()) {} |
133 | 133 |
134 CORE_EXPORT bool layoutObjectContainsPosition(LayoutObject*, const Position&); | 134 CORE_EXPORT bool layoutObjectContainsPosition(LayoutObject*, const Position&); |
135 | 135 |
136 } // namespace blink | 136 } // namespace blink |
137 | 137 |
138 #endif // RenderedPosition_h | 138 #endif // RenderedPosition_h |
OLD | NEW |