2022-04-08 10:04:16 +00:00
|
|
|
/**
|
|
|
|
* Copyright (c) 2021 lingdocs.com
|
|
|
|
*
|
|
|
|
* This source code is licensed under the MIT license found in the
|
|
|
|
* LICENSE file in the root directory of this source tree.
|
|
|
|
*
|
|
|
|
*/
|
2022-10-06 08:17:28 +00:00
|
|
|
const fs = require("fs");
|
2022-10-09 05:58:28 +00:00
|
|
|
const fetch = require("node-fetch-commonjs");
|
2022-10-06 08:17:28 +00:00
|
|
|
const path = require("path");
|
2022-10-08 16:50:46 +00:00
|
|
|
const verbCollectionPath = path.join(".", "vocab", "verbs");
|
|
|
|
const nounAdjCollectionPath = path.join(".", "vocab", "nouns-adjs");
|
2022-10-06 08:17:28 +00:00
|
|
|
const verbTsFiles = fs.readdirSync(verbCollectionPath);
|
|
|
|
const nounAdjTsFiles = fs.readdirSync(nounAdjCollectionPath);
|
2022-10-08 16:50:46 +00:00
|
|
|
const protoModels = require("./src/lib/src/dictionary-models.js");
|
2022-10-06 08:17:28 +00:00
|
|
|
const Pbf = require("pbf");
|
2022-04-08 10:04:16 +00:00
|
|
|
|
2022-10-06 08:17:28 +00:00
|
|
|
const allVerbTsS = [...new Set(verbTsFiles.reduce((arr, fileName) => {
|
2022-10-08 16:50:46 +00:00
|
|
|
const TsS = require("./vocab/verbs/"+fileName);
|
2022-10-06 08:17:28 +00:00
|
|
|
return [...arr, ...TsS];
|
|
|
|
}, []))];
|
2022-04-08 10:04:16 +00:00
|
|
|
|
2022-10-06 08:17:28 +00:00
|
|
|
const allNounAdjTsS = [...new Set(nounAdjTsFiles.reduce((arr, fileName) => {
|
2022-10-08 16:50:46 +00:00
|
|
|
const TsS = require("./vocab/nouns-adjs/"+fileName).map(x => x.ts);
|
2022-10-06 08:17:28 +00:00
|
|
|
return [...arr, ...TsS];
|
|
|
|
}, []))];
|
2022-04-08 10:04:16 +00:00
|
|
|
|
|
|
|
fetch(process.env.LINGDOCS_DICTIONARY_URL).then(res => res.arrayBuffer()).then(buffer => {
|
|
|
|
const pbf = new Pbf(buffer);
|
|
|
|
const dictionary = protoModels.Dictionary.read(pbf);
|
|
|
|
const entries = dictionary.entries;
|
|
|
|
const allVerbs = getVerbsFromTsS(entries, allVerbTsS);
|
|
|
|
const verbsContent = `
|
|
|
|
/**
|
|
|
|
* Copyright (c) 2021 lingdocs.com
|
|
|
|
*
|
|
|
|
* This source code is licensed under the MIT license found in the
|
|
|
|
* LICENSE file in the root directory of this source tree.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
import { DictionaryEntry, VerbEntry } from "./types";
|
|
|
|
|
|
|
|
const verbs: {
|
|
|
|
entry: DictionaryEntry,
|
|
|
|
complement?: DictionaryEntry,
|
|
|
|
}[] = ${JSON.stringify(allVerbs)};
|
|
|
|
export default verbs as VerbEntry[];`;
|
|
|
|
fs.writeFileSync("./src/verbs.ts", verbsContent);
|
|
|
|
const allNounsAdjs = getNounsAdjsFromTsS(entries, allNounAdjTsS);
|
|
|
|
const nounsAdjsContent = `
|
|
|
|
/**
|
|
|
|
* Copyright (c) 2021 lingdocs.com
|
|
|
|
*
|
|
|
|
* This source code is licensed under the MIT license found in the
|
|
|
|
* LICENSE file in the root directory of this source tree.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
import { DictionaryEntry } from "./types";
|
|
|
|
|
|
|
|
const nounsAdjs: DictionaryEntry[] = ${JSON.stringify(allNounsAdjs)};
|
|
|
|
export default nounsAdjs;`;
|
|
|
|
fs.writeFileSync("./src/nouns-adjs.ts", nounsAdjsContent);
|
|
|
|
console.log("fetched words from dictionary");
|
|
|
|
});
|
|
|
|
|
|
|
|
function getNounsAdjsFromTsS(entries, tss) {
|
|
|
|
const missingEc = [];
|
|
|
|
const toReturn = tss.map(ts => {
|
|
|
|
const entry = entries.find(x => ts === x.ts);
|
|
|
|
if (!entry) {
|
|
|
|
console.log("couldn't find ts", ts);
|
|
|
|
return undefined;
|
|
|
|
}
|
|
|
|
if (ts.ec) {
|
|
|
|
missingEc.push(ts);
|
|
|
|
}
|
|
|
|
return entry;
|
|
|
|
}).filter(x => x);
|
|
|
|
if (missingEc.length !== 0) {
|
|
|
|
console.log("missingEc", missingEc);
|
|
|
|
}
|
|
|
|
return toReturn;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
function getVerbsFromTsS(entries, tss) {
|
|
|
|
const missingEc = [];
|
|
|
|
const toReturn = tss.map(ts => {
|
|
|
|
const entry = entries.find(x => ts === x.ts);
|
|
|
|
if (!entry.ec) {
|
|
|
|
missingEc.push(entry.ts);
|
|
|
|
}
|
|
|
|
if (!entry) {
|
|
|
|
console.log("couldn't find ts", ts);
|
|
|
|
return undefined;
|
|
|
|
}
|
|
|
|
if (entry.c && entry.c.includes("comp.")) {
|
|
|
|
const complement = entries.find(x => entry.l === x.ts);
|
|
|
|
return {
|
|
|
|
entry,
|
|
|
|
complement,
|
|
|
|
};
|
|
|
|
}
|
|
|
|
return { entry };
|
|
|
|
}).filter(x => x);
|
|
|
|
if (missingEc.length !== 0) {
|
|
|
|
console.log("missingEc", missingEc);
|
|
|
|
}
|
|
|
|
return toReturn;
|
|
|
|
|
|
|
|
}
|