1
|
|
|
<?php |
2
|
|
|
|
3
|
|
|
namespace drupol\phpartition; |
4
|
|
|
|
5
|
|
|
class SubsetContainer extends \SplHeap |
6
|
|
|
{ |
7
|
|
|
|
8
|
|
|
/** |
9
|
|
|
* @var BasePartitionAlgorithm |
10
|
|
|
*/ |
11
|
|
|
protected $algo; |
12
|
|
|
|
13
|
|
|
/** |
14
|
|
|
* Override compare method. |
15
|
|
|
* |
16
|
|
|
* @param Subset $a |
17
|
|
|
* @param Subset $b |
18
|
|
|
* |
19
|
|
|
* @return int |
20
|
|
|
*/ |
21
|
|
|
public function compare($a, $b) |
|
|
|
|
22
|
|
|
{ |
23
|
|
|
$al = $a->getAlgo()->getSubsetWeight($a); |
|
|
|
|
24
|
|
|
$bl = $b->getAlgo()->getSubsetWeight($b); |
|
|
|
|
25
|
|
|
|
26
|
|
|
if ($al == $bl) { |
27
|
|
|
return 0; |
28
|
|
|
} |
29
|
|
|
return ($al > $bl) ? -1 : +1; |
30
|
|
|
} |
31
|
|
|
|
32
|
|
|
/** |
33
|
|
|
* @param $partition |
34
|
|
|
*/ |
35
|
|
|
public function setPartition($partition) |
36
|
|
|
{ |
37
|
|
|
for ($i=0; $i<$partition; $i++) { |
38
|
|
|
$subset = new Subset(); |
39
|
|
|
$subset->setAlgo($this->getAlgo()); |
40
|
|
|
$this->insert($subset); |
41
|
|
|
} |
42
|
|
|
} |
43
|
|
|
|
44
|
|
|
/** |
45
|
|
|
* @param SubsetItem[] $items |
46
|
|
|
*/ |
47
|
|
|
public function addItemsToSubset(array $items = array()) |
48
|
|
|
{ |
49
|
|
|
foreach ($items as $item) { |
50
|
|
|
$this->addItemToSubset($item); |
51
|
|
|
} |
52
|
|
|
} |
53
|
|
|
|
54
|
|
|
/** |
55
|
|
|
* @param \drupol\phpartition\SubsetItem $item |
56
|
|
|
*/ |
57
|
|
|
public function addItemToSubset(SubsetItem $item) |
58
|
|
|
{ |
59
|
|
|
$this->top(); |
60
|
|
|
$subset = $this->extract(); |
61
|
|
|
$subset->addItem($item); |
62
|
|
|
$this->insert($subset); |
63
|
|
|
} |
64
|
|
|
|
65
|
|
|
/** |
66
|
|
|
* @return Subset[] |
67
|
|
|
*/ |
68
|
|
View Code Duplication |
public function getSubsets() |
|
|
|
|
69
|
|
|
{ |
70
|
|
|
$data = array(); |
71
|
|
|
$clone = clone $this; |
72
|
|
|
|
73
|
|
|
for ($clone->top(); $clone->valid(); $clone->next()) { |
74
|
|
|
$data[] = $clone->current(); |
75
|
|
|
} |
76
|
|
|
|
77
|
|
|
return $data; |
78
|
|
|
} |
79
|
|
|
|
80
|
|
|
/** |
81
|
|
|
* @return array |
82
|
|
|
*/ |
83
|
|
View Code Duplication |
public function getSubsetsAndItemsAsArray() |
|
|
|
|
84
|
|
|
{ |
85
|
|
|
$data = array(); |
86
|
|
|
|
87
|
|
|
foreach ($this->getSubsets() as $subset) { |
88
|
|
|
$data[] = $subset->getRawItems(); |
89
|
|
|
} |
90
|
|
|
|
91
|
|
|
return array_values(array_filter($data)); |
92
|
|
|
} |
93
|
|
|
|
94
|
|
|
/** |
95
|
|
|
* @param \drupol\phpartition\BasePartitionAlgorithm $algo |
96
|
|
|
*/ |
97
|
|
|
public function setAlgo(BasePartitionAlgorithm $algo) |
98
|
|
|
{ |
99
|
|
|
$this->algo = $algo; |
100
|
|
|
} |
101
|
|
|
|
102
|
|
|
/** |
103
|
|
|
* @return BasePartitionAlgorithm |
104
|
|
|
*/ |
105
|
|
|
public function getAlgo() |
106
|
|
|
{ |
107
|
|
|
return $this->algo; |
108
|
|
|
} |
109
|
|
|
} |
110
|
|
|
|
Short variable names may make your code harder to understand. Variable names should be self-descriptive. This check looks for variable names who are shorter than a configured minimum.