File size: 3,281 Bytes
2d8be8f | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 | /*
* Open Chinese Convert
*
* Copyright 2010-2021 Carbo Kuo <byvoid@byvoid.com>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <algorithm>
#include <map>
#include "DictGroup.hpp"
#include "Lexicon.hpp"
#include "TextDict.hpp"
using namespace opencc;
namespace {
size_t GetKeyMaxLength(const std::list<DictPtr>& dicts) {
size_t keyMaxLength = 0;
for (const DictPtr& dict : dicts) {
keyMaxLength = (std::max)(keyMaxLength, dict->KeyMaxLength());
}
return keyMaxLength;
}
} // namespace
DictGroup::DictGroup(const std::list<DictPtr>& _dicts)
: keyMaxLength(GetKeyMaxLength(_dicts)), dicts(_dicts) {}
DictGroup::~DictGroup() {}
size_t DictGroup::KeyMaxLength() const { return keyMaxLength; }
Optional<const DictEntry*> DictGroup::Match(const char* word,
size_t len) const {
for (const auto& dict : dicts) {
const Optional<const DictEntry*>& prefix = dict->Match(word, len);
if (!prefix.IsNull()) {
return prefix;
}
}
return Optional<const DictEntry*>::Null();
}
Optional<const DictEntry*> DictGroup::MatchPrefix(const char* word,
size_t len) const {
for (const auto& dict : dicts) {
const Optional<const DictEntry*>& prefix = dict->MatchPrefix(word, len);
if (!prefix.IsNull()) {
return prefix;
}
}
return Optional<const DictEntry*>::Null();
}
std::vector<const DictEntry*> DictGroup::MatchAllPrefixes(const char* word,
size_t len) const {
std::map<size_t, const DictEntry*> matched;
// Match all prefixes from all dictionaries
for (const auto& dict : dicts) {
const std::vector<const DictEntry*>& entries =
dict->MatchAllPrefixes(word, len);
for (const auto& entry : entries) {
size_t entryLen = entry->KeyLength();
// If the current length has already result, skip
if (matched.find(entryLen) == matched.end()) {
matched[entryLen] = entry;
}
}
}
std::vector<const DictEntry*> matchedEntries;
for (auto i = matched.rbegin(); i != matched.rend(); i++) {
matchedEntries.push_back(i->second);
}
return matchedEntries;
}
LexiconPtr DictGroup::GetLexicon() const {
LexiconPtr allLexicon(new Lexicon);
for (const auto& dict : dicts) {
const auto& lexicon = dict->GetLexicon();
for (const std::unique_ptr<DictEntry>& item : *lexicon) {
allLexicon->Add(DictEntryFactory::New(item.get()));
}
}
allLexicon->Sort();
// Fixme deduplicate
return allLexicon;
}
DictGroupPtr DictGroup::NewFromDict(const Dict& dict) {
TextDictPtr newDict = TextDict::NewFromDict(dict);
return DictGroupPtr(new DictGroup(std::list<DictPtr>{newDict}));
}
|