/usr/share/julia/test/priorityqueue.jl is in julia-common 0.4.7-6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | # This file is a part of Julia. License is MIT: http://julialang.org/license
using Base.Collections
# Test dequeing in sorted order.
function test_issorted!(pq::PriorityQueue, priorities)
last = dequeue!(pq)
while !isempty(pq)
value = dequeue!(pq)
@test priorities[last] <= priorities[value]
value = last
end
end
function test_isrequested!(pq::PriorityQueue, keys)
i = 0
while !isempty(pq)
krqst = keys[i+=1]
krcvd = dequeue!(pq, krqst)
@test krcvd == krqst
end
end
pmax = 1000
n = 10000
r = rand(1:pmax, n)
priorities = Dict(zip(1:n, r))
# building from a dict
pq = PriorityQueue(priorities)
test_issorted!(pq, priorities)
pq = PriorityQueue(priorities)
test_isrequested!(pq, 1:n)
# building from two lists
ks, vs = 1:n, rand(1:pmax, n)
pq = PriorityQueue(ks, vs)
priorities = Dict(zip(ks, vs))
test_issorted!(pq, priorities)
# enqueing via enqueue!
pq = PriorityQueue()
for (k, v) in priorities
enqueue!(pq, k, v)
end
test_issorted!(pq, priorities)
# enqueing via assign
pq = PriorityQueue()
for (k, v) in priorities
pq[k] = v
end
test_issorted!(pq, priorities)
# changing priorities
pq = PriorityQueue()
for (k, v) in priorities
pq[k] = v
end
for _ in 1:n
k = rand(1:n)
v = rand(1:pmax)
pq[k] = v
priorities[k] = v
end
test_issorted!(pq, priorities)
# dequeuing
pq = PriorityQueue(priorities)
try
dequeue!(pq, 0)
error("should have resulted in KeyError")
catch ex
@test isa(ex, KeyError)
end
@test 10 == dequeue!(pq, 10)
while !isempty(pq)
@test 10 != dequeue!(pq)
end
# low level heap operations
xs = heapify!([v for v in values(priorities)])
@test issorted([heappop!(xs) for _ in length(priorities)])
xs = Array(Int, 0)
for priority in values(priorities)
heappush!(xs, priority)
end
@test issorted([heappop!(xs) for _ in length(priorities)])
|