| 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 Apple Inc. All right reserved. | 3 * Copyright (C) 2003, 2004, 2006, 2007, 2008 Apple Inc. All right reserved. |
| 4 * | 4 * |
| 5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
| 6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
| 7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
| 8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
| 9 * | 9 * |
| 10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
| (...skipping 294 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 305 | 305 |
| 306 void updateStatusLastFromCurrentDirection(WTF::Unicode::Direction); | 306 void updateStatusLastFromCurrentDirection(WTF::Unicode::Direction); |
| 307 void reorderRunsFromLevels(BidiRunList<Run>&) const; | 307 void reorderRunsFromLevels(BidiRunList<Run>&) const; |
| 308 | 308 |
| 309 bool needsToApplyL1Rule(BidiRunList<Run>&) { return false; } | 309 bool needsToApplyL1Rule(BidiRunList<Run>&) { return false; } |
| 310 int findFirstTrailingSpaceAtRun(Run*) { return 0; } | 310 int findFirstTrailingSpaceAtRun(Run*) { return 0; } |
| 311 // http://www.unicode.org/reports/tr9/#L1 | 311 // http://www.unicode.org/reports/tr9/#L1 |
| 312 void applyL1Rule(BidiRunList<Run>&); | 312 void applyL1Rule(BidiRunList<Run>&); |
| 313 | 313 |
| 314 Vector<BidiEmbedding, 8> m_currentExplicitEmbeddingSequence; | 314 Vector<BidiEmbedding, 8> m_currentExplicitEmbeddingSequence; |
| 315 HashMap<Run *, MidpointState<Iterator> > m_midpointStateForIsolatedRun; | 315 HashMap<Run *, MidpointState<Iterator>> m_midpointStateForIsolatedRun; |
| 316 }; | 316 }; |
| 317 | 317 |
| 318 #if ENABLE(ASSERT) | 318 #if ENABLE(ASSERT) |
| 319 template <class Iterator, class Run> | 319 template <class Iterator, class Run> |
| 320 BidiResolver<Iterator, Run>::~BidiResolver() | 320 BidiResolver<Iterator, Run>::~BidiResolver() |
| 321 { | 321 { |
| 322 // The owner of this resolver should have handled the isolated runs. | 322 // The owner of this resolver should have handled the isolated runs. |
| 323 ASSERT(m_isolatedRuns.isEmpty()); | 323 ASSERT(m_isolatedRuns.isEmpty()); |
| 324 } | 324 } |
| 325 #endif | 325 #endif |
| (...skipping 764 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1090 template<class Iterator, class Run> | 1090 template<class Iterator, class Run> |
| 1091 MidpointState<Iterator> BidiResolver<Iterator, Run>::midpointStateForIsolatedRun
(Run* run) | 1091 MidpointState<Iterator> BidiResolver<Iterator, Run>::midpointStateForIsolatedRun
(Run* run) |
| 1092 { | 1092 { |
| 1093 return m_midpointStateForIsolatedRun.take(run); | 1093 return m_midpointStateForIsolatedRun.take(run); |
| 1094 } | 1094 } |
| 1095 | 1095 |
| 1096 | 1096 |
| 1097 } // namespace blink | 1097 } // namespace blink |
| 1098 | 1098 |
| 1099 #endif // BidiResolver_h | 1099 #endif // BidiResolver_h |
| OLD | NEW |