+ translate: function(text) {
+ return translations[text];
+ },
+ curProblems: function() {
+ switch (this.display)
+ {
+ case "others":
+ return this.problems;
+ case "mine":
+ return this.myProblems;
+ }
+ },
+ // TODO?: get 50 from server but only show 10 at a time (for example)
+ showNext: function(direction) {
+ if (!this.curProb)
+ return this.fetchProblems(this.display, direction);
+ // Show next problem (older or newer):
+ let curProbs = this.curProblems();
+ // Try to find a neighbour problem in the direction, among current set
+ const neighbor = this.findClosestNeighbor(this.curProb, curProbs, direction);
+ if (!!neighbor)
+ {
+ this.curProb = neighbor;
+ return;
+ }
+ // Boundary case: nothing in current set, need to fetch from server
+ const curSize = curProbs.length;
+ this.fetchProblems(this.display, direction);
+ const newSize = curProbs.length;
+ if (curSize == newSize) //no problems found
+ return this.noMoreProblems("No more problems in this direction");
+ // Ok, found something:
+ this.curProb = this.findClosestNeighbor(this.curProb, curProbs, direction);
+ },
+ findClosestNeighbor: function(problem, probList, direction) {
+ let neighbor = undefined;
+ let smallestDistance = Number.MAX_SAFE_INTEGER;
+ for (let prob of probList)
+ {
+ const delta = Math.abs(prob.id - problem.id);
+ if (delta < smallestDistance &&
+ ((direction == "backward" && prob.id < problem.id)
+ || (direction == "forward" && prob.id > problem.id)))
+ {
+ neighbor = prob;
+ smallestDistance = delta;
+ }
+ }
+ return neighbor;
+ },
+ noMoreProblems: function(message) {
+ this.nomoreMessage = message;
+ let modalNomore = document.getElementById("modalNomore");
+ modalNomore.checked = true;
+ setTimeout(() => modalNomore.checked = false, 2000);
+ },
+ displayList: function() {
+ this.curProb = null;
+ location.hash = "";
+ // Fetch problems if first call (if #num, and then lists)
+ if (!this.listsInitialized)
+ this.firstFetch();
+ },
+ toggleListDisplay: function() {
+ this.display = (this.display == "others" ? "mine" : "others");
+ },
+ fetchProblems: function(type, direction) {
+ let problems = (type == "others" ? this.problems : this.myProblems);
+ let last_dt = (direction=="forward" ? 0 : Number.MAX_SAFE_INTEGER);
+ if (this.problems.length > 0)
+ {
+ // Search for newest date (or oldest)
+ last_dt = problems[0].added;
+ for (let i=1; i<problems.length; i++)
+ {
+ if ((direction == "forward" && this.problems[i].added > last_dt) ||
+ (direction == "backward" && this.problems[i].added < last_dt))
+ {
+ last_dt = this.problems[i].added;
+ }
+ }
+ }
+ ajax(
+ "/problems/" + variant.name, //TODO: use variant._id ?
+ "GET",
+ {
+ type: type,
+ direction: direction,
+ last_dt: last_dt,
+ },
+ response => {
+ if (response.problems.length > 0)
+ {
+ Array.prototype.push.apply(problems,
+ response.problems.sort((p1,p2) => { return p1.added - p2.added; }));
+ // If one list is empty but not the other, show the non-empty
+ const otherArray = (type == "mine" ? this.problems : this.myProblems);
+ if (problems.length > 0 && otherArray.length == 0)
+ this.display = type;
+ }
+ }
+ );
+ },
+ previewProblem: function() {
+ if (!V.IsGoodFen(this.newProblem.fen))
+ return alert(translations["Bad FEN description"]);
+ if (this.newProblem.instructions.trim().length == 0)
+ return alert(translations["Empty instructions"]);
+ if (this.newProblem.solution.trim().length == 0)
+ return alert(translations["Empty solution"]);
+ this.modalProb.preview = true;
+ },
+ editProblem: function(prob) {
+ this.modalProb = prob;