Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/Cantido/int_set
A time- and memory-efficient data structure for positive integers.
https://github.com/Cantido/int_set
bitfield bitfields bittorrent collection elixir enumerable hacktoberfest set
Last synced: about 1 month ago
JSON representation
A time- and memory-efficient data structure for positive integers.
- Host: GitHub
- URL: https://github.com/Cantido/int_set
- Owner: Cantido
- License: agpl-3.0
- Created: 2018-02-02T04:24:29.000Z (almost 7 years ago)
- Default Branch: main
- Last Pushed: 2024-10-07T17:59:51.000Z (2 months ago)
- Last Synced: 2024-10-30T21:02:41.608Z (about 1 month ago)
- Topics: bitfield, bitfields, bittorrent, collection, elixir, enumerable, hacktoberfest, set
- Language: Elixir
- Homepage: https://hex.pm/packages/int_set
- Size: 312 KB
- Stars: 10
- Watchers: 3
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Changelog: CHANGELOG.md
- Contributing: CONTRIBUTING.md
- License: LICENSE.md
- Code of conduct: code_of_conduct.md
Awesome Lists containing this project
- fucking-awesome-elixir - int_set - A time- and memory-efficient unordered data structure for positive integers. (Code Analysis)
- awesome-elixir - int_set - A time- and memory-efficient unordered data structure for positive integers. (Code Analysis)
README
# IntSet
[](https://hex.pm/packages/int_set)
[](https://github.com/Cantido/int_set/actions/workflows/elixir.yml)
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`:
```elixir
def deps do
[
{:int_set, "~> 1.5"}
]
end
```
The docs can be found at [https://hexdocs.pm/int_set](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`:
```elixir
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.
```elixir
iex> IntSet.new(3) |> Enum.member?(3)
true
```
Sets also implement `Collectable`, so it can collect values in any context
that a list can:
```elixir
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:
```elixir
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.
```elixir
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`.
```elixir
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](https://github.com/Cantido).
You can get in touch with her on [Keybase.io](https://keybase.io/cantido).
## 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](https://github.com/Cantido/int_set/issues/new)!
Ideally, my answer to your question will be in an update to the docs.
Please see [CONTRIBUTING.md](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 .