drupol\phpartition\Algorithm\BruteForce::getResult()

Complexity

Conditions	7
Paths	12

Size

Total Lines	35
Code Lines	23

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	28
CRAP Score	7

Importance

Changes

0

<?php
    public function getResult()
    {
        $this->getDataPartition()->sortByValue('ASC');
        $partitionSize = ($this->getSize() > $this->getDataPartition()->size()) ?
          $this->getDataPartition()->size() :
          $this->getSize();

        for ($p = $partitionSize; $p > 1; $p--) {
            $best = $this->getDataPartition()->getWeight();
            $target = ($best) / $p;
            $goodSubset = array();
            $maxSize = floor($this->getDataPartition()->size() / $p);

            for ($i = 1; $i <= $maxSize; $i++) {
                $permutations = new Permutations($this->getDataPartition()->toArray(), $i);
                foreach ($permutations->generator() as $subset) {
                    $x = 0;
                    foreach ($subset as $item) {
                        $x += $item->getValue();
                        if (abs($x - $target) - abs($best - $target) < 0) {
                            $best = $x;
                            $goodSubset = $subset;
                        }
                    }
                }
            }

            $this->getPartitionContainer()->insert($this->getPartition()->addItems($goodSubset));
            $this->getDataPartition()->deleteItems($goodSubset);
        }

        $this->getPartitionContainer()->insert($this->getPartition()->addItems($this->getDataPartition()->toArray()));

        return $this->getPartitionContainer()->getPartitionsItemsArray();
    }
}