1 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
5 #include "base/files/file_util.h"
6 #include "base/message_loop/message_loop.h"
7 #include "base/path_service.h"
8 #include "base/strings/sys_string_conversions.h"
9 #include "base/strings/utf_string_conversions.h"
10 #include "chrome/common/chrome_paths.h"
11 #include "chrome/common/spellcheck_common.h"
12 #include "chrome/common/spellcheck_result.h"
13 #include "chrome/renderer/spellchecker/hunspell_engine.h"
14 #include "chrome/renderer/spellchecker/spellcheck.h"
15 #include "testing/gtest/include/gtest/gtest.h"
16 #include "third_party/WebKit/public/web/WebTextCheckingCompletion.h"
17 #include "third_party/WebKit/public/web/WebTextCheckingResult.h"
21 base::FilePath
GetHunspellDirectory() {
22 base::FilePath hunspell_directory
;
23 if (!PathService::Get(base::DIR_SOURCE_ROOT
, &hunspell_directory
))
24 return base::FilePath();
26 hunspell_directory
= hunspell_directory
.AppendASCII("third_party");
27 hunspell_directory
= hunspell_directory
.AppendASCII("hunspell_dictionaries");
28 return hunspell_directory
;
33 // TODO(groby): This needs to be a BrowserTest for OSX.
34 class SpellCheckTest
: public testing::Test
{
37 ReinitializeSpellCheck("en-US");
40 void ReinitializeSpellCheck(const std::string
& language
) {
41 spell_check_
.reset(new SpellCheck());
42 InitializeSpellCheck(language
);
45 void UninitializeSpellCheck() {
46 spell_check_
.reset(new SpellCheck());
49 bool InitializeIfNeeded() {
50 return spell_check()->InitializeIfNeeded();
53 void InitializeSpellCheck(const std::string
& language
) {
54 base::FilePath hunspell_directory
= GetHunspellDirectory();
55 EXPECT_FALSE(hunspell_directory
.empty());
57 chrome::spellcheck_common::GetVersionedFileName(language
,
59 base::File::FLAG_OPEN
| base::File::FLAG_READ
);
60 #if defined(OS_MACOSX)
61 // TODO(groby): Forcing spellcheck to use hunspell, even on OSX.
62 // Instead, tests should exercise individual spelling engines.
63 spell_check_
->spellcheck_
.platform_spelling_engine_
.reset(
66 spell_check_
->Init(file
.Pass(), std::set
<std::string
>(), language
);
69 void EnableAutoCorrect(bool enable_autocorrect
) {
70 spell_check_
->OnEnableAutoSpellCorrect(enable_autocorrect
);
73 ~SpellCheckTest() override
{}
75 SpellCheck
* spell_check() { return spell_check_
.get(); }
77 bool CheckSpelling(const std::string
& word
, int tag
) {
78 return spell_check_
->spellcheck_
.platform_spelling_engine_
->CheckSpelling(
79 base::ASCIIToUTF16(word
), tag
);
82 #if !defined(OS_MACOSX)
84 void TestSpellCheckParagraph(
85 const base::string16
& input
,
86 const std::vector
<SpellCheckResult
>& expected
) {
87 blink::WebVector
<blink::WebTextCheckingResult
> results
;
88 spell_check()->SpellCheckParagraph(input
,
91 EXPECT_EQ(results
.size(), expected
.size());
92 size_t size
= std::min(results
.size(), expected
.size());
93 for (size_t j
= 0; j
< size
; ++j
) {
94 EXPECT_EQ(results
[j
].decoration
, blink::WebTextDecorationTypeSpelling
);
95 EXPECT_EQ(results
[j
].location
, expected
[j
].location
);
96 EXPECT_EQ(results
[j
].length
, expected
[j
].length
);
102 scoped_ptr
<SpellCheck
> spell_check_
;
103 base::MessageLoop loop
;
106 // A fake completion object for verification.
107 class MockTextCheckingCompletion
: public blink::WebTextCheckingCompletion
{
109 MockTextCheckingCompletion()
110 : completion_count_(0) {
113 virtual void didFinishCheckingText(
114 const blink::WebVector
<blink::WebTextCheckingResult
>& results
)
117 last_results_
= results
;
120 virtual void didCancelCheckingText() override
{
124 size_t completion_count_
;
125 blink::WebVector
<blink::WebTextCheckingResult
> last_results_
;
128 // Operates unit tests for the content::SpellCheck::SpellCheckWord() function
129 // with the US English dictionary.
130 // The unit tests in this function consist of:
131 // * Tests for the function with empty strings;
132 // * Tests for the function with a valid English word;
133 // * Tests for the function with a valid non-English word;
134 // * Tests for the function with a valid English word with a preceding
136 // * Tests for the function with a valid English word with a preceding
138 // * Tests for the function with a valid English word with a following
140 // * Tests for the function with a valid English word with a following
142 // * Tests for the function with two valid English words concatenated
143 // with space characters or non-English words;
144 // * Tests for the function with an invalid English word;
145 // * Tests for the function with an invalid English word with a preceding
147 // * Tests for the function with an invalid English word with a preceding
149 // * Tests for the function with an invalid English word with a following
151 // * Tests for the function with an invalid English word with a following
152 // non-English word, and;
153 // * Tests for the function with two invalid English words concatenated
154 // with space characters or non-English words.
155 // A test with a "[ROBUSTNESS]" mark shows it is a robustness test and it uses
156 // grammatically incorrect string.
157 // TODO(groby): Please feel free to add more tests.
158 TEST_F(SpellCheckTest
, SpellCheckStrings_EN_US
) {
159 static const struct {
160 // A string to be tested.
161 const wchar_t* input
;
162 // An expected result for this test case.
163 // * true: the input string does not have any invalid words.
164 // * false: the input string has one or more invalid words.
165 bool expected_result
;
166 // The position and the length of the first invalid word.
167 int misspelling_start
;
168 int misspelling_length
;
176 // A valid English word "hello".
178 // A valid Chinese word (meaning "hello") consisting of two CJKV
180 {L
"\x4F60\x597D", true},
181 // A valid Korean word (meaning "hello") consisting of five hangul
183 {L
"\xC548\xB155\xD558\xC138\xC694", true},
184 // A valid Japanese word (meaning "hello") consisting of five Hiragana
186 {L
"\x3053\x3093\x306B\x3061\x306F", true},
187 // A valid Hindi word (meaning ?) consisting of six Devanagari letters
188 // (This word is copied from "http://b/issue?id=857583".)
189 {L
"\x0930\x093E\x091C\x0927\x093E\x0928", true},
190 // A valid English word "affix" using a Latin ligature 'ffi'
192 // A valid English word "hello" (fullwidth version)
193 {L
"\xFF28\xFF45\xFF4C\xFF4C\xFF4F", true},
194 // Two valid Greek words (meaning "hello") consisting of seven Greek
196 {L
"\x03B3\x03B5\x03B9\x03AC" L
" " L
"\x03C3\x03BF\x03C5", true},
197 // A valid Russian word (meaning "hello") consisting of twelve Cyrillic
199 {L
"\x0437\x0434\x0440\x0430\x0432\x0441"
200 L
"\x0442\x0432\x0443\x0439\x0442\x0435", true},
201 // A valid English contraction
203 // A valid English contraction with a typographical apostrophe.
204 {L
"isn\x2019t", true},
205 // A valid English word enclosed with underscores.
208 // A valid English word with a preceding whitespace
209 {L
" " L
"hello", true},
210 // A valid English word with a preceding no-break space
211 {L
"\xA0" L
"hello", true},
212 // A valid English word with a preceding ideographic space
213 {L
"\x3000" L
"hello", true},
214 // A valid English word with a preceding Chinese word
215 {L
"\x4F60\x597D" L
"hello", true},
216 // [ROBUSTNESS] A valid English word with a preceding Korean word
217 {L
"\xC548\xB155\xD558\xC138\xC694" L
"hello", true},
218 // A valid English word with a preceding Japanese word
219 {L
"\x3053\x3093\x306B\x3061\x306F" L
"hello", true},
220 // [ROBUSTNESS] A valid English word with a preceding Hindi word
221 {L
"\x0930\x093E\x091C\x0927\x093E\x0928" L
"hello", true},
222 // [ROBUSTNESS] A valid English word with two preceding Greek words
223 {L
"\x03B3\x03B5\x03B9\x03AC" L
" " L
"\x03C3\x03BF\x03C5"
225 // [ROBUSTNESS] A valid English word with a preceding Russian word
226 {L
"\x0437\x0434\x0440\x0430\x0432\x0441"
227 L
"\x0442\x0432\x0443\x0439\x0442\x0435" L
"hello", true},
229 // A valid English word with a following whitespace
230 {L
"hello" L
" ", true},
231 // A valid English word with a following no-break space
232 {L
"hello" L
"\xA0", true},
233 // A valid English word with a following ideographic space
234 {L
"hello" L
"\x3000", true},
235 // A valid English word with a following Chinese word
236 {L
"hello" L
"\x4F60\x597D", true},
237 // [ROBUSTNESS] A valid English word with a following Korean word
238 {L
"hello" L
"\xC548\xB155\xD558\xC138\xC694", true},
239 // A valid English word with a following Japanese word
240 {L
"hello" L
"\x3053\x3093\x306B\x3061\x306F", true},
241 // [ROBUSTNESS] A valid English word with a following Hindi word
242 {L
"hello" L
"\x0930\x093E\x091C\x0927\x093E\x0928", true},
243 // [ROBUSTNESS] A valid English word with two following Greek words
245 L
"\x03B3\x03B5\x03B9\x03AC" L
" " L
"\x03C3\x03BF\x03C5", true},
246 // [ROBUSTNESS] A valid English word with a following Russian word
247 {L
"hello" L
"\x0437\x0434\x0440\x0430\x0432\x0441"
248 L
"\x0442\x0432\x0443\x0439\x0442\x0435", true},
250 // Two valid English words concatenated with a whitespace
251 {L
"hello" L
" " L
"hello", true},
252 // Two valid English words concatenated with a no-break space
253 {L
"hello" L
"\xA0" L
"hello", true},
254 // Two valid English words concatenated with an ideographic space
255 {L
"hello" L
"\x3000" L
"hello", true},
256 // Two valid English words concatenated with a Chinese word
257 {L
"hello" L
"\x4F60\x597D" L
"hello", true},
258 // [ROBUSTNESS] Two valid English words concatenated with a Korean word
259 {L
"hello" L
"\xC548\xB155\xD558\xC138\xC694" L
"hello", true},
260 // Two valid English words concatenated with a Japanese word
261 {L
"hello" L
"\x3053\x3093\x306B\x3061\x306F" L
"hello", true},
262 // [ROBUSTNESS] Two valid English words concatenated with a Hindi word
263 {L
"hello" L
"\x0930\x093E\x091C\x0927\x093E\x0928" L
"hello" , true},
264 // [ROBUSTNESS] Two valid English words concatenated with two Greek words
265 {L
"hello" L
"\x03B3\x03B5\x03B9\x03AC" L
" " L
"\x03C3\x03BF\x03C5"
267 // [ROBUSTNESS] Two valid English words concatenated with a Russian word
268 {L
"hello" L
"\x0437\x0434\x0440\x0430\x0432\x0441"
269 L
"\x0442\x0432\x0443\x0439\x0442\x0435" L
"hello", true},
270 // [ROBUSTNESS] Two valid English words concatenated with a contraction
272 {L
"hello:hello", true},
274 // An invalid English word
275 {L
"ifmmp", false, 0, 5},
276 // An invalid English word "bffly" containing a Latin ligature 'ffl'
277 {L
"b\xFB04y", false, 0, 3},
278 // An invalid English word "ifmmp" (fullwidth version)
279 {L
"\xFF29\xFF46\xFF4D\xFF4D\xFF50", false, 0, 5},
280 // An invalid English contraction
281 {L
"jtm'u", false, 0, 5},
282 // An invalid English word enclosed with underscores.
283 {L
"_ifmmp_", false, 1, 5},
285 // An invalid English word with a preceding whitespace
286 {L
" " L
"ifmmp", false, 1, 5},
287 // An invalid English word with a preceding no-break space
288 {L
"\xA0" L
"ifmmp", false, 1, 5},
289 // An invalid English word with a preceding ideographic space
290 {L
"\x3000" L
"ifmmp", false, 1, 5},
291 // An invalid English word with a preceding Chinese word
292 {L
"\x4F60\x597D" L
"ifmmp", false, 2, 5},
293 // [ROBUSTNESS] An invalid English word with a preceding Korean word
294 {L
"\xC548\xB155\xD558\xC138\xC694" L
"ifmmp", false, 5, 5},
295 // An invalid English word with a preceding Japanese word
296 {L
"\x3053\x3093\x306B\x3061\x306F" L
"ifmmp", false, 5, 5},
297 // [ROBUSTNESS] An invalid English word with a preceding Hindi word
298 {L
"\x0930\x093E\x091C\x0927\x093E\x0928" L
"ifmmp", false, 6, 5},
299 // [ROBUSTNESS] An invalid English word with two preceding Greek words
300 {L
"\x03B3\x03B5\x03B9\x03AC" L
" " L
"\x03C3\x03BF\x03C5"
301 L
"ifmmp", false, 8, 5},
302 // [ROBUSTNESS] An invalid English word with a preceding Russian word
303 {L
"\x0437\x0434\x0440\x0430\x0432\x0441"
304 L
"\x0442\x0432\x0443\x0439\x0442\x0435" L
"ifmmp", false, 12, 5},
306 // An invalid English word with a following whitespace
307 {L
"ifmmp" L
" ", false, 0, 5},
308 // An invalid English word with a following no-break space
309 {L
"ifmmp" L
"\xA0", false, 0, 5},
310 // An invalid English word with a following ideographic space
311 {L
"ifmmp" L
"\x3000", false, 0, 5},
312 // An invalid English word with a following Chinese word
313 {L
"ifmmp" L
"\x4F60\x597D", false, 0, 5},
314 // [ROBUSTNESS] An invalid English word with a following Korean word
315 {L
"ifmmp" L
"\xC548\xB155\xD558\xC138\xC694", false, 0, 5},
316 // An invalid English word with a following Japanese word
317 {L
"ifmmp" L
"\x3053\x3093\x306B\x3061\x306F", false, 0, 5},
318 // [ROBUSTNESS] An invalid English word with a following Hindi word
319 {L
"ifmmp" L
"\x0930\x093E\x091C\x0927\x093E\x0928", false, 0, 5},
320 // [ROBUSTNESS] An invalid English word with two following Greek words
322 L
"\x03B3\x03B5\x03B9\x03AC" L
" " L
"\x03C3\x03BF\x03C5", false, 0, 5},
323 // [ROBUSTNESS] An invalid English word with a following Russian word
324 {L
"ifmmp" L
"\x0437\x0434\x0440\x0430\x0432\x0441"
325 L
"\x0442\x0432\x0443\x0439\x0442\x0435", false, 0, 5},
327 // Two invalid English words concatenated with a whitespace
328 {L
"ifmmp" L
" " L
"ifmmp", false, 0, 5},
329 // Two invalid English words concatenated with a no-break space
330 {L
"ifmmp" L
"\xA0" L
"ifmmp", false, 0, 5},
331 // Two invalid English words concatenated with an ideographic space
332 {L
"ifmmp" L
"\x3000" L
"ifmmp", false, 0, 5},
333 // Two invalid English words concatenated with a Chinese word
334 {L
"ifmmp" L
"\x4F60\x597D" L
"ifmmp", false, 0, 5},
335 // [ROBUSTNESS] Two invalid English words concatenated with a Korean word
336 {L
"ifmmp" L
"\xC548\xB155\xD558\xC138\xC694" L
"ifmmp", false, 0, 5},
337 // Two invalid English words concatenated with a Japanese word
338 {L
"ifmmp" L
"\x3053\x3093\x306B\x3061\x306F" L
"ifmmp", false, 0, 5},
339 // [ROBUSTNESS] Two invalid English words concatenated with a Hindi word
340 {L
"ifmmp" L
"\x0930\x093E\x091C\x0927\x093E\x0928" L
"ifmmp" , false, 0, 5},
341 // [ROBUSTNESS] Two invalid English words concatenated with two Greek words
342 {L
"ifmmp" L
"\x03B3\x03B5\x03B9\x03AC" L
" " L
"\x03C3\x03BF\x03C5"
343 L
"ifmmp", false, 0, 5},
344 // [ROBUSTNESS] Two invalid English words concatenated with a Russian word
345 {L
"ifmmp" L
"\x0437\x0434\x0440\x0430\x0432\x0441"
346 L
"\x0442\x0432\x0443\x0439\x0442\x0435" L
"ifmmp", false, 0, 5},
347 // [ROBUSTNESS] Two invalid English words concatenated with a contraction
349 {L
"ifmmp:ifmmp", false, 0, 11},
351 // [REGRESSION] Issue 13432: "Any word of 13 or 14 characters is not
352 // spellcheck" <http://crbug.com/13432>.
353 {L
"qwertyuiopasd", false, 0, 13},
354 {L
"qwertyuiopasdf", false, 0, 14},
356 // [REGRESSION] Issue 128896: "en_US hunspell dictionary includes
357 // acknowledgement but not acknowledgements" <http://crbug.com/128896>
358 {L
"acknowledgement", true},
359 {L
"acknowledgements", true},
361 // Issue 123290: "Spellchecker should treat numbers as word characters"
377 {L
"100,000,000", true},
378 {L
"3.141592653", true},
381 for (size_t i
= 0; i
< arraysize(kTestCases
); ++i
) {
382 size_t input_length
= 0;
383 if (kTestCases
[i
].input
!= NULL
) {
384 input_length
= wcslen(kTestCases
[i
].input
);
386 int misspelling_start
;
387 int misspelling_length
;
388 bool result
= spell_check()->SpellCheckWord(
389 base::WideToUTF16(kTestCases
[i
].input
).c_str(),
390 static_cast<int>(input_length
),
393 &misspelling_length
, NULL
);
395 EXPECT_EQ(kTestCases
[i
].expected_result
, result
);
396 EXPECT_EQ(kTestCases
[i
].misspelling_start
, misspelling_start
);
397 EXPECT_EQ(kTestCases
[i
].misspelling_length
, misspelling_length
);
401 TEST_F(SpellCheckTest
, SpellCheckSuggestions_EN_US
) {
402 static const struct {
403 // A string to be tested.
404 const wchar_t* input
;
405 // An expected result for this test case.
406 // * true: the input string does not have any invalid words.
407 // * false: the input string has one or more invalid words.
408 bool expected_result
;
409 // The position and the length of the first invalid word.
410 int misspelling_start
;
411 int misspelling_length
;
413 // A suggested word that should occur.
414 const wchar_t* suggested_word
;
416 {L
"ello", false, 0, 0, L
"hello"},
417 {L
"ello", false, 0, 0, L
"cello"},
418 {L
"wate", false, 0, 0, L
"water"},
419 {L
"wate", false, 0, 0, L
"waste"},
420 {L
"wate", false, 0, 0, L
"sate"},
421 {L
"wate", false, 0, 0, L
"ate"},
422 {L
"jum", false, 0, 0, L
"jump"},
423 {L
"jum", false, 0, 0, L
"hum"},
424 {L
"jum", false, 0, 0, L
"sum"},
425 {L
"jum", false, 0, 0, L
"um"},
426 {L
"alot", false, 0, 0, L
"a lot"},
427 // A regression test for Issue 36523.
428 {L
"privliged", false, 0, 0, L
"privileged"},
429 // TODO (Sidchat): add many more examples.
432 for (size_t i
= 0; i
< arraysize(kTestCases
); ++i
) {
433 std::vector
<base::string16
> suggestions
;
434 size_t input_length
= 0;
435 if (kTestCases
[i
].input
!= NULL
) {
436 input_length
= wcslen(kTestCases
[i
].input
);
438 int misspelling_start
;
439 int misspelling_length
;
440 bool result
= spell_check()->SpellCheckWord(
441 base::WideToUTF16(kTestCases
[i
].input
).c_str(),
442 static_cast<int>(input_length
),
448 // Check for spelling.
449 EXPECT_EQ(kTestCases
[i
].expected_result
, result
);
451 // Check if the suggested words occur.
452 bool suggested_word_is_present
= false;
453 for (int j
= 0; j
< static_cast<int>(suggestions
.size()); j
++) {
454 if (suggestions
.at(j
).compare(
455 base::WideToUTF16(kTestCases
[i
].suggested_word
)) == 0) {
456 suggested_word_is_present
= true;
461 EXPECT_TRUE(suggested_word_is_present
);
465 // This test verifies our spellchecker can split a text into words and check
466 // the spelling of each word in the text.
467 #if defined(THREAD_SANITIZER)
468 // SpellCheckTest.SpellCheckText fails under ThreadSanitizer v2.
469 // See http://crbug.com/217909.
470 #define MAYBE_SpellCheckText DISABLED_SpellCheckText
472 #define MAYBE_SpellCheckText SpellCheckText
473 #endif // THREAD_SANITIZER
474 TEST_F(SpellCheckTest
, MAYBE_SpellCheckText
) {
475 static const struct {
476 const char* language
;
477 const wchar_t* input
;
482 L
"Google se missie is om die w\x00EAreld se inligting te organiseer en "
483 L
"dit bruikbaar en toeganklik te maak."
487 L
"La missi\x00F3 de Google \x00E9s organitzar la informaci\x00F3 "
488 L
"del m\x00F3n i fer que sigui \x00FAtil i accessible universalment."
492 L
"Posl\x00E1n\x00EDm spole\x010Dnosti Google je "
493 L
"uspo\x0159\x00E1\x0064\x0061t informace z cel\x00E9ho sv\x011Bta "
494 L
"tak, aby byly v\x0161\x0065obecn\x011B p\x0159\x00EDstupn\x00E9 "
495 L
"a u\x017Eite\x010Dn\x00E9."
500 L
"mission er at organisere verdens information og g\x00F8re den "
501 L
"almindeligt tilg\x00E6ngelig og nyttig."
505 L
"Das Ziel von Google besteht darin, die auf der Welt vorhandenen "
506 L
"Informationen zu organisieren und allgemein zug\x00E4nglich und "
507 L
"nutzbar zu machen."
511 L
"\x0391\x03C0\x03BF\x03C3\x03C4\x03BF\x03BB\x03AE "
512 L
"\x03C4\x03B7\x03C2 Google \x03B5\x03AF\x03BD\x03B1\x03B9 "
513 L
"\x03BD\x03B1 \x03BF\x03C1\x03B3\x03B1\x03BD\x03CE\x03BD\x03B5\x03B9 "
514 L
"\x03C4\x03B9\x03C2 "
515 L
"\x03C0\x03BB\x03B7\x03C1\x03BF\x03C6\x03BF\x03C1\x03AF\x03B5\x03C2 "
516 L
"\x03C4\x03BF\x03C5 \x03BA\x03CC\x03C3\x03BC\x03BF\x03C5 "
517 L
"\x03BA\x03B1\x03B9 \x03BD\x03B1 \x03C4\x03B9\x03C2 "
518 L
"\x03BA\x03B1\x03B8\x03B9\x03C3\x03C4\x03AC "
519 L
"\x03C0\x03C1\x03BF\x03C3\x03B2\x03AC\x03C3\x03B9\x03BC\x03B5\x03C2 "
520 L
"\x03BA\x03B1\x03B9 \x03C7\x03C1\x03AE\x03C3\x03B9\x03BC\x03B5\x03C2."
522 // English (Australia)
524 L
"Google's mission is to organise the world's information and make it "
525 L
"universally accessible and useful."
529 L
"Google's mission is to organize the world's information and make it "
530 L
"universally accessible and useful."
532 // English (United Kingdom)
534 L
"Google's mission is to organise the world's information and make it "
535 L
"universally accessible and useful."
537 // English (United States)
539 L
"Google's mission is to organize the world's information and make it "
540 L
"universally accessible and useful."
544 L
"\x041c\x0438\x0441\x0438\x044f\x0442\x0430 "
545 L
"\x043d\x0430 Google \x0435 \x0434\x0430 \x043e"
546 L
"\x0440\x0433\x0430\x043d\x0438\x0437\x0438\x0440"
547 L
"\x0430 \x0441\x0432\x0435\x0442\x043e\x0432"
548 L
"\x043d\x0430\x0442\x0430 \x0438\x043d\x0444"
549 L
"\x043e\x0440\x043c\x0430\x0446\x0438\x044f "
550 L
"\x0438 \x0434\x0430 \x044f \x043d"
551 L
"\x0430\x043f\x0440\x0430\x0432\x0438 \x0443"
552 L
"\x043d\x0438\x0432\x0435\x0440\x0441\x0430\x043b"
553 L
"\x043d\x043e \x0434\x043e\x0441\x0442\x044a"
554 L
"\x043f\x043d\x0430 \x0438 \x043f\x043e"
555 L
"\x043b\x0435\x0437\x043d\x0430."
559 L
"La misi\x00F3n de "
560 // L"Google" - to be added.
561 L
" es organizar la informaci\x00F3n mundial "
562 L
"para que resulte universalmente accesible y \x00FAtil."
566 // L"Google'ile " - to be added.
567 L
"\x00FClesanne on korraldada maailma teavet ja teeb selle "
568 L
"k\x00F5igile k\x00E4ttesaadavaks ja kasulikuks.",
572 L
"Google er at samskipa alla vitan \x00ED heiminum og gera hana alment "
573 L
"atkomiliga og n\x00FDtiliga."
577 L
"Google a pour mission d'organiser les informations \x00E0 "
578 L
"l'\x00E9\x0063helle mondiale dans le but de les rendre accessibles "
579 L
"et utiles \x00E0 tous."
583 L
"\x05D4\x05DE\x05E9\x05D9\x05DE\x05D4 \x05E9\x05DC Google "
584 L
"\x05D4\x05D9\x05D0 \x05DC\x05D0\x05E8\x05D2\x05DF "
585 L
"\x05D0\x05EA \x05D4\x05DE\x05D9\x05D3\x05E2 "
586 L
"\x05D4\x05E2\x05D5\x05DC\x05DE\x05D9 "
587 L
"\x05D5\x05DC\x05D4\x05E4\x05D5\x05DA \x05D0\x05D5\x05EA\x05D5 "
588 L
"\x05DC\x05D6\x05DE\x05D9\x05DF "
589 L
"\x05D5\x05E9\x05D9\x05DE\x05D5\x05E9\x05D9 \x05D1\x05DB\x05DC "
590 L
"\x05D4\x05E2\x05D5\x05DC\x05DD. "
591 // Two words with ASCII double/single quoation marks.
592 L
"\x05DE\x05E0\x05DB\x0022\x05DC \x05E6\x0027\x05D9\x05E4\x05E1"
596 L
"Google \x0915\x093E \x092E\x093F\x0936\x0928 "
597 L
"\x0926\x0941\x0928\x093F\x092F\x093E \x0915\x0940 "
598 L
"\x091C\x093E\x0928\x0915\x093E\x0930\x0940 \x0915\x094B "
599 L
"\x0935\x094D\x092F\x0935\x0938\x094D\x0925\x093F\x0924 "
600 L
"\x0915\x0930\x0928\x093E \x0914\x0930 \x0909\x0938\x0947 "
601 L
"\x0938\x093E\x0930\x094D\x0935\x092D\x094C\x092E\x093F\x0915 "
602 L
"\x0930\x0942\x092A \x0938\x0947 \x092A\x0939\x0941\x0901\x091A "
603 L
"\x092E\x0947\x0902 \x0914\x0930 \x0909\x092A\x092F\x094B\x0917\x0940 "
604 L
"\x092C\x0928\x093E\x0928\x093E \x0939\x0948."
608 L
"A Google azt a k\x00FCldet\x00E9st v\x00E1llalta mag\x00E1ra, "
609 L
"hogy a vil\x00E1gon fellelhet\x0151 inform\x00E1\x0063i\x00F3kat "
610 L
"rendszerezze \x00E9s \x00E1ltal\x00E1nosan el\x00E9rhet\x0151v\x00E9, "
611 L
"illetve haszn\x00E1lhat\x00F3v\x00E1 tegye."
615 // L"Googleova " - to be added.
616 L
"je misija organizirati svjetske informacije i u\x010Diniti ih "
617 // L"univerzalno " - to be added.
618 L
"pristupa\x010Dnima i korisnima."
622 L
"Misi Google adalah untuk mengelola informasi dunia dan membuatnya "
623 L
"dapat diakses dan bermanfaat secara universal."
627 L
"La missione di Google \x00E8 organizzare le informazioni a livello "
628 L
"mondiale e renderle universalmente accessibili e fruibili."
632 L
"\x201EGoogle\x201C tikslas \x2013 rinkti ir sisteminti pasaulio "
633 L
"informacij\x0105 bei padaryti j\x0105 prieinam\x0105 ir "
634 L
"nauding\x0105 visiems."
638 L
"Google uzdevums ir k\x0101rtot pasaules inform\x0101"
639 L
"ciju un padar\x012Bt to univers\x0101li pieejamu un noder\x012Bgu."
643 // L"Googles " - to be added.
644 L
"m\x00E5l er \x00E5 organisere informasjonen i verden og "
645 L
"gj\x00F8re den tilgjengelig og nyttig for alle."
649 L
"Het doel van Google is om alle informatie wereldwijd toegankelijk "
650 L
"en bruikbaar te maken."
654 L
"Misj\x0105 Google jest uporz\x0105" L
"dkowanie \x015Bwiatowych "
655 L
"zasob\x00F3w informacji, aby sta\x0142y si\x0119 one powszechnie "
656 L
"dost\x0119pne i u\x017Cyteczne."
658 // Portuguese (Brazil)
661 #if !defined(OS_MACOSX)
664 L
"\x00E9 organizar as informa\x00E7\x00F5"
665 L
"es do mundo todo e "
666 #if !defined(OS_MACOSX)
669 L
"acess\x00EDveis e \x00FAteis em car\x00E1ter universal."
671 // Portuguese (Portugal)
674 #if !defined(OS_MACOSX)
677 L
"tem por miss\x00E3o organizar a informa\x00E7\x00E3o do "
679 #if !defined(OS_MACOSX)
682 L
"universalmente acess\x00EDvel e \x00FAtil"
686 L
"Misiunea Google este de a organiza informa\x021B3iile lumii \x0219i de "
687 L
"a le face accesibile \x0219i utile la nivel universal."
691 L
"\x041C\x0438\x0441\x0441\x0438\x044F Google "
692 L
"\x0441\x043E\x0441\x0442\x043E\x0438\x0442 \x0432 "
693 L
"\x043E\x0440\x0433\x0430\x043D\x0438\x0437\x0430\x0446\x0438\x0438 "
694 L
"\x043C\x0438\x0440\x043E\x0432\x043E\x0439 "
695 L
"\x0438\x043D\x0444\x043E\x0440\x043C\x0430\x0446\x0438\x0438, "
696 L
"\x043E\x0431\x0435\x0441\x043F\x0435\x0447\x0435\x043D\x0438\x0438 "
698 L
"\x0434\x043E\x0441\x0442\x0443\x043F\x043D\x043E\x0441\x0442\x0438 "
699 L
"\x0438 \x043F\x043E\x043B\x044C\x0437\x044B \x0434\x043B\x044F "
700 L
"\x0432\x0441\x0435\x0445."
701 // A Russian word including U+0451. (Bug 15558 <http://crbug.com/15558>)
702 L
"\x0451\x043B\x043A\x0430"
704 // Serbo-Croatian (Serbian Latin)
706 L
"Google-ova misija je da organizuje sve informacije na svetu i "
707 L
"u\x010dini ih univerzal-no dostupnim i korisnim."
711 L
"\x0047\x006f\x006f\x0067\x006c\x0065\x002d\x043e\x0432\x0430 "
712 L
"\x043c\x0438\x0441\x0438\x0458\x0430 \x0458\x0435 \x0434\x0430 "
713 L
"\x043e\x0440\x0433\x0430\x043d\x0438\x0437\x0443\x0458\x0435 "
714 L
"\x0441\x0432\x0435 "
715 L
"\x0438\x043d\x0444\x043e\x0440\x043c\x0430\x0446\x0438\x0458\x0435 "
716 L
"\x043d\x0430 \x0441\x0432\x0435\x0442\x0443 \x0438 "
717 L
"\x0443\x0447\x0438\x043d\x0438 \x0438\x0445 "
718 L
"\x0443\x043d\x0438\x0432\x0435\x0440\x0437\x0430\x043b\x043d\x043e "
719 L
"\x0434\x043e\x0441\x0442\x0443\x043f\x043d\x0438\x043c \x0438 "
720 L
"\x043a\x043e\x0440\x0438\x0441\x043d\x0438\x043c."
724 L
"Spolo\x010Dnos\x0165 Google si dala za \x00FAlohu usporiada\x0165 "
725 L
"inform\x00E1\x0063ie "
726 L
"z cel\x00E9ho sveta a zabezpe\x010Di\x0165, "
727 L
"aby boli v\x0161eobecne dostupn\x00E9 a u\x017Eito\x010Dn\x00E9."
731 // L"Googlovo " - to be added.
732 L
"poslanstvo je organizirati svetovne informacije in "
733 L
"omogo\x010Diti njihovo dostopnost in s tem uporabnost za vse."
737 L
"Googles m\x00E5ls\x00E4ttning \x00E4r att ordna v\x00E4rldens "
738 L
"samlade information och g\x00F6ra den tillg\x00E4nglig f\x00F6r alla."
742 // L"Google\x2019\x0131n " - to be added.
743 L
"misyonu, d\x00FCnyadaki t\x00FCm bilgileri "
744 L
"organize etmek ve evrensel olarak eri\x015Filebilir ve "
745 L
"kullan\x0131\x015Fl\x0131 k\x0131lmakt\x0131r."
749 L
"\x041c\x0456\x0441\x0456\x044f "
750 L
"\x043a\x043e\x043c\x043f\x0430\x043d\x0456\x0457 Google "
751 L
"\x043f\x043e\x043b\x044f\x0433\x0430\x0454 \x0432 "
752 L
"\x0442\x043e\x043c\x0443, \x0449\x043e\x0431 "
753 L
"\x0443\x043f\x043e\x0440\x044f\x0434\x043a\x0443\x0432\x0430\x0442"
754 L
"\x0438 \x0456\x043d\x0444\x043e\x0440\x043c\x0430\x0446\x0456\x044e "
755 L
"\x0437 \x0443\x0441\x044c\x043e\x0433\x043e "
756 L
"\x0441\x0432\x0456\x0442\x0443 \x0442\x0430 "
757 L
"\x0437\x0440\x043e\x0431\x0438\x0442\x0438 \x0457\x0457 "
758 L
"\x0443\x043d\x0456\x0432\x0435\x0440\x0441\x0430\x043b\x044c\x043d"
759 L
"\x043e \x0434\x043e\x0441\x0442\x0443\x043f\x043d\x043e\x044e "
760 L
"\x0442\x0430 \x043a\x043e\x0440\x0438\x0441\x043d\x043e\x044e."
764 L
"Nhi\x1EC7m v\x1EE5 c\x1EE7\x0061 "
765 L
"Google la \x0111\x1EC3 t\x1ED5 ch\x1EE9\x0063 "
766 L
"c\x00E1\x0063 th\x00F4ng tin c\x1EE7\x0061 "
767 L
"th\x1EBF gi\x1EDBi va l\x00E0m cho n\x00F3 universal c\x00F3 "
768 L
"th\x1EC3 truy c\x1EADp va h\x1EEFu d\x1EE5ng h\x01A1n."
772 L
"Google\xC758 \xBAA9\xD45C\xB294 \xC804\xC138\xACC4\xC758 "
773 L
"\xC815\xBCF4\xB97C \xCCB4\xACC4\xD654\xD558\xC5EC \xBAA8\xB450\xAC00 "
774 L
"\xD3B8\xB9AC\xD558\xAC8C \xC774\xC6A9\xD560 \xC218 "
775 L
"\xC788\xB3C4\xB85D \xD558\xB294 \xAC83\xC785\xB2C8\xB2E4."
779 L
"Misioni i Google \x00EBsht\x00EB q\x00EB t\x00EB organizoj\x00EB "
780 L
"informacionin e bot\x00EBs dhe t\x00EB b\x00EBjn\x00EB at\x00EB "
781 L
"universalisht t\x00EB arritshme dhe t\x00EB dobishme."
785 L
"Google \x0B87\x0BA9\x0BCD "
786 L
"\x0BA8\x0BC7\x0BBE\x0B95\x0BCD\x0B95\x0BAE\x0BCD "
787 L
"\x0B89\x0BB2\x0B95\x0BBF\x0BA9\x0BCD \x0BA4\x0B95\x0BB5\x0BB2\x0BCD "
788 L
"\x0B8F\x0BB1\x0BCD\x0BAA\x0BBE\x0B9F\x0BC1 \x0B87\x0BA4\x0BC1 "
789 L
"\x0B89\x0BB2\x0B95\x0BB3\x0BBE\x0BB5\x0BBF\x0BAF "
790 L
"\x0B85\x0BA3\x0BC1\x0B95\x0B95\x0BCD \x0B95\x0BC2\x0B9F\x0BBF\x0BAF "
791 L
"\x0BAE\x0BB1\x0BCD\x0BB1\x0BC1\x0BAE\x0BCD "
792 L
"\x0BAA\x0BAF\x0BA9\x0BC1\x0BB3\x0BCD\x0BB3 "
793 L
"\x0B9A\x0BC6\x0BAF\x0BCD\x0BAF \x0B89\x0BB3\x0BCD\x0BB3\x0BA4\x0BC1."
797 L
"\x041c\x0438\x0441\x0441\x0438\x044f\x0438 Google \x0438\x043d "
798 L
"\x043c\x0443\x0440\x0430\x0442\x0442\x0430\x0431 "
799 L
"\x0441\x043e\x0445\x0442\x0430\x043d\x0438 "
800 L
"\x043c\x0430\x044a\x043b\x0443\x043c\x043e\x0442\x04b3\x043e\x0438 "
801 L
"\x043c\x0430\x0432\x04b7\x0443\x0434\x0430, \x043e\x0441\x043e\x043d "
802 L
"\x043d\x0430\x043c\x0443\x0434\x0430\x043d\x0438 "
803 L
"\x0438\x0441\x0442\x0438\x0444\x043e\x0434\x0430\x0431\x0430\x0440"
804 L
"\x04e3 \x0432\x0430 \x0434\x0430\x0441\x0442\x0440\x0430\x0441\x0438 "
805 L
"\x0443\x043c\x0443\x043c "
806 L
"\x0433\x0430\x0440\x0434\x043e\x043d\x0438\x0434\x0430\x043d\x0438 "
807 L
"\x043e\x043d\x04b3\x043e \x0430\x0441\x0442."
811 for (size_t i
= 0; i
< arraysize(kTestCases
); ++i
) {
812 ReinitializeSpellCheck(kTestCases
[i
].language
);
813 size_t input_length
= 0;
814 if (kTestCases
[i
].input
!= NULL
)
815 input_length
= wcslen(kTestCases
[i
].input
);
817 int misspelling_start
= 0;
818 int misspelling_length
= 0;
819 bool result
= spell_check()->SpellCheckWord(
820 base::WideToUTF16(kTestCases
[i
].input
).c_str(),
821 static_cast<int>(input_length
),
824 &misspelling_length
, NULL
);
828 << std::wstring(kTestCases
[i
].input
).substr(
829 misspelling_start
, misspelling_length
)
830 << "\" is misspelled in "
831 << kTestCases
[i
].language
833 EXPECT_EQ(0, misspelling_start
);
834 EXPECT_EQ(0, misspelling_length
);
838 TEST_F(SpellCheckTest
, GetAutoCorrectionWord_EN_US
) {
839 static const struct {
840 // A misspelled word.
843 // An expected result for this test case.
844 // Should be an empty string if there are no suggestions for auto correct.
845 const char* expected_result
;
854 EnableAutoCorrect(true);
856 for (size_t i
= 0; i
< arraysize(kTestCases
); ++i
) {
857 base::string16
misspelled_word(base::UTF8ToUTF16(kTestCases
[i
].input
));
858 base::string16
expected_autocorrect_word(
859 base::UTF8ToUTF16(kTestCases
[i
].expected_result
));
860 base::string16 autocorrect_word
= spell_check()->GetAutoCorrectionWord(
863 // Check for spelling.
864 EXPECT_EQ(expected_autocorrect_word
, autocorrect_word
);
868 // Verify that our SpellCheck::SpellCheckWord() returns false when it checks
870 TEST_F(SpellCheckTest
, MisspelledWords
) {
871 static const struct {
872 const char* language
;
873 const wchar_t* input
;
876 // A misspelled word for English
880 // A misspelled word for Greek.
882 L
"\x03B1\x03B1\x03B1\x03B1\x03B1\x03B1\x03B1\x03B1\x03B1\x03B1",
884 // A misspelled word for Hebrew
886 L
"\x05D0\x05D0\x05D0\x05D0\x05D0\x05D0\x05D0\x05D0\x05D0\x05D0",
890 L
"\x0905\x0905\x0905\x0905\x0905\x0905\x0905\x0905\x0905\x0905",
892 // A misspelled word for Russian
894 L
"\x0430\x0430\x0430\x0430\x0430\x0430\x0430\x0430\x0430\x0430",
898 for (size_t i
= 0; i
< arraysize(kTestCases
); ++i
) {
899 ReinitializeSpellCheck(kTestCases
[i
].language
);
901 base::string16
word(base::WideToUTF16(kTestCases
[i
].input
));
902 int word_length
= static_cast<int>(word
.length());
903 int misspelling_start
= 0;
904 int misspelling_length
= 0;
905 bool result
= spell_check()->SpellCheckWord(word
.c_str(),
911 EXPECT_FALSE(result
);
912 EXPECT_EQ(0, misspelling_start
);
913 EXPECT_EQ(word_length
, misspelling_length
);
917 // Since SpellCheck::SpellCheckParagraph is not implemented on Mac,
918 // we skip these SpellCheckParagraph tests on Mac.
919 #if !defined(OS_MACOSX)
921 // Make sure SpellCheckParagraph does not crash if the input is empty.
922 TEST_F(SpellCheckTest
, SpellCheckParagraphEmptyParagraph
) {
923 std::vector
<SpellCheckResult
> expected
;
924 TestSpellCheckParagraph(base::UTF8ToUTF16(""), expected
);
927 // A simple test case having no misspellings.
928 TEST_F(SpellCheckTest
, SpellCheckParagraphNoMisspellings
) {
929 const base::string16 text
= base::UTF8ToUTF16("apple");
930 std::vector
<SpellCheckResult
> expected
;
931 TestSpellCheckParagraph(text
, expected
);
934 // A simple test case having one misspelling.
935 TEST_F(SpellCheckTest
, SpellCheckParagraphSingleMisspellings
) {
936 const base::string16 text
= base::UTF8ToUTF16("zz");
937 std::vector
<SpellCheckResult
> expected
;
938 expected
.push_back(SpellCheckResult(
939 SpellCheckResult::SPELLING
, 0, 2));
941 TestSpellCheckParagraph(text
, expected
);
944 // A simple test case having multiple misspellings.
945 TEST_F(SpellCheckTest
, SpellCheckParagraphMultipleMisspellings
) {
946 const base::string16 text
= base::UTF8ToUTF16("zz, zz");
947 std::vector
<SpellCheckResult
> expected
;
948 expected
.push_back(SpellCheckResult(
949 SpellCheckResult::SPELLING
, 0, 2));
950 expected
.push_back(SpellCheckResult(
951 SpellCheckResult::SPELLING
, 4, 2));
953 TestSpellCheckParagraph(text
, expected
);
956 // Make sure a relatively long (correct) sentence can be spellchecked.
957 TEST_F(SpellCheckTest
, SpellCheckParagraphLongSentence
) {
958 std::vector
<SpellCheckResult
> expected
;
959 // The text is taken from US constitution preamble.
960 const base::string16 text
= base::UTF8ToUTF16(
961 "We the people of the United States, in order to form a more perfect "
962 "union, establish justice, insure domestic tranquility, provide for "
963 "the common defense, promote the general welfare, and secure the "
964 "blessings of liberty to ourselves and our posterity, do ordain and "
965 "establish this Constitution for the United States of America.");
967 TestSpellCheckParagraph(text
, expected
);
970 // Make sure all misspellings can be found in a relatively long sentence.
971 TEST_F(SpellCheckTest
, SpellCheckParagraphLongSentenceMultipleMisspellings
) {
972 std::vector
<SpellCheckResult
> expected
;
974 // All 'the' are converted to 'hte' in US consitition preamble.
975 const base::string16 text
= base::UTF8ToUTF16(
976 "We hte people of hte United States, in order to form a more perfect "
977 "union, establish justice, insure domestic tranquility, provide for "
978 "hte common defense, promote hte general welfare, and secure hte "
979 "blessings of liberty to ourselves and our posterity, do ordain and "
980 "establish this Constitution for hte United States of America.");
982 expected
.push_back(SpellCheckResult(
983 SpellCheckResult::SPELLING
, 3, 3));
984 expected
.push_back(SpellCheckResult(
985 SpellCheckResult::SPELLING
, 17, 3));
986 expected
.push_back(SpellCheckResult(
987 SpellCheckResult::SPELLING
, 135, 3));
988 expected
.push_back(SpellCheckResult(
989 SpellCheckResult::SPELLING
, 163, 3));
990 expected
.push_back(SpellCheckResult(
991 SpellCheckResult::SPELLING
, 195, 3));
992 expected
.push_back(SpellCheckResult(
993 SpellCheckResult::SPELLING
, 298, 3));
995 TestSpellCheckParagraph(text
, expected
);
998 // We also skip RequestSpellCheck tests on Mac, because a system spellchecker
999 // is used on Mac instead of SpellCheck::RequestTextChecking.
1001 // Make sure RequestTextChecking does not crash if input is empty.
1002 TEST_F(SpellCheckTest
, RequestSpellCheckWithEmptyString
) {
1003 MockTextCheckingCompletion completion
;
1005 spell_check()->RequestTextChecking(base::string16(), &completion
);
1007 base::MessageLoop::current()->RunUntilIdle();
1009 EXPECT_EQ(completion
.completion_count_
, 1U);
1012 // A simple test case having no misspellings.
1013 TEST_F(SpellCheckTest
, RequestSpellCheckWithoutMisspelling
) {
1014 MockTextCheckingCompletion completion
;
1016 const base::string16 text
= base::ASCIIToUTF16("hello");
1017 spell_check()->RequestTextChecking(text
, &completion
);
1019 base::MessageLoop::current()->RunUntilIdle();
1021 EXPECT_EQ(completion
.completion_count_
, 1U);
1024 // A simple test case having one misspelling.
1025 TEST_F(SpellCheckTest
, RequestSpellCheckWithSingleMisspelling
) {
1026 MockTextCheckingCompletion completion
;
1028 const base::string16 text
= base::ASCIIToUTF16("apple, zz");
1029 spell_check()->RequestTextChecking(text
, &completion
);
1031 base::MessageLoop::current()->RunUntilIdle();
1033 EXPECT_EQ(completion
.completion_count_
, 1U);
1034 EXPECT_EQ(completion
.last_results_
.size(), 1U);
1035 EXPECT_EQ(completion
.last_results_
[0].location
, 7);
1036 EXPECT_EQ(completion
.last_results_
[0].length
, 2);
1039 // A simple test case having a few misspellings.
1040 TEST_F(SpellCheckTest
, RequestSpellCheckWithMisspellings
) {
1041 MockTextCheckingCompletion completion
;
1043 const base::string16 text
= base::ASCIIToUTF16("apple, zz, orange, zz");
1044 spell_check()->RequestTextChecking(text
, &completion
);
1046 base::MessageLoop::current()->RunUntilIdle();
1048 EXPECT_EQ(completion
.completion_count_
, 1U);
1049 EXPECT_EQ(completion
.last_results_
.size(), 2U);
1050 EXPECT_EQ(completion
.last_results_
[0].location
, 7);
1051 EXPECT_EQ(completion
.last_results_
[0].length
, 2);
1052 EXPECT_EQ(completion
.last_results_
[1].location
, 19);
1053 EXPECT_EQ(completion
.last_results_
[1].length
, 2);
1056 // A test case that multiple requests comes at once. Make sure all
1057 // requests are processed.
1058 TEST_F(SpellCheckTest
, RequestSpellCheckWithMultipleRequests
) {
1059 MockTextCheckingCompletion completion
[3];
1061 const base::string16 text
[3] = {
1062 base::ASCIIToUTF16("what, zz"),
1063 base::ASCIIToUTF16("apple, zz"),
1064 base::ASCIIToUTF16("orange, zz")
1067 for (int i
= 0; i
< 3; ++i
)
1068 spell_check()->RequestTextChecking(text
[i
], &completion
[i
]);
1070 base::MessageLoop::current()->RunUntilIdle();
1072 for (int i
= 0; i
< 3; ++i
) {
1073 EXPECT_EQ(completion
[i
].completion_count_
, 1U);
1074 EXPECT_EQ(completion
[i
].last_results_
.size(), 1U);
1075 EXPECT_EQ(completion
[i
].last_results_
[0].location
, 6 + i
);
1076 EXPECT_EQ(completion
[i
].last_results_
[0].length
, 2);
1080 // A test case that spellchecking is requested before initializing.
1081 // In this case, we postpone to post a request.
1082 TEST_F(SpellCheckTest
, RequestSpellCheckWithoutInitialization
) {
1083 UninitializeSpellCheck();
1085 MockTextCheckingCompletion completion
;
1086 const base::string16 text
= base::ASCIIToUTF16("zz");
1088 spell_check()->RequestTextChecking(text
, &completion
);
1090 // The task will not be posted yet.
1091 base::MessageLoop::current()->RunUntilIdle();
1092 EXPECT_EQ(completion
.completion_count_
, 0U);
1095 // Requests several spellchecking before initializing. Except the last one,
1096 // posting requests is cancelled and text is rendered as correct one.
1097 TEST_F(SpellCheckTest
, RequestSpellCheckMultipleTimesWithoutInitialization
) {
1098 UninitializeSpellCheck();
1100 MockTextCheckingCompletion completion
[3];
1101 const base::string16 text
[3] = {
1102 base::ASCIIToUTF16("what, zz"),
1103 base::ASCIIToUTF16("apple, zz"),
1104 base::ASCIIToUTF16("orange, zz")
1107 // Calls RequestTextchecking a few times.
1108 for (int i
= 0; i
< 3; ++i
)
1109 spell_check()->RequestTextChecking(text
[i
], &completion
[i
]);
1111 // The last task will be posted after initialization, however the other
1112 // requests should be pressed without spellchecking.
1113 base::MessageLoop::current()->RunUntilIdle();
1114 for (int i
= 0; i
< 2; ++i
)
1115 EXPECT_EQ(completion
[i
].completion_count_
, 1U);
1116 EXPECT_EQ(completion
[2].completion_count_
, 0U);
1118 // Checks the last request is processed after initialization.
1119 InitializeSpellCheck("en-US");
1121 // Calls PostDelayedSpellCheckTask instead of OnInit here for simplicity.
1122 spell_check()->PostDelayedSpellCheckTask(
1123 spell_check()->pending_request_param_
.release());
1124 base::MessageLoop::current()->RunUntilIdle();
1125 for (int i
= 0; i
< 3; ++i
)
1126 EXPECT_EQ(completion
[i
].completion_count_
, 1U);
1129 TEST_F(SpellCheckTest
, CreateTextCheckingResults
) {
1130 // Verify that the SpellCheck class keeps the spelling marker added to a
1131 // misspelled word "zz".
1133 base::string16 text
= base::ASCIIToUTF16("zz");
1134 std::vector
<SpellCheckResult
> spellcheck_results
;
1135 spellcheck_results
.push_back(SpellCheckResult(
1136 SpellCheckResult::SPELLING
, 0, 2, base::string16()));
1137 blink::WebVector
<blink::WebTextCheckingResult
> textcheck_results
;
1138 spell_check()->CreateTextCheckingResults(SpellCheck::USE_NATIVE_CHECKER
,
1142 &textcheck_results
);
1143 EXPECT_EQ(spellcheck_results
.size(), textcheck_results
.size());
1144 EXPECT_EQ(blink::WebTextDecorationTypeSpelling
,
1145 textcheck_results
[0].decoration
);
1146 EXPECT_EQ(spellcheck_results
[0].location
, textcheck_results
[0].location
);
1147 EXPECT_EQ(spellcheck_results
[0].length
, textcheck_results
[0].length
);
1150 // Verify that the SpellCheck class replaces the spelling marker added to a
1151 // contextually-misspelled word "bean" with a grammar marker.
1153 base::string16 text
= base::ASCIIToUTF16("I have bean to USA.");
1154 std::vector
<SpellCheckResult
> spellcheck_results
;
1155 spellcheck_results
.push_back(SpellCheckResult(
1156 SpellCheckResult::SPELLING
, 7, 4, base::string16()));
1157 blink::WebVector
<blink::WebTextCheckingResult
> textcheck_results
;
1158 spell_check()->CreateTextCheckingResults(SpellCheck::USE_NATIVE_CHECKER
,
1162 &textcheck_results
);
1163 EXPECT_EQ(spellcheck_results
.size(), textcheck_results
.size());
1164 EXPECT_EQ(blink::WebTextDecorationTypeGrammar
,
1165 textcheck_results
[0].decoration
);
1166 EXPECT_EQ(spellcheck_results
[0].location
, textcheck_results
[0].location
);
1167 EXPECT_EQ(spellcheck_results
[0].length
, textcheck_results
[0].length
);
1173 // Checks some words that should be present in all English dictionaries.
1174 TEST_F(SpellCheckTest
, EnglishWords
) {
1175 static const struct {
1179 // Issue 146093: "Chromebook" and "Chromebox" not included in spell-checking
1181 {"Chromebook", true},
1182 {"Chromebooks", true},
1183 {"Chromebox", true},
1184 {"Chromeboxes", true},
1185 {"Chromeblade", true},
1186 {"Chromeblades", true},
1187 {"Chromebase", true},
1188 {"Chromebases", true},
1189 // Issue 94708: Spell-checker incorrectly reports whisky as misspelled.
1193 // Issue 98678: "Recency" should be included in client-side dictionary.
1195 {"recencies", false},
1201 static const char* const kLocales
[] = { "en-GB", "en-US", "en-CA", "en-AU" };
1203 for (size_t j
= 0; j
< arraysize(kLocales
); ++j
) {
1204 ReinitializeSpellCheck(kLocales
[j
]);
1205 for (size_t i
= 0; i
< arraysize(kTestCases
); ++i
) {
1206 size_t input_length
= 0;
1207 if (kTestCases
[i
].input
!= NULL
)
1208 input_length
= strlen(kTestCases
[i
].input
);
1210 int misspelling_start
= 0;
1211 int misspelling_length
= 0;
1212 bool result
= spell_check()->SpellCheckWord(
1213 base::ASCIIToUTF16(kTestCases
[i
].input
).c_str(),
1214 static_cast<int>(input_length
),
1217 &misspelling_length
, NULL
);
1219 EXPECT_EQ(kTestCases
[i
].should_pass
, result
) << kTestCases
[i
].input
<<
1220 " in " << kLocales
[j
];
1225 // Checks that NOSUGGEST works in English dictionaries.
1226 TEST_F(SpellCheckTest
, NoSuggest
) {
1227 static const struct {
1229 const char* suggestion
;
1233 {"suckerbert", "cocksucker", "en-GB", true},
1234 {"suckerbert", "cocksucker", "en-US", true},
1235 {"suckerbert", "cocksucker", "en-CA", true},
1236 {"suckerbert", "cocksucker", "en-AU", true},
1237 {"suckerbert", "cocksuckers", "en-GB", true},
1238 {"suckerbert", "cocksuckers", "en-US", true},
1239 {"suckerbert", "cocksuckers", "en-CA", true},
1240 {"suckerbert", "cocksuckers", "en-AU", true},
1241 {"Batasunaa", "Batasuna", "ca-ES", true},
1242 {"pornoo", "porno", "it-IT", true},
1243 {"catass", "catas", "lt-LT", true},
1244 {"kuracc", "kurac", "sl-SI", true},
1245 {"pittt", "pitt", "sv-SE", true},
1248 size_t test_cases_size
= arraysize(kTestCases
);
1249 for (size_t i
= 0; i
< test_cases_size
; ++i
) {
1250 ReinitializeSpellCheck(kTestCases
[i
].locale
);
1251 size_t suggestion_length
= 0;
1252 if (kTestCases
[i
].suggestion
!= NULL
)
1253 suggestion_length
= strlen(kTestCases
[i
].suggestion
);
1255 // First check that the NOSUGGEST flag didn't mark this word as not being in
1257 int misspelling_start
= 0;
1258 int misspelling_length
= 0;
1259 bool result
= spell_check()->SpellCheckWord(
1260 base::ASCIIToUTF16(kTestCases
[i
].suggestion
).c_str(),
1261 static_cast<int>(suggestion_length
),
1264 &misspelling_length
, NULL
);
1266 EXPECT_EQ(kTestCases
[i
].should_pass
, result
) << kTestCases
[i
].suggestion
<<
1267 " in " << kTestCases
[i
].locale
;
1269 // Now verify that this test case does not show up as a suggestion.
1270 std::vector
<base::string16
> suggestions
;
1271 size_t input_length
= 0;
1272 if (kTestCases
[i
].input
!= NULL
)
1273 input_length
= strlen(kTestCases
[i
].input
);
1274 result
= spell_check()->SpellCheckWord(
1275 base::ASCIIToUTF16(kTestCases
[i
].input
).c_str(),
1276 static_cast<int>(input_length
),
1279 &misspelling_length
,
1281 // Input word should be a misspelling.
1282 EXPECT_FALSE(result
) << kTestCases
[i
].input
1283 << " is not a misspelling in "
1284 << kTestCases
[i
].locale
;
1285 // Check if the suggested words occur.
1286 for (int j
= 0; j
< static_cast<int>(suggestions
.size()); j
++) {
1287 for (size_t t
= 0; t
< test_cases_size
; t
++) {
1288 int compare_result
= suggestions
.at(j
).compare(
1289 base::ASCIIToUTF16(kTestCases
[t
].suggestion
));
1290 EXPECT_FALSE(compare_result
== 0) << kTestCases
[t
].suggestion
<<
1291 " in " << kTestCases
[i
].locale
;
1297 // Check that the correct dictionary files are checked in.
1298 TEST_F(SpellCheckTest
, DictionaryFiles
) {
1299 std::vector
<std::string
> spellcheck_languages
;
1300 chrome::spellcheck_common::SpellCheckLanguages(&spellcheck_languages
);
1301 EXPECT_FALSE(spellcheck_languages
.empty());
1303 base::FilePath hunspell
= GetHunspellDirectory();
1304 for (size_t i
= 0; i
< spellcheck_languages
.size(); ++i
) {
1305 base::FilePath dict
= chrome::spellcheck_common::GetVersionedFileName(
1306 spellcheck_languages
[i
], hunspell
);
1307 EXPECT_TRUE(base::PathExists(dict
)) << dict
.value() << " not found";
1311 // TODO(groby): Add a test for hunspell itself, when MAXWORDLEN is exceeded.
1312 TEST_F(SpellCheckTest
, SpellingEngine_CheckSpelling
) {
1313 static const struct {
1315 bool expected_result
;
1318 { "automatic", true },
1320 { "forglobantic", false },
1321 { "xfdssfsdfaasds", false },
1322 { // 64 chars are the longest word to check - this should fail checking.
1323 "abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijkl",
1326 { // Any word longer than 64 chars should be exempt from checking.
1327 "reallylongwordthatabsolutelyexceedsthespecifiedcharacterlimitabit",
1332 // Initialization magic - call InitializeIfNeeded twice. The first one simply
1333 // flags internal state that a dictionary was requested. The second one will
1334 // take the passed-in file and initialize hunspell with it. (The file was
1335 // passed to hunspell in the ctor for the test fixture).
1336 // This needs to be done since we need to ensure the SpellingEngine object
1337 // contained in |spellcheck_| from the test fixture does get initialized.
1338 // TODO(groby): Clean up this mess.
1339 InitializeIfNeeded();
1340 ASSERT_FALSE(InitializeIfNeeded());
1342 for (size_t i
= 0; i
< arraysize(kTestCases
); ++i
) {
1343 bool result
= CheckSpelling(kTestCases
[i
].word
, 0);
1344 EXPECT_EQ(kTestCases
[i
].expected_result
, result
) <<
1345 "Failed test for " << kTestCases
[i
].word
;
1349 // Chrome should not suggest "Othello" for "hellllo" or "identically" for
1351 TEST_F(SpellCheckTest
, LogicalSuggestions
) {
1352 static const struct {
1353 const char* misspelled
;
1354 const char* suggestion
;
1356 { "hellllo", "hello" },
1357 { "accidently", "accidentally" }
1360 for (size_t i
= 0; i
< arraysize(kTestCases
); ++i
) {
1361 int misspelling_start
= 0;
1362 int misspelling_length
= 0;
1363 std::vector
<base::string16
> suggestions
;
1364 EXPECT_FALSE(spell_check()->SpellCheckWord(
1365 base::ASCIIToUTF16(kTestCases
[i
].misspelled
).c_str(),
1366 strlen(kTestCases
[i
].misspelled
),
1369 &misspelling_length
,
1371 EXPECT_GE(suggestions
.size(), static_cast<size_t>(1));
1372 if (suggestions
.size() > 0)
1373 EXPECT_EQ(suggestions
[0], base::ASCIIToUTF16(kTestCases
[i
].suggestion
));