@mmb-digital/ds-lilly 1.0.39 → 1.0.41

package/ext/memoizerific/memoizerific.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memoizerific.js","sources":["../../../node_modules/memoizerific/memoizerific.js"],"sourcesContent":["(function(f){if(typeof exports===\"object\"&&typeof module!==\"undefined\"){module.exports=f()}else if(typeof define===\"function\"&&define.amd){define([],f)}else{var g;if(typeof window!==\"undefined\"){g=window}else if(typeof global!==\"undefined\"){g=global}else if(typeof self!==\"undefined\"){g=self}else{g=this}g.memoizerific = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(_dereq_,module,exports){\nmodule.exports = function(forceSimilar) {\n\tif (typeof Map !== 'function' || forceSimilar) {\n\t\tvar Similar = _dereq_('./similar');\n\t\treturn new Similar();\n\t}\n\telse {\n\t\treturn new Map();\n\t}\n}\n\n},{\"./similar\":2}],2:[function(_dereq_,module,exports){\nfunction Similar() {\n\tthis.list = [];\n\tthis.lastItem = undefined;\n\tthis.size = 0;\n\n\treturn this;\n}\n\nSimilar.prototype.get = function(key) {\n\tvar index;\n\n\tif (this.lastItem && this.isEqual(this.lastItem.key, key)) {\n\t\treturn this.lastItem.val;\n\t}\n\n\tindex = this.indexOf(key);\n\tif (index >= 0) {\n\t\tthis.lastItem = this.list[index];\n\t\treturn this.list[index].val;\n\t}\n\n\treturn undefined;\n};\n\nSimilar.prototype.set = function(key, val) {\n\tvar index;\n\n\tif (this.lastItem && this.isEqual(this.lastItem.key, key)) {\n\t\tthis.lastItem.val = val;\n\t\treturn this;\n\t}\n\n\tindex = this.indexOf(key);\n\tif (index >= 0) {\n\t\tthis.lastItem = this.list[index];\n\t\tthis.list[index].val = val;\n\t\treturn this;\n\t}\n\n\tthis.lastItem = { key: key, val: val };\n\tthis.list.push(this.lastItem);\n\tthis.size++;\n\n\treturn this;\n};\n\nSimilar.prototype.delete = function(key) {\n\tvar index;\n\n\tif (this.lastItem && this.isEqual(this.lastItem.key, key)) {\n\t\tthis.lastItem = undefined;\n\t}\n\n\tindex = this.indexOf(key);\n\tif (index >= 0) {\n\t\tthis.size--;\n\t\treturn this.list.splice(index, 1)[0];\n\t}\n\n\treturn undefined;\n};\n\n\n// important that has() doesn't use get() in case an existing key has a falsy value, in which case has() would return false\nSimilar.prototype.has = function(key) {\n\tvar index;\n\n\tif (this.lastItem && this.isEqual(this.lastItem.key, key)) {\n\t\treturn true;\n\t}\n\n\tindex = this.indexOf(key);\n\tif (index >= 0) {\n\t\tthis.lastItem = this.list[index];\n\t\treturn true;\n\t}\n\n\treturn false;\n};\n\nSimilar.prototype.forEach = function(callback, thisArg) {\n\tvar i;\n\tfor (i = 0; i < this.size; i++) {\n\t\tcallback.call(thisArg || this, this.list[i].val, this.list[i].key, this);\n\t}\n};\n\nSimilar.prototype.indexOf = function(key) {\n\tvar i;\n\tfor (i = 0; i < this.size; i++) {\n\t\tif (this.isEqual(this.list[i].key, key)) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n};\n\n// check if the numbers are equal, or whether they are both precisely NaN (isNaN returns true for all non-numbers)\nSimilar.prototype.isEqual = function(val1, val2) {\n\treturn val1 === val2 || (val1 !== val1 && val2 !== val2);\n};\n\nmodule.exports = Similar;\n},{}],3:[function(_dereq_,module,exports){\nvar MapOrSimilar = _dereq_('map-or-similar');\n\nmodule.exports = function (limit) {\n\tvar cache = new MapOrSimilar(undefined === 'true'),\n\t\tlru = [];\n\n\treturn function (fn) {\n\t\tvar memoizerific = function () {\n\t\t\tvar currentCache = cache,\n\t\t\t\tnewMap,\n\t\t\t\tfnResult,\n\t\t\t\targsLengthMinusOne = arguments.length - 1,\n\t\t\t\tlruPath = Array(argsLengthMinusOne + 1),\n\t\t\t\tisMemoized = true,\n\t\t\t\ti;\n\n\t\t\tif ((memoizerific.numArgs || memoizerific.numArgs === 0) && memoizerific.numArgs !== argsLengthMinusOne + 1) {\n\t\t\t\tthrow new Error('Memoizerific functions should always be called with the same number of arguments');\n\t\t\t}\n\n\t\t\t// loop through each argument to traverse the map tree\n\t\t\tfor (i = 0; i < argsLengthMinusOne; i++) {\n\t\t\t\tlruPath[i] = {\n\t\t\t\t\tcacheItem: currentCache,\n\t\t\t\t\targ: arguments[i]\n\t\t\t\t};\n\n\t\t\t\t// climb through the hierarchical map tree until the second-last argument has been found, or an argument is missing.\n\t\t\t\t// if all arguments up to the second-last have been found, this will potentially be a cache hit (determined later)\n\t\t\t\tif (currentCache.has(arguments[i])) {\n\t\t\t\t\tcurrentCache = currentCache.get(arguments[i]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tisMemoized = false;\n\n\t\t\t\t// make maps until last value\n\t\t\t\tnewMap = new MapOrSimilar(undefined === 'true');\n\t\t\t\tcurrentCache.set(arguments[i], newMap);\n\t\t\t\tcurrentCache = newMap;\n\t\t\t}\n\n\t\t\t// we are at the last arg, check if it is really memoized\n\t\t\tif (isMemoized) {\n\t\t\t\tif (currentCache.has(arguments[argsLengthMinusOne])) {\n\t\t\t\t\tfnResult = currentCache.get(arguments[argsLengthMinusOne]);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tisMemoized = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!isMemoized) {\n\t\t\t\tfnResult = fn.apply(null, arguments);\n\t\t\t\tcurrentCache.set(arguments[argsLengthMinusOne], fnResult);\n\t\t\t}\n\n\t\t\tif (limit > 0) {\n\t\t\t\tlruPath[argsLengthMinusOne] = {\n\t\t\t\t\tcacheItem: currentCache,\n\t\t\t\t\targ: arguments[argsLengthMinusOne]\n\t\t\t\t};\n\n\t\t\t\tif (isMemoized) {\n\t\t\t\t\tmoveToMostRecentLru(lru, lruPath);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tlru.push(lruPath);\n\t\t\t\t}\n\n\t\t\t\tif (lru.length > limit) {\n\t\t\t\t\tremoveCachedResult(lru.shift());\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tmemoizerific.wasMemoized = isMemoized;\n\t\t\tmemoizerific.numArgs = argsLengthMinusOne + 1;\n\n\t\t\treturn fnResult;\n\t\t};\n\n\t\tmemoizerific.limit = limit;\n\t\tmemoizerific.wasMemoized = false;\n\t\tmemoizerific.cache = cache;\n\t\tmemoizerific.lru = lru;\n\n\t\treturn memoizerific;\n\t};\n};\n\n// move current args to most recent position\nfunction moveToMostRecentLru(lru, lruPath) {\n\tvar lruLen = lru.length,\n\t\tlruPathLen = lruPath.length,\n\t\tisMatch,\n\t\ti, ii;\n\n\tfor (i = 0; i < lruLen; i++) {\n\t\tisMatch = true;\n\t\tfor (ii = 0; ii < lruPathLen; ii++) {\n\t\t\tif (!isEqual(lru[i][ii].arg, lruPath[ii].arg)) {\n\t\t\t\tisMatch = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (isMatch) {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tlru.push(lru.splice(i, 1)[0]);\n}\n\n// remove least recently used cache item and all dead branches\nfunction removeCachedResult(removedLru) {\n\tvar removedLruLen = removedLru.length,\n\t\tcurrentLru = removedLru[removedLruLen - 1],\n\t\ttmp,\n\t\ti;\n\n\tcurrentLru.cacheItem.delete(currentLru.arg);\n\n\t// walk down the tree removing dead branches (size 0) along the way\n\tfor (i = removedLruLen - 2; i >= 0; i--) {\n\t\tcurrentLru = removedLru[i];\n\t\ttmp = currentLru.cacheItem.get(currentLru.arg);\n\n\t\tif (!tmp || !tmp.size) {\n\t\t\tcurrentLru.cacheItem.delete(currentLru.arg);\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n// check if the numbers are equal, or whether they are both precisely NaN (isNaN returns true for all non-numbers)\nfunction isEqual(val1, val2) {\n\treturn val1 === val2 || (val1 !== val1 && val2 !== val2);\n}\n},{\"map-or-similar\":1}]},{},[3])(3)\n});"],"names":["exports","e","t","n","r","s","o","u","a","require","i","f","Error","code","l","call","length","_dereq_","module","forceSimilar","Map","Similar","this","list","lastItem","undefined","size","prototype","get","key","index","isEqual","val","indexOf","set","push","delete","splice","has","forEach","callback","thisArg","val1","val2","MapOrSimilar","moveToMostRecentLru","lru","lruPath","isMatch","ii","lruLen","lruPathLen","arg","removeCachedResult","removedLru","tmp","removedLruLen","currentLru","cacheItem","limit","cache","fn","memoizerific","newMap","fnResult","currentCache","argsLengthMinusOne","arguments","Array","isMemoized","numArgs","apply","shift","wasMemoized"],"mappings":"uNAAwEA,QAA4S,SAAUC,EAAEC,EAAEC,EAAEC,GAAG,SAASC,EAAEC,EAAEC,GAAG,IAAIJ,EAAEG,GAAG,CAAC,IAAIJ,EAAEI,GAAG,CAAC,IAAIE,EAAkB,mBAATC,GAAqBA,EAAQ,IAAIF,GAAGC,EAAE,OAAOA,EAAEF,GAAE,GAAI,GAAGI,EAAE,OAAOA,EAAEJ,GAAE,GAAI,IAAIK,EAAE,IAAIC,MAAM,uBAAuBN,EAAE,KAAK,MAAMK,EAAEE,KAAK,mBAAmBF,CAAC,CAAC,IAAIG,EAAEX,EAAEG,GAAG,CAACN,QAAQ,CAAA,GAAIE,EAAEI,GAAG,GAAGS,KAAKD,EAAEd,SAAQ,SAASC,GAAG,IAAIE,EAAED,EAAEI,GAAG,GAAGL,GAAG,OAAOI,EAAEF,GAAIF,EAAE,GAAEa,EAAEA,EAAEd,QAAQC,EAAEC,EAAEC,EAAEC,EAAE,CAAC,OAAOD,EAAEG,GAAGN,OAAO,CAA2C,IAA1C,IAAIU,EAAkB,mBAATD,GAAqBA,EAAgBH,EAAE,EAAEA,EAAEF,EAAEY,OAAOV,IAAID,EAAED,EAAEE,IAAI,OAAOD,CAAE,CAAzb,CAA2b,CAAC,EAAE,CAAC,SAASY,EAAQC,EAAOlB,GAC30BkB,EAAOlB,QAAU,SAASmB,GACzB,MAAmB,mBAARC,KAAsBD,EAEzB,IADOF,EAAQ,cAIf,IAAIG,GAEZ,CAED,EAAE,CAAC,YAAY,IAAI,EAAE,CAAC,SAASH,EAAQC,EAAOlB,GAC9C,SAASqB,IAKR,OAJAC,KAAKC,KAAO,GACZD,KAAKE,cAAWC,EAChBH,KAAKI,KAAO,EAELJ,IACP,CAEDD,EAAQM,UAAUC,IAAM,SAASC,GAChC,IAAIC,EAEJ,OAAIR,KAAKE,UAAYF,KAAKS,QAAQT,KAAKE,SAASK,IAAKA,GAC7CP,KAAKE,SAASQ,KAGtBF,EAAQR,KAAKW,QAAQJ,KACR,GACZP,KAAKE,SAAWF,KAAKC,KAAKO,GACnBR,KAAKC,KAAKO,GAAOE,UAFzB,CAMD,EAEAX,EAAQM,UAAUO,IAAM,SAASL,EAAKG,GACrC,IAAIF,EAEJ,OAAIR,KAAKE,UAAYF,KAAKS,QAAQT,KAAKE,SAASK,IAAKA,IACpDP,KAAKE,SAASQ,IAAMA,EACbV,OAGRQ,EAAQR,KAAKW,QAAQJ,KACR,GACZP,KAAKE,SAAWF,KAAKC,KAAKO,GAC1BR,KAAKC,KAAKO,GAAOE,IAAMA,EAChBV,OAGRA,KAAKE,SAAW,CAAEK,IAAKA,EAAKG,IAAKA,GACjCV,KAAKC,KAAKY,KAAKb,KAAKE,UACpBF,KAAKI,OAEEJ,KACR,EAEAD,EAAQM,UAAUS,OAAS,SAASP,GACnC,IAAIC,EAOJ,GALIR,KAAKE,UAAYF,KAAKS,QAAQT,KAAKE,SAASK,IAAKA,KACpDP,KAAKE,cAAWC,IAGjBK,EAAQR,KAAKW,QAAQJ,KACR,EAEZ,OADAP,KAAKI,OACEJ,KAAKC,KAAKc,OAAOP,EAAO,GAAG,EAIpC,EAIAT,EAAQM,UAAUW,IAAM,SAAST,GAChC,IAAIC,EAEJ,SAAIR,KAAKE,WAAYF,KAAKS,QAAQT,KAAKE,SAASK,IAAKA,MAIrDC,EAAQR,KAAKW,QAAQJ,KACR,IACZP,KAAKE,SAAWF,KAAKC,KAAKO,IACnB,EAIT,EAEAT,EAAQM,UAAUY,QAAU,SAASC,EAAUC,GAC9C,IAAI/B,EACJ,IAAKA,EAAI,EAAGA,EAAIY,KAAKI,KAAMhB,IAC1B8B,EAASzB,KAAK0B,GAAWnB,KAAMA,KAAKC,KAAKb,GAAGsB,IAAKV,KAAKC,KAAKb,GAAGmB,IAAKP,KAErE,EAEAD,EAAQM,UAAUM,QAAU,SAASJ,GACpC,IAAInB,EACJ,IAAKA,EAAI,EAAGA,EAAIY,KAAKI,KAAMhB,IAC1B,GAAIY,KAAKS,QAAQT,KAAKC,KAAKb,GAAGmB,IAAKA,GAClC,OAAOnB,EAGT,OAAQ,CACT,EAGAW,EAAQM,UAAUI,QAAU,SAASW,EAAMC,GAC1C,OAAOD,IAASC,GAASD,GAASA,GAAQC,GAASA,CACpD,EAEAzB,EAAOlB,QAAUqB,CACjB,EAAE,CAAA,GAAI,EAAE,CAAC,SAASJ,EAAQC,EAAOlB,GACjC,IAAI4C,EAAe3B,EAAQ,kBA2F3B,SAAS4B,EAAoBC,EAAKC,GACjC,IAECC,EACAtC,EAAGuC,EAHAC,EAASJ,EAAI9B,OAChBmC,EAAaJ,EAAQ/B,OAItB,IAAKN,EAAI,EAAGA,EAAIwC,EAAQxC,IAAK,CAE5B,IADAsC,GAAU,EACLC,EAAK,EAAGA,EAAKE,EAAYF,IAC7B,IAAKlB,EAAQe,EAAIpC,GAAGuC,GAAIG,IAAKL,EAAQE,GAAIG,KAAM,CAC9CJ,GAAU,EACV,KACA,CAEF,GAAIA,EACH,KAED,CAEDF,EAAIX,KAAKW,EAAIT,OAAO3B,EAAG,GAAG,GAC1B,CAGD,SAAS2C,EAAmBC,GAC3B,IAECC,EACA7C,EAHG8C,EAAgBF,EAAWtC,OAC9ByC,EAAaH,EAAWE,EAAgB,GAOzC,IAHAC,EAAWC,UAAUtB,OAAOqB,EAAWL,KAGlC1C,EAAI8C,EAAgB,EAAG9C,GAAK,MAEhC6C,GADAE,EAAaH,EAAW5C,IACPgD,UAAU9B,IAAI6B,EAAWL,QAE7BG,EAAI7B,MAJkBhB,IAKlC+C,EAAWC,UAAUtB,OAAOqB,EAAWL,IAKzC,CAGD,SAASrB,EAAQW,EAAMC,GACtB,OAAOD,IAASC,GAASD,GAASA,GAAQC,GAASA,CACnD,CAxIDzB,EAAOlB,QAAU,SAAU2D,GAC1B,IAAIC,EAAQ,IAAIhB,GAAanB,GAC5BqB,EAAM,GAEP,OAAO,SAAUe,GAChB,IAAIC,EAAe,WAClB,IACCC,EACAC,EAIAtD,EANGuD,EAAeL,EAGlBM,EAAqBC,UAAUnD,OAAS,EACxC+B,EAAUqB,MAAMF,EAAqB,GACrCG,GAAa,EAGd,IAAKP,EAAaQ,SAAoC,IAAzBR,EAAaQ,UAAkBR,EAAaQ,UAAYJ,EAAqB,EACzG,MAAM,IAAItD,MAAM,oFAIjB,IAAKF,EAAI,EAAGA,EAAIwD,EAAoBxD,IACnCqC,EAAQrC,GAAK,CACZgD,UAAWO,EACXb,IAAKe,UAAUzD,IAKZuD,EAAa3B,IAAI6B,UAAUzD,IAC9BuD,EAAeA,EAAarC,IAAIuC,UAAUzD,KAI3C2D,GAAa,EAGbN,EAAS,IAAInB,GAAanB,GAC1BwC,EAAa/B,IAAIiC,UAAUzD,GAAIqD,GAC/BE,EAAeF,GAuChB,OAnCIM,IACCJ,EAAa3B,IAAI6B,UAAUD,IAC9BF,EAAWC,EAAarC,IAAIuC,UAAUD,IAGtCG,GAAa,GAIVA,IACJL,EAAWH,EAAGU,MAAM,KAAMJ,WAC1BF,EAAa/B,IAAIiC,UAAUD,GAAqBF,IAG7CL,EAAQ,IACXZ,EAAQmB,GAAsB,CAC7BR,UAAWO,EACXb,IAAKe,UAAUD,IAGZG,EACHxB,EAAoBC,EAAKC,GAGzBD,EAAIX,KAAKY,GAGND,EAAI9B,OAAS2C,GAChBN,EAAmBP,EAAI0B,UAIzBV,EAAaW,YAAcJ,EAC3BP,EAAaQ,QAAUJ,EAAqB,EAErCF,CACV,EAOE,OALAF,EAAaH,MAAQA,EACrBG,EAAaW,aAAc,EAC3BX,EAAaF,MAAQA,EACrBE,EAAahB,IAAMA,EAEZgB,CACT,CACA,CAmDA,EAAE,CAAC,iBAAiB,KAAK,CAAA,EAAG,CAAC,GA/PuV,CA+PnV","x_google_ignoreList":[0]}