bentools / cartesian-product
A simple, low-memory footprint function to generate all combinations from a multi-dimensionnal array.
Installs: 688 378
Dependents: 19
Suggesters: 0
Security: 0
Stars: 82
Watchers: 5
Forks: 12
Open Issues: 2
Requires
- php: >=7.4
Requires (Dev)
- dms/phpunit-arraysubset-asserts: ^0.3.1
- php-coveralls/php-coveralls: @stable
- phpunit/phpunit: ^8.0|^9.0
- squizlabs/php_codesniffer: @stable
- symfony/var-dumper: ^3.2|^4.0
README
Cartesian Product
A simple, low-memory footprint function to generate all combinations from a multi-dimensionnal array.
Usage
require_once __DIR__ . '/vendor/autoload.php'; use function BenTools\CartesianProduct\cartesian_product; $data = [ 'hair' => [ 'blond', 'black' ], 'eyes' => [ 'blue', 'green', function (array $combination) { // You can use closures to dynamically generate possibilities if ('black' === $combination['hair']) { // Then you have access to the current combination being built return 'brown'; } return 'grey'; } ] ]; foreach (cartesian_product($data) as $combination) { printf('Hair: %s - Eyes: %s' . PHP_EOL, $combination['hair'], $combination['eyes']); }
Output:
Hair: blond - Eyes: blue
Hair: blond - Eyes: green
Hair: blond - Eyes: grey
Hair: black - Eyes: blue
Hair: black - Eyes: green
Hair: black - Eyes: brown
Array output
Instead of using foreach
you can dump all possibilities into an array.
print_r(cartesian_product($data)->asArray());
Output:
Array ( [0] => Array ( [hair] => blond [eyes] => blue ) [1] => Array ( [hair] => blond [eyes] => green ) [2] => Array ( [hair] => blond [eyes] => grey ) [3] => Array ( [hair] => black [eyes] => blue ) [4] => Array ( [hair] => black [eyes] => green ) [5] => Array ( [hair] => black [eyes] => brown ) )
Combinations count
You can simply count how many combinations your data produce:
require_once __DIR__ . '/vendor/autoload.php'; use function BenTools\CartesianProduct\cartesian_product; $data = [ 'hair' => [ 'blond', 'red', ], 'eyes' => [ 'blue', 'green', 'brown', ], 'gender' => [ 'male', 'female', ] ]; var_dump(count(cartesian_product($data))); // 2 * 3 * 2 = 12
Installation
PHP 7.4+ is required.
composer require bentools/cartesian-product
Performance test
The following example was executed on my Core i7 personnal computer with 8GB RAM.
require_once __DIR__ . '/vendor/autoload.php'; use function BenTools\CartesianProduct\cartesian_product; $data = array_fill(0, 10, array_fill(0, 5, 'foo')); $start = microtime(true); foreach (cartesian_product($data) as $c => $combination) { continue; } $end = microtime(true); printf( 'Generated %d combinations in %ss - Memory usage: %sMB / Peak usage: %sMB', ++$c, round($end - $start, 3), round(memory_get_usage() / 1024 / 1024), round(memory_get_peak_usage() / 1024 / 1024) );
Output:
Generated 9765625 combinations in 1.61s - Memory usage: 0MB / Peak usage: 1MB
Unit tests
./vendor/bin/phpunit
Other implementations
patchranger/cartesian-iterator
See also
Credits
Titus on StackOverflow - you really rock.