Completed
Push — master ( 40661e...9dc04a )
by Doug
08:46
created

WeightRedistributor::equaliseWeight()   B

Complexity

Conditions 7
Paths 12

Size

Total Lines 53
Code Lines 34

Duplication

Lines 0
Ratio 0 %

Code Coverage

Tests 27
CRAP Score 7.4277

Importance

Changes 3
Bugs 1 Features 0
Metric Value
cc 7
eloc 34
c 3
b 1
f 0
nc 12
nop 3
dl 0
loc 53
ccs 27
cts 34
cp 0.7941
crap 7.4277
rs 8.4426

How to fix   Long Method   

Long Method

Small methods make your code easier to understand, in particular if combined with a good name. Besides, if your method is small, finding a good name is usually much easier.

For example, if you find yourself adding comments to a method's body, this is usually a good sign to extract the commented part to a new method, and use the comment as a starting point when coming up with a good name for this new method.

Commonly applied refactorings include:

1
<?php
2
/**
3
 * Box packing (3D bin packing, knapsack problem).
4
 *
5
 * @author Doug Wright
6
 */
7
declare(strict_types=1);
8
9
namespace DVDoug\BoxPacker;
10
11
use function array_filter;
12
use function array_merge;
13
use function count;
14
use function iterator_to_array;
15
use Psr\Log\LoggerAwareInterface;
16
use Psr\Log\LoggerAwareTrait;
17
use Psr\Log\LogLevel;
18
use Psr\Log\NullLogger;
19
use SplObjectStorage;
20
use function usort;
21
22
/**
23
 * Actual packer.
24
 *
25
 * @author Doug Wright
26
 * @internal
27
 */
