Python package for performing set type operations on any layout of discrete space in any dimension.
Project description
blocksets
A python package for performing set operations on layouts of discrete space in any dimension.
-
Block is an orthogonal clump of units/pixels (i.e. a line segment, rectangle, cuboid, hyper... you get the idea)
-
BlockSet takes a layout and resolves it to a disjoint set of Blocks in a consistent fashion, regardless of how the layout was composed.
Why?
You might choose to use a BlockSet
instead of a set
of tuples because the
resolution/granularity is sufficiently high to warrant it.
Or in other words, the number of pixels/points being modelled pushes the limits of the available computing power due to the expanse of the space they take up.
How?
- Create any layout (as a blockset) using a stacked list of block operations
which
add
,remove
ortoggle
blocks over the current blockset state. - Perform the usual set arithmetic
union
,intersection
,difference
etc. on blockset objects. - Compare 2 blockset objects using the standard set comparison methods and operators.
- Results are always consistent regardless of how they were constructed.
Installation
blocksets is available on pypi.org and can be installed using pip (there are no dependent packages).
pip install blocksets
Usage
Visit readthedocs
Review and run the example_use.py
module via python -m blocksets.example_use
for a few examples, one of which follows here.
TL;DR
from blocksets import Block, BlockSet
# A block is defined by the co-ordinates of the opposite corners
big_rubik = Block((0, 0, 0), (99999, 99999, 99999))
assert big_rubik.measure == 999970000299999
# A single argument is a unit block
centre_cube = Block((49999, 49999, 49999))
assert centre_cube.measure == 1
# Create a large 3 dimensional cube with the centre missing
bs = BlockSet(3)
bs.add(big_rubik)
bs.remove(centre_cube)
assert bs.measure == 999970000299998
assert len(bs) == 6
sorted_blocks = sorted(bs, key=lambda x: x.norm)
for blk in sorted_blocks:
print(f"{blk:50} {blk.measure}")
The resulting space is modelled using 6 objects (effectively tuples) instead of 999970000299998
(0, 0, 0)..(49999, 99999, 99999) 499980000249999
(49999, 0, 0)..(50000, 49999, 99999) 4999850001
(49999, 49999, 0)..(50000, 50000, 49999) 49999
(49999, 49999, 50000)..(50000, 50000, 99999) 49999
(49999, 50000, 0)..(50000, 99999, 99999) 4999850001
(50000, 0, 0)..(99999, 99999, 99999) 499980000249999
Visualisation
An example of 2D set operations on some randomly generated block sets A, B and
drawn using matplotlib
. See
readthedocs
for code snippet to generate this
Contribution
At the moment it is early days so whilst the foundations are forming I am only inviting comments which can be given via github issues
Project details
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
File details
Details for the file blocksets-0.3.1.tar.gz
.
File metadata
- Download URL: blocksets-0.3.1.tar.gz
- Upload date:
- Size: 24.0 kB
- Tags: Source
- Uploaded using Trusted Publishing? Yes
- Uploaded via: twine/5.1.0 CPython/3.12.4
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0f6ccc3a7d52aaa27c68eebc98523b19fbbd83d8a7e454e57bc5e4c646e2625e |
|
MD5 | b2d277f7038874a4ee8ffa6e68ac4997 |
|
BLAKE2b-256 | edb754c998406fdf79390c1ccf2acb3004bb3134d39c8aa1c24b8d7e8a2be3cd |
Provenance
File details
Details for the file blocksets-0.3.1-py3-none-any.whl
.
File metadata
- Download URL: blocksets-0.3.1-py3-none-any.whl
- Upload date:
- Size: 15.9 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? Yes
- Uploaded via: twine/5.1.0 CPython/3.12.4
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 4d3f6235b2e26f750e62f716db91270c26998e1eeae1ce2a9a4fac09d2dd2fe0 |
|
MD5 | 6984a452b5311ce262d2f2688e42aa0d |
|
BLAKE2b-256 | 12a3a7fa5f38a375815a379873d433440a02f8d0f48ffc7e3868bf06eada3ea1 |