').append(artifact['html']);
if (artifact['link'] == '/artifact/greasy-booklet') {
var gpages = $('.page', html).toArray();
for (var page_idx = 0; page_idx < gpages.length; page_idx++) {
var tags = $(".puflantu", gpages[page_idx]).toArray();
for (var i = 0; i < tags.length; i++)
phrases.push({'link': artifact['link'], 'name': artifact['name'], 'phrase': tags[i].innerHTML, 'page': page_idx + 1});
}
} else {
var tags = $(".puflantu", html).toArray();
for (var i = 0; i < tags.length; i++)
phrases.push({'link': artifact['link'], 'name': artifact['name'], 'phrase': tags[i].innerHTML});
}
}
fill_dictionary();
attach_translations();
add_listeners();
translate_words();
});
} else {
$.ajax({
url: '/dictionary' + location.search,
success: function (data) {
d = data;
attach_translations();
add_listeners();
translate_words();
}
});
}
$(window).focus(function() {
// Reduce duplicate simultaneous refreshes
var firing = $(this).data('firing');
if (firing != true)
$(this).data('firing', true);
setTimeout(function () {refresh(); $(this).data('firing', false);}, 1000)
});
setInterval(refresh, dictionary_refresh*1000);
$(document).click(closePopup);
};
$(document).ready(main_function);
function refresh() {
if (!document.hidden) {
$.ajax({
url: '/dictionary?refresh=true',
success: function (data) {
for (var wd in data)
update_dictionary_entry(wd, data[wd]);
}
});
}
}
function dict_row(wepp) {
var tr = $("
");
tr.append($("| ").text(wepp));
tr.append($(" | ").text(d[wepp] || ""));
tr.append(" | . . . | ");
return tr;
}
// Idempotent
function fill_dictionary() {
var words_to_phrases = {};
for (var wd in d) {
words_to_phrases[wd] = [];
}
for (var i = 0; i < phrases.length; i++) {
var phrase = phrases[i];
var toks = parse_phrase(phrase['phrase']);
for (var j = 0; j < toks.length; j++) {
var word = toks[j]['word'];
var norm_word = normalize(word);
var type = toks[j]['type'];
if (type == 'word') {
if (!(norm_word in words_to_phrases))
words_to_phrases[norm_word] = [];
words_to_phrases[norm_word].push(phrase);
}
}
}
$dict = $("#dictionary");
$dict.find("tr:gt(0)").remove();
var words = Object.keys(words_to_phrases);
words.sort();
var tbody = $("tbody", $dict);
for (var i = 0; i < words.length; ++i) {
tbody.append(dict_row(words[i]));
}
$dict.on('click', '.phrase-collapsible', function () {
$(this).toggleClass('active');
var phrase_list = $(this).next();
if (phrase_list.is(':empty')) {
var row = $(this).closest('tr');
var word = $('.dict-word', row).text();
phrase_list.append(words_to_phrases[word].map(function (phrase){
return (
"" + phrase['phrase'] + "
"
);
}).join(''));
$('.puflantu', phrase_list).map(function (i, phrase) {
attach_translations(phrase);
translate_words(phrase)
});
}
phrase_list.toggle();
});
// Uses fuse.js
var table_rows = $("tbody > tr", $dict).map(function (i, v) {
var $td = $('td', this);
return {
'puflantu': $td.eq(0).text(),
'english': $td.eq(1).text(),
'row': this
};
}).get();
row_map = {};
for (var i = 0; i < table_rows.length; i++)
row_map[table_rows[i]['puflantu']] = table_rows[i]['row'];
var options = {
keys: [
{name: 'puflantu', weight: 0.6},
{name: 'english', weight: 0.4}],
id: 'puflantu',
threshold: 0.4,
};
dictionary = new Fuse(table_rows, options);
$(".fuzzy-search", $dict).keyup(function () {
$("tbody > tr", $dict).remove();
var searchQuery = $(this).val();
var tds;
if (searchQuery.match(/^\s*$/)) {
// Search query is whitespace only. Instead of querying Fuse (which
// returns all rows that match that whitespace string i.e.
// untranslated Puflantu), just show all rows
tds = Object.values(row_map);
} else {
var matchedRows = dictionary.search(searchQuery);
tds = matchedRows.map(function (w) {return row_map[w];});
}
$("tbody:last-child", $dict).append(tds);
});
}
// Idempotent
function translate_words(div) {
$('.translateable', div || document.body).each(function (i) {
var word = $(this).attr('data-word');
var norm_word = normalize(word);
if (norm_word in d) {
var translation = d[norm_word];
var pretty_translation = translation;
if (word == word.toUpperCase())
pretty_translation = translation.toUpperCase();
else if (
(word.toLowerCase() != word) &&
(word.toLowerCase() == word.charAt(0).toLowerCase() + word.slice(1))
)
pretty_translation = translation.charAt(0).toUpperCase() + translation.slice(1);
$('.translation', this).text(pretty_translation);
$('.translation-input', this).attr('value', translation);
}
});
}
function update_dictionary_entry(word, translation) {
d[word] = translation;
// Could be more efficient...
translate_words();
if ($dict && row_map) {
var visible_row = $('tbody > tr', $dict).filter(function () {
return $('.dict-word', this).text() == word;
});
if (visible_row.length > 0)
$('.dict-translation', visible_row.eq(0)).text(translation);
if (word in row_map) {
var row = row_map[word];
$('.dict-translation', row).text(translation);
row_map[word] = row;
// Don't bother adding the new translation to the search function
}
}
}
function get_related_words(target_word) {
// Ignore casing
var target_word = normalize(target_word);
var all_words = Object.keys(d);
var scores = {};
for (var i = 0; i < all_words.length; i++) {
if (all_words[i] == target_word)
continue;
var score = 1.0 - levenshtein_distance(all_words[i], target_word) / target_word.length - 0.2;
// Negative scores are not worth showing
if (score >= 0)
scores[all_words[i]] = score;
}
all_words = Object.keys(scores);
// Sort highest scores first
all_words.sort(function (a, b) {
var sa = scores[a], sb = scores[b];
if (sa < sb) return 1;
if (sa > sb) return -1;
return 0;
});
return all_words.slice(0, 3).map(wd => [wd, d[wd]]);
}
function scratchpad(div) {
var out = div.nextSibling;
$('rt, .translation-popup', div).remove();
div.nextSibling.innerHTML = div.innerHTML;
attach_translations(out);
translate_words(out);
activePopup = null;
}
/* ============ EXTERNAL CODE COPIED HERE FOR CONVENIENCE ==============
*
* Copyright (c) 2011 Andrei Mackenzie
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
// Compute the edit distance between the two given strings
function levenshtein_distance(a, b){
if(a.length == 0) return b.length;
if(b.length == 0) return a.length;
var matrix = [];
// increment along the first column of each row
var i;
for(i = 0; i <= b.length; i++){
matrix[i] = [i];
}
// increment each column in the first row
var j;
for(j = 0; j <= a.length; j++){
matrix[0][j] = j;
}
// Fill in the rest of the matrix
for(i = 1; i <= b.length; i++){
for(j = 1; j <= a.length; j++){
if(b.charAt(i-1) == a.charAt(j-1)){
matrix[i][j] = matrix[i-1][j-1];
} else {
matrix[i][j] = Math.min(matrix[i-1][j-1] + 1.5, // substitution
Math.min(matrix[i][j-1] + 1, // insertion
matrix[i-1][j] + 1)); // deletion
}
}
}
return matrix[b.length][a.length];
};