forked from Yicong-Huang/random_cache
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrandom_cache.py
387 lines (309 loc) · 11.5 KB
/
random_cache.py
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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
import random
import sys
from functools import wraps
from gc import get_referents
from itertools import chain
from time import time
from types import ModuleType, FunctionType
from pympler import asizeof
def timing(cases, capacity):
def timing_with_cases(f):
@wraps(f)
def wrap(*args, **kw):
ts = time()
result = f(*args, **kw)
te = time()
cache = args[0]
size = asizeof.asizeof(cache)
name = f'{cache.__class__.__name__:<10}(cap={capacity})'
print(
f'{name:<30}\ttotal puts:{cases},\tper put time (ns):{(te - ts) * 1000 * 1000 / cases:.4f},\treplacement_counter:{cache._replacement_counter},\tper replacement time (ns):{((te - ts) * 1000 * 1000 / cache._replacement_counter) if cache._replacement_counter else 0.0 :.4f}, per item size: {size / cases:.4f}')
return result
return wrap
return timing_with_cases
class SimpleCache:
def __init__(self, capacity: int):
self._capacity = capacity
self._data = dict() # key -> value
self._replacement_counter = 0
def put(self, key, value):
if key in self._data:
self._data[key] = value
elif len(self._data) == self._capacity:
self._replace(key, value)
else:
self._data[key] = value
def get(self, key):
return self._data[key]
def delete(self, key):
del self._data[key]
def _replace(self, key, value):
random_idx = random.randint(0, self._capacity - 1)
random_key = list(self._data.keys())[random_idx]
del self._data[random_key]
self.put(key, value)
self._replacement_counter += 1
def __str__(self):
return str(self._data)
class OptimizedCache(SimpleCache):
def __init__(self, capacity: int):
super().__init__(capacity)
self._data = dict() # key -> (value, idx)
self._available_idxes = set(range(0, capacity)) # {idx}
self._used_idxes = dict() # idx -> key
def put(self, key, value):
if key in self._data:
self._data[key] = (value, self._data[key][0])
else:
if self._available_idxes:
idx = self._available_idxes.pop()
self._data[key] = (value, idx)
self._used_idxes[idx] = key
else:
self._replace(key, value)
def get(self, key):
value, _ = self._data[key]
return value
def delete(self, key):
_, idx = self._data[key]
self._delete_key(key)
self._delete_idx(idx)
def _replace(self, key, value):
random_idx = random.randint(0, self._capacity - 1)
random_key = self._used_idxes[random_idx]
self._delete_idx(random_idx)
self._delete_key(random_key)
self.put(key, value)
self._replacement_counter += 1
def _delete_idx(self, idx: int):
del self._used_idxes[idx]
self._available_idxes.add(idx)
def _delete_key(self, key):
del self._data[key]
class OptimizedCache2(SimpleCache):
def __init__(self, capacity: int):
super().__init__(capacity)
self._data = dict() # key -> (value, idx)
self._available_idxes = list(range(0, capacity)) # [idx3]
self._used_idxes = [None for _ in range(capacity)] # [key1, key2, None]
def put(self, key, value):
if key in self._data:
self._data[key] = (value, self._data[key][0])
else:
if self._available_idxes:
idx = self._available_idxes.pop()
self._data[key] = (value, idx)
self._used_idxes[idx] = key
else:
self._replace(key, value)
def get(self, key):
value, _ = self._data[key]
return value
def delete(self, key):
_, idx = self._data[key]
self._delete_key(key)
self._delete_idx(idx)
def _replace(self, key, value):
random_idx = random.randint(0, self._capacity - 1)
random_key = self._used_idxes[random_idx]
self._delete_idx(random_idx)
self._delete_key(random_key)
self.put(key, value)
self._replacement_counter += 1
def _delete_idx(self, idx: int):
self._used_idxes[idx] = None
self._available_idxes.append(idx)
def _delete_key(self, key):
del self._data[key]
class OptimizedCache3(SimpleCache):
def __init__(self, capacity: int):
super().__init__(capacity)
self._data = [(None, None) for _ in range(capacity)] # [(key1, value1), (key2, value2), (None, None)]
self._available_idxes = list(range(0, capacity)) # [idx3]
self._used_idxes = dict() # key -> idx
def put(self, key, value):
if key in self._used_idxes:
self._data[self._used_idxes[key]] = (key, value)
else:
if self._available_idxes:
idx = self._available_idxes.pop()
self._data[idx] = (key, value)
self._used_idxes[key] = idx
else:
self._replace(key, value)
def get(self, key):
return self._data[self._used_idxes[key]][1]
def delete(self, key):
idx = self._used_idxes[key]
self._delete_key(key)
self._delete_idx(idx)
def _replace(self, key, value):
random_idx = random.randint(0, self._capacity - 1)
random_key, _ = self._data[random_idx]
self._delete_idx(random_idx)
self._delete_key(random_key)
self.put(key, value)
self._replacement_counter += 1
def _delete_idx(self, idx: int):
self._data[idx] = (None, None)
self._available_idxes.append(idx)
def _delete_key(self, key):
del self._used_idxes[key]
def __str__(self):
return str({k: v for k, v in self._data if k is not None})
class OptimizedCache4(SimpleCache):
def __init__(self, capacity: int):
super().__init__(capacity)
self._data = dict()
def f(capacity):
i = 0
while i < capacity:
yield i
i += 1
self._available_idxes = f(capacity) # [idx3]
self._used_idxes = dict() # key -> idx
def put(self, key, value):
if key in self._used_idxes:
self._data[self._used_idxes[key]] = (key, value)
else:
try:
idx = next(self._available_idxes)
self._data[idx] = (key, value)
self._used_idxes[key] = idx
except:
self._replace(key, value)
def get(self, key):
return self._data[self._used_idxes[key]][1]
def delete(self, key):
idx = self._used_idxes[key]
self._delete_key(key)
self._delete_idx(idx)
def _replace(self, key, value):
random_idx = random.randint(0, self._capacity - 1)
random_key, _ = self._data[random_idx]
self._delete_idx(random_idx)
self._delete_key(random_key)
self.put(key, value)
self._replacement_counter += 1
def _delete_idx(self, idx: int):
del self._data[idx]
self._available_idxes = chain(self._available_idxes, (i for i in [idx]))
def _delete_key(self, key):
del self._used_idxes[key]
def __str__(self):
return str({k: v for k, v in self._data.items() if k is not None})
class OptimizedCache5(SimpleCache):
def __init__(self, capacity: int):
super().__init__(capacity)
self._data = [(None, None) for _ in range(capacity)] # [(key1, value1), (key2, value2), (None, None)]
def f(capacity):
i = 0
while i < capacity:
yield i
i += 1
self._available_idxes = f(capacity) # [idx3]
self._used_idxes = dict() # key -> idx
def put(self, key, value):
if key in self._used_idxes:
self._data[self._used_idxes[key]] = (key, value)
else:
try:
idx = next(self._available_idxes)
self._data[idx] = (key, value)
self._used_idxes[key] = idx
except:
self._replace(key, value)
def get(self, key):
return self._data[self._used_idxes[key]][1]
def delete(self, key):
idx = self._used_idxes[key]
self._delete_key(key)
self._delete_idx(idx)
def _replace(self, key, value):
random_idx = random.randint(0, self._capacity - 1)
random_key, _ = self._data[random_idx]
self._delete_idx(random_idx)
self._delete_key(random_key)
self.put(key, value)
self._replacement_counter += 1
def _delete_idx(self, idx: int):
self._data[idx] = (None, None)
self._available_idxes = chain(self._available_idxes, (i for i in [idx]))
def _delete_key(self, key):
del self._used_idxes[key]
def __str__(self):
return str({k: v for k, v in self._data if k is not None})
class OptimizedCacheMB:
def __init__(self, capacity: int):
self._capacity = capacity
self._data = dict() # key -> (value, pos)
self._data_list = [] # key list
self._replacement_counter = 0
def put(self, key, value):
if key in self._data:
self._data[key] = value, self._data[key][1]
elif len(self._data) == self._capacity:
self._replace(key, value)
else:
self._data[key] = value, len(self._data_list)
self._data_list.append(key)
def get(self, key):
return self._data[key][0]
def delete(self, key):
_, pos = self._data[key]
del self._data[key]
self._data_list[pos] = self._data_list[-1]
self._data_list.pop()
self._data[self._data_list[pos]] = self._data[self._data_list[pos]][0], pos
def _replace(self, key, value):
random_idx = random.randint(0, self._capacity - 1)
random_key = self._data_list[random_idx]
_, pos = self._data[random_key]
del self._data[random_key]
self._data[key] = value, pos
self._data_list[random_idx] = key
self._replacement_counter = self._replacement_counter + 1
def __str__(self):
return str(self._data)
if __name__ == '__main__':
# correctness check:
o = OptimizedCache5(3)
o.put(1, 1)
o.put(2, 2)
o.put(3, 3)
o.put(4, 4)
o.put(5, 5)
print(o)
print(o.get(5))
o.delete(5)
print(o)
# print(o._available_idxes)
# print(o._used_idxes)
o.put(6, 6)
print(o)
# print(o._available_idxes)
# print(o._used_idxes)
print(o.get(6))
# performance
for exp_c in range(3, 10):
capacity = 10 ** exp_c
for exp in range(0, 20):
cases = 2 ** exp
simple_c = SimpleCache(capacity)
optimized_c = OptimizedCache(capacity)
optimized2_c = OptimizedCache2(capacity)
optimized3_c = OptimizedCache3(capacity)
optimized4_c = OptimizedCache4(capacity)
optimized5_c = OptimizedCache5(capacity)
@timing(cases, capacity)
def ordered_inputs(c):
for i in range(cases):
c.put(i, i)
ordered_inputs(simple_c)
ordered_inputs(optimized_c)
ordered_inputs(optimized2_c)
ordered_inputs(optimized3_c)
ordered_inputs(optimized4_c)
ordered_inputs(optimized5_c)
print("-------------------------------------------------------------------------\n")
print("\n\n\n==================================================================\n")