Calculates cartesian product from iterables
Project description
prodius
Calculating cartesian product is not easy if not using itertools.product()
.
Prodius library allows to perform the same but also allowing iterables to
be callables that return iterable. Provided callables will be called when
iterable is needed to calculate cartesian product.
itertools.product()
ofsen raise MemoryError when one of iterables is too
large. No matter matter the size of iterable, prodius will never write
whole iterator into memory.
Issues
- Iterables cannot be more than 11.
- Maybe be slower than
itertools.product()
.
Installing
Prodius can be installed with pip in your command-line.
pip install prodius
Usage
Prodius is just easy just like builtin itertools.product()
.
Realise that this wont offer any benefit as iterator are passed direcly.
import prodius
iterables = [range(10), range(10)]
for item in prodius.product(*iterables, repeat=2):
print(item)
Prodius also allows iterables to contain callable that returns iterable.
The difference is that functions were used as iterables which provide iterables on demand.
import prodius
iterables = [lambda: range(10), lambda: range(10)]
for item in prodius.product(*iterables, repeat=2):
print(item)
This compares itertools.product()
with prodius.product()
.
import prodius
# prodius.product() is used to calculate cartesian product.
# No exception or MemoryError expected even if iterables are large.
iterables = [lambda: range(10000000000), lambda: range(10000000000)]
product = prodius.product(*iterables) # works as espected
import itertools
# itertools.product() is used to calculate cartesian product.
# MemoryError expected as iterables are too large.
iterables = [range(10000000000), range(10000000000)]
product = itertools.product(*iterables) # MemoryError
Prodius also gives control of over items of iterable to be used in cartesian
product. That could be accomplised using itertools.cycle()
by returning
different iterable each time function is called.
import prodius
import itertools
foods_numbers_list = [[1,2], ["apple", "orange"]]
foods_numbers_cycle = itertools.cycle(foods_numbers_list)
def numbers_foods():
return next(foods_numbers_cycle)
for item in prodius.product([100, 200], numbers_foods):
print(item)
# (100, 1)
# (100, 2)
# (200, 'apple')
# (200, 'orange')
Notice that 100
was matched with numbers (1, 2)
while 200
matched with
('apple', 'orange')
.
Thats a fantastic trick with prodius even if it does not have realworld application but who knows.
License
Project details
Release history Release notifications | RSS feed
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 prodius-0.0.3.tar.gz
.
File metadata
- Download URL: prodius-0.0.3.tar.gz
- Upload date:
- Size: 6.0 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.1 CPython/3.10.0
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | d7fa79c7671090be4d8510e8b7681b9801e348c82dc6c2d9d9cce0879012ea0e |
|
MD5 | 8394d9d38728f451375a60350d9ecb72 |
|
BLAKE2b-256 | 04cf275ea9e840859326ecd704cfb65b2c9b069b217ba9abfa43c004745071dc |
File details
Details for the file prodius-0.0.3-py3-none-any.whl
.
File metadata
- Download URL: prodius-0.0.3-py3-none-any.whl
- Upload date:
- Size: 6.5 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.1 CPython/3.10.0
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 497b56c70c4f49a1d2f2a047b7bff33eafb57fb1580c307d368c418fb6632046 |
|
MD5 | 8b4f7eb64c1aceff57c06e3b0bfeeb65 |
|
BLAKE2b-256 | bf65f6292c30b8c05f7ca188fe379d91e7013324ab3c268e3f03aed99a128338 |