Efficient storage for sets of mostly-consecutive integers
Project description
License: Your choice of MIT or Apache License 2.0
Rationale
Python Sets are nice to work with, but very inefficient if you need a large set with mostly-consecutive integers. The RangeSet class provides efficient handling and storage for these sets.
Non-integers?
RangeSet works with any class whose instances are
comparable
step-able, i.e. you can add 1 to them / subtract 1 from them.
discrete, i.e. there is no value between n and n+1.
RangeSet doesn’t add or subtract any other values, nor does it try to subtract two instances from each other.
The requirement to subtract 1 is an optimization that could be removed if necessary.
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for range_set-0.3.2-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 07380f2635f0cbabaf825109130a59bba342ef747e4d54486ab725dac0e03217 |
|
| MD5 | d3f34f19b498fc97ff2e502ec38eefdd |
|
| BLAKE2b-256 | 258312bd72b9630dc0e7e1fcb2d521244772050da8bfefcf192dcee8ef82d1fb |
