InMemoryQueue::count() - Code Metrics - bernardphp/bernard - Measure and Improve Code Quality continuously with Scrutinizer

InMemoryQueue::count() A
last analyzed 2019-10-20 16:13 UTC

↳ Parent: InMemoryQueue

Complexity

Conditions	1
Paths	1

Size

Total Lines

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	3
CRAP Score	1.064

Importance

Changes

Metric	Value
dl	0
loc	6
ccs	3
cts	5
cp	0.6
rs	10
c	0
b	0
f	0
cc	1
nc	1
nop	0
crap	1.064

<?php

namespace Bernard\Queue;

use Bernard\Envelope;

/**
 * Wrapper around SplQueue.
 */
class InMemoryQueue extends AbstractQueue
{
    protected $queue;

    /**
     * {@inheritdoc}
     */
    public function __construct($name)
    {
        parent::__construct($name);

        $this->queue = new \SplQueue();
        $this->queue->setIteratorMode(\SplQueue::IT_MODE_DELETE);
    }

    /**
     * {@inheritdoc}
     */
    public function count()
    {
        $this->errorIfClosed();

        return $this->queue->count();
    }

    /**
     * {@inheritdoc}
     */
    public function enqueue(Envelope $envelope)
    {
        $this->errorIfClosed();

        $this->queue->enqueue($envelope);
    }

    /**
     * {@inheritdoc}
     */
    public function dequeue()
    {
        $this->errorIfClosed();

        if ($this->count()) {
            return $this->queue->dequeue();
        }

        usleep(10000);

        return;
    }

    /**
     * {@inheritdoc}
     */
    public function peek($index = 0, $limit = 20)
    {
        $this->errorIfClosed();

        $envelopes = [];
        $queue = clone $this->queue;
        $key = 0;

        while ($queue->count() && count($envelopes) < $limit && $envelope = $queue->dequeue()) {
            if ($key++ < $index) {
                continue;
            }

            $envelopes[] = $envelope;
        }

        return $envelopes;
    }
}


1		<?php
2
3		namespace Bernard\Queue;
4
5		use Bernard\Envelope;
6
7		/**
8		* Wrapper around SplQueue.
9		*/
10		class InMemoryQueue extends AbstractQueue
11		{
12		protected $queue;
13
14		/**
15		* {@inheritdoc}
16		*/
17	36	public function __construct($name)
18		{
19	36	parent::__construct($name);
20
21	36	$this->queue = new \SplQueue();
22	36	$this->queue->setIteratorMode(\SplQueue::IT_MODE_DELETE);
23	36	}
24
25		/**
26		* {@inheritdoc}
27		*/
28	17	public function count()
29		{
30	17	$this->errorIfClosed();
31
32	16	return $this->queue->count();
33		}
34
35		/**
36		* {@inheritdoc}
37		*/
38	17	public function enqueue(Envelope $envelope)
39		{
40	17	$this->errorIfClosed();
41
42	16	$this->queue->enqueue($envelope);
43	16	}
44
45		/**
46		* {@inheritdoc}
47		*/
48	15	public function dequeue()
49		{
50	15	$this->errorIfClosed();
51
52	14	if ($this->count()) {
53	12	return $this->queue->dequeue();
54		}
55
56	7	usleep(10000);
57
58	7	return;
59		}
60
61		/**
62		* {@inheritdoc}
63		*/
64	4	public function peek($index = 0, $limit = 20)
65		{
66	4	$this->errorIfClosed();
67
68	2	$envelopes = [];
69	2	$queue = clone $this->queue;
70	2	$key = 0;
71
72	2	while ($queue->count() && count($envelopes) < $limit && $envelope = $queue->dequeue()) {
73	2	if ($key++ < $index) {
74	1	continue;
75		}
76
77	2	$envelopes[] = $envelope;
78	2	}
79
80	2	return $envelopes;
81		}
82		}
83

bernardphp / bernard

GitHub Access Token became invalid

InMemoryQueue::count() A last analyzed 2019-10-20 16:13 UTC

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like

InMemoryQueue::count() A
last analyzed 2019-10-20 16:13 UTC