Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
branch: master
Fetching contributors…

Cannot retrieve contributors at this time

297 lines (261 sloc) 6.649 kb
# This file is a part of Julia. License is MIT: http://julialang.org/license
type IntSet
bits::Array{UInt32,1}
limit::Int
fill1s::Bool
IntSet() = new(zeros(UInt32,256>>>5), 256, false)
end
IntSet(itr) = (s=IntSet(); for a in itr; push!(s,a); end; s)
eltype(::Type{IntSet}) = Int64
similar(s::IntSet) = IntSet()
function show(io::IO, s::IntSet)
print(io, "IntSet([")
first = true
for n in s
if n > s.limit
break
end
if !first
print(io, ", ")
end
print(io, n)
first = false
end
if s.fill1s
print(io, ", ..., ", typemax(Int)-1)
end
print(io, "])")
end
copy(s::IntSet) = union!(IntSet(), s)
function sizehint!(s::IntSet, top::Integer)
if top >= s.limit
lim = ((top+31) & -32)>>>5
olsz = length(s.bits)
if olsz < lim
resize!(s.bits, lim)
fill = s.fill1s ? UInt32(-1) : UInt32(0)
for i=(olsz+1):lim; s.bits[i] = fill; end
end
s.limit = top
end
s
end
function push!(s::IntSet, n::Integer)
if n >= s.limit
if s.fill1s
return s
else
lim = Int(n + div(n,2))
sizehint!(s, lim)
end
elseif n < 0
throw(ArgumentError("IntSet elements cannot be negative"))
end
s.bits[n>>5 + 1] |= (UInt32(1)<<(n&31))
return s
end
function union!(s::IntSet, ns)
for n in ns
push!(s, n)
end
return s
end
function pop!(s::IntSet, n::Integer, deflt)
if n >= s.limit
if s.fill1s
lim = Int(n + div(n,2))
sizehint!(s, lim)
else
return deflt
end
end
mask = UInt32(1)<<(n&31)
idx = n>>5 + 1
b = s.bits[idx]
if (b&mask)==0; return deflt; end
s.bits[idx] = b&~mask
return n
end
function pop!(s::IntSet, n::Integer)
if pop!(s, n, n+1) == n+1
throw(KeyError(n))
end
return n
end
# TODO: what should happen when fill1s == true?
pop!(s::IntSet) = pop!(s, last(s))
function delete!(s::IntSet, n::Integer)
pop!(s, n, n)
return s
end
function setdiff!(s::IntSet, ns)
for n in ns
delete!(s, n)
end
return s
end
setdiff(a::IntSet, b::IntSet) = setdiff!(copy(a),b)
symdiff(s1::IntSet, s2::IntSet) =
(s1.limit >= s2.limit ? symdiff!(copy(s1), s2) : symdiff!(copy(s2), s1))
function empty!(s::IntSet)
s.bits[:] = 0
return s
end
function symdiff!(s::IntSet, n::Integer)
if n >= s.limit
lim = Int(n + dim(n,2))
sizehint!(s, lim)
elseif n < 0
throw(ArgumentError("IntSet elements cannot be negative"))
end
s.bits[n>>5 + 1] $= (UInt32(1)<<(n&31))
return s
end
function symdiff!(s::IntSet, ns)
for n in ns
symdiff!(s, n)
end
return s
end
function copy!(to::IntSet, from::IntSet)
empty!(to)
union!(to, from)
end
function in(n::Integer, s::IntSet)
if n >= s.limit
# max IntSet length is typemax(Int), so highest possible element is
# typemax(Int)-1
s.fill1s && n >= 0 && n < typemax(Int)
elseif n < 0
return false
else
(s.bits[n>>5 + 1] & (UInt32(1)<<(n&31))) != 0
end
end
start(s::IntSet) = Int64(0)
done(s::IntSet, i) = (!s.fill1s && next(s,i)[1] >= s.limit) || i == typemax(Int)
function next(s::IntSet, i)
if i >= s.limit
n = Int64(i)
else
n = Int64(ccall(:bitvector_next, UInt64, (Ptr{UInt32}, UInt64, UInt64), s.bits, i, s.limit))
end
(n, n+1)
end
isempty(s::IntSet) =
!s.fill1s && ccall(:bitvector_any1, UInt32, (Ptr{UInt32}, UInt64, UInt64), s.bits, 0, s.limit)==0
function first(s::IntSet)
n = next(s,0)[1]
if n >= s.limit
throw(ArgumentError("set must be non-empty"))
end
return n
end
shift!(s::IntSet) = pop!(s, first(s))
function last(s::IntSet)
if !s.fill1s
for i = length(s.bits):-1:1
w = s.bits[i]
if w != 0
return (i-1)<<5 + (31-leading_zeros(w))
end
end
end
throw(ArgumentError("set has no last element"))
end
length(s::IntSet) = Int(ccall(:bitvector_count, UInt64, (Ptr{UInt32}, UInt64, UInt64), s.bits, 0, s.limit)) +
(s.fill1s ? typemax(Int) - s.limit : 0)
# Math functions
function union!(s::IntSet, s2::IntSet)
if s2.limit > s.limit
sizehint!(s, s2.limit)
end
lim = length(s2.bits)
for n = 1:lim
s.bits[n] |= s2.bits[n]
end
if s2.fill1s
for n=lim+1:length(s.bits)
s.bits[n] = UInt32(-1)
end
end
s.fill1s |= s2.fill1s
s
end
union(s1::IntSet) = copy(s1)
union(s1::IntSet, s2::IntSet) = (s1.limit >= s2.limit ? union!(copy(s1), s2) : union!(copy(s2), s1))
union(s1::IntSet, ss::IntSet...) = union(s1, union(ss...))
function intersect!(s::IntSet, s2::IntSet)
if s2.limit > s.limit
sizehint!(s, s2.limit)
end
lim = length(s2.bits)
for n = 1:lim
s.bits[n] &= s2.bits[n]
end
if !s2.fill1s
for n=lim+1:length(s.bits)
s.bits[n] = UInt32(0)
end
end
s.fill1s &= s2.fill1s
s
end
intersect(s1::IntSet) = copy(s1)
intersect(s1::IntSet, s2::IntSet) =
(s1.limit >= s2.limit ? intersect!(copy(s1), s2) : intersect!(copy(s2), s1))
intersect(s1::IntSet, ss::IntSet...) = intersect(s1, intersect(ss...))
function complement!(s::IntSet)
for n = 1:length(s.bits)
s.bits[n] = ~s.bits[n]
end
s.fill1s = !s.fill1s
s
end
complement(s::IntSet) = complement!(copy(s))
function symdiff!(s::IntSet, s2::IntSet)
if s2.limit > s.limit
sizehint!(s, s2.limit)
end
lim = length(s2.bits)
for n = 1:lim
s.bits[n] $= s2.bits[n]
end
if s2.fill1s
for n=lim+1:length(s.bits)
s.bits[n] = ~s.bits[n]
end
end
s.fill1s $= s2.fill1s
s
end
function ==(s1::IntSet, s2::IntSet)
if s1.fill1s != s2.fill1s
return false
end
lim1 = length(s1.bits)
lim2 = length(s2.bits)
for i = 1:min(lim1,lim2)
if s1.bits[i] != s2.bits[i]
return false
end
end
filln = s1.fill1s ? UInt32(-1) : UInt32(0)
if lim1 > lim2
for i = lim2:lim1
if s1.bits[i] != filln
return false
end
end
else
for i = lim1+1:lim2
if s2.bits[i] != filln
return false
end
end
end
return true
end
issubset(a::IntSet, b::IntSet) = isequal(a, intersect(a,b))
<(a::IntSet, b::IntSet) = (a<=b) && !isequal(a,b)
<=(a::IntSet, b::IntSet) = issubset(a, b)
Jump to Line
Something went wrong with that request. Please try again.