Skip to content

Instantly share code, notes, and snippets.

@koemeet
Created December 22, 2014 22:37
Show Gist options
  • Save koemeet/8eff6b8ad98ae76b74ac to your computer and use it in GitHub Desktop.
Save koemeet/8eff6b8ad98ae76b74ac to your computer and use it in GitHub Desktop.
Permutations variants
<?php
/*
* This file is part of the Sylius package.
*
* (c) Paweł Jędrzejewski
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace Sylius\Component\Variation\Generator;
use Sylius\Component\Resource\Repository\RepositoryInterface;
use Sylius\Component\Variation\Model\VariableInterface;
use Sylius\Component\Variation\Model\VariantInterface;
/**
* Abstract variant generator service implementation.
*
* It is used to create all possible combinations of object options
* and create Variant models from them.
*
* Example:
*
* If object has two options with 3 possible values each,
* this service will create 9 Variant's and assign them to the
* object. It ignores existing and invalid variants.
*
* @author Paweł Jędrzejewski <[email protected]>
*/
class VariantGenerator implements VariantGeneratorInterface
{
/**
* Variant manager.
*
* @var RepositoryInterface
*/
protected $variantRepository;
/**
* Constructor.
*
* @param RepositoryInterface $variantRepository
*/
public function __construct(RepositoryInterface $variantRepository)
{
$this->variantRepository = $variantRepository;
}
/**
* {@inheritdoc}
*/
public function generate(VariableInterface $variable)
{
if (!$variable->hasOptions()) {
throw new \InvalidArgumentException('Cannot generate variants for an object without options.');
}
$optionSet = array();
$optionMap = array();
$optionSet = array(
array(1, 2), // Color
array(4, 9) // Size
);
$optionMap = array(
1 => 'optionValueObject::S',
2 => 'M',
3 => 'L',
4 => 'XL'
);
foreach ($variable->getOptions() as $k => $option) {
foreach ($option->getValues() as $value) {
$optionSet[$k][] = $value->getId();
$optionMap[$value->getId()] = $value;
}
}
$permutations = $this->getPermutations($optionSet);
foreach ($permutations as $permutation) {
$variant = $this->variantRepository->createNew();
$variant->setObject($variable);
$variant->setDefaults($variable->getMasterVariant());
if (is_array($permutation)) {
foreach ($permutation as $id) {
$variant->addOption($optionMap[$id]);
}
} else {
$variant->addOption($optionMap[$permutation]);
}
$variable->addVariant($variant);
$this->process($variable, $variant);
}
}
/**
* Override if needed.
*
* @param VariableInterface $variable
* @param VariantInterface $variant
*/
protected function process(VariableInterface $variable, VariantInterface $variant)
{
}
/**
* Get all permutations of option set.
* Cartesian product.
*
* @param array $array
* @param Boolean $recursing
*
* @return array
*
* @throws \InvalidArgumentException
*/
protected function getPermutations($array, $recursing = false)
{
$countArrays = count($array);
if (1 === $countArrays) {
return reset($array);
} elseif (0 === $countArrays) {
throw new \InvalidArgumentException('At least one array is required.');
}
$keys = array_keys($array);
$a = array_shift($array);
$k = array_shift($keys);
$b = $this->getPermutations($array, true);
$result = array();
foreach ($a as $valueA) {
if ($valueA) {
foreach ($b as $valueB) {
if ($recursing) {
$result[] = array_merge(array($valueA), (array) $valueB);
} else {
$result[] = array($k => $valueA) + array_combine($keys, (array) $valueB);
}
}
}
}
return $result;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment