Description:

intset 1.0.0

IntSets are an efficient immutable representation of sets of unsigned 64-bit
integers with fast boolean operations and fast indexing of the set in sorted
order. They are designed to be particularly efficient for representing sets
with large contiguous ranges, so for example representing the set of all 64-bit
integers takes only a handful of bytes.
Their behaviour and API are somehwere in between that of frozenset and that of
a sorted list of deduplicated integers.
The implementation is heavily based on Fast Mergeable Integer Maps
by Okasaki and Gill, but it has been adapted to support a somewhat different feature
set and a more compact representation for certain usage patterns.
For usage, see the API documentation.

License

For personal and professional use. You cannot resell or redistribute these repositories in their original state.

Share

• Share on Facebook
• Share on Twitter