ef333b6d72
* Simplify object structure of deinflections * Modify existing array when removing duplicates * Update _sortDefinitions to not return a value * Use explicit argument value * Use a Collator for string comparisons * Simplify order comparison * Improve tag creation and sanitization * Switch .map to a for loop, skip null meta * Add _createKanjiStat * Move _sortDefinitions definition * Fix kanji stat sorting * Remove return value from _sortTags * Add _sortKanji * Add fast exits for sorting * Add _sortDefinitionsByIndex * Combine sort function * Improve creation of kanji definition data * Use "databaseDefinitions" instead of "definitions" to disambiguate * Simplify * Simplify further * Simplify max length calculation * More destructuring * Use databaseDefinitions variable name * Move _mergeBySequence body into _getSequencedDefinitions * Use databaseDefinitions field name * Move maxLength calculation * Use shared _createTermDefinitionFromDatabaseDefinition * Simplify map * Move definition sorts for better consistency and less redundancy * Move _createExpression function * Update setup of sequenced definitions * Simplify for loop
96 lines
3.2 KiB
JavaScript
96 lines
3.2 KiB
JavaScript
/*
|
|
* Copyright (C) 2016-2020 Yomichan Authors
|
|
*
|
|
* This program is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
|
|
class Deinflector {
|
|
constructor(reasons) {
|
|
this.reasons = Deinflector.normalizeReasons(reasons);
|
|
}
|
|
|
|
deinflect(source, rawSource) {
|
|
const results = [{
|
|
source,
|
|
rawSource,
|
|
term: source,
|
|
rules: 0,
|
|
reasons: [],
|
|
databaseDefinitions: []
|
|
}];
|
|
for (let i = 0; i < results.length; ++i) {
|
|
const {rules, term, reasons} = results[i];
|
|
for (const [reason, variants] of this.reasons) {
|
|
for (const [kanaIn, kanaOut, rulesIn, rulesOut] of variants) {
|
|
if (
|
|
(rules !== 0 && (rules & rulesIn) === 0) ||
|
|
!term.endsWith(kanaIn) ||
|
|
(term.length - kanaIn.length + kanaOut.length) <= 0
|
|
) {
|
|
continue;
|
|
}
|
|
|
|
results.push({
|
|
source,
|
|
rawSource,
|
|
term: term.substring(0, term.length - kanaIn.length) + kanaOut,
|
|
rules: rulesOut,
|
|
reasons: [reason, ...reasons],
|
|
databaseDefinitions: []
|
|
});
|
|
}
|
|
}
|
|
}
|
|
return results;
|
|
}
|
|
|
|
static normalizeReasons(reasons) {
|
|
const normalizedReasons = [];
|
|
for (const [reason, reasonInfo] of Object.entries(reasons)) {
|
|
const variants = [];
|
|
for (const {kanaIn, kanaOut, rulesIn, rulesOut} of reasonInfo) {
|
|
variants.push([
|
|
kanaIn,
|
|
kanaOut,
|
|
Deinflector.rulesToRuleFlags(rulesIn),
|
|
Deinflector.rulesToRuleFlags(rulesOut)
|
|
]);
|
|
}
|
|
normalizedReasons.push([reason, variants]);
|
|
}
|
|
return normalizedReasons;
|
|
}
|
|
|
|
static rulesToRuleFlags(rules) {
|
|
const ruleTypes = Deinflector.ruleTypes;
|
|
let value = 0;
|
|
for (const rule of rules) {
|
|
const ruleBits = ruleTypes.get(rule);
|
|
if (typeof ruleBits === 'undefined') { continue; }
|
|
value |= ruleBits;
|
|
}
|
|
return value;
|
|
}
|
|
}
|
|
|
|
Deinflector.ruleTypes = new Map([
|
|
['v1', 0b0000001], // Verb ichidan
|
|
['v5', 0b0000010], // Verb godan
|
|
['vs', 0b0000100], // Verb suru
|
|
['vk', 0b0001000], // Verb kuru
|
|
['adj-i', 0b0010000], // Adjective i
|
|
['iru', 0b0100000] // Intermediate -iru endings for progressive or perfect tense
|
|
]);
|