| OLD | NEW |
| 1 // Copyright 2017 The Chromium Authors. All rights reserved. | 1 // Copyright 2017 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "core/editing/InlineBoxTraversal.h" | 5 #include "core/editing/InlineBoxTraversal.h" |
| 6 | 6 |
| 7 #include "core/layout/line/InlineBox.h" | 7 #include "core/layout/line/InlineBox.h" |
| 8 | 8 |
| 9 namespace blink { | 9 namespace blink { |
| 10 | 10 |
| (...skipping 29 matching lines...) Expand all Loading... |
| 40 // "Right" Traversal strategy ignoring line break | 40 // "Right" Traversal strategy ignoring line break |
| 41 struct TraverseRightIgnoringLineBreak { | 41 struct TraverseRightIgnoringLineBreak { |
| 42 STATIC_ONLY(TraverseRightIgnoringLineBreak); | 42 STATIC_ONLY(TraverseRightIgnoringLineBreak); |
| 43 | 43 |
| 44 static InlineBox* Forward(const InlineBox& inline_box) { | 44 static InlineBox* Forward(const InlineBox& inline_box) { |
| 45 return inline_box.NextLeafChildIgnoringLineBreak(); | 45 return inline_box.NextLeafChildIgnoringLineBreak(); |
| 46 } | 46 } |
| 47 }; | 47 }; |
| 48 | 48 |
| 49 template <typename TraversalStrategy> | 49 template <typename TraversalStrategy> |
| 50 InlineBox* FindBidiRun(const InlineBox& start, unsigned bidi_level) { |
| 51 for (InlineBox* runner = TraversalStrategy::Forward(start); runner; |
| 52 runner = TraversalStrategy::Forward(*runner)) { |
| 53 if (runner->BidiLevel() <= bidi_level) |
| 54 return runner; |
| 55 } |
| 56 return nullptr; |
| 57 } |
| 58 |
| 59 template <typename TraversalStrategy> |
| 50 InlineBox* FindBoudnaryOfBidiRun(const InlineBox& start, unsigned bidi_level) { | 60 InlineBox* FindBoudnaryOfBidiRun(const InlineBox& start, unsigned bidi_level) { |
| 51 InlineBox* result = const_cast<InlineBox*>(&start); | 61 InlineBox* result = const_cast<InlineBox*>(&start); |
| 52 for (InlineBox* runner = TraversalStrategy::Forward(start); runner; | 62 for (InlineBox* runner = TraversalStrategy::Forward(start); runner; |
| 53 runner = TraversalStrategy::Forward(*runner)) { | 63 runner = TraversalStrategy::Forward(*runner)) { |
| 54 if (runner->BidiLevel() <= bidi_level) | 64 if (runner->BidiLevel() <= bidi_level) |
| 55 return result; | 65 return result; |
| 56 result = runner; | 66 result = runner; |
| 57 } | 67 } |
| 58 return result; | 68 return result; |
| 59 } | 69 } |
| 60 | 70 |
| 61 template <typename TraversalStrategy> | 71 template <typename TraversalStrategy> |
| 62 InlineBox* FindBoudnaryOfEntireBidiRun(const InlineBox& start, | 72 InlineBox* FindBoudnaryOfEntireBidiRun(const InlineBox& start, |
| 63 unsigned bidi_level) { | 73 unsigned bidi_level) { |
| 64 InlineBox* result = const_cast<InlineBox*>(&start); | 74 InlineBox* result = const_cast<InlineBox*>(&start); |
| 65 for (InlineBox* runner = TraversalStrategy::Forward(start); runner; | 75 for (InlineBox* runner = TraversalStrategy::Forward(start); runner; |
| 66 runner = TraversalStrategy::Forward(*runner)) { | 76 runner = TraversalStrategy::Forward(*runner)) { |
| 67 if (runner->BidiLevel() < bidi_level) | 77 if (runner->BidiLevel() < bidi_level) |
| 68 return result; | 78 return result; |
| 69 result = runner; | 79 result = runner; |
| 70 } | 80 } |
| 71 return result; | 81 return result; |
| 72 } | 82 } |
| 73 | 83 |
| 74 } // namespace | 84 } // namespace |
| 75 | 85 |
| 86 InlineBox* InlineBoxTraversal::FindLeftBidiRun(const InlineBox& box, |
| 87 unsigned bidi_level) { |
| 88 return FindBidiRun<TraverseLeft>(box, bidi_level); |
| 89 } |
| 90 |
| 91 InlineBox* InlineBoxTraversal::FindRightBidiRun(const InlineBox& box, |
| 92 unsigned bidi_level) { |
| 93 return FindBidiRun<TraverseRight>(box, bidi_level); |
| 94 } |
| 95 |
| 76 InlineBox* InlineBoxTraversal::FindLeftBoundaryOfBidiRunIgnoringLineBreak( | 96 InlineBox* InlineBoxTraversal::FindLeftBoundaryOfBidiRunIgnoringLineBreak( |
| 77 const InlineBox& inline_box, | 97 const InlineBox& inline_box, |
| 78 unsigned bidi_level) { | 98 unsigned bidi_level) { |
| 79 return FindBoudnaryOfBidiRun<TraverseLeftIgnoringLineBreak>(inline_box, | 99 return FindBoudnaryOfBidiRun<TraverseLeftIgnoringLineBreak>(inline_box, |
| 80 bidi_level); | 100 bidi_level); |
| 81 } | 101 } |
| 82 | 102 |
| 83 InlineBox* InlineBoxTraversal::FindLeftBoundaryOfEntireBidiRun( | 103 InlineBox* InlineBoxTraversal::FindLeftBoundaryOfEntireBidiRun( |
| 84 const InlineBox& inline_box, | 104 const InlineBox& inline_box, |
| 85 unsigned bidi_level) { | 105 unsigned bidi_level) { |
| (...skipping 22 matching lines...) Expand all Loading... |
| 108 | 128 |
| 109 InlineBox* | 129 InlineBox* |
| 110 InlineBoxTraversal::FindRightBoundaryOfEntireBidiRunIgnoringLineBreak( | 130 InlineBoxTraversal::FindRightBoundaryOfEntireBidiRunIgnoringLineBreak( |
| 111 const InlineBox& inline_box, | 131 const InlineBox& inline_box, |
| 112 unsigned bidi_level) { | 132 unsigned bidi_level) { |
| 113 return FindBoudnaryOfEntireBidiRun<TraverseRightIgnoringLineBreak>( | 133 return FindBoudnaryOfEntireBidiRun<TraverseRightIgnoringLineBreak>( |
| 114 inline_box, bidi_level); | 134 inline_box, bidi_level); |
| 115 } | 135 } |
| 116 | 136 |
| 117 } // namespace blink | 137 } // namespace blink |
| OLD | NEW |