-
v3.0.1 Stable
released this
2025-10-24 22:19:23 +00:00 | 40 commits to main since this releaseFixed
- Fixed compiler warnings for Elixir 1.19
Downloads
-
Source code (ZIP)
0 downloads
-
Source code (TAR.GZ)
0 downloads
-
v3.0.0 Stable
released this
2024-07-08 16:57:36 +00:00 | 129 commits to main since this releaseChanged
- BREAKING: This project will be licensed under the AGPL-3.0-or-later license going forward.
- Dependency updates
Downloads
-
Source code (ZIP)
0 downloads
-
Source code (TAR.GZ)
0 downloads
-
v2.0.0 Stable
released this
2023-03-30 01:16:35 +00:00 | 199 commits to main since this releaseChanged
- Inspecting an IntSet now returns a string using
IntString.new([1, 2, 3, ...])syntax. - The internal binary that IntSet uses to store values is now always byte-aligned,
and each byte has changed endianness to allow for some internal optimizations. - Binaries returned by
IntSet.bitstring/1is now always byte-aligned.
Removed
- BREAKING: The
byte_alignoption forIntSet.bitstring/1was removed.
Downloads
-
Source code (ZIP)
0 downloads
-
Source code (TAR.GZ)
0 downloads
- Inspecting an IntSet now returns a string using
-
v1.5.2 Stable
released this
2022-09-06 00:19:02 +00:00 | 231 commits to main since this releaseAdded
- Copyright headers are now on all files, following the REUSE Specification.
Changed
- Fixes for Elixir 1.14 deprecations
- The project now uses Earthly for CI.
You can run the entire CI pipeline on your local machine by installing Earthly and runningearthly +all.
Downloads
-
Source code (ZIP)
0 downloads
-
Source code (TAR.GZ)
0 downloads
-
v1.5.1 Stable
released this
2021-09-12 18:09:37 +00:00 | 298 commits to main since this releaseAdded
- Sponshorship link to
mix.exs
Fixed
inspect/2no longer renders certain sets as charlists.
Downloads
-
Source code (ZIP)
0 downloads
-
Source code (TAR.GZ)
0 downloads
- Sponshorship link to
-
v1.2.1 Stable
released this
2020-10-11 03:07:06 +00:00 | 381 commits to main since this releaseAdded
IntSet.difference/2now has a typespec.IntSet.disjoint?/2now has docs and a typespec.
Changed
IntSet.union/2has been optimized
Downloads
-
Source code (ZIP)
0 downloads
-
Source code (TAR.GZ)
0 downloads
-
v1.5.0 Stable
released this
2020-10-11 02:48:25 +00:00 | 359 commits to main since this releaseChanged
IntSet.bitstring/1is nowIntSet.bitstring/2and now accepts an option::byte_align.
When this option is set totrue, the bitstring is padded at the end to make it byte-aligned.
Downloads
-
Source code (ZIP)
0 downloads
-
Source code (TAR.GZ)
0 downloads
-
v1.4.0 Stable
released this
2020-10-11 02:47:13 +00:00 | 371 commits to main since this releaseAdded
- The
IntSet.inverse/2function, which is like taking the difference of your IntSet with a completely-full IntSet with n members.
Say you have a list of indices, and you want to create a list of all the indices you don't have.
Just take the inverse, providing a member limit. - Added an
.editorconfigfile to the project.
Downloads
-
Source code (ZIP)
0 downloads
-
Source code (TAR.GZ)
0 downloads
- The
-
v1.0.0 Stable
released this
2020-10-11 02:31:01 +00:00 | 405 commits to main since this releaseAdded
- Constructor
IntSet.new/0, which creates a new empty set. - Constructor
IntSet.new/1, which accepts either an enumerable and returns a set containing those elements.
This constructor also accepts a bitstring.
See the documentation for details on that behavior. - The
IntSet.put/2function.
Just likeMapSet.put/2, this function returns a new set with the given value added. - The
IntSet.delete/2function.
Again, just likeMapSet.delete/2.
Returns a new set with the given value removed. - The
IntSet.union/2function.
Returns a set that contains elements of both given sets. - An implementation of
Inspectthat sorts members before printing them,
so the order can be relied upon in doctests. - An implementation of
Collectable. - An implementation of
Enumerable.
Downloads
-
Source code (ZIP)
0 downloads
-
Source code (TAR.GZ)
0 downloads
- Constructor
-
v1.1.0 Stable
released this
2020-10-11 02:30:54 +00:00 | 396 commits to main since this releaseAdded
- The
IntSet.bitstring/1function.
Returns a binary with bits flipped at the indices at which the set has members.
For example, say you have a set containing 0, 1, and 4.
CallingIntSet.bitstring/1on that set will return a five-bit-long binary with the first, second, and fifth bits set to 1, and the rest are 0. - The library is now typespecced and documented.
Downloads
-
Source code (ZIP)
0 downloads
-
Source code (TAR.GZ)
0 downloads
- The