{"version":3,"file":"js/pollyFills.8e47ed24803ae6721b32.min.js","mappings":"wEAGI,aAAcA,SAAWC,SAASC,UAAUC,UAC5CC,QAAQC,KAAK,qBACbJ,SAASC,UAAUC,QAAU,SAAUG,EAAUC,GAC7CA,EAAUA,GAAWP,OACrB,IAAK,IAAIQ,EAAI,EAAGA,EAAIC,KAAKC,OAAQF,IAC7BF,EAASK,KAAKJ,EAASE,KAAKD,GAAIA,EAAGC,QAO1CG,QAAQV,UAAUW,UACdD,QAAQV,UAAUY,UACnBF,QAAQV,UAAUY,QAAUF,QAAQV,UAAUa,mBAAqBH,QAAQV,UAAUc,uBAEzFJ,QAAQV,UAAUW,QAAU,SAAUI,GAClC,IACIC,EAAWT,KACf,IAAKU,SAASC,gBAAgBC,SAFrBZ,MAEmC,OAAO,KACnD,EAAG,CACC,GAAIS,EAASJ,QAAQG,GAAI,OAAOC,EAChCA,EAAWA,EAASI,oBACF,OAAbJ,GACT,OAAO,OAMc,mBAAlBK,OAAOC,QAEdD,OAAOE,eAAeF,OAAQ,SAAU,CACpCG,MAAO,SAAgBC,EAAQC,GAC3B,aACA,GAAID,MAAAA,EACA,MAAM,IAAIE,UAAU,8CAKxB,IAFA,IAAIC,EAAKP,OAAOI,GAEPI,EAAQ,EAAGA,EAAQC,UAAUtB,OAAQqB,IAAS,CACnD,IAAIE,EAAaD,UAAUD,GAE3B,GAAIE,MAAAA,EACA,IAAK,IAAIC,KAAWD,EAEZV,OAAOrB,UAAUiC,eAAexB,KAAKsB,EAAYC,KACjDJ,EAAGI,GAAWD,EAAWC,IAKzC,OAAOJ,GAEXM,UAAU,EACVC,cAAc,IAOjBC,MAAMpC,UAAUqC,MACjBhB,OAAOE,eAAea,MAAMpC,UAAW,OAAQ,CAC3CwB,MAAO,SAAUc,GAEb,GAAY,MAAR/B,KACA,MAAMoB,UAAU,iCAGpB,IAAIY,EAAIlB,OAAOd,MAGXiC,EAAMD,EAAE/B,SAAW,EAGvB,GAAyB,mBAAd8B,EACP,MAAMX,UAAU,gCAUpB,IANA,IAAItB,EAAUyB,UAAU,GAGpBW,EAAI,EAGDA,EAAID,GAAK,CAKZ,IAAIE,EAASH,EAAEE,GACf,GAAIH,EAAU7B,KAAKJ,EAASqC,EAAQD,EAAGF,GACnC,OAAOG,EAGXD,MAMRN,cAAc,EACdD,UAAU,IAKlBS,KAAK3C,UAAUmB,SAAW,SAAUyB,GAChC,KAAOA,EAAKA,EAAGC,YACX,GAAID,IAAOrC,KAAM,OAAO,EAE5B,OAAO,GAIXG,QAAQV,UAAU8C,YAAc,SAAUC,GACtCA,EAAQF,WAAWG,aAAazC,KAAMwC,EAAQE,cAIlDvC,QAAQV,UAAUkD,aAAe,SAAUH,GACvCA,EAAQF,WAAWG,aAAazC,KAAMwC","sources":["webpack:///./scripts/pollyfills.js"],"sourcesContent":["/**\r\n * For each polyfill\r\n */\r\nif ('NodeList' in window && !NodeList.prototype.forEach) {\r\n console.info('polyfill for IE11');\r\n NodeList.prototype.forEach = function (callback, thisArg) {\r\n thisArg = thisArg || window;\r\n for (var i = 0; i < this.length; i++) {\r\n callback.call(thisArg, this[i], i, this);\r\n }\r\n };\r\n}\r\n/**\r\n * Element.closest() polyfill\r\n */\r\nif (!Element.prototype.closest) {\r\n if (!Element.prototype.matches) {\r\n Element.prototype.matches = Element.prototype.msMatchesSelector || Element.prototype.webkitMatchesSelector;\r\n }\r\n Element.prototype.closest = function (s) {\r\n var el = this;\r\n var ancestor = this;\r\n if (!document.documentElement.contains(el)) return null;\r\n do {\r\n if (ancestor.matches(s)) return ancestor;\r\n ancestor = ancestor.parentElement;\r\n } while (ancestor !== null);\r\n return null;\r\n };\r\n}\r\n/**\r\n * Object.assign()\r\n */\r\nif (typeof Object.assign !== 'function') {\r\n // Must be writable: true, enumerable: false, configurable: true\r\n Object.defineProperty(Object, \"assign\", {\r\n value: function assign(target, varArgs) { // .length of function is 2\r\n 'use strict';\r\n if (target === null || target === undefined) {\r\n throw new TypeError('Cannot convert undefined or null to object');\r\n }\r\n\r\n var to = Object(target);\r\n\r\n for (var index = 1; index < arguments.length; index++) {\r\n var nextSource = arguments[index];\r\n\r\n if (nextSource !== null && nextSource !== undefined) {\r\n for (var nextKey in nextSource) {\r\n // Avoid bugs when hasOwnProperty is shadowed\r\n if (Object.prototype.hasOwnProperty.call(nextSource, nextKey)) {\r\n to[nextKey] = nextSource[nextKey];\r\n }\r\n }\r\n }\r\n }\r\n return to;\r\n },\r\n writable: true,\r\n configurable: true\r\n });\r\n}\r\n\r\n/**\r\n * Find\r\n */\r\nif (!Array.prototype.find) {\r\n Object.defineProperty(Array.prototype, 'find', {\r\n value: function (predicate) {\r\n // 1. Let O be ? ToObject(this value).\r\n if (this == null) {\r\n throw TypeError('\"this\" is null or not defined');\r\n }\r\n\r\n var o = Object(this);\r\n\r\n // 2. Let len be ? ToLength(? Get(O, \"length\")).\r\n var len = o.length >>> 0;\r\n\r\n // 3. If IsCallable(predicate) is false, throw a TypeError exception.\r\n if (typeof predicate !== 'function') {\r\n throw TypeError('predicate must be a function');\r\n }\r\n\r\n // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.\r\n var thisArg = arguments[1];\r\n\r\n // 5. Let k be 0.\r\n var k = 0;\r\n\r\n // 6. Repeat, while k < len\r\n while (k < len) {\r\n // a. Let Pk be ! ToString(k).\r\n // b. Let kValue be ? Get(O, Pk).\r\n // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).\r\n // d. If testResult is true, return kValue.\r\n var kValue = o[k];\r\n if (predicate.call(thisArg, kValue, k, o)) {\r\n return kValue;\r\n }\r\n // e. Increase k by 1.\r\n k++;\r\n }\r\n\r\n // 7. Return undefined.\r\n return undefined;\r\n },\r\n configurable: true,\r\n writable: true\r\n });\r\n}\r\n\r\n// Contains\r\nNode.prototype.contains = function (el) {\r\n while (el = el.parentNode) {\r\n if (el === this) return true;\r\n }\r\n return false;\r\n}\r\n\r\n// Append after\r\nElement.prototype.appendAfter = function (element) {\r\n element.parentNode.insertBefore(this, element.nextSibling);\r\n}, false;\r\n\r\n// Append before\r\nElement.prototype.appendBefore = function (element) {\r\n element.parentNode.insertBefore(this, element);\r\n}, false;"],"names":["window","NodeList","prototype","forEach","console","info","callback","thisArg","i","this","length","call","Element","closest","matches","msMatchesSelector","webkitMatchesSelector","s","ancestor","document","documentElement","contains","parentElement","Object","assign","defineProperty","value","target","varArgs","TypeError","to","index","arguments","nextSource","nextKey","hasOwnProperty","writable","configurable","Array","find","predicate","o","len","k","kValue","Node","el","parentNode","appendAfter","element","insertBefore","nextSibling","appendBefore"],"sourceRoot":""}