2019-05-03 20:29:53 +02:00
|
|
|
import { cloneObject } from '../helpers';
|
2019-05-07 00:28:51 +02:00
|
|
|
import { addWord } from './wordManagement';
|
2019-05-03 18:34:11 +02:00
|
|
|
|
2019-05-04 00:10:41 +02:00
|
|
|
export function getNextId() {
|
|
|
|
const lastId = window.currentDictionary.words.reduce((highestId, word) => {
|
|
|
|
return (word.wordId && word.wordId) > highestId ? word.wordId : highestId;
|
|
|
|
}, 0);
|
|
|
|
return lastId + 1;
|
|
|
|
}
|
|
|
|
|
2019-05-03 18:34:11 +02:00
|
|
|
export function getWordsStats() {
|
2019-05-03 20:29:53 +02:00
|
|
|
const {words, partsOfSpeech} = window.currentDictionary;
|
|
|
|
const {caseSensitive} = window.currentDictionary.settings;
|
2019-05-03 18:34:11 +02:00
|
|
|
|
|
|
|
const wordStats = {
|
|
|
|
numberOfWords: [
|
|
|
|
{
|
|
|
|
name: 'Total',
|
|
|
|
value: words.length,
|
|
|
|
},
|
|
|
|
],
|
|
|
|
wordLength: {
|
|
|
|
shortest: 0,
|
|
|
|
longest: 0,
|
|
|
|
average: 0,
|
|
|
|
},
|
|
|
|
letterDistribution: [
|
|
|
|
/* {
|
|
|
|
letter: '',
|
|
|
|
number: 0,
|
|
|
|
percentage: 0.00,
|
|
|
|
} */
|
|
|
|
],
|
|
|
|
totalLetters: 0,
|
|
|
|
};
|
|
|
|
|
|
|
|
partsOfSpeech.forEach(partOfSpeech => {
|
|
|
|
const wordsWithPartOfSpeech = words.filter(word => word.partOfSpeech === partOfSpeech);
|
|
|
|
wordStats.numberOfWords.push({
|
|
|
|
name: partOfSpeech,
|
|
|
|
value: wordsWithPartOfSpeech.length,
|
|
|
|
});
|
|
|
|
});
|
|
|
|
|
|
|
|
wordStats.numberOfWords.push({
|
|
|
|
name: 'Unclassified',
|
|
|
|
value: words.filter(word => !partsOfSpeech.includes(word.partOfSpeech)).length,
|
|
|
|
});
|
|
|
|
|
|
|
|
let totalLetters = 0;
|
|
|
|
const numberOfLetters = {};
|
|
|
|
|
|
|
|
words.forEach(word => {
|
|
|
|
const shortestWord = wordStats.wordLength.shortest;
|
|
|
|
const longestWord = wordStats.wordLength.longest;
|
|
|
|
const wordLetters = word.name.split('');
|
|
|
|
const lettersInWord = wordLetters.length;
|
|
|
|
|
|
|
|
totalLetters += lettersInWord;
|
|
|
|
|
|
|
|
if (shortestWord === 0 || lettersInWord < shortestWord) {
|
|
|
|
wordStats.wordLength.shortest = lettersInWord;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (longestWord === 0 || lettersInWord > longestWord) {
|
|
|
|
wordStats.wordLength.longest = lettersInWord;
|
|
|
|
}
|
|
|
|
|
|
|
|
wordLetters.forEach(letter => {
|
|
|
|
const letterToUse = caseSensitive ? letter : letter.toLowerCase();
|
|
|
|
if (!numberOfLetters.hasOwnProperty(letterToUse)) {
|
|
|
|
numberOfLetters[letterToUse] = 1;
|
|
|
|
} else {
|
|
|
|
numberOfLetters[letterToUse]++;
|
|
|
|
}
|
|
|
|
});
|
|
|
|
});
|
|
|
|
|
|
|
|
wordStats.totalLetters = totalLetters;
|
2019-05-04 05:52:19 +02:00
|
|
|
wordStats.wordLength.average = words.length > 0 ? Math.round(totalLetters / words.length) : 0;
|
2019-05-03 18:34:11 +02:00
|
|
|
|
|
|
|
for (const letter in numberOfLetters) {
|
|
|
|
if (numberOfLetters.hasOwnProperty(letter)) {
|
|
|
|
const number = numberOfLetters[letter];
|
|
|
|
wordStats.letterDistribution.push({
|
|
|
|
letter,
|
|
|
|
number,
|
|
|
|
percentage: number / totalLetters,
|
|
|
|
});
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
wordStats.letterDistribution.sort((a, b) => {
|
|
|
|
if (a.percentage === b.percentage) return 0;
|
|
|
|
return (a.percentage > b.percentage) ? -1 : 1;
|
|
|
|
});
|
|
|
|
|
|
|
|
return wordStats;
|
|
|
|
}
|
2019-05-03 19:46:11 +02:00
|
|
|
|
|
|
|
export function wordExists(word, returnId = false) {
|
|
|
|
const { currentDictionary } = window;
|
|
|
|
const { caseSensitive } = currentDictionary.settings;
|
|
|
|
const foundWord = currentDictionary.words.find(existingWord => {
|
|
|
|
return caseSensitive ? existingWord.name === word : existingWord.name.toLowerCase() === word.toLowerCase();
|
|
|
|
});
|
|
|
|
return foundWord ? (returnId ? foundWord.wordId : true) : false;
|
2019-05-03 20:02:46 +02:00
|
|
|
}
|
2019-05-07 00:28:51 +02:00
|
|
|
|
|
|
|
export function generateRandomWords(numberOfWords) {
|
|
|
|
console.log('Generating', numberOfWords, 'words...');
|
|
|
|
const letters = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'];
|
|
|
|
letters.forEach(letter => letters.push(letter.toUpperCase()));
|
|
|
|
const words = [];
|
|
|
|
while (words.length < numberOfWords) {
|
|
|
|
let word = '';
|
|
|
|
while (word === '' || words.includes(word)) {
|
|
|
|
word += letters[Math.floor(Math.random() * letters.length)];
|
|
|
|
}
|
|
|
|
words.push(word);
|
|
|
|
}
|
|
|
|
words.forEach((word, index) => {
|
|
|
|
addWord({
|
|
|
|
name: word,
|
|
|
|
pronunciation: '/' + word + '/',
|
|
|
|
partOfSpeech: Math.random() > 0.5 ? 'Noun' : 'Verb',
|
|
|
|
simpleDefinition: word,
|
|
|
|
longDefinition: word + (index > 0 ? '\n\nRef: {{' + words[index - 1] + '}}' : ''),
|
|
|
|
wordId: getNextId(),
|
|
|
|
}, false);
|
|
|
|
});
|
|
|
|
console.log('done');
|
|
|
|
}
|