Awesome
<!-- SPDX-FileCopyrightText: 2024 Rosa Richter SPDX-License-Identifier: CC-BY-SA-4.0 -->IntSet
A time- and memory-efficient data structure for positive integers.
Faster than Elixir's MapSet at set operations (union, intersection, difference, equality), and slower at everything else. Also can be serlialized wicked small.
Install
This package can be installed by adding int_set
to your list of dependencies in mix.exs
:
def deps do
[
{:int_set, "~> 1.5"}
]
end
The docs can be found at https://hexdocs.pm/int_set.
Usage
Usage is pretty much the same as with MapSet
,
but you're only allowed to put positive integers (including zero) into the set.
A set can be constructed using IntSet.new/0
:
iex> IntSet.new()
IntSet.new([])
An IntSet
obeys the same set semantics as MapSet
, and provides
constant-time operations for insertion, deletion, and membership checking.
Use Enum.member?/2
to check for membership.
iex> IntSet.new(3) |> Enum.member?(3)
true
Sets also implement Collectable
, so it can collect values in any context
that a list can:
iex> Enum.into([1, 2, 3], IntSet.new())
IntSet.new([1, 2, 3])
The inspect/1
implementation for IntSet
sorts the members, which makes
it way easier to write doctests:
iex> IntSet.new([3, 1, 2])
IntSet.new([1, 2, 3])
Working with applications that use bitstrings becomes way easier,
because IntSet.new/1
accepts a bitstring,
and IntSet.bitstring/2
can return one.
iex> IntSet.new(5) |> IntSet.bitstring()
<<4>>
iex> IntSet.new(<<0::1, 0::1, 0::1, 0::1, 0::1, 1::1>>)
IntSet.new([5])
This also means that an IntSet
can be really efficiently serialized with the use of IntSet.bitstring/2
, and IntSet.new/1
.
iex> IntSet.new([4, 8, 15, 16, 23, 42]) |> IntSet.bitstring() |> Base.encode16()
"088181000020"
iex> Base.decode16!("088181000020") |> IntSet.new()
IntSet.new([4, 8, 15, 16, 23, 42])
Performance
Check out the iterations-per-second for some operations of MapSet
compared to IntSet
.
Op | MapSet | IntSet | Comparison |
---|---|---|---|
new | 4.8K | 2.46K | 1.95x slower |
member? | 6.78M | 2.93M | 2.31x slower |
put | 4.19M | 1.15M | 3.66x slower |
union | 156.4K | 944.31K | 6.04x faster |
difference | 48.09 | 891.27K | 18.53x faster |
intersection | 14.03K | 905.70K | 64.54x faster |
equal? | 0.26M | 2.41M | 9.25x faster |
Memory usage is also better for union, difference, intersection, and equality.
See the [benchmarks/results
] directory for all the benchmarks.
You can run the benchmarks for yourself with mix run benchmarks/benchmark.exs
.
Maintainer
This project was developed by Rosa Richter. You can get in touch with her on Keybase.io.
Contributing
Questions and pull requests are more than welcome. I follow Elixir's tenet of bad documentation being a bug, so if anything is unclear, please file an issue! Ideally, my answer to your question will be in an update to the docs.
Please see CONTRIBUTING.md for all the details you could ever want about helping me with this project.
Note that this project is released with a Contributor [Code of Conduct]. By participating in this project you agree to abide by its terms.
License
Copyright 2024 Rosa Richter
This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License along with this program. If not, see https://www.gnu.org/licenses/.