// Copyright 2010-2020, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "dictionary/suffix_dictionary.h"
#include <algorithm>
#include <string>
#include "base/logging.h"
#include "base/serialized_string_array.h"
#include "base/util.h"
#include "dictionary/dictionary_token.h"
#include "absl/strings/string_view.h"
namespace mozc {
namespace dictionary {
namespace {
class ComparePrefix {
public:
explicit ComparePrefix(size_t max_len) : max_len_(max_len) {}
bool operator()(absl::string_view x, absl::string_view y) const {
return x.substr(0, max_len_) < y.substr(0, max_len_);
}
private:
const size_t max_len_;
};
} // namespace
SuffixDictionary::SuffixDictionary(absl::string_view key_array_data,
absl::string_view value_array_data,
const uint32 *token_array)
: token_array_(token_array) {
DCHECK(SerializedStringArray::VerifyData(key_array_data));
DCHECK(SerializedStringArray::VerifyData(value_array_data));
DCHECK(token_array_);
key_array_.Set(key_array_data);
value_array_.Set(value_array_data);
}
SuffixDictionary::~SuffixDictionary() {}
bool SuffixDictionary::HasKey(absl::string_view key) const {
// SuffixDictionary::HasKey() is never called and unnecessary to
// implement. To avoid accidental calls of this method, the method simply dies
// so that we can immediately notice this unimplemented method during
// development.
LOG(FATAL) << "bool SuffixDictionary::HasKey() is not implemented";
return false;
}
bool SuffixDictionary::HasValue(absl::string_view value) const {
// SuffixDictionary::HasValue() is never called and unnecessary to
// implement. To avoid accidental calls of this method, the method simply dies
// so that we can immediately notice this unimplemented method during
// development.
LOG(FATAL) << "bool SuffixDictionary::HasValue() is not implemented";
return false;
}
void SuffixDictionary::LookupPredictive(
absl::string_view key, const ConversionRequest &conversion_request,
Callback *callback) const {
using Iter = SerializedStringArray::const_iterator;
std::pair<Iter, Iter> range = std::equal_range(
key_array_.begin(), key_array_.end(), key, ComparePrefix(key.size()));
Token token;
token.attributes = Token::SUFFIX_DICTIONARY;
for (; range.first != range.second; ++range.first) {
token.key.assign((*range.first).data(), (*range.first).size());
switch (callback->OnKey(token.key)) {
case Callback::TRAVERSE_DONE:
return;
case Callback::TRAVERSE_NEXT_KEY:
continue;
case Callback::TRAVERSE_CULL:
LOG(FATAL) << "Culling is not supported.";
continue;
default:
break;
}
const size_t index = range.first - key_array_.begin();
if (value_array_[index].empty()) {
token.value = token.key;
} else {
token.value.assign(value_array_[index].data(),
value_array_[index].size());
}
token.lid = token_array_[3 * index];
token.rid = token_array_[3 * index + 1];
token.cost = token_array_[3 * index + 2];
if (callback->OnToken(token.key, token.key, token) !=
Callback::TRAVERSE_CONTINUE) {
break;
}
}
}
void SuffixDictionary::LookupPrefix(absl::string_view key,
const ConversionRequest &conversion_request,
Callback *callback) const {}
void SuffixDictionary::LookupExact(absl::string_view key,
const ConversionRequest &conversion_request,
Callback *callback) const {}
void SuffixDictionary::LookupReverse(
absl::string_view key, const ConversionRequest &conversion_request,
Callback *callback) const {}
} // namespace dictionary
} // namespace mozc