| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2013 Yandex LLC. All rights reserved. | 2 * Copyright (c) 2013 Yandex LLC. 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 12 matching lines...) Expand all Loading... |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #include "platform/text/UnicodeUtilities.h" | 31 #include "platform/text/UnicodeUtilities.h" |
| 32 | 32 |
| 33 #include <unicode/uchar.h> |
| 33 #include "testing/gtest/include/gtest/gtest.h" | 34 #include "testing/gtest/include/gtest/gtest.h" |
| 34 #include "wtf/Vector.h" | 35 #include "wtf/Vector.h" |
| 35 #include "wtf/text/CharacterNames.h" | 36 #include "wtf/text/CharacterNames.h" |
| 36 #include "wtf/text/WTFString.h" | 37 #include "wtf/text/WTFString.h" |
| 37 #include <unicode/uchar.h> | |
| 38 | 38 |
| 39 namespace blink { | 39 namespace blink { |
| 40 | 40 |
| 41 static const UChar32 kMaxLatinCharCount = 256; | 41 static const UChar32 kMaxLatinCharCount = 256; |
| 42 | 42 |
| 43 static bool isTestFirstAndLastCharsInCategoryFailed = false; | 43 static bool isTestFirstAndLastCharsInCategoryFailed = false; |
| 44 UBool U_CALLCONV testFirstAndLastCharsInCategory(const void* context, | 44 UBool U_CALLCONV testFirstAndLastCharsInCategory(const void* context, |
| 45 UChar32 start, | 45 UChar32 start, |
| 46 UChar32 limit, | 46 UChar32 limit, |
| 47 UCharCategory type) { | 47 UCharCategory type) { |
| (...skipping 195 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 243 voicedKanaString1, WTF_ARRAY_LENGTH(voicedKanaString1), voicedKanaString2, | 243 voicedKanaString1, WTF_ARRAY_LENGTH(voicedKanaString1), voicedKanaString2, |
| 244 WTF_ARRAY_LENGTH(voicedKanaString2))); | 244 WTF_ARRAY_LENGTH(voicedKanaString2))); |
| 245 | 245 |
| 246 voicedKanaString2[0] = 0x3043; | 246 voicedKanaString2[0] = 0x3043; |
| 247 EXPECT_FALSE(checkKanaStringsEqual( | 247 EXPECT_FALSE(checkKanaStringsEqual( |
| 248 voicedKanaString1, WTF_ARRAY_LENGTH(voicedKanaString1), voicedKanaString2, | 248 voicedKanaString1, WTF_ARRAY_LENGTH(voicedKanaString1), voicedKanaString2, |
| 249 WTF_ARRAY_LENGTH(voicedKanaString2))); | 249 WTF_ARRAY_LENGTH(voicedKanaString2))); |
| 250 } | 250 } |
| 251 | 251 |
| 252 } // namespace blink | 252 } // namespace blink |
| OLD | NEW |