Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit ab7e519

Browse files
lvltelvlte
committed
LFUCache/LRUCache : convert live code example to Jest test.
1 parent 5c4be76 commit ab7e519

4 files changed

Lines changed: 110 additions & 76 deletions

File tree

‎Cache/LFUCache.js‎

Lines changed: 1 addition & 38 deletions
Original file line numberDiff line numberDiff line change
@@ -103,41 +103,4 @@ class LFUCache {
103103
}
104104
}
105105

106-
function main () {
107-
// Example 1 (Small Cache)
108-
const cache = new LFUCache(2)
109-
cache.set(1, 1)
110-
cache.set(2, 2)
111-
112-
console.log(cache.get(1))
113-
114-
cache.set(3, 3)
115-
116-
console.log(cache.get(2)) // cache miss
117-
118-
cache.set(4, 4)
119-
120-
console.log(cache.get(1)) // cache miss
121-
console.log(cache.get(3))
122-
console.log(cache.get(4))
123-
124-
console.log('Example Cache: ', cache.cacheInfo(), '\n')
125-
126-
// Example 2 (Computing Fibonacci Series - 100 terms)
127-
function fib (num, cache = null) {
128-
if (cache) {
129-
const value = cache.get(num)
130-
if (value) { return value }
131-
}
132-
if (num === 1 || num === 2) { return 1 }
133-
const result = fib(num - 1, cache) + fib(num - 2, cache)
134-
if (cache) { cache.set(num, result) }
135-
return result
136-
}
137-
138-
const fibCache = new LFUCache(100)
139-
for (let i = 1; i <= 100; i++) { fib(i, fibCache) }
140-
console.log('Fibonacci Series Cache: ', fibCache.cacheInfo(), '\n')
141-
}
142-
143-
main()
106+
export { LFUCache }

‎Cache/LRUCache.js‎

Lines changed: 1 addition & 38 deletions
Original file line numberDiff line numberDiff line change
@@ -86,41 +86,4 @@ class LRUCache {
8686
}
8787
}
8888

89-
function main () {
90-
// Example 1 (Small Cache)
91-
const cache = new LRUCache(2)
92-
cache.set(1, 1)
93-
cache.set(2, 2)
94-
95-
console.log(cache.get(1))
96-
97-
cache.set(3, 3)
98-
99-
console.log(cache.get(2)) // cache miss
100-
101-
cache.set(4, 4)
102-
103-
console.log(cache.get(1)) // cache miss
104-
console.log(cache.get(3))
105-
console.log(cache.get(4))
106-
107-
console.log('Example Cache: ', cache.cacheInfo(), '\n')
108-
109-
// Example 2 (Computing Fibonacci Series - 100 terms)
110-
function fib (num, cache = null) {
111-
if (cache) {
112-
const value = cache.get(num)
113-
if (value) { return value }
114-
}
115-
if (num === 1 || num === 2) { return 1 }
116-
const result = fib(num - 1, cache) + fib(num - 2, cache)
117-
if (cache) { cache.set(num, result) }
118-
return result
119-
}
120-
121-
const fibCache = new LRUCache(100)
122-
for (let i = 1; i <= 100; i++) { fib(i, fibCache) }
123-
console.log('Fibonacci Series Cache: ', fibCache.cacheInfo(), '\n')
124-
}
125-
126-
main()
89+
export { LRUCache }

‎Cache/test/LFUCache.test.js‎

Lines changed: 54 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
import { LFUCache } from '../LFUCache'
2+
3+
describe('LFUCache', () => {
4+
it('Example 1 (Small Cache, size=2)', () => {
5+
const cache = new LFUCache(2)
6+
cache.set(1, 1)
7+
cache.set(2, 2)
8+
9+
expect(cache.get(1)).toBe(1)
10+
expect(cache.get(2)).toBe(2)
11+
12+
// Additional entries triggers cache rotate
13+
cache.set(3, 3)
14+
15+
// Then we should have a cache miss for the first entry added
16+
expect(cache.get(1)).toBe(null)
17+
expect(cache.get(2)).toBe(2)
18+
expect(cache.get(3)).toBe(3)
19+
20+
cache.set(4, 4)
21+
expect(cache.get(1)).toBe(null) // cache miss
22+
expect(cache.get(2)).toBe(null) // cache miss
23+
expect(cache.get(3)).toBe(3)
24+
expect(cache.get(4)).toBe(4)
25+
26+
expect(cache.cacheInfo()).toBe('CacheInfo(hits=6, misses=3, capacity=2, current size=2)')
27+
})
28+
29+
it('Example 2 (Computing Fibonacci Series, size=100)', () => {
30+
const cache = new LFUCache(100)
31+
for (let i = 1; i <= 100; i++) {
32+
fib(i, cache)
33+
}
34+
expect(cache.cacheInfo()).toBe('CacheInfo(hits=193, misses=103, capacity=100, current size=98)')
35+
})
36+
})
37+
38+
// Helper for building and caching Fibonacci series
39+
function fib (num, cache = null) {
40+
if (cache) {
41+
const value = cache.get(num)
42+
if (value) {
43+
return value
44+
}
45+
}
46+
if (num === 1 || num === 2) {
47+
return 1
48+
}
49+
const result = fib(num - 1, cache) + fib(num - 2, cache)
50+
if (cache) {
51+
cache.set(num, result)
52+
}
53+
return result
54+
}

‎Cache/test/LRUCache.test.js‎

Lines changed: 54 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
import { LRUCache } from '../LRUCache'
2+
3+
describe('LRUCache', () => {
4+
it('Example 1 (Small Cache, size=2)', () => {
5+
const cache = new LRUCache(2)
6+
cache.set(1, 1)
7+
cache.set(2, 2)
8+
9+
expect(cache.get(1)).toBe(1)
10+
expect(cache.get(2)).toBe(2)
11+
12+
// Additional entries triggers cache rotate
13+
cache.set(3, 3)
14+
15+
// Then we should have a cache miss for the first entry added
16+
expect(cache.get(1)).toBe(null)
17+
expect(cache.get(2)).toBe(2)
18+
expect(cache.get(3)).toBe(3)
19+
20+
cache.set(4, 4)
21+
expect(cache.get(1)).toBe(null) // cache miss
22+
expect(cache.get(2)).toBe(null) // cache miss
23+
expect(cache.get(3)).toBe(3)
24+
expect(cache.get(4)).toBe(4)
25+
26+
expect(cache.cacheInfo()).toBe('CacheInfo(hits=6, misses=3, capacity=2, current size=2)')
27+
})
28+
29+
it('Example 2 (Computing Fibonacci Series, size=100)', () => {
30+
const cache = new LRUCache(100)
31+
for (let i = 1; i <= 100; i++) {
32+
fib(i, cache)
33+
}
34+
expect(cache.cacheInfo()).toBe('CacheInfo(hits=193, misses=103, capacity=100, current size=98)')
35+
})
36+
})
37+
38+
// Helper for building and caching Fibonacci series
39+
function fib (num, cache = null) {
40+
if (cache) {
41+
const value = cache.get(num)
42+
if (value) {
43+
return value
44+
}
45+
}
46+
if (num === 1 || num === 2) {
47+
return 1
48+
}
49+
const result = fib(num - 1, cache) + fib(num - 2, cache)
50+
if (cache) {
51+
cache.set(num, result)
52+
}
53+
return result
54+
}

0 commit comments

Comments
 (0)