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
|
using LRUExample
TestLRU = LRUExample.UnboundedLRU{ASCIIString, ASCIIString}()
TestBLRU = LRUExample.BoundedLRU{ASCIIString, ASCIIString}(1000)
get_str(i) = ascii(vcat(map(x->[x>>4; x&0x0F], reinterpret(Uint8, [int32(i)]))...))
isbounded{L<:LRUExample.LRU}(::Type{L}) = any(map(n->n==:maxsize, L.names))
isbounded{L<:LRUExample.LRU}(l::L) = isbounded(L)
nmax = int(logspace(2, 5, 4))
function lrutest()
#println("LRU consistency tests")
for lru in (TestLRU,TestBLRU)
for n in nmax
empty!(lru)
#@printf(" %s, %d items\n", lru, n)
#print(" Simple eviction: ")
for i in 1:n
str = get_str(i)
lru[str] = str
@assert lru.q[1].v == str
if isbounded(lru) && length(lru) >= lru.maxsize
tailstr = get_str(i-lru.maxsize+1)
@assert lru.q[end].v == tailstr
end
end
#println("pass")
#print(" Lookup, random access: ")
for i in 1:n
str = get_str(rand(1:n))
if haskey(lru, str) # the bounded LRUs can have cache misses
blah = lru[str]
@assert lru.q[1].v == blah
end
end
#println("pass")
end
empty!(lru)
end
end
lrutest()
|
