nano-memoize - npm Package Compare versions

Comparing version 1.1.6 to 1.1.7

benchmark/index.js

@@ -430,2 +430,5 @@ 'use strict';
   });
+  const mNanoHashIt = nanomemoize(fibonacciMultipleDeepEqual, {
+    equals: hashItEquals
+  });
 
@@ -440,2 +443,5 @@ return new Promise((resolve) => {
 	    })
+	    .add('nanomemoize deep equals (hash-it isEqual)', () => {
+	      mNanoHashIt(fibonacciNumber);
+	    })
       .add('micro-memoize deep equals (lodash isEqual)', () => {
@@ -442,0 +448,0 @@ mMicroMemoizeDeep(fibonacciNumber);

browser/nano-memoize.js

 (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
 (function() {
-	var vrgs = f => {
+	"use strict"
+	var assign = Object.assign;
+	if(typeof(assign)!=="function") {
+		assign = function() { 
+			var a = arguments,
+				o = arguments[0];
+			if (o === null || o === undefined) {
+				throw new TypeError('Cannot convert undefined or null to object');
+		    }
+			o = Object(o);
+			for(var i=1;i<a.length;i++) {
+				if(a[i] && typeof(a[i])==="object") {
+					Object.keys(a[i]).forEach(function(k) {
+						o[k] = a[i][k];
+					})
+				}
+			}
+			return o;
+		}
+	}
+	var vrgs = function f() {
 			var s = f+"",
@@ -8,45 +28,44 @@ i = s.indexOf("...");
 		},
-		nanomemoize = (fn, {
-			serializer, // used to serialize arguments of single argument functions, multis are not serialized
-			equals, // equality tester, will force use of slower multiarg approach even for single arg functions
-			maxAge, // max cache age is ms, set > 0 && < Infinity if you want automatic clearing
-			maxArgs, // max args to use for signature
-			vargs = vrgs(fn) // set to true if function may have variable or beyond-signature arguments, default if best attempt at infering
-		}={}) => {
-			var s = Object.create(null), // single arg function key/value cache
+		nanomemoize = function(fn,o) {
+			/*o = {
+				serializer, // used to serialize arguments of single argument functions, multis are not serialized
+				equals, // equality tester, will force use of slower multiarg approach even for single arg functions
+				maxAge, // max cache age is ms, set > 0 && < Infinity if you want automatic clearing
+				maxArgs, // max args to use for signature
+				vargs = vrgs(fn) // set to true if function may have variable or beyond-signature arguments, default is best attempt at infering
+			  } = {}
+			*/
+			o || (o={});
+			var vargs = o.vargs || vrgs(fn),
+				s = Object.create(null), // single arg function key/value cache
 				k = [], // multiple arg function arg key cache
 				v = [], // multiple arg function result cache
-				wm = {m:new WeakMap()},
-				d = (key,c) => setTimeout(() => { 
+				wm = new WeakMap(),
+				d = function(key,c,k) { return setTimeout(function() {
+						if(k) { // dealing with multi-arg function, c and k are Arrays
+							c.splice(key,1);
+							k.splice(key,1);
+							return;
+						} // dealing with single arg function, c is a WekMap or Object
 						c instanceof WeakMap  ? c.delete(key) : delete c[key] 
-					},maxAge),
-				I = Infinity,
+					},o.maxAge)},
+				c = o.maxAge>0 && o.maxAge<Infinity ? d : 0, // cache change timeout,
+				eq = o.equals ? o.equals : function(a,b) { return a===b; },
+				maxargs = o.maxArgs,
+				srlz = o.serializer,
 				f, // memoized function to return
 				u; // flag indicating a unary arg function is in use for clear operation
-			if(fn.length===1 && !equals && !vargs) {
+			if(fn.length===1 && !o.equals && !vargs) {
 				// for single argument functions, just use a JS object key look-up
-				// f = original function
-				// s = result cache
-				// wm = weakmap
-				// c = cache change timeout
-				// p = arg serializer
-				// a = the arguments
-				f =  (function(f,s,wm,c,p,a) { // pre-bind core arguments, faster than using a closure or passing on stack
+				f =  (function(a) {
 						  // strings must be serialized because cache[1] should not equal or overwrite cache["1"] for value = 1 and value = "1"
 							var t = typeof a;
 							// set chng timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
-							if(!p && (t==="object"  || t==="function")) {
+							if(!srlz && (t==="object"  || t==="function")) {
 								var r;
-								return wm.m.get(a) || ((!c||c(a,wm.m)),wm.m.set(a,r = fn.call(this, a)),r);
+								return wm.get(a) || ((!c||c(a,wm)),wm.set(a,r = fn.call(this, a)),r);
 							}
-							var key = t === "number" || t === "boolean" || t==="undefined" ? a : t === "string" ? JSON.stringify(a) : p(a);
+							var key = t === "number" || t === "boolean" || t==="undefined" ? a : t === "string" ? JSON.stringify(a) : srlz(a);
 							return s[key] || ((!c||c(key,s)),s[key] = fn.call(this, a));
-						}).bind(
-							 this,
-							 fn,
-							 s,
-							 wm,
-							 maxAge>0 && maxAge<I ? d : 0,
-							 serializer
-							 );
+						}).bind(this);
 						u = 1;
@@ -56,39 +75,24 @@ } else {
 				// looking at each arg separately so a test can abort as soon as possible
-				// f = original function
-				// k = arg cache
-				// v = results cache
-				// e = equality tester
-				// c = cache change timeout
-				// m = maxArgs
-				// ...a = the arguments
-				f = (function(f,k,v,e,c,m,...a) {
-							var i,j,l = m||a.length; // use var, slightly smaller and faster for loops, and i needs more scope
-							for(i=0;i<k.length && v[i]!==undefined;i++) { // an array of arrays of args, each array represents a call signature
-								for(j=0;j<=l && (k[i][j]===a[j] || (e && e(k[i][j],a[j])));j++) {	// compare each arg									//if(p[j]!==a[j] && (!e || !e(p[j],a[j]))) break; // go to next call signature if args don't match
-									if(j===l) return v[i]; // the args matched
-								}
-							}
-							// set chng timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
-							!c||c(i,v);
-							return v[i] = fn.apply(this,k[i] = a);
-						}).bind(
-								 this,
-								 fn,
-								 k,
-								 v,
-								 equals,
-								 maxAge>0 && maxAge<I ? d : 0, 
-								 maxArgs
-								 );
+				f = (function() {
+					var l = maxargs||arguments.length;
+					for(var i=k.length-1;i>=0;i--) { // an array of arrays of args, each array represents a call signature
+						for(var j=l-1;j>=0 && eq(k[i][j],arguments[j]);j--) {	// compare each arg			
+							if(j===0) return v[i]; // the args matched
+						}
+					}
+					i = k.length - (i + 1);
+					// set change timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
+					return (!c||c(i,v,k)),v[i] = fn.apply(this,k[i] = arguments);
+				}).bind(this);
 			}
-			// reset all the caches, must change array length or delete keys on objects to retain bind integrity
-			f.clear = _ => {
-				Object.keys(s).forEach(k => delete s[k]);
-				wm.m = new WeakMap();
-				k.length = 0;
-				v.length = 0; 
+			// reset all the caches
+			f.clear = function() {
+				wm = new WeakMap();
+				s = Object.create(null)
+				k = [];
+				v = []; 
 			};
-			f.keys = _ => u ? null : k.slice();
-			f.values = _ => u ? null : v.slice();
-			f.keyValues = _ => u ? {primitives:Object.assign({},s),objects:wm.m} : null;
+			f.keys = function() { return u ? null : k.slice() };
+			f.values = function() { return u ? null : v.slice() };
+			f.keyValues = function() { return u ? {primitives:assign({},s),objects:wm} : null };
 			return f;
@@ -95,0 +99,0 @@ }

browser/nano-memoize.min.js

@@ -1,1 +0,1 @@
-(function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){(function(){var vrgs=f=>{var s=f+"",i=s.indexOf("...");return i>=0&&i<s.indexOf(")"||s.indexOf("arguments")>=0)},nanomemoize=(fn,{serializer:serializer,equals:equals,maxAge:maxAge,maxArgs:maxArgs,vargs:vargs=vrgs(fn)}={})=>{var s=Object.create(null),k=[],v=[],wm={m:new WeakMap},d=(key,c)=>setTimeout(()=>{c instanceof WeakMap?c.delete(key):delete c[key]},maxAge),I=Infinity,f,u;if(fn.length===1&&!equals&&!vargs){f=function(f,s,wm,c,p,a){var t=typeof a;if(!p&&(t==="object"||t==="function")){var r;return wm.m.get(a)||(!c||c(a,wm.m),wm.m.set(a,r=fn.call(this,a)),r)}var key=t==="number"||t==="boolean"||t==="undefined"?a:t==="string"?JSON.stringify(a):p(a);return s[key]||(!c||c(key,s),s[key]=fn.call(this,a))}.bind(this,fn,s,wm,maxAge>0&&maxAge<I?d:0,serializer);u=1}else{f=function(f,k,v,e,c,m,...a){var i,j,l=m||a.length;for(i=0;i<k.length&&v[i]!==undefined;i++){for(j=0;j<=l&&(k[i][j]===a[j]||e&&e(k[i][j],a[j]));j++){if(j===l)return v[i]}}!c||c(i,v);return v[i]=fn.apply(this,k[i]=a)}.bind(this,fn,k,v,equals,maxAge>0&&maxAge<I?d:0,maxArgs)}f.clear=(_=>{Object.keys(s).forEach(k=>delete s[k]);wm.m=new WeakMap;k.length=0;v.length=0});f.keys=(_=>u?null:k.slice());f.values=(_=>u?null:v.slice());f.keyValues=(_=>u?{primitives:Object.assign({},s),objects:wm.m}:null);return f};if(typeof module!=="undefined")module.exports=nanomemoize;if(typeof window!=="undefined")window.nanomemoize=nanomemoize}).call(this)},{}]},{},[1]);
+(function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){(function(){"use strict";var assign=Object.assign;if(typeof assign!=="function"){assign=function(){var a=arguments,o=arguments[0];if(o===null||o===undefined){throw new TypeError("Cannot convert undefined or null to object")}o=Object(o);for(var i=1;i<a.length;i++){if(a[i]&&typeof a[i]==="object"){Object.keys(a[i]).forEach(function(k){o[k]=a[i][k]})}}return o}}var vrgs=function f(){var s=f+"",i=s.indexOf("...");return i>=0&&i<s.indexOf(")"||s.indexOf("arguments")>=0)},nanomemoize=function(fn,o){o||(o={});var vargs=o.vargs||vrgs(fn),s=Object.create(null),k=[],v=[],wm=new WeakMap,d=function(key,c,k){return setTimeout(function(){if(k){c.splice(key,1);k.splice(key,1);return}c instanceof WeakMap?c.delete(key):delete c[key]},o.maxAge)},c=o.maxAge>0&&o.maxAge<Infinity?d:0,eq=o.equals?o.equals:function(a,b){return a===b},maxargs=o.maxArgs,srlz=o.serializer,f,u;if(fn.length===1&&!o.equals&&!vargs){f=function(a){var t=typeof a;if(!srlz&&(t==="object"||t==="function")){var r;return wm.get(a)||(!c||c(a,wm),wm.set(a,r=fn.call(this,a)),r)}var key=t==="number"||t==="boolean"||t==="undefined"?a:t==="string"?JSON.stringify(a):srlz(a);return s[key]||(!c||c(key,s),s[key]=fn.call(this,a))}.bind(this);u=1}else{f=function(){var l=maxargs||arguments.length;for(var i=k.length-1;i>=0;i--){for(var j=l-1;j>=0&&eq(k[i][j],arguments[j]);j--){if(j===0)return v[i]}}i=k.length-(i+1);return!c||c(i,v,k),v[i]=fn.apply(this,k[i]=arguments)}.bind(this)}f.clear=function(){wm=new WeakMap;s=Object.create(null);k=[];v=[]};f.keys=function(){return u?null:k.slice()};f.values=function(){return u?null:v.slice()};f.keyValues=function(){return u?{primitives:assign({},s),objects:wm}:null};return f};if(typeof module!=="undefined")module.exports=nanomemoize;if(typeof window!=="undefined")window.nanomemoize=nanomemoize}).call(this)},{}]},{},[1]);

dist/nano-memoize.js

 (function() {
-	var vrgs = f => {
+	"use strict"
+	var assign = Object.assign;
+	if(typeof(assign)!=="function") {
+		assign = function() { 
+			var a = arguments,
+				o = arguments[0];
+			if (o === null || o === undefined) {
+				throw new TypeError('Cannot convert undefined or null to object');
+		    }
+			o = Object(o);
+			for(var i=1;i<a.length;i++) {
+				if(a[i] && typeof(a[i])==="object") {
+					Object.keys(a[i]).forEach(function(k) {
+						o[k] = a[i][k];
+					})
+				}
+			}
+			return o;
+		}
+	}
+	var vrgs = function f() {
 			var s = f+"",
@@ -7,45 +27,44 @@ i = s.indexOf("...");
 		},
-		nanomemoize = (fn, {
-			serializer, // used to serialize arguments of single argument functions, multis are not serialized
-			equals, // equality tester, will force use of slower multiarg approach even for single arg functions
-			maxAge, // max cache age is ms, set > 0 && < Infinity if you want automatic clearing
-			maxArgs, // max args to use for signature
-			vargs = vrgs(fn) // set to true if function may have variable or beyond-signature arguments, default if best attempt at infering
-		}={}) => {
-			var s = Object.create(null), // single arg function key/value cache
+		nanomemoize = function(fn,o) {
+			/*o = {
+				serializer, // used to serialize arguments of single argument functions, multis are not serialized
+				equals, // equality tester, will force use of slower multiarg approach even for single arg functions
+				maxAge, // max cache age is ms, set > 0 && < Infinity if you want automatic clearing
+				maxArgs, // max args to use for signature
+				vargs = vrgs(fn) // set to true if function may have variable or beyond-signature arguments, default is best attempt at infering
+			  } = {}
+			*/
+			o || (o={});
+			var vargs = o.vargs || vrgs(fn),
+				s = Object.create(null), // single arg function key/value cache
 				k = [], // multiple arg function arg key cache
 				v = [], // multiple arg function result cache
-				wm = {m:new WeakMap()},
-				d = (key,c) => setTimeout(() => { 
+				wm = new WeakMap(),
+				d = function(key,c,k) { return setTimeout(function() {
+						if(k) { // dealing with multi-arg function, c and k are Arrays
+							c.splice(key,1);
+							k.splice(key,1);
+							return;
+						} // dealing with single arg function, c is a WekMap or Object
 						c instanceof WeakMap  ? c.delete(key) : delete c[key] 
-					},maxAge),
-				I = Infinity,
+					},o.maxAge)},
+				c = o.maxAge>0 && o.maxAge<Infinity ? d : 0, // cache change timeout,
+				eq = o.equals ? o.equals : function(a,b) { return a===b; },
+				maxargs = o.maxArgs,
+				srlz = o.serializer,
 				f, // memoized function to return
 				u; // flag indicating a unary arg function is in use for clear operation
-			if(fn.length===1 && !equals && !vargs) {
+			if(fn.length===1 && !o.equals && !vargs) {
 				// for single argument functions, just use a JS object key look-up
-				// f = original function
-				// s = result cache
-				// wm = weakmap
-				// c = cache change timeout
-				// p = arg serializer
-				// a = the arguments
-				f =  (function(f,s,wm,c,p,a) { // pre-bind core arguments, faster than using a closure or passing on stack
+				f =  (function(a) {
 						  // strings must be serialized because cache[1] should not equal or overwrite cache["1"] for value = 1 and value = "1"
 							var t = typeof a;
 							// set chng timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
-							if(!p && (t==="object"  || t==="function")) {
+							if(!srlz && (t==="object"  || t==="function")) {
 								var r;
-								return wm.m.get(a) || ((!c||c(a,wm.m)),wm.m.set(a,r = fn.call(this, a)),r);
+								return wm.get(a) || ((!c||c(a,wm)),wm.set(a,r = fn.call(this, a)),r);
 							}
-							var key = t === "number" || t === "boolean" || t==="undefined" ? a : t === "string" ? JSON.stringify(a) : p(a);
+							var key = t === "number" || t === "boolean" || t==="undefined" ? a : t === "string" ? JSON.stringify(a) : srlz(a);
 							return s[key] || ((!c||c(key,s)),s[key] = fn.call(this, a));
-						}).bind(
-							 this,
-							 fn,
-							 s,
-							 wm,
-							 maxAge>0 && maxAge<I ? d : 0,
-							 serializer
-							 );
+						}).bind(this);
 						u = 1;
@@ -55,39 +74,24 @@ } else {
 				// looking at each arg separately so a test can abort as soon as possible
-				// f = original function
-				// k = arg cache
-				// v = results cache
-				// e = equality tester
-				// c = cache change timeout
-				// m = maxArgs
-				// ...a = the arguments
-				f = (function(f,k,v,e,c,m,...a) {
-							var i,j,l = m||a.length; // use var, slightly smaller and faster for loops, and i needs more scope
-							for(i=0;i<k.length && v[i]!==undefined;i++) { // an array of arrays of args, each array represents a call signature
-								for(j=0;j<=l && (k[i][j]===a[j] || (e && e(k[i][j],a[j])));j++) {	// compare each arg									//if(p[j]!==a[j] && (!e || !e(p[j],a[j]))) break; // go to next call signature if args don't match
-									if(j===l) return v[i]; // the args matched
-								}
-							}
-							// set chng timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
-							!c||c(i,v);
-							return v[i] = fn.apply(this,k[i] = a);
-						}).bind(
-								 this,
-								 fn,
-								 k,
-								 v,
-								 equals,
-								 maxAge>0 && maxAge<I ? d : 0, 
-								 maxArgs
-								 );
+				f = (function() {
+					var l = maxargs||arguments.length;
+					for(var i=k.length-1;i>=0;i--) { // an array of arrays of args, each array represents a call signature
+						for(var j=l-1;j>=0 && eq(k[i][j],arguments[j]);j--) {	// compare each arg			
+							if(j===0) return v[i]; // the args matched
+						}
+					}
+					i = k.length - (i + 1);
+					// set change timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
+					return (!c||c(i,v,k)),v[i] = fn.apply(this,k[i] = arguments);
+				}).bind(this);
 			}
-			// reset all the caches, must change array length or delete keys on objects to retain bind integrity
-			f.clear = _ => {
-				Object.keys(s).forEach(k => delete s[k]);
-				wm.m = new WeakMap();
-				k.length = 0;
-				v.length = 0; 
+			// reset all the caches
+			f.clear = function() {
+				wm = new WeakMap();
+				s = Object.create(null)
+				k = [];
+				v = []; 
 			};
-			f.keys = _ => u ? null : k.slice();
-			f.values = _ => u ? null : v.slice();
-			f.keyValues = _ => u ? {primitives:Object.assign({},s),objects:wm.m} : null;
+			f.keys = function() { return u ? null : k.slice() };
+			f.values = function() { return u ? null : v.slice() };
+			f.keyValues = function() { return u ? {primitives:assign({},s),objects:wm} : null };
 			return f;
@@ -94,0 +98,0 @@ }

dist/nano-memoize.min.js

@@ -1,1 +0,1 @@
-(function(){var vrgs=f=>{var s=f+"",i=s.indexOf("...");return i>=0&&i<s.indexOf(")"||s.indexOf("arguments")>=0)},nanomemoize=(fn,{serializer:serializer,equals:equals,maxAge:maxAge,maxArgs:maxArgs,vargs:vargs=vrgs(fn)}={})=>{var s=Object.create(null),k=[],v=[],wm={m:new WeakMap},d=(key,c)=>setTimeout(()=>{c instanceof WeakMap?c.delete(key):delete c[key]},maxAge),I=Infinity,f,u;if(fn.length===1&&!equals&&!vargs){f=function(f,s,wm,c,p,a){var t=typeof a;if(!p&&(t==="object"||t==="function")){var r;return wm.m.get(a)||(!c||c(a,wm.m),wm.m.set(a,r=fn.call(this,a)),r)}var key=t==="number"||t==="boolean"||t==="undefined"?a:t==="string"?JSON.stringify(a):p(a);return s[key]||(!c||c(key,s),s[key]=fn.call(this,a))}.bind(this,fn,s,wm,maxAge>0&&maxAge<I?d:0,serializer);u=1}else{f=function(f,k,v,e,c,m,...a){var i,j,l=m||a.length;for(i=0;i<k.length&&v[i]!==undefined;i++){for(j=0;j<=l&&(k[i][j]===a[j]||e&&e(k[i][j],a[j]));j++){if(j===l)return v[i]}}!c||c(i,v);return v[i]=fn.apply(this,k[i]=a)}.bind(this,fn,k,v,equals,maxAge>0&&maxAge<I?d:0,maxArgs)}f.clear=(_=>{Object.keys(s).forEach(k=>delete s[k]);wm.m=new WeakMap;k.length=0;v.length=0});f.keys=(_=>u?null:k.slice());f.values=(_=>u?null:v.slice());f.keyValues=(_=>u?{primitives:Object.assign({},s),objects:wm.m}:null);return f};if(typeof module!=="undefined")module.exports=nanomemoize;if(typeof window!=="undefined")window.nanomemoize=nanomemoize}).call(this);
+(function(){"use strict";var assign=Object.assign;if(typeof assign!=="function"){assign=function(){var a=arguments,o=arguments[0];if(o===null||o===undefined){throw new TypeError("Cannot convert undefined or null to object")}o=Object(o);for(var i=1;i<a.length;i++){if(a[i]&&typeof a[i]==="object"){Object.keys(a[i]).forEach(function(k){o[k]=a[i][k]})}}return o}}var vrgs=function f(){var s=f+"",i=s.indexOf("...");return i>=0&&i<s.indexOf(")"||s.indexOf("arguments")>=0)},nanomemoize=function(fn,o){o||(o={});var vargs=o.vargs||vrgs(fn),s=Object.create(null),k=[],v=[],wm=new WeakMap,d=function(key,c,k){return setTimeout(function(){if(k){c.splice(key,1);k.splice(key,1);return}c instanceof WeakMap?c.delete(key):delete c[key]},o.maxAge)},c=o.maxAge>0&&o.maxAge<Infinity?d:0,eq=o.equals?o.equals:function(a,b){return a===b},maxargs=o.maxArgs,srlz=o.serializer,f,u;if(fn.length===1&&!o.equals&&!vargs){f=function(a){var t=typeof a;if(!srlz&&(t==="object"||t==="function")){var r;return wm.get(a)||(!c||c(a,wm),wm.set(a,r=fn.call(this,a)),r)}var key=t==="number"||t==="boolean"||t==="undefined"?a:t==="string"?JSON.stringify(a):srlz(a);return s[key]||(!c||c(key,s),s[key]=fn.call(this,a))}.bind(this);u=1}else{f=function(){var l=maxargs||arguments.length;for(var i=k.length-1;i>=0;i--){for(var j=l-1;j>=0&&eq(k[i][j],arguments[j]);j--){if(j===0)return v[i]}}i=k.length-(i+1);return!c||c(i,v,k),v[i]=fn.apply(this,k[i]=arguments)}.bind(this)}f.clear=function(){wm=new WeakMap;s=Object.create(null);k=[];v=[]};f.keys=function(){return u?null:k.slice()};f.values=function(){return u?null:v.slice()};f.keyValues=function(){return u?{primitives:assign({},s),objects:wm}:null};return f};if(typeof module!=="undefined")module.exports=nanomemoize;if(typeof window!=="undefined")window.nanomemoize=nanomemoize}).call(this);

index.js

 (function() {
-	var vrgs = f => {
+	"use strict"
+	var assign = Object.assign;
+	if(typeof(assign)!=="function") {
+		assign = function() { 
+			var a = arguments,
+				o = arguments[0];
+			if (o === null || o === undefined) {
+				throw new TypeError('Cannot convert undefined or null to object');
+		    }
+			o = Object(o);
+			for(var i=1;i<a.length;i++) {
+				if(a[i] && typeof(a[i])==="object") {
+					Object.keys(a[i]).forEach(function(k) {
+						o[k] = a[i][k];
+					})
+				}
+			}
+			return o;
+		}
+	}
+	var vrgs = function f() {
 			var s = f+"",
@@ -7,45 +27,44 @@ i = s.indexOf("...");
 		},
-		nanomemoize = (fn, {
-			serializer, // used to serialize arguments of single argument functions, multis are not serialized
-			equals, // equality tester, will force use of slower multiarg approach even for single arg functions
-			maxAge, // max cache age is ms, set > 0 && < Infinity if you want automatic clearing
-			maxArgs, // max args to use for signature
-			vargs = vrgs(fn) // set to true if function may have variable or beyond-signature arguments, default if best attempt at infering
-		}={}) => {
-			var s = Object.create(null), // single arg function key/value cache
+		nanomemoize = function(fn,o) {
+			/*o = {
+				serializer, // used to serialize arguments of single argument functions, multis are not serialized
+				equals, // equality tester, will force use of slower multiarg approach even for single arg functions
+				maxAge, // max cache age is ms, set > 0 && < Infinity if you want automatic clearing
+				maxArgs, // max args to use for signature
+				vargs = vrgs(fn) // set to true if function may have variable or beyond-signature arguments, default is best attempt at infering
+			  } = {}
+			*/
+			o || (o={});
+			var vargs = o.vargs || vrgs(fn),
+				s = Object.create(null), // single arg function key/value cache
 				k = [], // multiple arg function arg key cache
 				v = [], // multiple arg function result cache
-				wm = {m:new WeakMap()},
-				d = (key,c) => setTimeout(() => { 
+				wm = new WeakMap(),
+				d = function(key,c,k) { return setTimeout(function() {
+						if(k) { // dealing with multi-arg function, c and k are Arrays
+							c.splice(key,1);
+							k.splice(key,1);
+							return;
+						} // dealing with single arg function, c is a WekMap or Object
 						c instanceof WeakMap  ? c.delete(key) : delete c[key] 
-					},maxAge),
-				I = Infinity,
+					},o.maxAge)},
+				c = o.maxAge>0 && o.maxAge<Infinity ? d : 0, // cache change timeout,
+				eq = o.equals ? o.equals : function(a,b) { return a===b; },
+				maxargs = o.maxArgs,
+				srlz = o.serializer,
 				f, // memoized function to return
 				u; // flag indicating a unary arg function is in use for clear operation
-			if(fn.length===1 && !equals && !vargs) {
+			if(fn.length===1 && !o.equals && !vargs) {
 				// for single argument functions, just use a JS object key look-up
-				// f = original function
-				// s = result cache
-				// wm = weakmap
-				// c = cache change timeout
-				// p = arg serializer
-				// a = the arguments
-				f =  (function(f,s,wm,c,p,a) { // pre-bind core arguments, faster than using a closure or passing on stack
+				f =  (function(a) {
 						  // strings must be serialized because cache[1] should not equal or overwrite cache["1"] for value = 1 and value = "1"
 							var t = typeof a;
 							// set chng timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
-							if(!p && (t==="object"  || t==="function")) {
+							if(!srlz && (t==="object"  || t==="function")) {
 								var r;
-								return wm.m.get(a) || ((!c||c(a,wm.m)),wm.m.set(a,r = fn.call(this, a)),r);
+								return wm.get(a) || ((!c||c(a,wm)),wm.set(a,r = fn.call(this, a)),r);
 							}
-							var key = t === "number" || t === "boolean" || t==="undefined" ? a : t === "string" ? JSON.stringify(a) : p(a);
+							var key = t === "number" || t === "boolean" || t==="undefined" ? a : t === "string" ? JSON.stringify(a) : srlz(a);
 							return s[key] || ((!c||c(key,s)),s[key] = fn.call(this, a));
-						}).bind(
-							 this,
-							 fn,
-							 s,
-							 wm,
-							 maxAge>0 && maxAge<I ? d : 0,
-							 serializer
-							 );
+						}).bind(this);
 						u = 1;
@@ -55,39 +74,24 @@ } else {
 				// looking at each arg separately so a test can abort as soon as possible
-				// f = original function
-				// k = arg cache
-				// v = results cache
-				// e = equality tester
-				// c = cache change timeout
-				// m = maxArgs
-				// ...a = the arguments
-				f = (function(f,k,v,e,c,m,...a) {
-							var i,j,l = m||a.length; // use var, slightly smaller and faster for loops, and i needs more scope
-							for(i=0;i<k.length && v[i]!==undefined;i++) { // an array of arrays of args, each array represents a call signature
-								for(j=0;j<=l && (k[i][j]===a[j] || (e && e(k[i][j],a[j])));j++) {	// compare each arg									//if(p[j]!==a[j] && (!e || !e(p[j],a[j]))) break; // go to next call signature if args don't match
-									if(j===l) return v[i]; // the args matched
-								}
-							}
-							// set chng timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
-							!c||c(i,v);
-							return v[i] = fn.apply(this,k[i] = a);
-						}).bind(
-								 this,
-								 fn,
-								 k,
-								 v,
-								 equals,
-								 maxAge>0 && maxAge<I ? d : 0, 
-								 maxArgs
-								 );
+				f = (function() {
+					var l = maxargs||arguments.length;
+					for(var i=k.length-1;i>=0;i--) { // an array of arrays of args, each array represents a call signature
+						for(var j=l-1;j>=0 && eq(k[i][j],arguments[j]);j--) {	// compare each arg			
+							if(j===0) return v[i]; // the args matched
+						}
+					}
+					i = k.length - (i + 1);
+					// set change timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
+					return (!c||c(i,v,k)),v[i] = fn.apply(this,k[i] = arguments);
+				}).bind(this);
 			}
-			// reset all the caches, must change array length or delete keys on objects to retain bind integrity
-			f.clear = _ => {
-				Object.keys(s).forEach(k => delete s[k]);
-				wm.m = new WeakMap();
-				k.length = 0;
-				v.length = 0; 
+			// reset all the caches
+			f.clear = function() {
+				wm = new WeakMap();
+				s = Object.create(null)
+				k = [];
+				v = []; 
 			};
-			f.keys = _ => u ? null : k.slice();
-			f.values = _ => u ? null : v.slice();
-			f.keyValues = _ => u ? {primitives:Object.assign({},s),objects:wm.m} : null;
+			f.keys = function() { return u ? null : k.slice() };
+			f.values = function() { return u ? null : v.slice() };
+			f.keyValues = function() { return u ? {primitives:assign({},s),objects:wm} : null };
 			return f;
@@ -94,0 +98,0 @@ }

package.json

 {
   "name": "nano-memoize",
-  "version": "v1.1.6",
+  "version": "v1.1.7",
   "description": "Faster than fast, smaller than micro ... a nano speed and nano size memoizer.",
@@ -21,3 +21,3 @@ "engines": {},
     "micro-memoize",
-    "oddy-osmani"
+    "addy-osmani"
   ],
@@ -24,0 +24,0 @@ "author": "Simon Y. Blackwell <[e-mail]> (http://www.github.com/anywhichway)",

README.md

@@ -6,23 +6,36 @@ [![Codacy Badge](https://api.codacy.com/project/badge/Grade/30ce201484754fa5b0a6c6046abb842d)](https://www.codacy.com/app/syblackwell/nano-memoize?utm_source=github.com&utm_medium=referral&utm_content=anywhichway/nano-memoize&utm_campaign=Badge_Grade)
 
-The devs [caiogondim](https://github.com/caiogondim) and [planttheidea](https://github.com/planttheidea) have produced great memoizers. We analyzed their code to see if we could build something faster than [fast-memoize](https://github.com/caiogondim/fastmemoize.js) and smaller than [micro-memoize](https://github.com/planttheidea/micromemoize) while adding back some of the functionality of [moize](https://github.com/planttheidea/moize) removed in micro-memoize. We think we have done it ... but credit to them ... we just merged the best ideas in both and eliminated excess code.
+The devs [caiogondim](https://github.com/caiogondim) and [planttheidea](https://github.com/planttheidea) have produced great memoizers. 
+We analyzed their code to see if we could build something faster than [fast-memoize](https://github.com/caiogondim/fastmemoize.js) and 
+smaller than [micro-memoize](https://github.com/planttheidea/micromemoize) while adding back some of the functionality of 
+[moize](https://github.com/planttheidea/moize) removed in micro-memoize. We think we have done it ... but credit to them ... we just 
+merged the best ideas in both and eliminated excess code.
 
-During development we also discovered that despite its popularity and goal to be the fastest possible memoizer, `fast-memoize` is actually one of the slowest out-of-the-box when it comes to multiple argument functions because it uses `JSON.stringify` to generate a single key generator for all arguments. It also only memoizes out to 3 arguments, which may cause issues. This is not to say it should not be used, it also seems to have the cleanest software architecture and it may be theoretically possible to write a high-speed multi-argument plugin. And, MANY people are very happy with it.
+During development we also discovered that despite its popularity and goal to be the fastest possible memoizer, `fast-memoize` is 
+actually one of the slowest out-of-the-box when it comes to multiple argument functions because it uses `JSON.stringify` to generate 
+a single key generator for all arguments. It also only memoizes out to 3 arguments, which may cause issues. This is not to say it 
+should not be used, it also seems to have the cleanest software architecture and it may be theoretically possible to write a high-speed 
+multi-argument plugin. And, MANY people are very happy with it.
 
-Special appreciation to @titoBouzout and @popbee who spent a good bit of time reviewing code for optimization and making recommendations. See [Issue 4](https://github.com/anywhichway/nano-memoize/issues/4) for the conversation.
+Special appreciation to @titoBouzout and @popbee who spent a good bit of time reviewing code for optimization and making recommendations. 
+See [Issue 4](https://github.com/anywhichway/nano-memoize/issues/4) for the conversation.
 
-The minified/brotli size is 660 bytes for `nano-memoize` v1.1.5 vs 1,356 bytes for `micro-memoize` v4.08. And, `nano-memoize` has slightly more functionality.
+The minified/brotli size is 780 bytes for `nano-memoize` v1.1.5 vs 1,356 bytes for `micro-memoize` v4.08. And, `nano-memoize` has 
+slightly more functionality.
 
-The speed tests are below. At the time of testing the most recent version of `fast-memoize` 2.5.1 was a year old. The most recent version of `micro-memoize` 4.0.8 was 14 days old.
+The speed tests are below. At the time of testing the most recent version of `fast-memoize` 2.5.1 was a year old. The most recent 
+version of `micro-memoize` 4.0.8 was 3 months old.
  
- * For single primitive argument functions `nano-memoize` runs neck-and-neck with `fast-memoize` and 3-4x faster than `micro-memoize`.
+ * For single primitive argument functions `nano-memoize` is typically 20% faster than `fast-memoize` and is almost 2x faster than `micro-memoize`.
  
- * For single object argument functions `nano-memoize` is typically 10% faster than `fast-memoize` and 1.75x faster than `micro-memoize`.
+ * For single object argument functions `nano-memoize` is typically 30% faster than `fast-memoize` and 2x faster than `micro-memoize`.
  
- * For multiple primitive argument functions `nano-memoize` is about 20% faster than `micro-memoize`. They are 60x faster than `fast-memoize`.
+ * For multiple primitive argument functions `nano-memoize` is typically 10% faster than `micro-memoize`. They are 40x faster than `fast-memoize`.
 
- * For multiple object argument functions `nano-memoize` is typically 20% faster than `micro-memoize` and 60x faster than `fast-memoize`.
+ * For multiple object argument functions `nano-memoize` is typically 10% faster than  `micro-memoize`. They are 40x faster than `fast-memoize`.
  
- * When `deepEquals` tests are used, `nano-memoize` is 33% faster than micro-memoize. `fast-memoize` is by default deep equals and `nano-memoize` is 60x faster.
+ * When `deepEquals` tests are used, `nano-memoize` is typically 5-10% faster than micro-memoize.
 
-We have found that benchmarks can vary dramatically from O/S to O/S or Node version to Node version. These tests were run on a Windows 10 Pro 64bit 1.8ghz i7 machine with 16GB RAM and Node v11.6.0. Also, even with multiple samplings, garbage collection can have a substative impact and multiple runs in different orders are really required for apples-to-apples comparisons.
+We have found that benchmarks can vary dramatically from O/S to O/S or Node version to Node version. These tests were run on a Windows 10 
+Pro 64bit 1.8ghz i7 machine with 16GB RAM and Node v12.7.0. Also, even with multiple samplings, garbage collection can have a substative 
+impact and multiple runs in different orders are really required for apples-to-apples comparisons.
 
@@ -35,23 +48,23 @@ Functions with a single primitive parameter...
 +----------------------------------------------------------------------+
-� nano-memoize  � 429,266,986 �   0.53%                  � 95          �
+� nano-memoize  � 111,079,216 � � 2.37%                  � 78          �
 +----------------------------------------------------------------------+
-� fast-memoize  � 423,833,441 �   0.62%                  � 94          �
+� fast-memoize  � 65,479,705  � � 3.34%                  � 75          �
 +----------------------------------------------------------------------+
-� moize         � 95,351,935  �   1.54%                  � 93          �
+� iMemoized     � 62,291,787  � � 2.52%                  � 77          �
 +----------------------------------------------------------------------+
-� iMemoized     � 82,908,646  �   0.76%                  � 89          �
+� lru-memoize   � 60,937,690  � � 2.60%                  � 82          �
 +----------------------------------------------------------------------+
-� micro-memoize � 74,658,533  �   2.16%                  � 86          �
+� micro-memoize � 55,728,952  � � 2.81%                  � 77          �
 +----------------------------------------------------------------------+
-� lru-memoize   � 73,747,331  �   0.59%                  � 89          �
+� moize         � 53,819,146  � � 2.37%                  � 78          �
 +----------------------------------------------------------------------+
-� lodash        � 48,098,010  �   1.79%                  � 93          �
+� lodash        � 33,465,668  � � 1.62%                  � 83          �
 +----------------------------------------------------------------------+
-� memoizee      � 39,111,373  �   0.53%                  � 95          �
+� underscore    � 29,056,353  � � 1.88%                  � 79          �
 +----------------------------------------------------------------------+
-� underscore    � 34,623,228  �   1.22%                  � 95          �
+� memoizee      � 26,065,006  � � 1.84%                  � 82          �
 +----------------------------------------------------------------------+
-� memoizerific  � 6,905,607   �   2.16%                  � 91          �
+� addy-osmani   � 13,832,042  � � 1.60%                  � 85          �
 +----------------------------------------------------------------------+
-� addy-osmani   � 6,319,914   �   0.94%                  � 91          �
+� memoizerific  � 8,427,361   � � 1.91%                  � 82          �
 +----------------------------------------------------------------------+
@@ -63,27 +76,23 @@ ```
 ```
++---------------------------------------------------------------------+
+� Name          � Ops / sec  � Relative margin of error � Sample size �
++---------------------------------------------------------------------+
+� nano-memoize  � 46,495,146 � � 1.97%                  � 80          �
++---------------------------------------------------------------------+
+� micro-memoize � 43,077,944 � � 2.09%                  � 81          �
++---------------------------------------------------------------------+
+� moize         � 42,777,883 � � 2.78%                  � 77          �
++---------------------------------------------------------------------+
+� lru-memoize   � 37,611,410 � � 1.79%                  � 82          �
++---------------------------------------------------------------------+
+� memoizee      � 17,154,216 � � 2.01%                  � 79          �
++---------------------------------------------------------------------+
+� iMemoized     � 10,634,931 � � 1.49%                  � 87          �
++---------------------------------------------------------------------+
+� memoizerific  � 6,097,165  � � 1.87%                  � 79          �
++---------------------------------------------------------------------+
+� addy-osmani   � 5,582,986  � � 2.31%                  � 79          �
++---------------------------------------------------------------------+
+� fast-memoize  � 1,218,211  � � 1.75%                  � 84          �
 +----------------------------------------------------------------------+
-� Name          � Ops / sec   � Relative margin of error � Sample size �
-+----------------------------------------------------------------------+
-� nano-memoize  � 124,264,741 �   0.61%                  � 93          �
-+----------------------------------------------------------------------+
-� fast-memoize  � 111,267,506 �   0.74%                  � 93          �
-+----------------------------------------------------------------------+
-� moize         � 95,260,557  �   0.88%                  � 93          �
-+----------------------------------------------------------------------+
-� iMemoized     � 73,937,479  �   0.67%                  � 93          �
-+----------------------------------------------------------------------+
-� micro-memoize � 66,863,547  �   4.08%                  � 80          �
-+----------------------------------------------------------------------+
-� lodash        � 47,881,566  �   1.41%                  � 90          �
-+----------------------------------------------------------------------+
-� underscore    � 34,777,812  �   0.79%                  � 92          �
-+----------------------------------------------------------------------+
-� lru-memoize   � 31,919,125  �   0.33%                  � 98          �
-+----------------------------------------------------------------------+
-� memoizee      � 18,033,950  �   0.55%                  � 89          �
-+----------------------------------------------------------------------+
-� memoizerific  � 6,600,328   �   1.28%                  � 95          �
-+----------------------------------------------------------------------+
-� addy-osmani   � 6,346,356   �   1.02%                  � 93          �
-+----------------------------------------------------------------------+
 ```
@@ -97,19 +106,19 @@
 +---------------------------------------------------------------------+
-� nano-memoize  � 64,862,221 �   0.98%                  � 91          �
+� nano-memoize  � 46,495,146 � � 1.97%                  � 80          �
 +---------------------------------------------------------------------+
-� moize         � 62,050,114 �   0.46%                  � 95          �
+� micro-memoize � 43,077,944 � � 2.09%                  � 81          �
 +---------------------------------------------------------------------+
-� micro-memoize � 53,790,249 �   0.42%                  � 93          �
+� moize         � 42,777,883 � � 2.78%                  � 77          �
 +---------------------------------------------------------------------+
-� lru-memoize   � 25,083,521 �   0.43%                  � 97          �
+� lru-memoize   � 37,611,410 � � 1.79%                  � 82          �
 +---------------------------------------------------------------------+
-� memoizee      � 16,817,318 �   1.67%                  � 94          �
+� memoizee      � 17,154,216 � � 2.01%                  � 79          �
 +---------------------------------------------------------------------+
-� iMemoized     � 9,893,933  �   0.53%                  � 93          �
+� iMemoized     � 10,634,931 � � 1.49%                  � 87          �
 +---------------------------------------------------------------------+
-� memoizerific  � 5,214,455  �   1.49%                  � 89          �
+� memoizerific  � 6,097,165  � � 1.87%                  � 79          �
 +---------------------------------------------------------------------+
-� addy-osmani   � 3,331,201  �   0.81%                  � 94          �
+� addy-osmani   � 5,582,986  � � 2.31%                  � 79          �
 +---------------------------------------------------------------------+
-� fast-memoize  � 1,370,977  �   1.01%                  � 90          �
+� fast-memoize  � 1,218,211  � � 1.75%                  � 84          �
 +---------------------------------------------------------------------+
@@ -124,17 +133,17 @@ ```
 +---------------------------------------------------------------------+
-� nano-memoize  � 63,382,702 �   1.88%                  � 83          �
+� nano-memoize  � 48,155,435 � � 2.54%                  � 78          �
 +---------------------------------------------------------------------+
-� moize         � 61,349,765 �   1.78%                  � 82          �
+� moize         � 40,315,112 � � 2.07%                  � 78          �
 +---------------------------------------------------------------------+
-� micro-memoize � 54,322,737 �   4.53%                  � 72          �
+� micro-memoize � 39,886,911 � � 2.40%                  � 80          �
 +---------------------------------------------------------------------+
-� lru-memoize   � 23,824,559 �   2.34%                  � 81          �
+� lru-memoize   � 36,058,456 � � 2.57%                  � 79          �
 +---------------------------------------------------------------------+
-� memoizee      � 11,161,431 �   1.97%                  � 84          �
+� memoizee      � 15,785,666 � � 3.43%                  � 81          �
 +---------------------------------------------------------------------+
-� memoizerific  � 5,416,184  �   3.89%                  � 79          �
+� memoizerific  � 6,107,157  � � 2.99%                  � 81          �
 +---------------------------------------------------------------------+
-� addy-osmani   � 1,199,529  �   2.78%                  � 84          �
+� addy-osmani   � 1,712,749  � � 3.02%                  � 83          �
 +---------------------------------------------------------------------+
-� fast-memoize  � 1,057,876  �   1.75%                  � 83          �
+� fast-memoize  � 775,548    � � 3.24%                  � 80          �
 +---------------------------------------------------------------------+
@@ -149,12 +158,14 @@ ```
 +---------------------------------------------------------------------------------------------------------+
-� nanomemoize deep equals (lodash isEqual)          � 66,440,153 �   2.02%                  � 92          �
+� nanomemoize deep equals (lodash isEqual)          � 61,286,418 � � 2.01%                  � 80          �
 +---------------------------------------------------------------------------------------------------------+
-� nanomemoize deep equals (fast-equals deepEqual)   � 53,056,118 �   2.48%                  � 74          �
+� nanomemoize deep equals (hash-it isEqual)         � 61,085,147 � � 4.10%                  � 77          �
 +---------------------------------------------------------------------------------------------------------+
-� micro-memoize deep equals (hash-it isEqual)       � 47,502,261 �   1.73%                  � 85          �
+� micro-memoize deep equals (lodash isEqual)        � 57,944,413 � � 3.21%                  � 79          �
 +---------------------------------------------------------------------------------------------------------+
-� micro-memoize deep equals (lodash isEqual)        � 41,636,743 �   2.88%                  � 84          �
+� micro-memoize deep equals (hash-it isEqual)       � 54,368,987 � � 2.66%                  � 81          �
 +---------------------------------------------------------------------------------------------------------+
-� micro-memoize deep equals (fast-equals deepEqual) � 39,346,248 �   2.18%                  � 85          �
+� nanomemoize deep equals (fast-equals deepEqual)   � 50,030,425 � � 3.39%                  � 76          �
 +---------------------------------------------------------------------------------------------------------+
+� micro-memoize deep equals (fast-equals deepEqual) � 41,445,170 � � 2.84%                  � 76          �
++---------------------------------------------------------------------------------------------------------+
 ```
@@ -169,3 +180,3 @@
 
-Since most devs are running a build pipeline, the code is not transpiled, although it is browserified
+The code is hand-crafted to run across all browsers all the way back to IE 11. No transpiling is necessary.
 
@@ -191,3 +202,3 @@
   maxArgs: number, 
-  // number of milliseconds to cache a result, set to `Infinity` to never create timers or expire
+  // number of milliseconds to cache a result, set to `Infinity` or `-1` to never create timers or expire
   maxAge: number, 
@@ -208,4 +219,10 @@ // the serializer/key generator to use for single argument functions (optional, not recommended)
 
[phone] v1.1.7 Manually created an IE 11 compatible version by removing arrow functions and replacing Object.assign
+with a custom function. Minor size increase from 660 to 780 Brotli bytes. Also eliminated complex `bind` approach in
+favor of closures. The latest v8 engine handles closures as fast as bound arguments for our case and we are not as
+concerned with older browser performace (particularly given how fast the code is anyway). Converted for loops to run in
+reverse, which for our case is faster (but is not always guranteed to be faster).
+
 2019-09-17 v1.1.6 Added a manually transpiled es5_ie11.html file with an Object.assign polyfill to the test directory to verify
-compatibility with IE11. Modified unit tests so they are ES5 compatible. All tests pass. Addes `sideEffects=false` to package.json.
+compatibility with IE11. Modified unit tests so they are ES5 compatible. All tests pass. Added `sideEffects=false` to package.json.
 
@@ -212,0 +229,0 @@ 2019-06-28 v1.1.5 Improved documentation. Updated version of `micro-memoize` used for benchmark testing. No code changes.

src/nano-memoize.js

 (function() {
-	var vrgs = f => {
+	"use strict"
+	var assign = Object.assign;
+	if(typeof(assign)!=="function") {
+		assign = function() { 
+			var a = arguments,
+				o = arguments[0];
+			if (o === null || o === undefined) {
+				throw new TypeError('Cannot convert undefined or null to object');
+		    }
+			o = Object(o);
+			for(var i=1;i<a.length;i++) {
+				if(a[i] && typeof(a[i])==="object") {
+					Object.keys(a[i]).forEach(function(k) {
+						o[k] = a[i][k];
+					})
+				}
+			}
+			return o;
+		}
+	}
+	var vrgs = function f() {
 			var s = f+"",
@@ -7,45 +27,44 @@ i = s.indexOf("...");
 		},
-		nanomemoize = (fn, {
-			serializer, // used to serialize arguments of single argument functions, multis are not serialized
-			equals, // equality tester, will force use of slower multiarg approach even for single arg functions
-			maxAge, // max cache age is ms, set > 0 && < Infinity if you want automatic clearing
-			maxArgs, // max args to use for signature
-			vargs = vrgs(fn) // set to true if function may have variable or beyond-signature arguments, default if best attempt at infering
-		}={}) => {
-			var s = Object.create(null), // single arg function key/value cache
+		nanomemoize = function(fn,o) {
+			/*o = {
+				serializer, // used to serialize arguments of single argument functions, multis are not serialized
+				equals, // equality tester, will force use of slower multiarg approach even for single arg functions
+				maxAge, // max cache age is ms, set > 0 && < Infinity if you want automatic clearing
+				maxArgs, // max args to use for signature
+				vargs = vrgs(fn) // set to true if function may have variable or beyond-signature arguments, default is best attempt at infering
+			  } = {}
+			*/
+			o || (o={});
+			var vargs = o.vargs || vrgs(fn),
+				s = Object.create(null), // single arg function key/value cache
 				k = [], // multiple arg function arg key cache
 				v = [], // multiple arg function result cache
-				wm = {m:new WeakMap()},
-				d = (key,c) => setTimeout(() => { 
+				wm = new WeakMap(),
+				d = function(key,c,k) { return setTimeout(function() {
+						if(k) { // dealing with multi-arg function, c and k are Arrays
+							c.splice(key,1);
+							k.splice(key,1);
+							return;
+						} // dealing with single arg function, c is a WekMap or Object
 						c instanceof WeakMap  ? c.delete(key) : delete c[key] 
-					},maxAge),
-				I = Infinity,
+					},o.maxAge)},
+				c = o.maxAge>0 && o.maxAge<Infinity ? d : 0, // cache change timeout,
+				eq = o.equals ? o.equals : function(a,b) { return a===b; },
+				maxargs = o.maxArgs,
+				srlz = o.serializer,
 				f, // memoized function to return
 				u; // flag indicating a unary arg function is in use for clear operation
-			if(fn.length===1 && !equals && !vargs) {
+			if(fn.length===1 && !o.equals && !vargs) {
 				// for single argument functions, just use a JS object key look-up
-				// f = original function
-				// s = result cache
-				// wm = weakmap
-				// c = cache change timeout
-				// p = arg serializer
-				// a = the arguments
-				f =  (function(f,s,wm,c,p,a) { // pre-bind core arguments, faster than using a closure or passing on stack
+				f =  (function(a) {
 						  // strings must be serialized because cache[1] should not equal or overwrite cache["1"] for value = 1 and value = "1"
 							var t = typeof a;
 							// set chng timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
-							if(!p && (t==="object"  || t==="function")) {
+							if(!srlz && (t==="object"  || t==="function")) {
 								var r;
-								return wm.m.get(a) || ((!c||c(a,wm.m)),wm.m.set(a,r = fn.call(this, a)),r);
+								return wm.get(a) || ((!c||c(a,wm)),wm.set(a,r = fn.call(this, a)),r);
 							}
-							var key = t === "number" || t === "boolean" || t==="undefined" ? a : t === "string" ? JSON.stringify(a) : p(a);
+							var key = t === "number" || t === "boolean" || t==="undefined" ? a : t === "string" ? JSON.stringify(a) : srlz(a);
 							return s[key] || ((!c||c(key,s)),s[key] = fn.call(this, a));
-						}).bind(
-							 this,
-							 fn,
-							 s,
-							 wm,
-							 maxAge>0 && maxAge<I ? d : 0,
-							 serializer
-							 );
+						}).bind(this);
 						u = 1;
@@ -55,39 +74,24 @@ } else {
 				// looking at each arg separately so a test can abort as soon as possible
-				// f = original function
-				// k = arg cache
-				// v = results cache
-				// e = equality tester
-				// c = cache change timeout
-				// m = maxArgs
-				// ...a = the arguments
-				f = (function(f,k,v,e,c,m,...a) {
-							var i,j,l = m||a.length; // use var, slightly smaller and faster for loops, and i needs more scope
-							for(i=0;i<k.length && v[i]!==undefined;i++) { // an array of arrays of args, each array represents a call signature
-								for(j=0;j<=l && (k[i][j]===a[j] || (e && e(k[i][j],a[j])));j++) {	// compare each arg									//if(p[j]!==a[j] && (!e || !e(p[j],a[j]))) break; // go to next call signature if args don't match
-									if(j===l) return v[i]; // the args matched
-								}
-							}
-							// set chng timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
-							!c||c(i,v);
-							return v[i] = fn.apply(this,k[i] = a);
-						}).bind(
-								 this,
-								 fn,
-								 k,
-								 v,
-								 equals,
-								 maxAge>0 && maxAge<I ? d : 0, 
-								 maxArgs
-								 );
+				f = (function() {
+					var l = maxargs||arguments.length;
+					for(var i=k.length-1;i>=0;i--) { // an array of arrays of args, each array represents a call signature
+						for(var j=l-1;j>=0 && eq(k[i][j],arguments[j]);j--) {	// compare each arg			
+							if(j===0) return v[i]; // the args matched
+						}
+					}
+					i = k.length - (i + 1);
+					// set change timeout only when new value computed, hits will not push out the tte, but it is arguable they should not
+					return (!c||c(i,v,k)),v[i] = fn.apply(this,k[i] = arguments);
+				}).bind(this);
 			}
-			// reset all the caches, must change array length or delete keys on objects to retain bind integrity
-			f.clear = _ => {
-				Object.keys(s).forEach(k => delete s[k]);
-				wm.m = new WeakMap();
-				k.length = 0;
-				v.length = 0; 
+			// reset all the caches
+			f.clear = function() {
+				wm = new WeakMap();
+				s = Object.create(null)
+				k = [];
+				v = []; 
 			};
-			f.keys = _ => u ? null : k.slice();
-			f.values = _ => u ? null : v.slice();
-			f.keyValues = _ => u ? {primitives:Object.assign({},s),objects:wm.m} : null;
+			f.keys = function() { return u ? null : k.slice() };
+			f.values = function() { return u ? null : v.slice() };
+			f.keyValues = function() { return u ? {primitives:assign({},s),objects:wm} : null };
 			return f;
@@ -94,0 +98,0 @@ }

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Manifest confusion

Supply chain risk

This package has inconsistent metadata. This could be malicious or caused by an error when publishing the package.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Manifest confusion

Supply chain risk

This package has inconsistent metadata. This could be malicious or caused by an error when publishing the package.

Found 1 instance in 1 package

Improved metrics

Lines of code

954

increased by2.36%

Number of lines in readme file

269

increased by6.75%

Worsened metrics

Total package byte prevSize

73623

decreased by-5.51%

Number of package files

21

decreased by-4.55%

No dependency changes