Skip to main content
Help us improve PyPI by participating in user testing. All experience levels needed!

Efficient representations of large sets of integers

Project description

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.

Release history Release notifications

This version
History Node

1.0.0

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Filename, size & hash SHA256 hash help File type Python version Upload date
intset-1.0.0-py2-none-any.whl (9.8 kB) Copy SHA256 hash SHA256 Wheel py2 Oct 8, 2015
intset-1.0.0-py3-none-any.whl (9.8 kB) Copy SHA256 hash SHA256 Wheel py3 Oct 8, 2015
intset-1.0.0.tar.gz (7.6 kB) Copy SHA256 hash SHA256 Source None Oct 8, 2015

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging CloudAMQP CloudAMQP RabbitMQ AWS AWS Cloud computing Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page