{"version":3,"file":"5476.04b48e9fe56df70260f7.js","mappings":"4GAEKA,MAAMC,UAAUC,SACnBF,MAAMC,UAAUC,OAAS,WAKvB,IAJA,IAAIC,EAGFC,EAFAC,EAAIC,UACJC,EAAIF,EAAEG,OAEDD,GAAKE,KAAKD,QAEf,IADAL,EAAOE,IAAIE,IAC2B,KAA9BH,EAAKK,KAAKC,QAAQP,KACxBM,KAAKE,OAAOP,EAAI,GAGpB,OAAOK,IACT,GAGGG,OAAOX,UAAUY,cACpBD,OAAOX,UAAUY,YAAc,SAAUC,EAAaC,EAAaC,GACjE,IAAIC,EAAIR,KACRK,EAAcI,MAAOJ,EAAcK,KAAKC,IAAIN,IAAiB,EAAIA,EACjEC,OAAqC,IAAhBA,EAA8B,IAAMA,EACzDC,OAAyC,IAAlBA,EAAgC,IAAMA,EAC7D,IAAIK,EAAIJ,EAAI,EAAI,IAAM,GAClBK,EAAIC,SAAUN,EAAIE,KAAKC,KAAKH,GAAK,GAAGO,QAAQV,IAAiB,GAC7DW,GAAKA,EAAIH,EAAEd,QAAU,EAAIiB,EAAI,EAAI,EACrC,OACEJ,GACCI,EAAIH,EAAEI,OAAO,EAAGD,GAAKT,EAAgB,IACtCM,EAAEI,OAAOD,GAAGE,QAAQ,iBAAkB,KAAOX,IAC5CF,EACGC,EACAI,KAAKC,IAAIH,EAAIK,GACVE,QAAQV,GACRc,MAAM,GACT,GAER,GAGFhB,OAAOM,MACLN,OAAOM,OACP,SAAUW,GACR,OAAOA,GAAUA,CACnB,EAEGC,OAAO7B,UAAU8B,SACpBD,OAAO7B,UAAU8B,OAAS,WAIxB,IAHA,IAAIV,EAAIZ,KACNa,EAAIhB,UAAUE,OAETc,KACLD,EAAIA,EAAEM,QAAQ,IAAIK,OAAO,MAAQV,EAAI,MAAO,MAAOhB,UAAUgB,IAE/D,OAAOD,CACT,GAGGrB,MAAMC,UAAUgC,WACnBjC,MAAMC,UAAUgC,SAAW,SAAUC,GACnC,GAAa,OAATzB,KACF,MAAM,IAAI0B,UAAU,wDAGtB,IAAIC,EAAIC,OAAO5B,MACX6B,EAAMf,SAASa,EAAE5B,OAAQ,KAAO,EACpC,GAAY,IAAR8B,EACF,OAAO,EAET,IACIC,EASAC,EAVAvB,EAAIM,SAASjB,UAAU,GAAI,KAAO,EAWtC,IATIW,GAAK,EACPsB,EAAItB,GAEJsB,EAAID,EAAMrB,GACF,IACNsB,EAAI,GAIDA,EAAID,GAAK,CAEd,GACEJ,KAFFM,EAAiBJ,EAAEG,KAGhBL,GAAkBA,GAAiBM,GAAmBA,EAGvD,OAAO,EAETD,GACF,CACA,OAAO,CACT,GAGGT,OAAO7B,UAAUgC,WACpBH,OAAO7B,UAAUgC,SAAW,SAAUQ,EAAQC,GAM5C,MAJqB,iBAAVA,IACTA,EAAQ,KAGNA,EAAQD,EAAOjC,OAASC,KAAKD,UAGS,IAAjCC,KAAKC,QAAQ+B,EAAQC,EAEhC,GAGG1C,MAAMC,UAAU0C,WAEnB3C,MAAMC,UAAU0C,SAAW,SAAUT,GACnC,GAAa,OAATzB,KACF,MAAM,IAAI0B,UAAU,wDAGtB,OAAO1B,KAAKwB,SAASC,EACvB,GAGGlC,MAAMC,UAAU2C,SACnB5C,MAAMC,UAAU2C,OAAS,SAAUC,GACjC,GAAIpC,WACF,MAAM,IAAI0B,UAGZ,IAAIW,EAAIT,OAAO5B,MACX6B,EAAMQ,EAAEtC,SAAW,EACvB,GAAmB,mBAARqC,EACT,MAAM,IAAIV,UAKZ,IAFA,IAAIY,EAAM,GACNC,EAAU1C,UAAUE,QAAU,EAAIF,UAAU,QAAK,EAC5CgB,EAAI,EAAGA,EAAIgB,EAAKhB,IACvB,GAAIA,KAAKwB,EAAG,CACV,IAAIG,EAAMH,EAAExB,GAORuB,EAAIK,KAAKF,EAASC,EAAK3B,EAAGwB,IAC5BC,EAAII,KAAKF,EAEb,CAGF,OAAOF,CACT,GAGG/C,MAAMC,UAAUmD,eACnBpD,MAAMC,UAAUmD,aAAe,SAAUP,GACvC,IAAIE,EAAMtC,KAAKmC,OAAOC,GAEtB,OAAIE,EAAIvC,OAAS,EACfuC,EAAMA,EAAI,GAIL,IACT,GAGG/C,MAAMC,UAAUoD,UACnBrD,MAAMC,UAAUoD,QAAU,SAAUC,GAClC,IAAIC,EAAGhB,EAEP,GAAa,OAAT9B,KACF,MAAM,IAAI0B,UAAU,+BAKtB,IAAIC,EAAIC,OAAO5B,MAKX6B,EAAMF,EAAE5B,SAAW,EAIvB,GAAwB,mBAAb8C,EACT,MAAM,IAAInB,UAAUmB,EAAW,sBAajC,IARIhD,UAAUE,OAAS,IACrB+C,EAAIjD,UAAU,IAIhBiC,EAAI,EAGGA,EAAID,GAAK,CACd,IAAIkB,EAQAjB,KAAKH,IAGPoB,EAASpB,EAAEG,GAIXe,EAASJ,KAAKK,EAAGC,EAAQjB,EAAGH,IAG9BG,GACF,CAEF,GAGGvC,MAAMC,UAAUwD,MACnBpB,OAAOqB,eAAe1D,MAAMC,UAAW,OAAQ,CAC7C4B,MAAO,SAAU8B,GAEf,GAAa,OAATlD,KACF,MAAM,IAAI0B,UAAU,iCAGtB,IAAIyB,EAAIvB,OAAO5B,MAGX6B,EAAMsB,EAAEpD,SAAW,EAGvB,GAAyB,mBAAdmD,EACT,MAAM,IAAIxB,UAAU,gCAUtB,IANA,IAAIa,EAAU1C,UAAU,GAGpBiC,EAAI,EAGDA,EAAID,GAAK,CAKd,IAAIkB,EAASI,EAAErB,GACf,GAAIoB,EAAUT,KAAKF,EAASQ,EAAQjB,EAAGqB,GACrC,OAAOJ,EAGTjB,GACF,CAIF,IAOCvC,MAAMC,UAAU4D,QACnBxB,OAAOqB,eAAe1D,MAAMC,UAAW,SAAU,CAC/C4B,MAAO,SAAUyB,GACf,GAAa,OAAT7C,KACF,MAAM,IAAI0B,UAAU,sDAEtB,GAAwB,mBAAbmB,EACT,MAAM,IAAInB,UAAUmB,EAAW,sBAIjC,IAOIzB,EAPA+B,EAAIvB,OAAO5B,MAGX6B,EAAMsB,EAAEpD,SAAW,EAGnB+B,EAAI,EAGR,GAAIjC,UAAUE,QAAU,EACtBqB,EAAQvB,UAAU,OACb,CACL,KAAOiC,EAAID,KAASC,KAAKqB,IACvBrB,IAKF,GAAIA,GAAKD,EACP,MAAM,IAAIH,UAAU,+CAEtBN,EAAQ+B,EAAErB,IACZ,CAGA,KAAOA,EAAID,GAQLC,KAAKqB,IACP/B,EAAQyB,EAASzB,EAAO+B,EAAErB,GAAIA,EAAGqB,IAInCrB,IAIF,OAAOV,CACT,IAMC7B,MAAMC,UAAU6D,OACnB9D,MAAMC,UAAU6D,KAAO,SAAUjB,GAC/B,GAAa,OAATpC,KACF,MAAM,IAAI0B,UAAU,oDAGtB,GAAmB,mBAARU,EACT,MAAM,IAAIV,UAOZ,IAJA,IAAIW,EAAIT,OAAO5B,MACX6B,EAAMQ,EAAEtC,SAAW,EAEnBwC,EAAU1C,UAAUE,QAAU,EAAIF,UAAU,QAAK,EAC5CgB,EAAI,EAAGA,EAAIgB,EAAKhB,IACvB,GAAIA,KAAKwB,GAAKD,EAAIK,KAAKF,EAASF,EAAExB,GAAIA,EAAGwB,GACvC,OAAO,EAIX,OAAO,CACT,GAGG9C,MAAMC,UAAU8D,aACnB/D,MAAMC,UAAU8D,WAAa,SAAUC,GACrC,IAAIC,EAASxD,KACb,OAAIwD,EACKA,EAAOrB,QAAO,SAAU3B,GAC7B,OAA8B,IAAvB+C,EAAOtD,QAAQO,EACxB,IAGKgD,CACT,GAGGjE,MAAMC,UAAUiE,SACnBlE,MAAMC,UAAUiE,OAAS,SAAUjB,GACjC,OAAOxC,KAAKmC,QAAO,SAAUuB,GAC3B,IAAKlB,EAAIhB,SAASkC,GAChB,OAAOA,CAEX,GACF,GAGGnE,MAAMoE,UACTpE,MAAMoE,QAAU,SAAUC,GACxB,MAA+C,mBAAxChC,OAAOpC,UAAUqE,SAASpB,KAAKmB,EACxC,GAGGrE,MAAMuE,QACTlC,OAAOqB,eAAe1D,MAAMC,UAAW,QAAS,CAC9C4B,MAAO,SAAeZ,GACpB,IAAIuD,EAAQ/D,KAERgE,EAAOtD,KAAKsD,KAChB,OAAOzE,MAAM0E,KAAK1E,MAAMyE,EAAKhE,KAAKD,OAASS,KAAK,SAAU0D,EAAGrD,GAC3D,OAAOkD,EAAM5C,MAAMN,EAAIL,EAAGK,EAAIL,EAAIA,EACpC,GACF,IAICa,OAAO7B,UAAU2E,aACpB9C,OAAO7B,UAAU2E,WAAa,SAAUC,EAAcC,GACpD,OAAOrE,KAAKiB,OAAOoD,GAAY,EAAGD,EAAarE,UAAYqE,CAC7D,GAGG/C,OAAO7B,UAAU8E,WACpBjD,OAAO7B,UAAU8E,SAAW,SAAUC,EAAWC,GAK/C,OAFMA,EAAWxE,KAAKD,OACjByE,GAAY,EADcA,EAAWxE,KAAKD,OAExCC,KAAKiB,OAAOuD,EAAWD,EAAUxE,OAAQwE,EAAUxE,UAAYwE,CACxE,GAGFlD,OAAO7B,UAAUiF,WAAa,SAAUzC,EAAQ0C,GAE9C,OADa1E,KACCkB,QAAQ,IAAIK,OAAOS,EAAQ,KAAM0C,EACjD,EAEArD,OAAO7B,UAAUmF,WAAa,WAE5B,OADa3E,UAGRkB,QAAQ,KAAM,SACdA,QAAQ,KAAM,UACdA,QAAQ,KAAM,SACdA,QAAQ,KAAM,QACdA,QAAQ,KAAM,QAEZ,EACT,EAEAG,OAAO7B,UAAUoF,aAAe,WAE9B,GADY5E,KACD,CACT,GAAI6E,GAAGC,WACL,OAHQ9E,KAGK+E,MAAMF,GAAGC,YAEtB,KAAM,2BAEV,CACA,OAAO,CACT,EAEAzD,OAAO7B,UAAUwF,cAAgB,SAAUC,GACzC,IAAIC,EAAQlF,KACZ,GAAIkF,EAAO,CAET,IAAIC,OAAiC,IAAdF,EAA4BA,EAAY,IAC/D,QAFAC,EAAQA,EAAMhE,QAAQ,WAAY,KAEpBnB,QACZ,KAAK,GACH,OACEmF,EAAME,UAAU,EAAG,GACnBD,EACAD,EAAME,UAAU,EAAG,GACnBD,EACAD,EAAME,UAAU,EAAG,GACnBD,EACAD,EAAME,UAAU,EAAG,IAEvB,KAAK,GACH,OAAOF,EAAME,UAAU,EAAG,GAAKD,EAAYD,EAAME,UAAU,EAAG,GAAKD,EAAYD,EAAME,UAAU,EAAG,IACpG,KAAK,EACH,OAAOF,EAAME,UAAU,EAAG,GAAKD,EAAYD,EAAME,UAAU,EAAG,GAChE,QACE,OAAOF,EAEb,CAEA,OAAOA,CACT,EAEK7D,OAAO7B,UAAU6F,OACpBhE,OAAO7B,UAAU6F,KAAO,WACtB,OAAOrF,KAAKkB,QAAQ,qCAAsC,GAC5D,GAGFG,OAAO7B,UAAU8F,UAAY,WAC3B,IAAyBC,EAArBC,GAAqBD,EActB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAbtB,SAAUE,GAMf,IALA,IAGEjD,EAHEX,EAAM4D,EAAM1F,OACd2F,EAAM,EACNC,EAAM,EAGD9D,GACLW,EAAM1B,SAAS2E,EAAMG,SAAS/D,GAAM,IACpC8D,IAAQD,GAAO,GAAKH,EAAI/C,GAAOA,EAGjC,OAAOmD,GAAOA,EAAM,IAAO,CAC7B,GAGF,SAAI3F,MAAwB,KAAhBA,KAAKqF,QAAiBrF,KAAKqF,OAAOtF,QAAU,KAC/CyF,EAAQxF,KAInB,C","sources":["webpack://shipley-du-lib/./common/js/legacy/custPortal/cw/lib/cw.prototype.js"],"sourcesContent":["\"use strict\";\r\n\r\nif (!Array.prototype.remove) {\r\n  Array.prototype.remove = function () {\r\n    var what,\r\n      a = arguments,\r\n      L = a.length,\r\n      ax;\r\n    while (L && this.length) {\r\n      what = a[--L];\r\n      while ((ax = this.indexOf(what)) !== -1) {\r\n        this.splice(ax, 1);\r\n      }\r\n    }\r\n    return this;\r\n  };\r\n}\r\n\r\nif (!Number.prototype.formatMoney) {\r\n  Number.prototype.formatMoney = function (numDecimals, decimal_sep, thousands_sep) {\r\n    var n = this;\r\n    numDecimals = isNaN((numDecimals = Math.abs(numDecimals))) ? 2 : numDecimals;\r\n    decimal_sep = typeof decimal_sep === \"undefined\" ? \".\" : decimal_sep;\r\n    thousands_sep = typeof thousands_sep === \"undefined\" ? \",\" : thousands_sep;\r\n    var s = n < 0 ? \"-\" : \"\";\r\n    var i = parseInt((n = Math.abs(+n || 0).toFixed(numDecimals))) + \"\";\r\n    var j = (j = i.length) > 3 ? j % 3 : 0;\r\n    return (\r\n      s +\r\n      (j ? i.substr(0, j) + thousands_sep : \"\") +\r\n      i.substr(j).replace(/(\\d{3})(?=\\d)/g, \"$1\" + thousands_sep) +\r\n      (numDecimals\r\n        ? decimal_sep +\r\n          Math.abs(n - i)\r\n            .toFixed(numDecimals)\r\n            .slice(2)\r\n        : \"\")\r\n    );\r\n  };\r\n}\r\n\r\nNumber.isNaN =\r\n  Number.isNaN ||\r\n  function (value) {\r\n    return value !== value;\r\n  };\r\n\r\nif (!String.prototype.format) {\r\n  String.prototype.format = function () {\r\n    var s = this,\r\n      i = arguments.length;\r\n\r\n    while (i--) {\r\n      s = s.replace(new RegExp(\"\\\\{\" + i + \"\\\\}\", \"gm\"), arguments[i]);\r\n    }\r\n    return s;\r\n  };\r\n}\r\n\r\nif (!Array.prototype.includes) {\r\n  Array.prototype.includes = function (searchElement /*, fromIndex*/) {\r\n    if (this === null) {\r\n      throw new TypeError(\"Array.prototype.includes called on null or undefined\");\r\n    }\r\n\r\n    var O = Object(this);\r\n    var len = parseInt(O.length, 10) || 0;\r\n    if (len === 0) {\r\n      return false;\r\n    }\r\n    var n = parseInt(arguments[1], 10) || 0;\r\n    var k;\r\n    if (n >= 0) {\r\n      k = n;\r\n    } else {\r\n      k = len + n;\r\n      if (k < 0) {\r\n        k = 0;\r\n      }\r\n    }\r\n    var currentElement;\r\n    while (k < len) {\r\n      currentElement = O[k];\r\n      if (\r\n        searchElement === currentElement ||\r\n        (searchElement !== searchElement && currentElement !== currentElement)\r\n      ) {\r\n        // NaN !== NaN\r\n        return true;\r\n      }\r\n      k++;\r\n    }\r\n    return false;\r\n  };\r\n}\r\n\r\nif (!String.prototype.includes) {\r\n  String.prototype.includes = function (search, start) {\r\n    \"use strict\";\r\n    if (typeof start !== \"number\") {\r\n      start = 0;\r\n    }\r\n\r\n    if (start + search.length > this.length) {\r\n      return false;\r\n    } else {\r\n      return this.indexOf(search, start) !== -1;\r\n    }\r\n  };\r\n}\r\n\r\nif (!Array.prototype.contains) {\r\n  //alias this to '[array].includes()'\r\n  Array.prototype.contains = function (searchElement /*, fromIndex*/) {\r\n    if (this === null) {\r\n      throw new TypeError(\"Array.prototype.includes called on null or undefined\");\r\n    }\r\n\r\n    return this.includes(searchElement);\r\n  };\r\n}\r\n\r\nif (!Array.prototype.filter) {\r\n  Array.prototype.filter = function (fun /*, thisArg*/) {\r\n    if (this === void 0 || this === null) {\r\n      throw new TypeError();\r\n    }\r\n\r\n    var t = Object(this);\r\n    var len = t.length >>> 0;\r\n    if (typeof fun !== \"function\") {\r\n      throw new TypeError();\r\n    }\r\n\r\n    var res = [];\r\n    var thisArg = arguments.length >= 2 ? arguments[1] : void 0;\r\n    for (var i = 0; i < len; i++) {\r\n      if (i in t) {\r\n        var val = t[i];\r\n\r\n        // NOTE: Technically this should Object.defineProperty at\r\n        //       the next index, as push can be affected by\r\n        //       properties on Object.prototype and Array.prototype.\r\n        //       But that method's new, and collisions should be\r\n        //       rare, so use the more-compatible alternative.\r\n        if (fun.call(thisArg, val, i, t)) {\r\n          res.push(val);\r\n        }\r\n      }\r\n    }\r\n\r\n    return res;\r\n  };\r\n}\r\n\r\nif (!Array.prototype.filterSingle) {\r\n  Array.prototype.filterSingle = function (fun /*, thisArg*/) {\r\n    var res = this.filter(fun);\r\n\r\n    if (res.length > 0) {\r\n      res = res[0];\r\n      return res;\r\n    }\r\n\r\n    return null;\r\n  };\r\n}\r\n\r\nif (!Array.prototype.forEach) {\r\n  Array.prototype.forEach = function (callback /*, thisArg*/) {\r\n    var T, k;\r\n\r\n    if (this === null) {\r\n      throw new TypeError(\"this is null or not defined\");\r\n    }\r\n\r\n    // 1. Let O be the result of calling toObject() passing the\r\n    // |this| value as the argument.\r\n    var O = Object(this);\r\n\r\n    // 2. Let lenValue be the result of calling the Get() internal\r\n    // method of O with the argument \"length\".\r\n    // 3. Let len be toUint32(lenValue).\r\n    var len = O.length >>> 0;\r\n\r\n    // 4. If isCallable(callback) is false, throw a TypeError exception.\r\n    // See: http://es5.github.com/#x9.11\r\n    if (typeof callback !== \"function\") {\r\n      throw new TypeError(callback + \" is not a function\");\r\n    }\r\n\r\n    // 5. If thisArg was supplied, let T be thisArg; else let\r\n    // T be undefined.\r\n    if (arguments.length > 1) {\r\n      T = arguments[1];\r\n    }\r\n\r\n    // 6. Let k be 0\r\n    k = 0;\r\n\r\n    // 7. Repeat, while k < len\r\n    while (k < len) {\r\n      var kValue;\r\n\r\n      // a. Let Pk be ToString(k).\r\n      //    This is implicit for LHS operands of the in operator\r\n      // b. Let kPresent be the result of calling the HasProperty\r\n      //    internal method of O with argument Pk.\r\n      //    This step can be combined with c\r\n      // c. If kPresent is true, then\r\n      if (k in O) {\r\n        // i. Let kValue be the result of calling the Get internal\r\n        // method of O with argument Pk.\r\n        kValue = O[k];\r\n\r\n        // ii. Call the Call internal method of callback with T as\r\n        // the this value and argument list containing kValue, k, and O.\r\n        callback.call(T, kValue, k, O);\r\n      }\r\n      // d. Increase k by 1.\r\n      k++;\r\n    }\r\n    // 8. return undefined\r\n  };\r\n}\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 new 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 new 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  });\r\n}\r\n\r\n// Production steps of ECMA-262, Edition 5, 15.4.4.21\r\n// Reference: http://es5.github.io/#x15.4.4.21\r\n// https://tc39.github.io/ecma262/#sec-array.prototype.reduce\r\nif (!Array.prototype.reduce) {\r\n  Object.defineProperty(Array.prototype, \"reduce\", {\r\n    value: function (callback /*, initialValue*/) {\r\n      if (this === null) {\r\n        throw new TypeError(\"Array.prototype.reduce \" + \"called on null or undefined\");\r\n      }\r\n      if (typeof callback !== \"function\") {\r\n        throw new TypeError(callback + \" is not a function\");\r\n      }\r\n\r\n      // 1. Let O be ? ToObject(this value).\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      // Steps 3, 4, 5, 6, 7\r\n      var k = 0;\r\n      var value;\r\n\r\n      if (arguments.length >= 2) {\r\n        value = arguments[1];\r\n      } else {\r\n        while (k < len && !(k in o)) {\r\n          k++;\r\n        }\r\n\r\n        // 3. If len is 0 and initialValue is not present,\r\n        //    throw a TypeError exception.\r\n        if (k >= len) {\r\n          throw new TypeError(\"Reduce of empty array \" + \"with no initial value\");\r\n        }\r\n        value = o[k++];\r\n      }\r\n\r\n      // 8. Repeat, while k < len\r\n      while (k < len) {\r\n        // a. Let Pk be ! ToString(k).\r\n        // b. Let kPresent be ? HasProperty(O, Pk).\r\n        // c. If kPresent is true, then\r\n        //    i.  Let kValue be ? Get(O, Pk).\r\n        //    ii. Let accumulator be ? Call(\r\n        //          callbackfn, undefined,\r\n        //          « accumulator, kValue, k, O »).\r\n        if (k in o) {\r\n          value = callback(value, o[k], k, o);\r\n        }\r\n\r\n        // d. Increase k by 1.\r\n        k++;\r\n      }\r\n\r\n      // 9. Return accumulator.\r\n      return value;\r\n    },\r\n  });\r\n}\r\n\r\n// Production steps of ECMA-262, Edition 5, 15.4.4.17\r\n// Reference: http://es5.github.io/#x15.4.4.17\r\nif (!Array.prototype.some) {\r\n  Array.prototype.some = function (fun /*, thisArg*/) {\r\n    if (this === null) {\r\n      throw new TypeError(\"Array.prototype.some called on null or undefined\");\r\n    }\r\n\r\n    if (typeof fun !== \"function\") {\r\n      throw new TypeError();\r\n    }\r\n\r\n    var t = Object(this);\r\n    var len = t.length >>> 0;\r\n\r\n    var thisArg = arguments.length >= 2 ? arguments[1] : void 0;\r\n    for (var i = 0; i < len; i++) {\r\n      if (i in t && fun.call(thisArg, t[i], i, t)) {\r\n        return true;\r\n      }\r\n    }\r\n\r\n    return false;\r\n  };\r\n}\r\n\r\nif (!Array.prototype.intersects) {\r\n  Array.prototype.intersects = function (array2) {\r\n    var array1 = this;\r\n    if (array1) {\r\n      return array1.filter(function (n) {\r\n        return array2.indexOf(n) !== -1;\r\n      });\r\n    }\r\n\r\n    return array1;\r\n  };\r\n}\r\n\r\nif (!Array.prototype.except) {\r\n  Array.prototype.except = function (val) {\r\n    return this.filter(function (x) {\r\n      if (!val.includes(x)) {\r\n        return x;\r\n      }\r\n    });\r\n  };\r\n}\r\n\r\nif (!Array.isArray) {\r\n  Array.isArray = function (arg) {\r\n    return Object.prototype.toString.call(arg) === \"[object Array]\";\r\n  };\r\n}\r\n\r\nif (!Array.chunck) {\r\n  Object.defineProperty(Array.prototype, \"chunk\", {\r\n    value: function value(n) {\r\n      var _this = this;\r\n\r\n      var ceil = Math.ceil;\r\n      return Array.from(Array(ceil(this.length / n)), function (_, i) {\r\n        return _this.slice(i * n, i * n + n);\r\n      });\r\n    },\r\n  });\r\n}\r\n\r\nif (!String.prototype.startsWith) {\r\n  String.prototype.startsWith = function (searchString, position) {\r\n    return this.substr(position || 0, searchString.length) === searchString;\r\n  };\r\n}\r\n\r\nif (!String.prototype.endsWith) {\r\n  String.prototype.endsWith = function (searchStr, Position) {\r\n    // This works much better than >= because\r\n    // it compensates for NaN:\r\n    if (!(Position < this.length)) Position = this.length;\r\n    else Position |= 0; // round position\r\n    return this.substr(Position - searchStr.length, searchStr.length) === searchStr;\r\n  };\r\n}\r\n\r\nString.prototype.replaceAll = function (search, replacement) {\r\n  var target = this;\r\n  return target.replace(new RegExp(search, \"g\"), replacement);\r\n};\r\n\r\nString.prototype.htmlEscape = function () {\r\n  var target = this;\r\n  if (target) {\r\n    return target\r\n      .replace(/&/g, \"&amp;\")\r\n      .replace(/\"/g, \"&quot;\")\r\n      .replace(/'/g, \"&#39;\")\r\n      .replace(/</g, \"&lt;\")\r\n      .replace(/>/g, \"&gt;\");\r\n  }\r\n  return \"\";\r\n};\r\n\r\nString.prototype.isValidEmail = function () {\r\n  var email = this;\r\n  if (email) {\r\n    if (cw.emailRegex) {\r\n      return email.match(cw.emailRegex);\r\n    } else {\r\n      throw \"cw.emailRegex is missing!\";\r\n    }\r\n  }\r\n  return false;\r\n};\r\n\r\nString.prototype.formatAsPhone = function (seperator) {\r\n  var phone = this;\r\n  if (phone) {\r\n    phone = phone.replace(/[^0-9]+/g, \"\");\r\n    var breakChar = typeof seperator !== \"undefined\" ? seperator : \"-\";\r\n    switch (phone.length) {\r\n      case 11:\r\n        return (\r\n          phone.substring(0, 1) +\r\n          breakChar +\r\n          phone.substring(1, 4) +\r\n          breakChar +\r\n          phone.substring(4, 7) +\r\n          breakChar +\r\n          phone.substring(7, 11)\r\n        );\r\n      case 10:\r\n        return phone.substring(0, 3) + breakChar + phone.substring(3, 6) + breakChar + phone.substring(6, 10);\r\n      case 7:\r\n        return phone.substring(0, 3) + breakChar + phone.substring(3, 7);\r\n      default:\r\n        return phone;\r\n    }\r\n  }\r\n\r\n  return phone;\r\n};\r\n\r\nif (!String.prototype.trim) {\r\n  String.prototype.trim = function () {\r\n    return this.replace(/^[\\s\\uFEFF\\xA0]+|[\\s\\uFEFF\\xA0]+$/g, \"\");\r\n  };\r\n}\r\n\r\nString.prototype.luhnCheck = function () {\r\n  var luhnChk = (function (arr) {\r\n    return function (ccNum) {\r\n      var len = ccNum.length,\r\n        bit = 1,\r\n        sum = 0,\r\n        val;\r\n\r\n      while (len) {\r\n        val = parseInt(ccNum.charAt(--len), 10);\r\n        sum += (bit ^= 1) ? arr[val] : val;\r\n      }\r\n\r\n      return sum && sum % 10 === 0;\r\n    };\r\n  })([0, 2, 4, 6, 8, 1, 3, 5, 7, 9]);\r\n\r\n  if (this && this.trim() !== \"\" && this.trim().length >= 12) {\r\n    return luhnChk(this);\r\n  }\r\n\r\n  return false;\r\n};\r\n\r\nfunction intParse(int) {\r\n  //take that c#!\r\n  return parseInt(int);\r\n}\r\n"],"names":["Array","prototype","remove","what","ax","a","arguments","L","length","this","indexOf","splice","Number","formatMoney","numDecimals","decimal_sep","thousands_sep","n","isNaN","Math","abs","s","i","parseInt","toFixed","j","substr","replace","slice","value","String","format","RegExp","includes","searchElement","TypeError","O","Object","len","k","currentElement","search","start","contains","filter","fun","t","res","thisArg","val","call","push","filterSingle","forEach","callback","T","kValue","find","defineProperty","predicate","o","reduce","some","intersects","array2","array1","except","x","isArray","arg","toString","chunck","_this","ceil","from","_","startsWith","searchString","position","endsWith","searchStr","Position","replaceAll","replacement","htmlEscape","isValidEmail","cw","emailRegex","match","formatAsPhone","seperator","phone","breakChar","substring","trim","luhnCheck","arr","luhnChk","ccNum","bit","sum","charAt"],"sourceRoot":""}