PackedItemList::compare() - Code Metrics - Inspection of "API compatible backport of v2.x-dev" - dvdoug/BoxPacker - Measure and Improve Code Quality continuously with Scrutinizer

Completed

Push — 1.x-dev ( e51b9c )

by Doug

created 2017-08-27 10:45 UTC

PackedItemList::compare() A

↳ Parent: PackedItemList

Complexity

Conditions	3
Paths	3

Size

Total Lines	10
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	6
CRAP Score	3

Importance

Changes

Metric	Value
dl	0
loc	10
ccs	6
cts	6
cp	1
rs	9.4285
c	0
b	0
f	0
cc	3
eloc	7
nc	3
nop	2
crap	3

<?php
/**
 * Box packing (3D bin packing, knapsack problem)
 * @package BoxPacker
 * @author Doug Wright
 */
namespace DVDoug\BoxPacker;

/**
 * List of packed items, ordered by volume
 * @author Doug Wright
 * @package BoxPacker
 */
class PackedItemList extends \SplMaxHeap
{

    /**
     * Compare elements in order to place them correctly in the heap while sifting up.
     *
     * @see \SplMaxHeap::compare()
     *
     * @param PackedItem $itemA
     * @param PackedItem $itemB
     *
     * @return int
     */
    public function compare($itemA, $itemB)
    {
        if ($itemA->getItem()->getVolume() > $itemB->getItem()->getVolume()) {
            return 1;
        } elseif ($itemA->getItem()->getVolume() < $itemB->getItem()->getVolume()) {
            return -1;
        } else {
            return $itemA->getItem()->getWeight() - $itemB->getItem()->getWeight();
        }
    }

    /**
     * Get copy of this list as a standard PHP array
     * @return PackedItem[]
     */
    public function asArray()
    {
        $return = [];
        foreach (clone $this as $item) {
            $return[] = $item;
        }
        return $return;
    }

    /**
     * Get copy of this list as a standard PHP array
     * @return Item[]
     */
    public function asItemArray()
    {
        $return = [];
        foreach (clone $this as $item) {
            $return[] = $item->getItem();
        }
        return $return;
    }

    /**
     * Get copy of this list as a standard PHP array
     * @return ItemList
     */
    public function asItemList()
    {
        $return = new ItemList;
        foreach (clone $this as $packedItem) {
            $return->insert($packedItem->getItem());
        }
        return $return;
    }
}


1		<?php
2		/**
3		* Box packing (3D bin packing, knapsack problem)
4		* @package BoxPacker
5		* @author Doug Wright
6		*/
7		namespace DVDoug\BoxPacker;
8
9		/**
10		* List of packed items, ordered by volume
11		* @author Doug Wright
12		* @package BoxPacker
13		*/
14		class PackedItemList extends \SplMaxHeap
15		{
16
17		/**
18		* Compare elements in order to place them correctly in the heap while sifting up.
19		*
20		* @see \SplMaxHeap::compare()
21		*
22		* @param PackedItem $itemA
23		* @param PackedItem $itemB
24		*
25		* @return int
26		*/
27	31	public function compare($itemA, $itemB)
28		{
29	31	if ($itemA->getItem()->getVolume() > $itemB->getItem()->getVolume()) {
30	12	return 1;
31	30	} elseif ($itemA->getItem()->getVolume() < $itemB->getItem()->getVolume()) {
32	4	return -1;
33		} else {
34	30	return $itemA->getItem()->getWeight() - $itemB->getItem()->getWeight();
35		}
36		}
37
38		/**
39		* Get copy of this list as a standard PHP array
40		* @return PackedItem[]
41		*/
42		public function asArray()
43		{
44		$return = [];
45		foreach (clone $this as $item) {
46		$return[] = $item;
47		}
48		return $return;
49		}
50
51		/**
52		* Get copy of this list as a standard PHP array
53		* @return Item[]
54		*/
55		public function asItemArray()
56		{
57		$return = [];
58		foreach (clone $this as $item) {
59		$return[] = $item->getItem();
60		}
61		return $return;
62		}
63
64		/**
65		* Get copy of this list as a standard PHP array
66		* @return ItemList
67		*/
68	33	public function asItemList()
69		{
70	33	$return = new ItemList;
71	33	foreach (clone $this as $packedItem) {
72	33	$return->insert($packedItem->getItem());
73		}
74	33	return $return;
75		}
76		}
77

dvdoug / BoxPacker

Push — 1.x-dev ( e51b9c )

PackedItemList::compare() A

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like