mirror of
https://github.com/swc-project/swc.git
synced 2024-12-22 05:01:42 +03:00
50 lines
1.5 KiB
TypeScript
50 lines
1.5 KiB
TypeScript
// Loaded from https://deno.land/x/ramda@v0.27.2/source/memoizeWith.js
|
|
|
|
|
|
import _arity from './internal/_arity.js';
|
|
import _curry2 from './internal/_curry2.js';
|
|
import _has from './internal/_has.js';
|
|
|
|
|
|
/**
|
|
* Creates a new function that, when invoked, caches the result of calling `fn`
|
|
* for a given argument set and returns the result. Subsequent calls to the
|
|
* memoized `fn` with the same argument set will not result in an additional
|
|
* call to `fn`; instead, the cached result for that set of arguments will be
|
|
* returned.
|
|
*
|
|
* Care must be taken when implementing key generation to avoid key collision,
|
|
* or if tracking references, memory leaks and mutating arguments.
|
|
*
|
|
* @func
|
|
* @memberOf R
|
|
* @since v0.24.0
|
|
* @category Function
|
|
* @sig (*... -> String) -> (*... -> a) -> (*... -> a)
|
|
* @param {Function} fn The function to generate the cache key.
|
|
* @param {Function} fn The function to memoize.
|
|
* @return {Function} Memoized version of `fn`.
|
|
* @example
|
|
*
|
|
* let count = 0;
|
|
* const factorial = R.memoizeWith(Number, n => {
|
|
* count += 1;
|
|
* return R.product(R.range(1, n + 1));
|
|
* });
|
|
* factorial(5); //=> 120
|
|
* factorial(5); //=> 120
|
|
* factorial(5); //=> 120
|
|
* count; //=> 1
|
|
*/
|
|
var memoizeWith = _curry2(function memoizeWith(mFn, fn) {
|
|
var cache = {};
|
|
return _arity(fn.length, function() {
|
|
var key = mFn.apply(this, arguments);
|
|
if (!_has(key, cache)) {
|
|
cache[key] = fn.apply(this, arguments);
|
|
}
|
|
return cache[key];
|
|
});
|
|
});
|
|
export default memoizeWith;
|