This packages allows to create a very fast immutable type that represents a set of enum values.
julia> using EnumSets
julia> @enum Lang Python Julia C
julia> const LangSet = enumsettype(Lang)
EnumSets.EnumSet{Lang, UInt8, EnumSets.OffsetBasedPacking{0}}
julia> s = LangSet((Python, Julia))
EnumSets.EnumSet{Lang, UInt8, EnumSets.OffsetBasedPacking{0}} with 2 elements:
Python
Julia
julia> push(s, C) # s is immutable, but we can create modified copies
EnumSets.EnumSet{Lang, UInt8, EnumSets.OffsetBasedPacking{0}} with 3 elements:
Python
Julia
C
julia> s
EnumSets.EnumSet{Lang, UInt8, EnumSets.OffsetBasedPacking{0}} with 2 elements:
Python
Julia
julia> s2 = LangSet((C, Python))
EnumSets.EnumSet{Lang, UInt8, EnumSets.OffsetBasedPacking{0}} with 2 elements:
Python
C
julia> s ∪ s2
EnumSets.EnumSet{Lang, UInt8, EnumSets.OffsetBasedPacking{0}} with 3 elements:
Python
Julia
C
julia> s ∩ s2
EnumSets.EnumSet{Lang, UInt8, EnumSets.OffsetBasedPacking{0}} with 1 element:
Python
...
using EnumSets
@enum Alphabet A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
function workout(sets)
s = first(sets)
b = false
ESet = eltype(sets)
E = eltype(ESet)
for s1 in sets
for s2 in sets
for e in instances(E)
s = (s ∩ s2) ∪ s1
s = s ∪ s1
s = symdiff(s, ESet((e,)))
b = b ⊻ (s1 ⊆ s2)
b = b ⊻ (s1 ⊊ s2)
b = b ⊻ (e in s)
end
end
end
s, b
end
const AlphabetSet = enumsettype(Alphabet)
sets = [AlphabetSet(rand(instances(Alphabet)) for _ in 0:length(instances(Alphabet))) for _ in 1:100]
basesets = map(Set, sets)
# warmup
workout(sets, )
workout(basesets, )
# benchmark
println(eltype(sets))
res1 = @time workout(sets, )
println(eltype(basesets))
res2 = @time workout(basesets, )
@assert res1 == res2 # both yield the same result
# AlphabetSet
# 0.000279 seconds (1 allocation: 16 bytes)
# Set{Alphabet}
# 0.503022 seconds (8.15 M allocations: 756.469 MiB, 13.51% gc time)