X-Git-Url: https://git.auder.net/?p=vchess.git;a=blobdiff_plain;f=public%2Fjavascripts%2Fcomponents%2Fproblems.js;h=53077049d12dc61bd071fa2160e38c67c86cba08;hp=dc32052081b8e0b003e4bd5d00a343a27a7ba467;hb=fd08ab2c5b8931bb8c95cf7e9f2f95122647f991;hpb=4ecf423bce243e8e10b5b777a95f67ecc9f8d8d3 diff --git a/public/javascripts/components/problems.js b/public/javascripts/components/problems.js index dc320520..53077049 100644 --- a/public/javascripts/components/problems.js +++ b/public/javascripts/components/problems.js @@ -1,23 +1,316 @@ -//TODO: list problems as FEN (quickly rendered), by date, with possible filtering per variant(?) -//click on a problem ==> land on variant page with mode==friend, FEN prefilled... ok - -// get 10 first problems, and buttons next<>previous send date + "before" or "after" -// need database: sqlite ! - -// form "new problem" fen(position/turn/flags[guess]), instructions, solution (mandatory) -// ==> upload on server in sandbox -// -// Atomic rules, atomic game, atomic problems(list drawn position -// + summary(first chars of instructions) + timedate)... one big Vue ? with components -// -// click on problem ==> masque problems, affiche game tab, launch new game Friend with -// FEN + turn + flags + rappel instructions / solution on click sous l'échiquier - Vue.component('my-problems', { - //props: ['vobj'], + data: function () { + return { + userId: user.id, + problems: [], //oldest first + myProblems: [], //same, but only mine + singletons: [], //requested problems (using #num) + display: "others", //or "mine" + curProb: null, //(reference to) current displayed problem (if any) + showSolution: false, + pbNum: 0, //to navigate directly to some problem + // New problem (to upload), or existing problem to edit: + modalProb: { + id: 0, //defined if it's an edit + fen: "", + instructions: "", + solution: "", + preview: false, + }, + }; + }, template: ` -
-

Hello

+
+
+ + + +
+
+
+

+ {{ curProb.instructions }} +

+
+ + +
+

+ {{ translations["Show solution"] }} +

+

+ {{ curProb.solution }} +

+
+ +
+
+ + +
+ + + + +
+
+ +

+ {{ translate("Add a problem") }} +

+
+
+ + +
+
+

+ {{ translate("Safe HTML tags allowed") }} +

+ + + + + +
+
+
+
+ + + +
+ + +
+
+
+ +
+
+ +

+ {{ nomoreMessage }} +

+
+
`, + created: function() { + if (location.hash.length > 0) + this.showProblem(location.hash.slice(1)); + else + this.firstFetch(); + }, + methods: { + firstFetch: function() { + // Fetch most recent problems from server, for both lists + this.fetchProblems("others", "bacwkard"); + this.fetchProblems("mine", "bacwkard"); + this.listsInitialized = true; + }, + showProblem: function(num) { + const pid = num || this.pbNum; + location.hash = "#" + pid; + const pIdx = this.singletons.findIndex(p => p.id == pid); + if (pIdx >= 0) + curProb = this.singletons[pIdx]; + else + { + // Cannot find problem in current set; get from server, and add to singletons. + ajax( + "/problems/" + variant.name + "/" + pid, //TODO: use variant._id ? + "GET", + response => { + if (!!response.problem) + { + this.singletons.push(response.problem); + this.curProb = response.problem; + } + else + this.noMoreProblems("Sorry, problem " + pid + " does not exist"); + } + ); + } + }, + 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 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; + document.getElementById("modal-newproblem").checked = true; + }, + deleteProblem: function(pid) { + ajax( + "/problems/" + variant.name + "/" + pid, //TODO: with variant.id ? + "DELETE", + response => { + // Delete problem from the list on client side + let problems = this.curProblems(); + const pIdx = problems.findIndex(p => p.id == pid); + problems.splice(pIdx, 1); + } + ); + }, + sendProblem: function() { + // Send it to the server and close modal + ajax( + "/problems/" + variant.name, //TODO: with variant.id ? + (this.modalProb.id > 0 ? "PUT" : "POST"), + this.modalProb, + response => { + document.getElementById("modal-newproblem").checked = false; + if (this.modalProb.id == 0) + { + this.modalProb.added = Date.now(); + this.modalProb.preview = false; + this.myProblems.push(JSON.parse(JSON.stringify(this.modalProb))); + } + else + this.modalProb.id = 0; + } + ); + }, + }, })