28
class WeightRedistributor implements LoggerAwareInterface
29
{
30
    use LoggerAwareTrait;
31
32
    /**
33
     * List of box sizes available to pack items into.
34
     *
35
     * @var BoxList
36
     */
37
    private $boxes;
38
39
    /**
40
     * Quantities available of each box type.
41
     *
42
     * @var SplObjectStorage|int[]
43
     */
44
    private $boxesQtyAvailable;
45
46
    /**
47
     * Constructor.
48
     */
49 13
    public function __construct(BoxList $boxList, SplObjectStorage $boxQuantitiesAvailable)
50
    {
51 13
        $this->boxes = $boxList;
52 13
        $this->boxesQtyAvailable = $boxQuantitiesAvailable;
53 13
        $this->logger = new NullLogger();
54 13
    }
55
56
    /**
57
     * Given a solution set of packed boxes, repack them to achieve optimum weight distribution.
58
     */
59 13
    public function redistributeWeight(PackedBoxList $originalBoxes): PackedBoxList
60
    {
61 13
        $targetWeight = $originalBoxes->getMeanItemWeight();
62 13
        $this->logger->log(LogLevel::DEBUG, "repacking for weight distribution, weight variance {$originalBoxes->getWeightVariance()}, target weight {$targetWeight}");
63
64
        /** @var PackedBox[] $boxes */
65 13
        $boxes = iterator_to_array($originalBoxes);
66
67
        usort($boxes, static function (PackedBox $boxA, PackedBox $boxB) {
68 13
            return $boxB->getWeight() <=> $boxA->getWeight();
69 13
        });
70
71
        do {
72 13
            $iterationSuccessful = false;
73
74 13
            foreach ($boxes as $a => &$boxA) {
75 13
                foreach ($boxes as $b => &$boxB) {
76 13
                    if ($b <= $a || $boxA->getWeight() === $boxB->getWeight()) {
77 13
                        continue; //no need to evaluate
78
                    }
79
80 9
                    $iterationSuccessful = $this->equaliseWeight($boxA, $boxB, $targetWeight);
81 9
                    if ($iterationSuccessful) {
82
                        $boxes = array_filter($boxes, static function (?PackedBox $box) { //remove any now-empty boxes from the list
83 7
                            return $box instanceof PackedBox;
84 7
                        });
85 7
                        break 2;
86
                    }
87
                }
88
            }
89 13
        } while ($iterationSuccessful);
90
91
        //Combine back into a single list
92 13
        $packedBoxes = new PackedBoxList();
93 13
        $packedBoxes->insertFromArray($boxes);
94
95 13
        return $packedBoxes;
96
    }
97
98
    /**
99
     * Attempt to equalise weight distribution between 2 boxes.
100
     *
101
     * @return bool was the weight rebalanced?
102
     */
103 9
    private function equaliseWeight(PackedBox &$boxA, PackedBox &$boxB, float $targetWeight): bool
104
    {
105 9
        $anyIterationSuccessful = false;
106
107 9
        if ($boxA->getWeight() > $boxB->getWeight()) {
108 9
            $overWeightBox = $boxA;
109 9
            $underWeightBox = $boxB;
110
        } else {
111 3
            $overWeightBox = $boxB;
112 3
            $underWeightBox = $boxA;
113
        }
114
115 9
        $overWeightBoxItems = $overWeightBox->getItems()->asItemArray();
116 9
        $underWeightBoxItems = $underWeightBox->getItems()->asItemArray();
117
118 9
        foreach ($overWeightBoxItems as $key => $overWeightItem) {
119 9
            if (!static::wouldRepackActuallyHelp($overWeightBoxItems, $overWeightItem, $underWeightBoxItems, $targetWeight)) {
120 9
                continue; // moving this item would harm more than help
121
            }
122
123 7
            $newLighterBoxes = $this->doVolumeRepack(array_merge($underWeightBoxItems, [$overWeightItem]), $underWeightBox->getBox());
124 7
            if ($newLighterBoxes->count() !== 1) {
125
                continue; //only want to move this item if it still fits in a single box
126
            }
127
128 7
            $underWeightBoxItems[] = $overWeightItem;
129
130 7
            if (count($overWeightBoxItems) === 1) { //sometimes a repack can be efficient enough to eliminate a box
131
                $boxB = $newLighterBoxes->top();
132
                $boxA = null;
133
                $this->boxesQtyAvailable[$boxB->getBox()] = $this->boxesQtyAvailable[$boxB->getBox()] - 1;
134
                $this->boxesQtyAvailable[$overWeightBox->getBox()] = $this->boxesQtyAvailable[$overWeightBox->getBox()] + 1;
135
136
                return true;
137
            }
138
139 7
            unset($overWeightBoxItems[$key]);
140 7
            $newHeavierBoxes = $this->doVolumeRepack($overWeightBoxItems, $overWeightBox->getBox());
141 7
            if (count($newHeavierBoxes) !== 1) {
142
                continue; //this should never happen, if we can pack n+1 into the box, we should be able to pack n
143
            }
144
145 7
            $this->boxesQtyAvailable[$boxA->getBox()] = $this->boxesQtyAvailable[$boxA->getBox()] + 1;
146 7
            $this->boxesQtyAvailable[$boxB->getBox()] = $this->boxesQtyAvailable[$boxB->getBox()] + 1;
147 7
            $this->boxesQtyAvailable[$newHeavierBoxes->top()->getBox()] = $this->boxesQtyAvailable[$newHeavierBoxes->top()->getBox()] - 1;
148 7
            $this->boxesQtyAvailable[$newLighterBoxes->top()->getBox()] = $this->boxesQtyAvailable[$newLighterBoxes->top()->getBox()] - 1;
149 7
            $underWeightBox = $boxB = $newLighterBoxes->top();
150 7
            $boxA = $newHeavierBoxes->top();
151
152 7
            $anyIterationSuccessful = true;
153
        }
154
155 9
        return $anyIterationSuccessful;
156
    }
157
158
    /**
159
     * Do a volume repack of a set of items.
160
     */
161 7
    private function doVolumeRepack(iterable $items, Box $currentBox): PackedBoxList
162
    {
163 7
        $packer = new Packer();
164 7
        $packer->setBoxes($this->boxes); // use the full set of boxes to allow smaller/larger for full efficiency
165 7
        foreach ($this->boxes as $box) {
166 7
            $packer->setBoxQuantity($box, $this->boxesQtyAvailable[$box]);
167
        }
168 7
        $packer->setBoxQuantity($currentBox, max(PHP_INT_MAX, $this->boxesQtyAvailable[$currentBox] + 1));
169 7
        $packer->setItems($items);
170
171 7
        return $packer->doVolumePacking(true, true);
172
    }
173
174
    /**
175
     * Not every attempted repack is actually helpful - sometimes moving an item between two otherwise identical
176
     * boxes, or sometimes the box used for the now lighter set of items actually weighs more when empty causing
177
     * an increase in total weight.
178
     */
179 9
    private static function wouldRepackActuallyHelp(array $overWeightBoxItems, Item $overWeightItem, array $underWeightBoxItems, float $targetWeight): bool
180
    {
181
        $overWeightItemsWeight = array_sum(array_map(static function (Item $item) {return $item->getWeight(); }, $overWeightBoxItems));
182
        $underWeightItemsWeight = array_sum(array_map(static function (Item $item) {return $item->getWeight(); }, $underWeightBoxItems));
183
184 9
        if ($overWeightItem->getWeight() + $underWeightItemsWeight > $targetWeight) {
185 9
            return false;
186
        }
187
188 7
        $oldVariance = static::calculateVariance($overWeightItemsWeight, $underWeightItemsWeight);
0 ignored issues
show
Bug introduced by
It seems like $overWeightItemsWeight can also be of type double; however, parameter $boxAWeight of DVDoug\BoxPacker\WeightR...or::calculateVariance() does only seem to accept integer, maybe add an additional type check? ( Ignorable by Annotation )

If this is a false-positive, you can also ignore this issue in your code via the ignore-type  annotation

188
        $oldVariance = static::calculateVariance(/** @scrutinizer ignore-type */ $overWeightItemsWeight, $underWeightItemsWeight);
Loading history...
Bug introduced by
It seems like $underWeightItemsWeight can also be of type double; however, parameter $boxBWeight of DVDoug\BoxPacker\WeightR...or::calculateVariance() does only seem to accept integer, maybe add an additional type check? ( Ignorable by Annotation )

If this is a false-positive, you can also ignore this issue in your code via the ignore-type  annotation

188
        $oldVariance = static::calculateVariance($overWeightItemsWeight, /** @scrutinizer ignore-type */ $underWeightItemsWeight);
Loading history...
189 7
        $newVariance = static::calculateVariance($overWeightItemsWeight - $overWeightItem->getWeight(), $underWeightItemsWeight + $overWeightItem->getWeight());
190
191 7
        return $newVariance < $oldVariance;
192
    }
193
194 7
    private static function calculateVariance(int $boxAWeight, int $boxBWeight)
195
    {
196 7
        return ($boxAWeight - (($boxAWeight + $boxBWeight) / 2)) ** 2; //don't need to calculate B and ÷ 2, for a 2-item population the difference from mean is the same for each box
197
    }
198
}
199