File indexing completed on 2024-04-28 15:07:42

 /* GCompris - algorithm.js
  *
  * SPDX-FileCopyrightText: 2014 Bharath M S " <brat.197@gmail.com>
  *
  * Authors:
  *   Christof Petig and Ingo Konrad (GTK+ version)
  *   "Bharath M S" <brat.197@gmail.com> (Qt Quick port)
  *
  *   SPDX-License-Identifier: GPL-3.0-or-later
  */
 .pragma library
 .import QtQuick 2.12 as Quick
 .import "qrc:/gcompris/src/core/core.js" as Core
 
 /*
 
 functions :-
 
 setUp() - the function is called to set the basic game layout each time (questionTray, answerTray)
 getImages() - returns a random array of length 8 that is based on the chosen sample
 setQuestion() - the function is called to set questionTray
 setAnswer() - the function is called to set answerTray
 clickHandler() - called to handle click event
 
 variables :-
 
 sample - this array has an array of arrays for each level
 choiceCount (int) - initialised with the value 5 and the game is won when choiceCount is 8
 
 Example 1:
 sample: [0,1,0,1,0,1,0,1]
 getImages() sample output - names of images with indexes [6,7,6,7,6,7,6,7]
 
 Example 2:
 sample: [0,1,2,0,1,2,0,1]
 getImages() sample output - names of images with indexes [3,5,7,3,5,7,3,5]
 
 Example 3:
 sample: [0,1,2,3,3,2,1,0]
 getImages() sample output - names of images with indexes [1,3,2,5,5,2,3,1]
 
 */
 
 var matchesVisible = 4
 var max = 8
 var index
 var answerIndex
 var items
 var number
 var images = ["apple",
               'banana',
               'cherries',
               'lemon',
               'orange',
               'pear',
               'pineapple',
               'plum']
 var url = "qrc:/gcompris/src/activities/algorithm/resource/"
 
 // Add more cases to sample and differentiate arrange according to level of difficulty.
 // Develop an algo to choose them accordingly for each level.
 var sample = [[[0,1,0,1,0,1,0,1],[0,1,1,0,0,1,1,0],[1,1,0,0,0,0,1,1],[1,0,0,1,0,1,1,0]],//level1
               [[0,1,2,0,1,2,0,1],[0,1,2,3,0,1,2,3],[0,1,2,3,3,2,1,0],[0,1,2,1,0,1,2,0]],//2
               [[0,1,2,3,1,0,0,1],[0,1,2,3,0,1,0,1],[0,1,2,3,1,2,1,2],[0,1,2,3,2,3,2,3]],//3
               [[0,1,2,3,0,1,2,0],[0,1,2,3,1,2,3,1],[0,1,2,3,2,1,3,1],[0,1,2,3,3,1,2,1]],//4
               [[0,1,2,3,1,2,3,0],[0,1,2,3,2,3,0,1],[0,1,2,3,3,0,1,2],[0,1,2,3,3,0,1,2]],//5
               [[0,1,2,3,3,1,2,0],[0,1,2,3,0,2,1,3],[0,1,2,3,2,3,1,0],[0,1,2,3,2,1,3,0]],//6
               [[0,1,2,3,3,0,1,1],[0,1,2,3,2,2,3,2],[0,1,2,3,1,1,0,3],[0,1,2,3,1,2,3,2]]]//7
 var numberOfLevel = sample.length
 
 function start(items_) {
     items = items_
     items.currentLevel = Core.getInitialLevel(numberOfLevel);
     initLevel()
 }
 
 function stop() {
 }
 
 function initLevel() {
     setUp()
 }
 
 function setUp() {
     number = Math.floor(Math.random() * 10000) % sample[items.currentLevel].length
 
     index = getImages(number, items.currentLevel)
     setQuestion(index)
 
     answerIndex = getImages(number, items.currentLevel)
     setAnswer(answerIndex)
 
     choiceCount = matchesVisible
     items.blockClicks = false
 }
 
 // Returns a set of images that is used to set either the Sample algorithm or the Answer tray.
 function getImages(number, level) {
     var substitution = Core.shuffle(images)
     // Create results table based on sample and substitution
     var results = []
     for(var i=0; i<sample[level][number].length; i++) {
         results.push(substitution[sample[level][number][i]])
     }
     return results
 }
 
 // The source of questionTray is changed to reflect the chosen
 // set of random indices
 function setQuestion(indices){
     items.question.model = indices
 }
 
 // The first `matchesVisible` images of answerTray are set and the `matchesVisible+1`th is a question mark.
 function setAnswer(indices){
 
     var tempIndex = []
     for(var i=0; i < matchesVisible; i++) {
         tempIndex.push(indices[i])
     }
     tempIndex.push('question_mark')
     items.answer.model = tempIndex
 }
 
 // Game is won when choiceCount == 8.
 var choiceCount = matchesVisible
 
 function clickHandler(id){
     var tempIndex = []
 
     // Correct answer
     if(id === answerIndex[choiceCount]) {
         tempIndex = items.answer.model
         choiceCount++;
 
         if(choiceCount < max) {
             tempIndex.push('question_mark')
         }
 
         tempIndex[choiceCount - 1] = answerIndex[choiceCount - 1]
         items.answer.model = tempIndex
 
         if(choiceCount == max) {
             items.blockClicks = true
             items.currentSubLevel++
             items.score.playWinAnimation();
             items.audioEffects.play("qrc:/gcompris/src/core/resource/sounds/completetask.wav");
         } else {
             items.audioEffects.play('qrc:/gcompris/src/core/resource/sounds/bleep.wav')
         }
         return 1
     } else { // Wrong answer, try again
         items.audioEffects.play('qrc:/gcompris/src/core/resource/sounds/brick.wav')
     }
 }
 
 function nextLevel() {
     items.score.stopWinAnimation();
     items.currentLevel = Core.getNextLevel(items.currentLevel, numberOfLevel);
     items.currentSubLevel = 0;
     initLevel();
 }
 
 function nextSubLevel() {
     // Increment level after 3 successful games.
     if (items.currentSubLevel === items.nbSubLevel) {
         items.bonus.good("tux");
     } else {
         setUp();
     }
 }
 
 function previousLevel() {
     items.score.stopWinAnimation();
     items.currentLevel = Core.getPreviousLevel(items.currentLevel, numberOfLevel);
     items.currentSubLevel = 0;
     initLevel();
 }