mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-19 18:13:44 +08:00
9f7ed56290
* refactor: added one implementation of fibonacciCahce * chore: move union function * chore: renamed the cacheTest file
38 lines
1.1 KiB
JavaScript
38 lines
1.1 KiB
JavaScript
import { LRUCache } from '../LRUCache'
|
|
import { fibonacciCache } from './cacheTest'
|
|
|
|
describe('LRUCache', () => {
|
|
it('Example 1 (Small Cache, size=2)', () => {
|
|
const cache = new LRUCache(2)
|
|
cache.set(1, 1)
|
|
cache.set(2, 2)
|
|
|
|
expect(cache.get(1)).toBe(1)
|
|
expect(cache.get(2)).toBe(2)
|
|
|
|
// Additional entries triggers cache rotate
|
|
cache.set(3, 3)
|
|
|
|
// Then we should have a cache miss for the first entry added
|
|
expect(cache.get(1)).toBe(null)
|
|
expect(cache.get(2)).toBe(2)
|
|
expect(cache.get(3)).toBe(3)
|
|
|
|
cache.set(4, 4)
|
|
expect(cache.get(1)).toBe(null) // cache miss
|
|
expect(cache.get(2)).toBe(null) // cache miss
|
|
expect(cache.get(3)).toBe(3)
|
|
expect(cache.get(4)).toBe(4)
|
|
|
|
expect(cache.cacheInfo()).toBe('CacheInfo(hits=6, misses=3, capacity=2, current size=2)')
|
|
})
|
|
|
|
it('Example 2 (Computing Fibonacci Series, size=100)', () => {
|
|
const cache = new LRUCache(100)
|
|
for (let i = 1; i <= 100; i++) {
|
|
fibonacciCache(i, cache)
|
|
}
|
|
expect(cache.cacheInfo()).toBe('CacheInfo(hits=193, misses=103, capacity=100, current size=98)')
|
|
})
|
|
})
|