Bernard\Driver\InMemory\Driver

Complexity

Total Complexity

15

Size/Duplication

Total Lines	92
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	0

Test Coverage

Coverage

14.58%

Importance

Changes

0

9 Methods

Rating	Name	Duplication	Size	Complexity
A	listQueues()	0	4	1
A	createQueue()	0	6	2
A	countMessages()	0	8	2
A	pushMessage()	0	4	1
A	popMessage()	0	8	3
A	acknowledgeMessage()	0	4	1
A	peekQueue()	0	8	2
A	removeQueue()	0	6	2
A	info()	0	4	1

<?php

namespace Bernard\Driver\InMemory;

/**
 * Simple in-memory driver.
 *
 * @author Márk Sági-Kazár <mark.sagikazar@gmail.com>
 */
final class Driver implements \Bernard\Driver
{
    private $queues = [];

    /**
     * {@inheritdoc}
     */
    public function listQueues()
    {
        return array_keys($this->queues);
    }

    /**
     * {@inheritdoc}
     */
    public function createQueue($queueName)
    {
        if (!array_key_exists($queueName, $this->queues)) {
            $this->queues[$queueName] = [];
        }
    }

    /**
     * {@inheritdoc}
     */
    public function countMessages($queueName)
    {
        if (array_key_exists($queueName, $this->queues)) {
            return count($this->queues[$queueName]);
        }

        return 0;
    }

    /**
     * {@inheritdoc}
     */
    public function pushMessage($queueName, $message)
    {
        $this->queues[$queueName][] = $message;
    }

    /**
     * {@inheritdoc}
     */
    public function popMessage($queueName, $duration = 5)
    {
        if (!array_key_exists($queueName, $this->queues) || count($this->queues[$queueName]) < 1) {
            return [null, null];
        }

        return [array_shift($this->queues[$queueName]), null];
    }

    /**
     * {@inheritdoc}
     */
    public function acknowledgeMessage($queueName, $receipt)
    {
        // Noop
    }

    /**
     * {@inheritdoc}
     */
    public function peekQueue($queueName, $index = 0, $limit = 20)
    {
        if (array_key_exists($queueName, $this->queues)) {
            return array_slice($this->queues[$queueName], $index, $limit);
        }

        return null;
    }

    /**
     * {@inheritdoc}
     */
    public function removeQueue($queueName)
    {
        if (array_key_exists($queueName, $this->queues)) {
            unset($this->queues[$queueName]);
        }
    }

    /**
     * {@inheritdoc}
     */
    public function info()
    {
        return [];
    }
}