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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
|
/* CodeQ: an online programming tutor.
Copyright (C) 2015 UL FRI
This program is free software: you can redistribute it and/or modify it under
the terms of the GNU Affero 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 Affero General Public License for more
details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
(function(){
"use strict";
var jqScreen = $('#screen_problem_list'),
languageCache = {}, // keyed by language identifier: processed data about languages
translationCache = [], // keys are autogenerated in ta(), a value is a dictionary of translations of a translation key for every language
problemCache = {}, // problem data cache, 3-level, keyed by: language, problem group, and problem identifier
langs, Nlangs, // constants, set on init
// ================================================================================
// Hint processing: extract hints from the translations and return them in the
// processed form, hint key -> translation language -> value
// ================================================================================
defaultHintCondition = function (translation) {
// must contain at least one translation
var key;
if (!translation || typeof translation !== 'object') return false;
for (key in translation) {
if (!translation.hasOwnProperty(key)) continue;
return true;
}
return false;
},
processHints = function (rawTranslations) {
var defaultHint = {}, // here we put all the hints with their default translations
allHints = {}, // the result
allHintKeys = [],
tr, key, i, lang, hint, h, j;
// find the default hint translations, they will form the basis of default hints
tr = chooseDefaultTranslation(rawTranslations, 'hint', defaultHintCondition) || {};
for (key in tr) { // copy the hints
if (!tr.hasOwnProperty(key)) continue;
defaultHint[key] = tr[key];
allHintKeys.push(key);
}
// copy any hints not in the default hints to the default hints
for (i = langs.length - 1; i >= 0; i--) {
lang = langs[i];
tr = rawTranslations[lang];
if (!tr || !defaultHintCondition(tr.hint)) continue; // skip unavailable translations or translations with no hints
hint = tr.hint;
for (key in hint) {
if (!hint.hasOwnProperty(key) || !hint[key]) continue;
if (!(key in defaultHint)) {
defaultHint[key] = hint[key];
allHintKeys.push(key);
}
}
}
// create all translations for hints
for (i = allHintKeys.length - 1; i >= 0; i--) {
allHints[allHintKeys[i]] = {}; // create keys with no translations, we'll fill them in the next loop
}
for (i = langs.length - 1; i >= 0; i--) {
lang = langs[i];
tr = rawTranslations[lang];
// set up hints
if (!tr || !defaultHintCondition(tr.hint)) {
// there's no hint in the current language, copy the default in its entirety
for (j = allHintKeys.length - 1; j >= 0; j--) {
key = allHintKeys[j];
allHints[key][lang] = defaultHint[key];
}
}
else {
// make a copy of all hints, using the default hint value where a hint value is missing
h = tr.hint;
for (j = allHintKeys.length - 1; j >= 0; j--) {
key = allHintKeys[j];
allHints[key][lang] = h[key] || defaultHint[key];
}
}
}
return allHints;
},
// ================================================================================
// Plan processing: extract plans from the translations and return them in the
// processed form, hint key -> translation language -> value
// ================================================================================
defaultPlanCondition = function (translation) {
// default plan must be non-empty
if (!translation || !(translation instanceof Array)) return false;
return translation.length > 0;
},
/**
* Structurally converts the plan definition into something that the
* hint module can work with.
* The input is the translations object from problem.json in the form
* {'sl': { ..., 'plan': [hint1_sl, hint2_sl, ...]}, 'en': { ..., 'plan': [hint1_en, hint2_en, ...]}, ...}
* The output is a list of hints in the plan, translations are in each hint:
* [{'sl': hint1_sl, 'en': hint1_en, ...}, {'sl': hint2_sl, 'en': hint2_en}, ...]
*/
processPlans = function (rawTranslations) {
// find the default plan translation
var defaultPlan = chooseDefaultTranslation(rawTranslations, 'plan', defaultPlanCondition) || [],
result = [],
i, lang, tr, plan, j, fragment;
if (defaultPlan.length == 0) return result; // no plan
// copy all translations from plan
for (i = langs.length - 1; i >= 0; i--) {
lang = langs[i];
tr = rawTranslations[lang];
// set up plan
if (tr && defaultPlanCondition(tr.plan)) {
plan = tr.plan;
}
else {
// there's no plan in the current language, copy the default plan
plan = defaultPlan;
}
if (!(plan instanceof Array)) plan = [plan];
for (j = 0; j < plan.length; j++) {
if (j < result.length) fragment = result[j];
else {
fragment = {};
result.push(fragment);
}
fragment[lang] = plan[j];
}
}
// ensure each plan element has all translations
for (j = result.length - 1; j >= 0; j--) {
fragment = result[j];
for (i = langs.length - 1; i >= 0; i--) {
lang = langs[i];
if (!fragment[lang]) fragment[lang] = 'Missing plan for language ' + lang + ' at index ' + j;
}
}
return result;
},
// ================================================================================
// Group + problems directory processing
// ================================================================================
chooseTranslation = function (keyword, lang, currentDict, enDict, translations) {
var tr = currentDict[keyword],
otherLang;
if (tr) return tr; // if there is a translation in the current dictionary: return it
tr = enDict[keyword];
if (tr) { // if there is a translation in the english dictionary: return it
codeq.log.info('Translation for ' + keyword + ' not set for language ' + lang + ', using translation from en');
return tr;
}
for (otherLang in translations) {
if (!translations.hasOwnProperty(otherLang)) continue;
tr = (translations[otherLang] || {})[keyword];
if (tr) { // otherwise: return the first available translation in any language
codeq.log.info('Translation for ' + keyword + ' not set for language ' + lang + ', using translation from ' + otherLang);
return tr;
}
}
return keyword + ' not set for language ' + lang;
},
/**
* convert the input translations (arg0) for given keys (arg1..argN)
* so each keys holds all its translations for every language
*/
convertTranslations = function () {
var translations = arguments[0] || {},
result = {},
enDict = translations['en'] || {},
lang, dict, i, keyword, l;
// initialize result: one lang-dict per keyword
for (i = arguments.length - 1; i > 0; i--) result[arguments[i]] = {};
// convert translations: one keyword-dict per lang -> one lang-dict per keyword
for (l = Nlangs - 1; l >= 0; l--) {
lang = langs[l];
dict = translations[lang] || {};
for (i = arguments.length - 1; i > 0; i--) {
keyword = arguments[i];
// result[keyword][lang] = dict[keyword] || keyword + ' not set for language ' + lang;
result[keyword][lang] = chooseTranslation(keyword, lang, dict, enDict, translations);
}
}
return result;
},
/**
* Connect the given translations of a key with the DOM, returning
* the string of arguments to use with a HTML tag which will contain
* a translation chosen from the given dictionary.
*/
ta = function (trObj) { // an object of the form: {'en': 'english content', 'sl': 'slovenska vsebina'}
var result = ['data-dict="directory" data-tkey="', translationCache.length, '"'].join('');
translationCache.push(trObj);
return result;
},
/**
* Assemble the display structure and translations from the server's
* language.json for the given language identifier.
*/
createLanguageData = function (data, languageIdentifier) { // data is the content of language.json
var li = languageIdentifier, // a shorthand
rawTranslations = data.translations || {},
groups = data.groups || [],
Ngroups = groups.length,
html = [],
problemReferences = [],
group, problems, Nproblems, problem, i, j, nrefs,
baseTabIndex = 200; // tabindex attribute of the first problem link
var langDict = convertTranslations(rawTranslations, 'name', 'description'), // this will be the resulting dictionary: multi-level keys that lead up to the lang-dict
groupDict, problemDict;
codeq.template.processDictionary(langDict.description, [languageIdentifier]);
// title: HTML structure for "name" and "desc"
html.push('<h1 class="language-title" ', ta(langDict.name), '></h1><hr>');
html.push('<p class="language-description" ', ta(langDict.description), '></p>');
// content: problem directory
for (i = 0; i < Ngroups; i++) {
group = groups[i] || {};
groupDict = convertTranslations(group.translations, 'name', 'description'); // the group-level translations, added will
codeq.template.processDictionary(groupDict.description,
[languageIdentifier, group.identifier]);
// group content
html.push('<h2 class="group-title" ', ta(groupDict.name), '></h2>');
html.push('<div class="group-description" ', ta(groupDict.description), '></div>');
html.push('<ul class="group-problems">');
// problem content
problems = group.problems || [];
Nproblems = problems.length;
for (j = 0; j < Nproblems; j++) {
nrefs = problemReferences.length;
problem = problems[j] || {};
problemDict = convertTranslations(problem.translations, 'name');
html.push('<li><a href="#" tabindex="' + (baseTabIndex+nrefs) + '"' + ' class="problem-', '' + nrefs, '" ', ta(problemDict.name), '></a></li>');
problemReferences.push({'g': group.identifier || 'nogroup', 'p': problem.identifier || 'noproblem', 'id': problem.id});
}
html.push('</ul>');
}
return {
'language': languageIdentifier, // 'prolog', 'python', ...
'html': html.join(''), // the DOM structure (without textual content), as HTML text
'refs': problemReferences, // array of problem info {g: group, p: problem, id: problem_id}, referenced from DOM <a> elements
'commonDef': {
'hint': processHints(rawTranslations), // hint translations: keyword -> lang -> value
'hint_type': data.hint_type || {}
}
};
},
// ================================================================================
// DOM instantiation.
// The transition to problem solving takes place here, after the user clicks on a
// problem and all the required data is loaded.
// ================================================================================
/**
* Instantiates the screen from the given processed data.
*/
createDom = function (data) { // data is the (cached) result of createLanguageData()
var language = data.language;
jqScreen.html(data.html);
codeq.tr.translateDom(jqScreen);
jqScreen.find('.group-problems a').on('click', function (e) {
var index = +$(this).attr('class').split(' ')[0].split('-')[1],
ref = data.refs[index];
e.preventDefault();
if (!ref) {
codeq.log.error('Clicked on a problem link having erroneous index: ' + index);
return;
}
codeq.globalStateMachine.transition(language,ref,data);
});
},
/**
* Show attempted/solved status in the link for every problem.
*/
showAttempts = function (languageData, attempts) {
var i;
for (i = 0; i < languageData.refs.length; i++) {
var ref = languageData.refs[i];
if (ref.id in attempts) {
jqScreen.find('a.problem-'+i)
.removeClass('solved attempted')
.addClass(attempts[ref.id] ? 'solved' : 'attempted');
}
}
},
// ================================================================================
// Problem definition processing
// ================================================================================
chooseDefaultTranslation = function (rawTranslations, translationKey, condition) {
var tr = rawTranslations.en, // try English as the default
lang;
if (typeof condition !== 'function') condition = function (x) { return !!x; };
if (tr && condition(tr[translationKey])) return tr[translationKey];
for (lang in rawTranslations) { // find a translation with content
if (!rawTranslations.hasOwnProperty(lang)) continue;
tr = rawTranslations[lang];
if (tr && condition(tr[translationKey])) return tr[translationKey];
}
return null; // default must be chosen by the caller
},
processProblemData = function (rawData, language, group, problem) {
var rawTranslations = rawData.translations || {};
return {
'language': language,
'group': group,
'problem': problem,
'id': rawData.id,
'translations': convertTranslations(rawTranslations, 'title', 'name', 'slug', 'description'), // GUI translations: keyword -> lang -> value
'hint': processHints(rawTranslations), // hint translations: keyword -> lang -> value
'plan': processPlans(rawTranslations), // plan translations: keyword -> lang -> value
'hint_type': rawData.hint_type || {}
};
},
getProblemData = function (language, group, problem) {
var langCache = problemCache[language],
groupCache, cachedProblem, promise;
if (langCache) {
groupCache = langCache[group];
if (!groupCache) {
groupCache = {};
langCache[group] = groupCache;
}
}
else {
langCache = {};
problemCache[language] = langCache;
groupCache = {};
langCache[group] = groupCache;
}
cachedProblem = groupCache[problem];
if (cachedProblem) return Q(cachedProblem);
return codeq.comms.getProblemDef(language, group, problem).then(function (rawData) {
var data = processProblemData(rawData, language, group, problem);
groupCache[problem] = data;
return data;
});
},
loadProblemData = function(ref, data){
var language = data.language;
return codeq.wait(
Q.all([
codeq.comms.getCurrentSolution(ref.id), // the current user's solution to the selected problem
getProblemData(language, ref.g, ref.p) // the (cached) result of processProblemData()
])
.spread(function (userProblemData, generalProblemData) {
//codeq.log.debug("spread");
if (userProblemData.code !== 0) throw new Error('Failed to obtain user problem data, code: ' + userProblemData.code + ', message: ' + userProblemData.message);
if (!generalProblemData) throw new Error('General problem data is not defined');
//codeq.globalStateMachine.transition(language, generalProblemData, data.commonDef, userProblemData.data.solution);
return {"generalProblemData":generalProblemData,"solution":userProblemData.data.solution};
})
);
//while(!generalProblemData1){}
//return [generalProblemData1, userProblemDataSolution];
//codeq.log.debug("after wait:"+a);
},
currentLanguage; // the currently active language
codeq.loadProblemData = loadProblemData;
// ================================================================================
// Initialization, invoked from the boot sequence
// ================================================================================
codeq.on('init', function () {
codeq.tr.registerDictionary('directory', translationCache);
langs = codeq.availableLangs; // cache for easier access
Nlangs = langs.length;
});
// ================================================================================
// Register with the state machine
// ================================================================================
codeq.globalStateMachine.register('problem_list', {
'jqScreen': jqScreen,
'enter': function(language){
var data = languageCache[language]; // language data
$("#navigation-problem_list").addClass("active").css('display', '');
if (!language) language = currentLanguage; // This happens when we hit this with the back button
if (language !== currentLanguage) {
jqScreen.empty();
}
codeq.wait(Q.all([
data || codeq.comms.getLanguageDef(language),
codeq.comms.getAttempts(language)
]).spread(function (langData, attemptData) {
if (!data) {
data = createLanguageData(langData, language);
languageCache[language] = data;
}
if (language !== currentLanguage) {
createDom(data);
}
currentLanguage = language;
showAttempts(data, attemptData.data);
})).done();
jqScreen.css('display', '');
},
'exit' : function(){
jqScreen.css('display', 'none');
$('#navigation-problem_list').css('display', 'none').removeClass("active");
}
});
})();
|