| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
|
| #include <algorithm> |
| #include <cstring> |
|
|
| #include "BinaryDict.hpp" |
| #include "DartsDict.hpp" |
| #include "Lexicon.hpp" |
| #include "darts.h" |
|
|
| using namespace opencc; |
|
|
| static const char* OCDHEADER = "OPENCCDARTS1"; |
|
|
| class DartsDict::DartsInternal { |
| public: |
| BinaryDictPtr binary; |
| void* buffer; |
| Darts::DoubleArray* doubleArray; |
|
|
| DartsInternal() : binary(nullptr), buffer(nullptr), doubleArray(nullptr) {} |
|
|
| ~DartsInternal() { |
| if (buffer != nullptr) { |
| free(buffer); |
| } |
| if (doubleArray != nullptr) { |
| delete doubleArray; |
| } |
| } |
| }; |
|
|
| DartsDict::DartsDict() { internal = new DartsInternal; } |
|
|
| DartsDict::~DartsDict() { delete internal; } |
|
|
| size_t DartsDict::KeyMaxLength() const { return maxLength; } |
|
|
| Optional<const DictEntry*> DartsDict::Match(const char* word, |
| size_t len) const { |
| if (len > maxLength) { |
| return Optional<const DictEntry*>::Null(); |
| } |
| Darts::DoubleArray& dict = *internal->doubleArray; |
| Darts::DoubleArray::result_pair_type result; |
|
|
| dict.exactMatchSearch(word, result, len); |
| if (result.value != -1) { |
| return Optional<const DictEntry*>( |
| lexicon->At(static_cast<size_t>(result.value))); |
| } else { |
| return Optional<const DictEntry*>::Null(); |
| } |
| } |
|
|
| Optional<const DictEntry*> DartsDict::MatchPrefix(const char* word, |
| size_t len) const { |
| const size_t DEFAULT_NUM_ENTRIES = 64; |
| Darts::DoubleArray& dict = *internal->doubleArray; |
| Darts::DoubleArray::value_type results[DEFAULT_NUM_ENTRIES]; |
| Darts::DoubleArray::value_type maxMatchedResult; |
| size_t numMatched = dict.commonPrefixSearch( |
| word, results, DEFAULT_NUM_ENTRIES, (std::min)(maxLength, len)); |
| if (numMatched == 0) { |
| return Optional<const DictEntry*>::Null(); |
| } else if ((numMatched > 0) && (numMatched < DEFAULT_NUM_ENTRIES)) { |
| maxMatchedResult = results[numMatched - 1]; |
| } else { |
| Darts::DoubleArray::value_type* rematchedResults = |
| new Darts::DoubleArray::value_type[numMatched]; |
| numMatched = dict.commonPrefixSearch(word, rematchedResults, numMatched, |
| (std::min)(maxLength, len)); |
| maxMatchedResult = rematchedResults[numMatched - 1]; |
| delete[] rematchedResults; |
| } |
| if (maxMatchedResult >= 0) { |
| return Optional<const DictEntry*>( |
| lexicon->At(static_cast<size_t>(maxMatchedResult))); |
| } else { |
| return Optional<const DictEntry*>::Null(); |
| } |
| } |
|
|
| LexiconPtr DartsDict::GetLexicon() const { return lexicon; } |
|
|
| DartsDictPtr DartsDict::NewFromFile(FILE* fp) { |
| DartsDictPtr dict(new DartsDict()); |
|
|
| Darts::DoubleArray* doubleArray = new Darts::DoubleArray(); |
| size_t headerLen = strlen(OCDHEADER); |
| void* buffer = malloc(sizeof(char) * headerLen); |
| size_t bytesRead = fread(buffer, sizeof(char), headerLen, fp); |
| if (bytesRead != headerLen || memcmp(buffer, OCDHEADER, headerLen) != 0) { |
| throw InvalidFormat("Invalid OpenCC dictionary header"); |
| } |
| free(buffer); |
|
|
| size_t dartsSize; |
| bytesRead = fread(&dartsSize, sizeof(size_t), 1, fp); |
| if (bytesRead * sizeof(size_t) != sizeof(size_t)) { |
| throw InvalidFormat("Invalid OpenCC dictionary header (dartsSize)"); |
| } |
| buffer = malloc(dartsSize); |
| bytesRead = fread(buffer, 1, dartsSize, fp); |
| if (bytesRead != dartsSize) { |
| throw InvalidFormat("Invalid OpenCC dictionary size of darts mismatch"); |
| } |
| doubleArray->set_array(buffer); |
|
|
| auto internal = dict->internal; |
| internal->buffer = buffer; |
| internal->binary = BinaryDict::NewFromFile(fp); |
| internal->doubleArray = doubleArray; |
| dict->lexicon = internal->binary->GetLexicon(); |
| dict->maxLength = internal->binary->KeyMaxLength(); |
| return dict; |
| } |
|
|
| DartsDictPtr DartsDict::NewFromDict(const Dict& thatDict) { |
| DartsDictPtr dict(new DartsDict()); |
|
|
| Darts::DoubleArray* doubleArray = new Darts::DoubleArray(); |
| std::vector<std::string> keys; |
| std::vector<const char*> keys_cstr; |
| size_t maxLength = 0; |
| const LexiconPtr& lexicon = thatDict.GetLexicon(); |
| size_t lexiconCount = lexicon->Length(); |
| keys.resize(lexiconCount); |
| keys_cstr.resize(lexiconCount); |
| for (size_t i = 0; i < lexiconCount; i++) { |
| const DictEntry* entry = lexicon->At(i); |
| keys[i] = entry->Key(); |
| keys_cstr[i] = keys[i].c_str(); |
| maxLength = (std::max)(entry->KeyLength(), maxLength); |
| } |
| doubleArray->build(lexicon->Length(), &keys_cstr[0]); |
| dict->lexicon = lexicon; |
| dict->maxLength = maxLength; |
| auto internal = dict->internal; |
| internal->doubleArray = doubleArray; |
| return dict; |
| } |
|
|
| void DartsDict::SerializeToFile(FILE* fp) const { |
| Darts::DoubleArray& dict = *internal->doubleArray; |
|
|
| fwrite(OCDHEADER, sizeof(char), strlen(OCDHEADER), fp); |
|
|
| size_t dartsSize = dict.total_size(); |
| fwrite(&dartsSize, sizeof(size_t), 1, fp); |
| fwrite(dict.array(), sizeof(char), dartsSize, fp); |
|
|
| internal->binary.reset(new BinaryDict(lexicon)); |
| internal->binary->SerializeToFile(fp); |
| } |
|
|