Code Coverage |
||||||||||
Lines |
Functions and Methods |
Classes and Traits |
||||||||
| Total | |
0.00% |
0 / 12 |
|
0.00% |
0 / 3 |
CRAP | |
0.00% |
0 / 1 |
| WeightStrategy | |
0.00% |
0 / 12 |
|
0.00% |
0 / 3 |
30 | |
0.00% |
0 / 1 |
| pickNextTask | |
0.00% |
0 / 3 |
|
0.00% |
0 / 1 |
2 | |||
| getWaitTime | |
0.00% |
0 / 1 |
|
0.00% |
0 / 1 |
2 | |||
| pickQueueByWight | |
0.00% |
0 / 8 |
|
0.00% |
0 / 1 |
12 | |||
| 1 | <?php |
| 2 | |
| 3 | /** |
| 4 | * This program is free software; you can redistribute it and/or |
| 5 | * modify it under the terms of the GNU General Public License |
| 6 | * as published by the Free Software Foundation; under version 2 |
| 7 | * of the License (non-upgradable). |
| 8 | * |
| 9 | * This program is distributed in the hope that it will be useful, |
| 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 12 | * GNU General Public License for more details. |
| 13 | * |
| 14 | * You should have received a copy of the GNU General Public License |
| 15 | * along with this program; if not, write to the Free Software |
| 16 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. |
| 17 | * |
| 18 | * Copyright (c) 2017 (original work) Open Assessment Technologies SA (under the project TAO-PRODUCT); |
| 19 | * |
| 20 | */ |
| 21 | |
| 22 | namespace oat\taoTaskQueue\model\TaskSelector; |
| 23 | |
| 24 | use oat\oatbox\log\LoggerAwareTrait; |
| 25 | use oat\oatbox\PhpSerializeStateless; |
| 26 | use oat\tao\model\taskQueue\Queue\TaskSelector\SelectorStrategyInterface; |
| 27 | use oat\taoTaskQueue\model\QueueInterface; |
| 28 | use Psr\Log\LoggerAwareInterface; |
| 29 | |
| 30 | /** |
| 31 | * Implements a strategy for selecting a queue randomly taking into account the known weights. |
| 32 | * |
| 33 | * @deprecated Use \oat\tao\model\taskQueue\Queue\TaskSelector\WeightStrategy |
| 34 | * |
| 35 | * @author Gyula Szucs <gyula@taotesting.com> |
| 36 | */ |
| 37 | class WeightStrategy implements SelectorStrategyInterface, LoggerAwareInterface |
| 38 | { |
| 39 | use LoggerAwareTrait; |
| 40 | use PhpSerializeStateless; |
| 41 | |
| 42 | /** |
| 43 | * @inheritdoc |
| 44 | */ |
| 45 | public function pickNextTask(array $queues) |
| 46 | { |
| 47 | $pickedQueue = $this->pickQueueByWight($queues); |
| 48 | |
| 49 | $this->logDebug('Queue "' . strtoupper($pickedQueue->getName()) . '" picked by WeightStrategy'); |
| 50 | |
| 51 | return $pickedQueue->dequeue(); |
| 52 | } |
| 53 | |
| 54 | /** |
| 55 | * @return int |
| 56 | */ |
| 57 | public function getWaitTime() |
| 58 | { |
| 59 | return 1; |
| 60 | } |
| 61 | |
| 62 | /** |
| 63 | * Picks randomly a queue based on weight. |
| 64 | * |
| 65 | * For example, an array like ['A'=>5, 'B'=>45, 'C'=>50] means that "A" has a 5% chance of being selected, |
| 66 | * "B" 45%, and "C" 50%. |
| 67 | * The values are simply relative to each other. If one value weight was 2, and the other weight of 1, |
| 68 | * the value with the weight of 2 has about a 66% chance of being selected. |
| 69 | * |
| 70 | * @inheritdoc |
| 71 | */ |
| 72 | private function pickQueueByWight(array $queues) |
| 73 | { |
| 74 | $weights = array_map(function (QueueInterface $queue) { |
| 75 | return $queue->getWeight(); |
| 76 | }, $queues); |
| 77 | |
| 78 | $rand = mt_rand(1, array_sum($weights)); |
| 79 | |
| 80 | /** @var QueueInterface $queue */ |
| 81 | foreach ($queues as $queue) { |
| 82 | $rand -= $queue->getWeight(); |
| 83 | if ($rand <= 0) { |
| 84 | return $queue; |
| 85 | } |
| 86 | } |
| 87 | } |
| 88 | } |