blob: 82c403a9eccf95b39e0bd69f72ecb896c649b96e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
var words = [];
var word;
var anagram;
var alphabet = "qwertyuiopasdfghjklzxcvbnm";
var letters = alphabet + alphabet.toUpperCase();
Array.prototype.equals = function (array)
{
if (this.length != array.length)
return false;
for (var i = 0; i < array.length; i++)
{
if (this[i] != array[i])
return false;
}
return true;
}
function containsSymbols(w)
{
for (var i = 0; i < w.length; i++)
{
if (!letters.includes(w[i]))
return true;
}
return false;
}
function letterCounts(w)
{
var lc = [];
for (var i = 0; i < 26; i++)
{
lc.push(0);
}
var w = w.toLowerCase();
for (var i = 0; i < w.length; i++)
{
lc[w.charCodeAt(i)-97]++;
}
return lc;
}
function isAnagram(w1, w2)
{
return letterCounts(w1).equals(letterCounts(w2));
}
function findWord()
{
var numWords = words.length;
word = words[Math.floor(Math.random()*numWords)];
if (containsSymbols(word))
findWord();
var lc = letterCounts(word);
for (var i = 0; i < numWords; i++)
{
if (words[i] != word && letterCounts(words[i]).equals(lc))
{
anagram = words[i];
return;
}
}
findWord();
}
function play()
{
document.getElementById("hidden").style = "visibility: hidden;";
document.getElementById("again").style = "visibility: hidden;";
document.getElementById("answer").style = "visibility: hidden;";
document.getElementById("guess").value = "";
document.getElementById("loading").innerHTML = "Finding a word with an anagram...";
findWord();
document.getElementById("loading").innerHTML = "";
document.getElementById("word").innerHTML = "Find an anagram of " + word + ".";
document.getElementById("hidden").style = "";
}
function isWord(x)
{
return words.indexOf(x) > -1;
}
function loadWords()
{
var xhttp = new XMLHttpRequest();
xhttp.onreadystatechange = function()
{
if (xhttp.readyState == 4 && xhttp.status == 200)
{
var allwords = xhttp.responseText.split('\n');
words = [];
for (var i = 0; i < allwords.length; i++)
{
if (allwords[i].length == 7)
words.push(allwords[i].toLowerCase());
}
play();
}
};
xhttp.open("GET", "https://raw.githubusercontent.com/sindresorhus/word-list/master/words.txt", true);
xhttp.send();
}
function submit()
{
var guess = document.getElementById("guess").value.toLowerCase();
if (letterCounts(guess).equals(letterCounts(word)) && isWord(guess))
{
document.getElementById("answer").style = "";
document.getElementById("answer").innerHTML = "<span style='color: green'>Correct!</span>";
document.getElementById("again").style = "";
}
else
{
document.getElementById("answer").style = "";
document.getElementById("answer").innerHTML = "<span style='color: red'>Incorrect!</span>";
}
}
function giveUp()
{
document.getElementById("answer").style = "";
document.getElementById("answer").innerHTML = "<span style='color: red'>The answer was " + anagram + ".</span>";
document.getElementById("again").style = "";
}
loadWords();
|
