forked from ptarjan/node-cache
/
index.js
209 lines (191 loc) · 6.7 KB
/
index.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
/* global describe, it */
'use strict';
var assert = require( 'chai' ).assert;
var TinyCache = require( '../' );
var i = 0;
function new_key() {
return 'key_' + ( ++i );
}
var suite = function( cache ) {
describe( 'size', function() {
it( 'should be 0 when empty', function() {
cache.clear();
assert.equal( cache.size, 0 );
} );
it( 'should be accurate', function() {
cache.clear();
cache.put( new_key(), 1 );
assert.equal( cache.size, 1 );
} );
it( 'should be accurate after object falls out of cache', function( done ) {
this.slow( 200 ); // not slow at 50ms
var start = cache.size;
cache.put( new_key(), 1, 5 );
assert.equal( cache.size, start + 1 );
setTimeout( function() {
assert.equal( cache.size, start );
done();
}, 50 );
} );
} );
describe( 'memsize', function() {
it( 'should be 0 when empty', function() {
cache.clear();
assert.equal( cache.memsize, 0 );
} );
it( 'should be accurate', function() {
cache.clear();
var firstKey = new_key();
cache.put( firstKey, 1 );
var firstSize = cache.memsize;
assert.isAbove( firstSize, 0 );
var secondKey = new_key();
cache.put( secondKey, 10 );
var secondSize = cache.memsize;
assert.isAbove( secondSize, firstSize );
cache.del( secondKey );
assert.equal( cache.memsize, firstSize );
cache.del( firstKey );
assert.equal( cache.memsize, 0 );
} );
it( 'should be accurate after object falls out of cache', function( done ) {
this.slow( 200 ); // not slow at 50ms
var start = cache.memsize;
cache.put( new_key(), 1, 5 );
assert.isAbove( cache.memsize, start );
setTimeout( function() {
assert.equal( cache.memsize, start );
done();
}, 50 );
} );
} );
describe( 'clear()', function() {
it( 'should clear all objects', function() {
var size_start = cache.size;
var keys = [ new_key(), new_key(), new_key() ];
cache.put( keys[ 0 ], 1, 10 );
cache.put( keys[ 1 ], 2, 10 );
cache.put( keys[ 2 ], 3, 10 );
assert.equal( cache.size, size_start + 3 );
cache.clear();
assert.equal( cache.size, 0 );
assert.isNull( cache.get( keys[ 0 ] ) );
assert.isNull( cache.get( keys[ 1 ] ) );
assert.isNull( cache.get( keys[ 2 ] ) );
} );
} );
describe( 'get()', function() {
it( 'should return null if key doesn\'t exist', function() {
assert.isNull( cache.get( 'awf1n1a' ) );
assert.isNull( cache.get( null ) );
assert.isNull( cache.get() );
assert.isNull( cache.get( 1 ) );
assert.isNull( cache.get( true ) );
assert.isNull( cache.get( false ) );
} );
it( 'should return value', function() {
var complicated = [ 'a', {
'b': 'c',
'd': [ 'e', 3 ]
}, '@' ];
var key = new_key();
cache.put( key, complicated, 100 );
assert.deepEqual( cache.get( key ), complicated );
} );
} );
describe( 'put()', function() {
it( 'should overwrite existing object if exists', function( done ) {
var ttl1 = 20;
var ttl2 = 20;
var value1 = {
a: 1
};
var value2 = {
a: 2
};
var key = new_key();
cache.put( key, value1, ttl1 );
assert.deepEqual( cache.get( key ), value1 );
setTimeout( function() {
cache.put( key, value2, ttl2 );
assert.deepEqual( cache.get( key ), value2 );
}, 10 );
// test that the value isn't wiped out by the first
// put()'s timeout
setTimeout( function() {
assert.deepEqual( cache.get( key ), value2 );
done();
}, 25 );
} );
describe( 'stored object', function() {
it( 'should exist during ttl (ms)', function( done ) {
var ttl = 20;
var value = {
a: 1
};
var key = new_key();
cache.put( key, value, ttl );
setTimeout( function() {
assert.deepEqual( cache.get( key ), value );
done();
}, 10 );
} );
it( 'should expire after ttl (ms)', function( done ) {
var ttl = 20;
var value = {
a: 1
};
var key = new_key();
cache.put( key, value, ttl );
setTimeout( function() {
assert.isNull( cache.get( key ) );
done();
}, 30 );
} );
} );
} );
describe( 'del()', function() {
it( 'should remove object', function() {
var key = new_key();
var val = 1;
var size = cache.size;
cache.put( key, val, 100 );
assert.equal( cache.get( key ), val );
cache.del( key );
assert.isNull( cache.get( key ) );
assert.equal( cache.size, size );
} );
it( 'should return false when trying to remove a nonexistent object', function() {
assert.notOk( cache.del( 'nonexistent' ) );
} );
} );
describe( 'hits', function() {
it( 'should be number of cache hits', function() {
var key = new_key();
cache.put( key, 1, 1 );
var start = cache.hits;
cache.get( 'missing' );
cache.get( key );
cache.get( key );
cache.get( key );
assert.equal( cache.hits, start + 3 );
} );
} );
describe( 'misses', function() {
it( 'should be number of cache misses', function() {
var key = new_key();
cache.put( key, 1, 1 );
var start = cache.misses;
cache.get( 'missing' );
cache.get( 'missing' );
cache.get( key );
assert.equal( cache.misses, start + 2 );
} );
} );
};
describe( 'tinycache (instance)', function() {
suite( new TinyCache() );
} );
describe( 'tinycache (shared)', function() {
suite( TinyCache.shared );
} );