mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
65 lines
2.4 KiB
JavaScript
65 lines
2.4 KiB
JavaScript
import { memoize } from '../Memoize'
|
|
import { union } from './cacheTest'
|
|
import { fibonacci } from '../../Dynamic-Programming/FibonacciNumber'
|
|
import { factorial } from '../../Recursive/Factorial'
|
|
import LFUCache from '../LFUCache'
|
|
|
|
const multipleFactorials = (arr) => arr.map(factorial)
|
|
|
|
describe('Testing Memoize', () => {
|
|
it('expects the fibonacci function to use the cache on the second call', () => {
|
|
const memoFibonacci = memoize(fibonacci)
|
|
|
|
expect(memoFibonacci(5)).toEqual(fibonacci(5))
|
|
expect(memoFibonacci(5)).toEqual(5)
|
|
expect(memoFibonacci(10)).toEqual(fibonacci(10))
|
|
expect(memoFibonacci(10)).toEqual(55)
|
|
})
|
|
|
|
it('expects the factorial function to use the cache on the second call', () => {
|
|
const memoFactorial = memoize(factorial)
|
|
|
|
expect(memoFactorial(5)).toEqual(factorial(5))
|
|
expect(memoFactorial(5)).toEqual(120)
|
|
expect(memoFactorial(10)).toEqual(factorial(10))
|
|
expect(memoFactorial(10)).toEqual(3628800)
|
|
})
|
|
|
|
it('expects the multipleFactorials function to use the cache on the second call', () => {
|
|
const memoMultipleFactorials = memoize(multipleFactorials)
|
|
const input = [2, 3, 4, 5]
|
|
|
|
expect(memoMultipleFactorials(input)).toEqual([2, 6, 24, 120])
|
|
expect(memoMultipleFactorials(input)).toEqual(multipleFactorials(input))
|
|
})
|
|
|
|
it('expects the multipleFactorials function to use the cache on the second call', () => {
|
|
const memoMultipleFactorials = memoize(multipleFactorials)
|
|
const input = [2, 3, 4, 5]
|
|
|
|
expect(memoMultipleFactorials(input)).toEqual([2, 6, 24, 120])
|
|
expect(memoMultipleFactorials(input)).toEqual(multipleFactorials(input))
|
|
})
|
|
|
|
it('expects the union function to use the cache on the second call', () => {
|
|
const memoUnion = memoize(union)
|
|
const inputs = [new Set([1, 2, 3]), new Set([4, 3, 2]), new Set([5, 3, 6])]
|
|
|
|
expect(memoUnion(...inputs)).toEqual(new Set([1, 2, 3, 4, 5, 6]))
|
|
expect(memoUnion(...inputs)).toEqual(union(...inputs))
|
|
})
|
|
|
|
it('Testing with explicit cache -> LFUCache', () => {
|
|
const LFU = new LFUCache(2)
|
|
|
|
const memoizeFibonacci = memoize(fibonacci, LFU) // added LFU cache explicitly
|
|
const fibOfFiveHundred = memoizeFibonacci(500)
|
|
const fibOfOneHundred = memoizeFibonacci(100)
|
|
|
|
expect(memoizeFibonacci(500)).toBe(fibOfFiveHundred)
|
|
expect(memoizeFibonacci(100)).toBe(fibOfOneHundred)
|
|
|
|
expect(LFU.leastFrequency).toBe(2)
|
|
})
|
|
})
|