Bernard\Driver\PrefetchMessageCache

Complexity

Total Complexity

5

Size/Duplication

Total Lines	49
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	0

Test Coverage

Coverage

68.42%

Importance

Changes

0

3 Methods

Rating	Name	Duplication	Size	Complexity
A	push()	0	5	1
A	pop()	0	8	2
A	get()	0	8	2

<?php

namespace Bernard\Driver;

class PrefetchMessageCache
{
    protected $caches = [];

    /**
     * Pushes a $message to the end of the cache.
     *
     * @param string $queueName
     * @param array  $message
     */
    public function push($queueName, array $message)
    {
        $cache = $this->get($queueName);
        $cache->enqueue($message);
    }

    /**
     * Get the next message in line. Or nothing if there is no more
     * in the cache.
     *
     * @param string $queueName
     *
     * @return array|null
     */
    public function pop($queueName)
    {
        $cache = $this->get($queueName);

        if (!$cache->isEmpty()) {
            return $cache->dequeue();
        }
    }

    /**
     * Create the queue cache internally if it doesn't yet exists.
     *
     * @param string $queueName
     *
     * @return \SplQueue
     */
    protected function get($queueName)
    {
        if (isset($this->caches[$queueName])) {
            return $this->caches[$queueName];
        }

        return $this->caches[$queueName] = new \SplQueue();
    }
}