Update Hunspell to the latest stable version to use the latest dictionary for...

chrome/browser/spellchecker.cc

 // Copyright (c) 2006-2009 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "app/l10n_util.h"
 #include "chrome/browser/spellchecker.h"
 #include "chrome/browser/spellchecker_common.h"
 #include "chrome/browser/spellchecker_platform_engine.h"
 #include "base/basictypes.h"
 #include "base/compiler_specific.h"
@@ skipping 595 matching lines @@
   // This should be done in File Loop, but since Hunspell is in this IO Loop,
   // this too has to be initialized here.
   // TODO(sidchat): Work out a way to initialize Hunspell in the File Loop.
   std::string contents;
   file_util::ReadFileToString(custom_dictionary_file_name_, &contents);
   std::vector<std::string> list_of_words;
   SplitString(contents, '\n', &list_of_words);
   if (hunspell_.get()) {
     for (std::vector<std::string>::iterator it = list_of_words.begin();
          it != list_of_words.end(); ++it) {
-      hunspell_->put_word(it->c_str());
+      hunspell_->add(it->c_str());
     }
   }
 }
 
 // Returns whether or not the given string is a valid contraction.
 // This function is a fall-back when the SpellcheckWordIterator class
 // returns a concatenated word which is not in the selected dictionary
 // (e.g. "in'n'out") but each word is valid.
 bool SpellChecker::IsValidContraction(const string16& contraction) {
   SpellcheckWordIterator word_iterator;
@@ skipping 110 matching lines @@
     SpellCheckerPlatform::AddWord(word);
     return;
   }
 
   // Check if the |hunspell_| has been initialized at all.
   Initialize();
 
   // Add the word to hunspell.
   std::string word_to_add = WideToUTF8(word);
   if (!word_to_add.empty())
-    hunspell_->put_word(word_to_add.c_str());
+    hunspell_->add(word_to_add.c_str());
 
   // Now add the word to the custom dictionary file.
   Task* write_word_task =
       new AddWordToCustomDictionaryTask(custom_dictionary_file_name_, word);
   if (file_loop_)
     file_loop_->PostTask(FROM_HERE, write_word_task);
   else
     write_word_task->Run();
 }
 
@@ skipping 29 matching lines @@
 
   // Populate the vector of WideStrings.
   for (int i = 0; i < number_of_suggestions; i++) {
     if (i < kMaxSuggestions)
       optional_suggestions->push_back(UTF8ToWide(suggestions[i]));
     free(suggestions[i]);
   }
   if (suggestions != NULL)
     free(suggestions);
 }