{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./app/javascript/packs/shared/maths.js","webpack:///./app/javascript/packs/puzzles/prime_pairs.js"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","isSquare","number","Math","floor","sqrt","isPrime","fibs","isFibonacci","length","push","includes","isTriangle","option","inputMin","document","getElementById","inputMax","inputTuple","inputFilter","inputCount","minTerm","parseInt","maxTerm","tupleLength","filter","totalDisplay","reducer","total","current","checkLast","array","tuple","slice","reduce","iterateSolve","solutionArray","solution","innerHTML","join","pop","updateValues","filterValue","setFilter","solve","iterateCount","countArray","counter","count","run","checked","addEventListener","event","setAttribute"],"mappings":"aACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QAKfF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,qBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,kBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,UAIjBlC,EAAoBA,EAAoBmC,EAAI,I,kCClFrD,mLAAMC,EAAW,SAACC,GAChB,QAAIA,EAAS,IAEN,SAACC,KAAKC,MAAMD,KAAKE,KAAKH,IAAY,KAAOA,GAG5CI,EAAU,SAACJ,GACf,GAAIA,EAAS,EAAK,OAAO,EACzB,GAAe,IAAXA,EAAgB,OAAO,EAE3B,IAAK,IAAIjC,EAAI,EAAGA,EAAIiC,EAAQjC,GAAK,EAC/B,GAAIiC,EAASjC,GAAK,EAChB,OAAO,EAGX,OAAO,GAGHsC,EAAO,CAAC,EAAG,GAEXC,EAAc,SAACN,GACnB,GAAIA,EAAS,EAAK,OAAO,EAEzB,KAAOK,EAAKA,EAAKE,OAAO,GAAKP,GAC3BK,EAAKG,KAAKH,EAAKA,EAAKE,OAAO,GAAKF,EAAKA,EAAKE,OAAO,IAEnD,OAAOF,EAAKI,SAAST,IAGjBU,EAAa,SAACV,GAClB,IAAMW,EAASV,KAAKC,MAAMD,KAAKE,KAAc,EAATH,IAEpC,OAAQW,GAAUA,EAAS,GAAM,IAAMX,I,mDC9BnCY,EAAWC,SAASC,eAAe,YACnCC,EAAWF,SAASC,eAAe,YACnCE,EAAaH,SAASC,eAAe,gBACrCG,EAAcJ,SAASC,eAAe,UACtCI,EAAaL,SAASC,eAAe,SAEvCK,EAAUC,SAASR,EAAS5B,OAC5BqC,EAAUD,SAASL,EAAS/B,OAC5BsC,EAAcF,SAASJ,EAAWhC,OAClCuC,EAASN,EAAYjC,MAGnBwC,GADkBX,SAASC,eAAe,YAC3BD,SAASC,eAAe,UAEvCW,EAAU,SAACC,EAAOC,GACtB,OAAOD,EAAQC,GAGXC,EAAY,SAACC,GACjB,GAAIA,EAAMtB,OAASe,EAAe,OAAO,EAEzC,IAAMQ,EAAQD,EAAME,OAAOT,GAAaU,OAAOP,GAC/C,OAAOF,EAAOrD,K,UAAW4D,IAGrBG,EAAe,SAAfA,EAAgBC,GACpB,GAAIA,EAAc3B,SAAYc,EAAUF,EAAU,EAEhD,OADAgB,SAASC,UAAYF,EAAcG,KAAK,OACjC,EAGT,IAAK,IAAItE,EAAIoD,EAASpD,GAAKsD,EAAStD,GAAI,EACtC,IAAKmE,EAAczB,SAAS1C,GAAI,CAE9B,GADAmE,EAAc1B,KAAKzC,GACf6D,EAAUM,IAAkBD,EAAaC,GAC3C,OAAO,EAEPA,EAAcI,MAIpB,OAAO,GAYHC,EAAe,WACnBpB,EAAUC,SAASR,EAAS5B,OAC5BqC,EAAUD,SAASL,EAAS/B,OAC5BsC,EAAcF,SAASJ,EAAWhC,OAClCuC,EAbgB,SAACiB,GACjB,OAAOA,GACL,IAAK,QAAS,OAAOpC,UACrB,IAAK,SAAU,OAAOL,WACtB,IAAK,YAAa,OAAOO,cACzB,IAAK,WAAY,OAAOI,cAQjB+B,CAAUxB,EAAYjC,QAG3B0D,EAAQ,WACZH,IAEKN,EAAa,MAChBE,SAASC,UAAY,6BAInBO,EAAe,SAAfA,EAAgBC,EAAYC,GAChC,GAAID,EAAWrC,SAAYc,EAAUF,EAAU,EAE7C,OADA0B,GAAW,EAIb,IAAK,IAAI9E,EAAIoD,EAASpD,GAAKsD,EAAStD,GAAI,EACjC6E,EAAWnC,SAAS1C,KACvB6E,EAAWpC,KAAKzC,GACZ6D,EAAUgB,KACZC,EAAUF,EAAaC,EAAYC,IAErCD,EAAWN,OAIf,OAAOO,GAGHC,EAAQ,WACZP,IAEAf,EAAaY,UAAYO,EAAa,GAAI,IAGtCI,EAAM,WACVL,IACIxB,EAAW8B,QACbF,IAEAtB,EAAaY,UAAY,gBAI7BxB,EAASqC,iBAAiB,SAAS,SAACC,GAClCnC,EAASoC,aAAa,MAAO/B,SAASR,EAAS5B,OAAS,GACxD+D,OAGFhC,EAASkC,iBAAiB,SAAS,SAACC,GAClCtC,EAASuC,aAAa,MAAO/B,SAASL,EAAS/B,OAAS,GACxD+D,OAGF/B,EAAWiC,iBAAiB,SAAS,SAACC,GACpCH,OAGF9B,EAAYgC,iBAAiB,SAAS,SAACC,GACrCH,OAGFA","file":"js/puzzles/prime_pairs-2079a2c4ef30d179b5e8.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"/packs/\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 66);\n","const isSquare = (number) => {\n  if (number < 0) { return false; }\n\n  return (Math.floor(Math.sqrt(number)) ** 2) === number;\n};\n\nconst isPrime = (number) => {\n  if (number < 2) { return false; }\n  if (number === 2) { return true; }\n\n  for (let i = 2; i < number; i += 1) {\n    if (number % i == 0) {\n      return false;\n    }\n  }\n  return true;\n};\n\nconst fibs = [0, 1];\n\nconst isFibonacci = (number) => {\n  if (number < 0) { return false; }\n\n  while (fibs[fibs.length-1] < number) {\n    fibs.push(fibs[fibs.length-1] + fibs[fibs.length-2]);\n  }\n  return fibs.includes(number);\n};\n\nconst isTriangle = (number) => {\n  const option = Math.floor(Math.sqrt(number * 2));\n\n  return (option * (option + 1)) / 2 === number;\n};\n\nexport { isSquare, isPrime, isFibonacci, isTriangle };\n","import { isSquare, isPrime, isFibonacci, isTriangle } from '../shared/maths';\n\nconst inputMin = document.getElementById('min-term');\nconst inputMax = document.getElementById('max-term');\nconst inputTuple = document.getElementById('tuple-length');\nconst inputFilter = document.getElementById('filter');\nconst inputCount = document.getElementById('count');\n\nlet minTerm = parseInt(inputMin.value);\nlet maxTerm = parseInt(inputMax.value);\nlet tupleLength = parseInt(inputTuple.value);\nlet filter = inputFilter.value;\n\nconst solutionDisplay = document.getElementById('solution');\nconst totalDisplay = document.getElementById('total');\n\nconst reducer = (total, current) => {\n  return total + current;\n};\n\nconst checkLast = (array) => {\n  if (array.length < tupleLength) { return true; }\n\n  const tuple = array.slice(-tupleLength).reduce(reducer);\n  return filter.call(this, tuple);\n};\n\nconst iterateSolve = (solutionArray) => {\n  if (solutionArray.length === (maxTerm - minTerm + 1)) {\n    solution.innerHTML = solutionArray.join(', ');\n    return true;\n  }\n\n  for (let i = minTerm; i <= maxTerm; i+= 1) {\n    if (!solutionArray.includes(i)) {\n      solutionArray.push(i);\n      if (checkLast(solutionArray) && iterateSolve(solutionArray)) {\n        return true;\n      } else {\n        solutionArray.pop();\n      }\n    }\n  }\n  return false;\n};\n\nconst setFilter = (filterValue) => {\n  switch(filterValue) {\n    case 'prime': return isPrime;\n    case 'square': return isSquare;\n    case 'fibonacci': return isFibonacci;\n    case 'triangle': return isTriangle;\n  }\n};\n\nconst updateValues = () => {\n  minTerm = parseInt(inputMin.value);\n  maxTerm = parseInt(inputMax.value);\n  tupleLength = parseInt(inputTuple.value);\n  filter = setFilter(inputFilter.value);\n};\n\nconst solve = () => {\n  updateValues();\n\n  if (!iterateSolve([])) {\n    solution.innerHTML = \"No solution found, sorry\";\n  }\n};\n\nconst iterateCount = (countArray, counter) => {\n  if (countArray.length === (maxTerm - minTerm + 1)) {\n    counter += 1;\n    return counter;\n  }\n\n  for (let i = minTerm; i <= maxTerm; i+= 1) {\n    if (!countArray.includes(i)) {\n      countArray.push(i);\n      if (checkLast(countArray)) {\n        counter = iterateCount(countArray, counter);\n      }\n      countArray.pop();\n    }\n  }\n\n  return counter;\n};\n\nconst count = () => {\n  updateValues();\n\n  totalDisplay.innerHTML = iterateCount([], 0);\n};\n\nconst run = () => {\n  solve();\n  if (inputCount.checked) {\n    count();\n  } else {\n    totalDisplay.innerHTML = \"Not counting\";\n  }\n};\n\ninputMin.addEventListener('input', (event) => {\n  inputMax.setAttribute('min', parseInt(inputMin.value) + 1);\n  run();\n});\n\ninputMax.addEventListener('input', (event) => {\n  inputMin.setAttribute('max', parseInt(inputMax.value) - 1);\n  run();\n});\n\ninputTuple.addEventListener('input', (event) => {\n  run();\n});\n\ninputFilter.addEventListener('input', (event) => {\n  run();\n});\n\nrun();\n"],"sourceRoot":""}