Unit test for spellchecking 96- through 102-character words

chrome/tools/convert_dict/dic_reader.cc

 // Copyright (c) 2006-2008 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 "chrome/tools/convert_dict/dic_reader.h"
 
 #include <algorithm>
 #include <set>
 
 #include "base/file_util.h"
 #include "base/string_util.h"
 #include "chrome/tools/convert_dict/aff_reader.h"
 #include "chrome/tools/convert_dict/hunspell_reader.h"
 
 namespace convert_dict {
 
 namespace {
 
 // Maps each unique word to the unique affix group IDs associated with it.
 typedef std::map<std::string, std::set<int> > WordSet;
 
 void SplitDicLine(const std::string& line, std::vector<std::string>* output) {
-  // We split the line on a slash not preceeded by a backslash. A slash at the
+  // We split the line on a slash not preceded by a backslash. A slash at the
   // beginning of the line is not a separator either.
   size_t slash_index = line.size();
   for (size_t i = 0; i < line.size(); i++) {
     if (line[i] == '/' && i > 0 && line[i - 1] != '\\') {
       slash_index = i;
       break;
     }
   }
 
   output->clear();
@@ skipping 147 matching lines @@
     std::reverse(affixes.begin(), affixes.end());
     words_.push_back(std::make_pair(word->first, affixes));
   }
 
   // Double-check that the words are sorted.
   std::sort(words_.begin(), words_.end());
   return true;
 }
 
 }  // namespace convert_dict