120 lines
3.7 KiB
JavaScript
120 lines
3.7 KiB
JavaScript
/*
|
|
* Copyright (C) 2016-2017 Alex Yatskov <alex@foosoft.net>
|
|
* Author: Alex Yatskov <alex@foosoft.net>
|
|
*
|
|
* 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 <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
|
|
class Deinflection {
|
|
constructor(term, {rules=[], definitions=[], reason=''} = {}) {
|
|
this.term = term;
|
|
this.rules = rules;
|
|
this.definitions = definitions;
|
|
this.reason = reason;
|
|
this.children = [];
|
|
}
|
|
|
|
async deinflect(definer, reasons) {
|
|
for (const reason in reasons) {
|
|
for (const variant of reasons[reason]) {
|
|
let accept = this.rules.length === 0;
|
|
if (!accept) {
|
|
for (const rule of this.rules) {
|
|
if (variant.rulesIn.includes(rule)) {
|
|
accept = true;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (!accept || !this.term.endsWith(variant.kanaIn)) {
|
|
continue;
|
|
}
|
|
|
|
const term = this.term.slice(0, -variant.kanaIn.length) + variant.kanaOut;
|
|
if (term.length === 0) {
|
|
continue;
|
|
}
|
|
|
|
const child = new Deinflection(term, {reason, rules: variant.rulesOut});
|
|
if (await child.deinflect(definer, reasons)) {
|
|
this.children.push(child);
|
|
}
|
|
}
|
|
}
|
|
|
|
const definitions = await definer(this.term);
|
|
if (this.rules.length === 0) {
|
|
this.definitions = definitions;
|
|
} else {
|
|
for (const rule of this.rules) {
|
|
for (const definition of definitions) {
|
|
if (definition.rules.includes(rule)) {
|
|
this.definitions.push(definition);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if (this.definitions.length > 0 && this.children.length > 0) {
|
|
const child = new Deinflection(this.term, {rules: this.rules, definitions: this.definitions});
|
|
this.children.push(child);
|
|
}
|
|
|
|
return this.definitions.length > 0 || this.children.length > 0;
|
|
}
|
|
|
|
gather() {
|
|
if (this.children.length === 0) {
|
|
return [{
|
|
source: this.term,
|
|
rules: this.rules,
|
|
definitions: this.definitions,
|
|
reasons: this.reason.length > 0 ? [this.reason] : []
|
|
}];
|
|
}
|
|
|
|
const results = [];
|
|
for (const child of this.children) {
|
|
for (const result of child.gather()) {
|
|
if (this.reason.length > 0) {
|
|
result.reasons.push(this.reason);
|
|
}
|
|
|
|
result.source = this.term;
|
|
results.push(result);
|
|
}
|
|
}
|
|
|
|
return results;
|
|
}
|
|
}
|
|
|
|
|
|
class Deinflector {
|
|
constructor(reasons) {
|
|
this.reasons = reasons;
|
|
}
|
|
|
|
async deinflect(term, definer) {
|
|
const node = new Deinflection(term);
|
|
if (await node.deinflect(definer, this.reasons)) {
|
|
return node.gather();
|
|
} else {
|
|
return [];
|
|
}
|
|
}
|
|
}
|