OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2000 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 2000 Lars Knoll (knoll@kde.org) |
3 * Copyright (C) 2003, 2004, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. | 3 * Copyright (C) 2003, 2004, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. |
4 * All right reserved. | 4 * All right reserved. |
5 * Copyright (C) 2010 Google Inc. All rights reserved. | 5 * Copyright (C) 2010 Google Inc. All rights reserved. |
6 * | 6 * |
7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
11 * | 11 * |
12 * This library is distributed in the hope that it will be useful, | 12 * This library is distributed in the hope that it will be useful, |
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
15 * Library General Public License for more details. | 15 * Library General Public License for more details. |
16 * | 16 * |
17 * You should have received a copy of the GNU Library General Public License | 17 * You should have received a copy of the GNU Library General Public License |
18 * along with this library; see the file COPYING.LIB. If not, write to | 18 * along with this library; see the file COPYING.LIB. If not, write to |
19 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 19 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
20 * Boston, MA 02110-1301, USA. | 20 * Boston, MA 02110-1301, USA. |
21 * | 21 * |
22 */ | 22 */ |
23 | 23 |
24 #ifndef BidiRunForLine_h | |
25 #define BidiRunForLine_h | |
26 | |
27 #include "config.h" | 24 #include "config.h" |
28 #include "core/layout/BidiRunForLine.h" | 25 #include "core/layout/BidiRunForLine.h" |
29 | 26 |
30 #include "core/layout/line/InlineIterator.h" | 27 #include "core/layout/line/InlineIterator.h" |
31 | 28 |
32 namespace blink { | 29 namespace blink { |
33 | 30 |
34 using namespace WTF::Unicode; | 31 using namespace WTF::Unicode; |
35 | 32 |
36 static LayoutObject* firstLayoutObjectForDirectionalityDetermination( | 33 static LayoutObject* firstLayoutObjectForDirectionalityDetermination( |
(...skipping 37 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
74 if (!next) | 71 if (!next) |
75 break; | 72 break; |
76 | 73 |
77 current = next; | 74 current = next; |
78 } | 75 } |
79 | 76 |
80 return current; | 77 return current; |
81 } | 78 } |
82 | 79 |
83 TextDirection determinePlaintextDirectionality(LayoutObject* root, | 80 TextDirection determinePlaintextDirectionality(LayoutObject* root, |
84 LayoutObject* current = 0, unsigned pos = 0) | 81 LayoutObject* current, unsigned pos) |
85 { | 82 { |
86 LayoutObject* firstLayoutObject = firstLayoutObjectForDirectionalityDetermin
ation(root, current); | 83 LayoutObject* firstLayoutObject = firstLayoutObjectForDirectionalityDetermin
ation(root, current); |
87 InlineIterator iter(LineLayoutItem(root), LineLayoutItem(firstLayoutObject),
firstLayoutObject == current ? pos : 0); | 84 InlineIterator iter(LineLayoutItem(root), LineLayoutItem(firstLayoutObject),
firstLayoutObject == current ? pos : 0); |
88 InlineBidiResolver observer; | 85 InlineBidiResolver observer; |
89 observer.setStatus(BidiStatus(root->style()->direction(), | 86 observer.setStatus(BidiStatus(root->style()->direction(), |
90 isOverride(root->style()->unicodeBidi()))); | 87 isOverride(root->style()->unicodeBidi()))); |
91 observer.setPositionIgnoringNestedIsolates(iter); | 88 observer.setPositionIgnoringNestedIsolates(iter); |
92 return observer.determineParagraphDirectionality(); | 89 return observer.determineParagraphDirectionality(); |
93 } | 90 } |
94 | 91 |
(...skipping 125 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
220 isolatedRunsStack.resize(isolatedRunsStack.size() + 1); | 217 isolatedRunsStack.resize(isolatedRunsStack.size() + 1); |
221 isolatedRunsStack.last().isolatedRuns.appendVector( | 218 isolatedRunsStack.last().isolatedRuns.appendVector( |
222 isolatedResolver.isolatedRuns()); | 219 isolatedResolver.isolatedRuns()); |
223 isolatedRunsStack.last().root = isolatedInline; | 220 isolatedRunsStack.last().root = isolatedInline; |
224 restoreIsolatedMidpointStates(topResolver, isolatedResolver); | 221 restoreIsolatedMidpointStates(topResolver, isolatedResolver); |
225 } | 222 } |
226 } | 223 } |
227 } | 224 } |
228 | 225 |
229 } // namespace blink | 226 } // namespace blink |
230 | |
231 #endif // BidiRunForLine_h | |
OLD | NEW |