Commitd246958

authored

merge: Added explicit cache feature & optional parameter (TheAlgorithms#941)

1 parentad68c63 commitd246958Copy full SHA for d246958

File tree

+16

-4

lines changed

+16

-4

lines changed

Lines changed: 2 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,12 +10,10 @@`
`10`	`10`	`* which lets us use it as [Higher-Order Function](https://eloquentjavascript.net/05_higher_order.html)`
`11`	`11`	`* and return another function`
`12`	`12`	`*@param {Function} func Original function`
	`13`	`+ *@param {Map} cache - it's receive any cache DS which have get, set & has method`
`13`	`14`	`*@returns {Function} Memoized function`
`14`	`15`	`*/`
`15`		`-constmemoize=(func)=>{`
`16`		`-// Initialization of a slot to store the function result by arguments as a key in Hash Map`
`17`		`-constcache=newMap()`
`18`		`-`
	`16`	`+constmemoize=(func,cache=newMap())=>{`
`19`	`17`	`constjsonReplacer=(_,value)=>{`
`20`	`18`	`if(valueinstanceofSet){// if the value is Set it's converted to Array cause JSON.stringify can't convert Set`
`21`	`19`	`return[...value]`

Lines changed: 14 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,7 @@ import { memoize } from '../Memoize'`
`2`	`2`	`import{union}from'./cacheTest'`
`3`	`3`	`import{fibonacci}from'../../Dynamic-Programming/FibonacciNumber'`
`4`	`4`	`import{factorial}from'../../Recursive/Factorial'`
	`5`	`+importLFUCachefrom'../LFUCache'`
`5`	`6`
`6`	`7`	`constmultipleFactorials=(arr)=>arr.map(factorial)`
`7`	`8`
`@@ -51,4 +52,17 @@ describe('Testing Memoize', () => {`
`51`	`52`	`expect(memoUnion(...inputs)).toEqual(newSet([1,2,3,4,5,6]))`
`52`	`53`	`expect(memoUnion(...inputs)).toEqual(union(...inputs))`
`53`	`54`	`})`
	`55`	`+`
	`56`	`+it('Testing with explicit cache -> LFUCache',()=>{`
	`57`	`+constLFU=newLFUCache(2)`
	`58`	`+`
	`59`	`+constmemoizeFibonacci=memoize(fibonacci,LFU)// added LFU cache explicitly`
	`60`	`+constfibOfFiveHundred=memoizeFibonacci(500)`
	`61`	`+constfibOfOneHundred=memoizeFibonacci(100)`
	`62`	`+`
	`63`	`+expect(memoizeFibonacci(500)).toBe(fibOfFiveHundred)`
	`64`	`+expect(memoizeFibonacci(100)).toBe(fibOfOneHundred)`
	`65`	`+`
	`66`	`+expect(LFU.leastFrequency).toBe(2)`
	`67`	`+})`
`54`	`68`	`})`

Comments

(0)