{"version":3,"sources":["../../../../../dev/j/mkt/technology/common/polyfills.js"],"names":["Array","from","toStr","Object","prototype","toString","isCallable","fn","call","toInteger","value","number","Number","isNaN","isFinite","Math","floor","abs","maxSafeInteger","pow","toLength","len","min","max","arrayLike","C","this","items","TypeError","T","mapFn","arguments","length","undefined","kValue","A","k","find","ctx","i","e"],"mappings":"AAAA,YAMKA,OAAMC,OACVD,MAAMC,KAAO,WACZ,GAAIC,GAAQC,OAAOC,UAAUC,SACzBC,EAAa,SAAoBC,GACpC,MAAqB,kBAAPA,IAAwC,sBAAnBL,EAAMM,KAAKD,IAE3CE,EAAY,SAAmBC,GAClC,GAAIC,GAASC,OAAOF,EACpB,OAAIG,OAAMF,GACF,EAEO,IAAXA,GAAiBG,SAASH,IAGtBA,EAAS,EAAI,GAAK,GAAKI,KAAKC,MAAMD,KAAKE,IAAIN,IAF3CA,GAILO,EAAiBH,KAAKI,IAAI,EAAG,IAAM,EACnCC,EAAW,SAAkBV,GAChC,GAAIW,GAAMZ,EAAUC,EACpB,OAAOK,MAAKO,IAAIP,KAAKQ,IAAIF,EAAK,GAAIH,GAInC,OAAO,UAAcM,GAEpB,GAAIC,GAAIC,KAGJC,EAAQxB,OAAOqB,EAGnB,IAAkB,OAAdA,EACH,KAAM,IAAII,WAAU,mEAIrB,IACIC,GADAC,EAAQC,UAAUC,OAAS,EAAID,UAAU,OAAUE,UAEvD,QAAqB,KAAVH,EAAuB,CAGjC,IAAKxB,EAAWwB,GACf,KAAM,IAAIF,WAAU,oEAIjBG,WAAUC,OAAS,IACtBH,EAAIE,UAAU,IAkBhB,IAZA,GAWIG,GAXAb,EAAMD,EAASO,EAAMK,QAMrBG,EAAI7B,EAAWmB,GAAKtB,OAAO,GAAIsB,GAAEJ,IAAQ,GAAIrB,OAAMqB,GAGnDe,EAAI,EAGDA,EAAIf,GACVa,EAASP,EAAMS,GAEdD,EAAEC,GADCN,MACiB,KAAND,EAAoBC,EAAMI,EAAQE,GAAKN,EAAMtB,KAAKqB,EAAGK,EAAQE,GAEpEF,EAERE,GAAK,CAKN,OAFAD,GAAEH,OAASX,EAEJc,OASLnC,MAAMI,UAAUiC,OACpBrC,MAAMI,UAAUiC,KAAO,SAAU9B,EAAI+B,GACpC,IAAK,GAAIC,GAAI,EAAGA,EAAIb,KAAKM,OAAQO,IAAK,CACrC,GAAIC,GAAId,KAAKa,EACb,IAAIhC,EAAGC,KAAK8B,EAAKE,EAAGD,EAAGb,MACtB,MAAOc,GAGT,MAAOP","file":"polyfills.js","sourcesContent":["'use strict';\n\n//====================================================\n// Array.from() - not available in IE\n//====================================================\n\nif (!Array.from) {\n\tArray.from = function () {\n\t\tvar toStr = Object.prototype.toString;\n\t\tvar isCallable = function isCallable(fn) {\n\t\t\treturn typeof fn === 'function' || toStr.call(fn) === '[object Function]';\n\t\t};\n\t\tvar toInteger = function toInteger(value) {\n\t\t\tvar number = Number(value);\n\t\t\tif (isNaN(number)) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (number === 0 || !isFinite(number)) {\n\t\t\t\treturn number;\n\t\t\t}\n\t\t\treturn (number > 0 ? 1 : -1) * Math.floor(Math.abs(number));\n\t\t};\n\t\tvar maxSafeInteger = Math.pow(2, 53) - 1;\n\t\tvar toLength = function toLength(value) {\n\t\t\tvar len = toInteger(value);\n\t\t\treturn Math.min(Math.max(len, 0), maxSafeInteger);\n\t\t};\n\n\t\t// The length property of the from method is 1.\n\t\treturn function from(arrayLike /*, mapFn, thisArg */) {\n\t\t\t// 1. Let C be the this value.\n\t\t\tvar C = this;\n\n\t\t\t// 2. Let items be ToObject(arrayLike).\n\t\t\tvar items = Object(arrayLike);\n\n\t\t\t// 3. ReturnIfAbrupt(items).\n\t\t\tif (arrayLike === null) {\n\t\t\t\tthrow new TypeError('Array.from requires an array-like object - not null or undefined');\n\t\t\t}\n\n\t\t\t// 4. If mapfn is undefined, then let mapping be false.\n\t\t\tvar mapFn = arguments.length > 1 ? arguments[1] : void undefined;\n\t\t\tvar T;\n\t\t\tif (typeof mapFn !== 'undefined') {\n\t\t\t\t// 5. else\n\t\t\t\t// 5. a If IsCallable(mapfn) is false, throw a TypeError exception.\n\t\t\t\tif (!isCallable(mapFn)) {\n\t\t\t\t\tthrow new TypeError('Array.from: when provided, the second argument must be a function');\n\t\t\t\t}\n\n\t\t\t\t// 5. b. If thisArg was supplied, let T be thisArg; else let T be undefined.\n\t\t\t\tif (arguments.length > 2) {\n\t\t\t\t\tT = arguments[2];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// 10. Let lenValue be Get(items, \"length\").\n\t\t\t// 11. Let len be ToLength(lenValue).\n\t\t\tvar len = toLength(items.length);\n\n\t\t\t// 13. If IsConstructor(C) is true, then\n\t\t\t// 13. a. Let A be the result of calling the [[Construct]] internal method\n\t\t\t// of C with an argument list containing the single item len.\n\t\t\t// 14. a. Else, Let A be ArrayCreate(len).\n\t\t\tvar A = isCallable(C) ? Object(new C(len)) : new Array(len);\n\n\t\t\t// 16. Let k be 0.\n\t\t\tvar k = 0;\n\t\t\t// 17. Repeat, while k < len… (also steps a - h)\n\t\t\tvar kValue;\n\t\t\twhile (k < len) {\n\t\t\t\tkValue = items[k];\n\t\t\t\tif (mapFn) {\n\t\t\t\t\tA[k] = typeof T === 'undefined' ? mapFn(kValue, k) : mapFn.call(T, kValue, k);\n\t\t\t\t} else {\n\t\t\t\t\tA[k] = kValue;\n\t\t\t\t}\n\t\t\t\tk += 1;\n\t\t\t}\n\t\t\t// 18. Let putStatus be Put(A, \"length\", len, true).\n\t\t\tA.length = len;\n\t\t\t// 20. Return A.\n\t\t\treturn A;\n\t\t};\n\t}();\n}\n\n//====================================================\n// Array.find() - not available in IE\n//====================================================\n\nif (!Array.prototype.find) {\n\tArray.prototype.find = function (fn, ctx) {\n\t\tfor (var i = 0; i < this.length; i++) {\n\t\t\tvar e = this[i];\n\t\t\tif (fn.call(ctx, e, i, this)) {\n\t\t\t\treturn e;\n\t\t\t}\n\t\t}\n\t\treturn undefined;\n\t};\n}"]}