Algorithms\DijkstraCache

Complexity

Total Complexity

7

Size/Duplication

Total Lines	38
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	0

Importance

Changes	1
Bugs	0	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	cacheMany()	0	14	3
A	cacheOne()	0	8	2
A	loadMany()	0	4	1
A	loadOne()	0	6	1

<?php
namespace Algorithms;

abstract class DijkstraCache
{
    protected static function cacheMany($currentData, $many)
    {
        if (empty($currentData)) {
            $currentData = $many();
        } else {
            foreach ($many() as $point => $tracks) {
                $currentData = self::cacheOne($currentData, $point, function () use ($tracks) {
                    return $tracks;
                });
            }
        }

        return $currentData;
    }

    protected static function cacheOne($currentData, $point, $one)
    {
        if (empty($currentData[$point])) {
            $currentData[$point] = $one();
        }

        return $currentData;
    }

    public static function loadMany(&$currentData, $callback)
    {
        return self::cacheMany($currentData, $callback);
    }

    public static function loadOne(&$currentData, $point, $callback)
    {
        $currentData = self::cacheOne($currentData, $point, $callback);

        return $currentData[$point];
    }
}