The first step towards Turkish spell-checker....

chrome/third_party/hunspell/google/bdict_writer.cc

 // Copyright 2008 Google Inc. All Rights Reserved.
 
 #include "chrome/third_party/hunspell/google/bdict_writer.h"
 
 #include "base/logging.h"
 #include "base/string_util.h"
 #include "chrome/third_party/hunspell/google/bdict.h"
 
 namespace hunspell {
 
@@ skipping 143 matching lines @@
 }
 
 // Recursively fills in the storage strategy for this node and each of its
 // children. This must be done before actually serializing because the storage
 // mode will depend on the size of the children.
 size_t ComputeTrieStorage(DicNode* node) {
   if (node->is_leaf()) {
     // The additional affix list holds affixes when there is more than one. Each
     // entry is two bytes, plus an additional FFFF terminator.
     size_t supplimentary_size = 0;
-    if (node->affix_indices.size() > 1 ||
-        node->affix_indices[0] > BDict::LEAF_NODE_MAX_FIRST_AFFIX_ID)
+    if (node->affix_indices[0] > BDict::LEAF_NODE_MAX_FIRST_AFFIX_ID) {
+      // We cannot store the first affix ID of the affix list into a leaf node.
+      // In this case, we have to store all the affix IDs and a terminator
+      // into a supplimentary list.
+      supplimentary_size = node->affix_indices.size() * 2 + 2;
+    } else if (node->affix_indices.size() > 1) {
+      // We can store the first affix ID of the affix list into a leaf node.
+      // In this case, we need to store the remaining affix IDs and a
+      // terminator into a supplimentary list.
       supplimentary_size = node->affix_indices.size() * 2;
+    }
 
     if (node->leaf_addition.empty()) {
       node->storage = DicNode::LEAF;
       return 2 + supplimentary_size;
     }
     node->storage = DicNode::LEAFMORE;
     // Signature & affix (2) + null for leaf_addition (1) = 3
     return 3 + node->leaf_addition.size() + supplimentary_size;
   }
 
@@ skipping 310 matching lines @@
   // Add the header now that we know the offsets.
   hunspell::BDict::AffHeader* header =
       reinterpret_cast<hunspell::BDict::AffHeader*>(&(*output)[header_offset]);
   header->affix_group_offset = static_cast<uint32>(affix_group_offset);
   header->affix_rule_offset = static_cast<uint32>(affix_rule_offset);
   header->rep_offset = static_cast<uint32>(rep_offset);
   header->other_offset = static_cast<uint32>(other_offset);
 }
 
 }  // namespace hunspell