2015-10-26 18:20:12 +00:00
|
|
|
/*
|
|
|
|
* Open Chinese Convert
|
|
|
|
*
|
2023-06-10 01:40:13 +00:00
|
|
|
* Copyright 2010-2014 Carbo Kuo <byvoid@byvoid.com>
|
2015-10-26 18:20:12 +00:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "Common.hpp"
|
|
|
|
#include "DictEntry.hpp"
|
|
|
|
|
|
|
|
namespace opencc {
|
|
|
|
/**
|
2022-02-11 12:55:16 +00:00
|
|
|
* Storage of all entries
|
|
|
|
* @ingroup opencc_cpp_api
|
|
|
|
*/
|
2015-10-26 18:20:12 +00:00
|
|
|
class OPENCC_EXPORT Lexicon {
|
|
|
|
public:
|
|
|
|
Lexicon() {}
|
2023-06-10 01:40:13 +00:00
|
|
|
Lexicon(std::vector<std::unique_ptr<DictEntry>> entries_)
|
2022-02-11 12:55:16 +00:00
|
|
|
: entries(std::move(entries_)) {}
|
|
|
|
Lexicon(const Lexicon&) = delete;
|
|
|
|
Lexicon& operator=(const Lexicon&) = delete;
|
2015-10-26 18:20:12 +00:00
|
|
|
|
2022-02-11 12:55:16 +00:00
|
|
|
// Lexicon will take the ownership of the entry.
|
|
|
|
void Add(DictEntry* entry) { entries.emplace_back(entry); }
|
2015-10-26 18:20:12 +00:00
|
|
|
|
2022-02-11 12:55:16 +00:00
|
|
|
void Add(std::unique_ptr<DictEntry> entry) {
|
|
|
|
entries.push_back(std::move(entry));
|
|
|
|
}
|
2015-10-26 18:20:12 +00:00
|
|
|
|
2023-06-10 01:40:13 +00:00
|
|
|
void Sort();
|
2015-10-26 18:20:12 +00:00
|
|
|
|
2023-06-10 01:40:13 +00:00
|
|
|
// Returns true if the lexicon is sorted by key.
|
|
|
|
bool IsSorted();
|
|
|
|
|
|
|
|
// Returns true if every key unique (after sorted).
|
|
|
|
// When dupkey is set, it is set to the duplicate key.
|
|
|
|
bool IsUnique(std::string* dupkey = nullptr);
|
2022-02-11 12:55:16 +00:00
|
|
|
|
|
|
|
const DictEntry* At(size_t index) const { return entries.at(index).get(); }
|
2015-10-26 18:20:12 +00:00
|
|
|
|
|
|
|
size_t Length() const { return entries.size(); }
|
|
|
|
|
2023-06-10 01:40:13 +00:00
|
|
|
std::vector<std::unique_ptr<DictEntry>>::const_iterator begin() const {
|
2022-02-11 12:55:16 +00:00
|
|
|
return entries.begin();
|
|
|
|
}
|
2015-10-26 18:20:12 +00:00
|
|
|
|
2023-06-10 01:40:13 +00:00
|
|
|
std::vector<std::unique_ptr<DictEntry>>::const_iterator end() const {
|
2022-02-11 12:55:16 +00:00
|
|
|
return entries.end();
|
|
|
|
}
|
2015-10-26 18:20:12 +00:00
|
|
|
|
|
|
|
private:
|
2023-06-10 01:40:13 +00:00
|
|
|
std::vector<std::unique_ptr<DictEntry>> entries;
|
2015-10-26 18:20:12 +00:00
|
|
|
};
|
2022-02-11 12:55:16 +00:00
|
|
|
} // namespace opencc
|