OLD | NEW |
1 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "chrome/tools/convert_dict/dic_reader.h" | 5 #include "chrome/tools/convert_dict/dic_reader.h" |
6 | 6 |
| 7 #include <stddef.h> |
| 8 |
7 #include <algorithm> | 9 #include <algorithm> |
8 #include <set> | 10 #include <set> |
9 | 11 |
10 #include "base/files/file_util.h" | 12 #include "base/files/file_util.h" |
11 #include "base/strings/string_util.h" | 13 #include "base/strings/string_util.h" |
12 #include "chrome/tools/convert_dict/aff_reader.h" | 14 #include "chrome/tools/convert_dict/aff_reader.h" |
13 #include "chrome/tools/convert_dict/hunspell_reader.h" | 15 #include "chrome/tools/convert_dict/hunspell_reader.h" |
14 | 16 |
15 namespace convert_dict { | 17 namespace convert_dict { |
16 | 18 |
(...skipping 164 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
181 std::reverse(affixes.begin(), affixes.end()); | 183 std::reverse(affixes.begin(), affixes.end()); |
182 words_.push_back(std::make_pair(word->first, affixes)); | 184 words_.push_back(std::make_pair(word->first, affixes)); |
183 } | 185 } |
184 | 186 |
185 // Double-check that the words are sorted. | 187 // Double-check that the words are sorted. |
186 std::sort(words_.begin(), words_.end()); | 188 std::sort(words_.begin(), words_.end()); |
187 return true; | 189 return true; |
188 } | 190 } |
189 | 191 |
190 } // namespace convert_dict | 192 } // namespace convert_dict |
OLD | NEW |