OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) Research In Motion Limited 2011. All rights reserved. | 2 * Copyright (C) Research In Motion Limited 2011. All rights reserved. |
3 * | 3 * |
4 * This library is free software; you can redistribute it and/or | 4 * This library is free software; you can redistribute it and/or |
5 * modify it under the terms of the GNU Library General Public | 5 * modify it under the terms of the GNU Library General Public |
6 * License as published by the Free Software Foundation; either | 6 * License as published by the Free Software Foundation; either |
7 * version 2 of the License, or (at your option) any later version. | 7 * version 2 of the License, or (at your option) any later version. |
8 * | 8 * |
9 * This library is distributed in the hope that it will be useful, | 9 * This library is distributed in the hope that it will be useful, |
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
12 * Library General Public License for more details. | 12 * Library General Public License for more details. |
13 * | 13 * |
14 * You should have received a copy of the GNU Library General Public License | 14 * You should have received a copy of the GNU Library General Public License |
15 * along with this library; see the file COPYING.LIB. If not, write to | 15 * along with this library; see the file COPYING.LIB. If not, write to |
16 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 16 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
17 * Boston, MA 02110-1301, USA. | 17 * Boston, MA 02110-1301, USA. |
18 * | 18 * |
19 */ | 19 */ |
20 | 20 |
21 #ifndef SurrogatePairAwareTextIterator_h | 21 #ifndef SurrogatePairAwareTextIterator_h |
22 #define SurrogatePairAwareTextIterator_h | 22 #define SurrogatePairAwareTextIterator_h |
23 | 23 |
24 #include <wtf/unicode/CharacterNames.h> | 24 #include "wtf/unicode/CharacterNames.h" |
25 #include <wtf/text/WTFString.h> | 25 #include "wtf/text/WTFString.h" |
26 | 26 |
27 namespace WebCore { | 27 namespace WebCore { |
28 | 28 |
29 class SurrogatePairAwareTextIterator { | 29 class SurrogatePairAwareTextIterator { |
30 public: | 30 public: |
31 // The passed in UChar pointer starts at 'currentCharacter'. The iterator op
eratoes on the range [currentCharacter, lastCharacter]. | 31 // The passed in UChar pointer starts at 'currentCharacter'. The iterator op
eratoes on the range [currentCharacter, lastCharacter]. |
32 // 'endCharacter' denotes the maximum length of the UChar array, which might
exceed 'lastCharacter'. | 32 // 'endCharacter' denotes the maximum length of the UChar array, which might
exceed 'lastCharacter'. |
33 SurrogatePairAwareTextIterator(const UChar*, int currentCharacter, int lastC
haracter, int endCharacter); | 33 SurrogatePairAwareTextIterator(const UChar*, int currentCharacter, int lastC
haracter, int endCharacter); |
34 | 34 |
35 inline bool consume(UChar32& character, unsigned& clusterLength) | 35 inline bool consume(UChar32& character, unsigned& clusterLength) |
(...skipping 25 matching lines...) Expand all Loading... |
61 | 61 |
62 const UChar* m_characters; | 62 const UChar* m_characters; |
63 int m_currentCharacter; | 63 int m_currentCharacter; |
64 int m_lastCharacter; | 64 int m_lastCharacter; |
65 int m_endCharacter; | 65 int m_endCharacter; |
66 }; | 66 }; |
67 | 67 |
68 } | 68 } |
69 | 69 |
70 #endif | 70 #endif |
OLD | NEW |