DependencyGraph::getDependencyArrows() - Code Metrics - Inspection of "verify by @deps-internal" - nazonohito51/dependency-analyzer - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( da3a15...020c57 )

by Satoshi

created 2019-05-03 16:44 UTC

DependencyGraph::getDependencyArrows() A

↳ Parent: DependencyGraph

Complexity

Conditions	2
Paths	2

Size

Total Lines	9
Code Lines	4

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	2
eloc	4
nc	2
nop	0
dl	0
loc	9
rs	10
c	0
b	0
f	0

<?php
declare(strict_types=1);

namespace DependencyAnalyzer;

use DependencyAnalyzer\DependencyGraph\ClassLike;
use DependencyAnalyzer\DependencyGraph\DependencyArrow;
use DependencyAnalyzer\DependencyGraph\DependencyTypes\Base as DependencyType;
use DependencyAnalyzer\DependencyGraph\Path;
use DependencyAnalyzer\Exceptions\InvalidEdgeOnDependencyGraphException;
use DependencyAnalyzer\DependencyGraph\StructuralElementPatternMatcher;
use Fhaculty\Graph\Edge\Directed;
use Fhaculty\Graph\Graph;
use Fhaculty\Graph\Set\Vertices;
use Fhaculty\Graph\Vertex;

class DependencyGraph implements \Countable
{
    const DEPENDENCY_TYPE_KEY = 'dependency_types';

    const TYPE_SOME_DEPENDENCY = 'some_dependency';
    const TYPE_NEW = 'new';
    const TYPE_METHOD_CALL = 'method_call';
    const TYPE_PROPERTY_FETCH = 'property_fetch';
    const TYPE_CONSTANT_FETCH = 'constant_fetch';
    const TYPE_EXTENDS = 'extends';
    const TYPE_IMPLEMENTS = 'implements';
    const TYPE_USE_TRAIT = 'use_trait';

    /**
     * @var Graph
     */
    private $graph;

    public function __construct(Graph $graph)
    {
        foreach ($graph->getEdges() as $edge) {
            if (!$edge instanceof Directed) {
                throw new InvalidEdgeOnDependencyGraphException($edge);
            }
        }
        $this->graph = $graph;
    }

    public function getGraph()
    {
        return $this->graph;
    }

    /**
     * @return ClassLike[]
     */
    public function getClasses(): array
    {
        $ret = [];
        foreach ($this->graph->getVertices() as $vertex) {
            $ret[] = new ClassLike($vertex);
        }

        return $ret;
    }

    /**
     * @return DependencyArrow[]
     */
    public function getDependencyArrows(): array
    {
        $ret = [];

        foreach ($this->graph->getEdges() as $edge) {
            $ret[] = new DependencyArrow($edge);
        }

        return $ret;
    }

    public function groupByPattern(string $name, StructuralElementPatternMatcher $pattern)
    {
        $graph = new Graph();
        $graph->createVertex($name);
        $graph->createVertex(/** @scrutinizer ignore-type */ $name);
        foreach ($this->getClasses() as $class) {
            if (!$pattern->isMatch($class->getName())) {
                $graph->createVertex($class->getName());
            }
        }

        foreach ($this->getDependencyArrows() as $dependencyArrow) {
            $start = $pattern->isMatch($dependencyArrow->getDependerName()) ? $name : $dependencyArrow->getDependerName();
            $end = $pattern->isMatch($dependencyArrow->getDependeeName()) ? $name : $dependencyArrow->getDependeeName();

            if ($start !== $end && !$graph->getVertex($start)->hasEdgeTo($graph->getVertex($end))) {
                $graph->getVertex($start)->createEdgeTo($graph->getVertex($end));
            }
        }

        return new self($graph);
    }

    public function getConnectedSubGraphsStartFrom(Vertex $vertex)
    {
        $vertices = $this->collectConnectedVertices($vertex);
        return new self($this->graph->createGraphCloneVertices($vertices));
    }

    protected function collectConnectedVertices(Vertex $start)
    {
        $visited = [];

        /**
         * @var Vertex[] $queue
         */
        $queue = [$start];
        // Breadth first search
        do {
            $target = array_shift($queue);
            $visited[$target->getId()]= $target;

            foreach ($target->getVerticesEdgeTo()->getMap() as $id => $vertexTo) {
                if (!isset($visited[$id])) {
                    $queue[] = $vertexTo;
                }
            }
        } while ($queue);

        return new Vertices(array_values($visited));
    }

    public function walkOnPath(callable $carry)
    {
        foreach ($this->graph->getEdges() as $edge) {
            $this->walkThroughEdge($edge, new Path(), $carry);
        }
    }

    protected function walkThroughEdge(Directed $edge, Path $path, callable $carry)
    {
        $path = $path->addEdge($edge);
        $carry($path);

        if (!$path->haveCycle()) {
            $edgesOut = $edge->getVertexEnd()->getEdgesOut();
            foreach ($edgesOut as $edgeOut) {
                $this->walkThroughEdge($edgeOut, $path, $carry);
            }
        }
    }

    public function toArray()
    {
        $ret = [];

        foreach ($this->graph->getVertices() as $vertex) {
            $ret[$vertex->getId()] = [];

            foreach ($vertex->getEdgesOut() as $edge) {
                /** @var Directed $edge */
                $types = $edge->getAttribute(DependencyGraph::DEPENDENCY_TYPE_KEY) ?? [];

                $ret[$vertex->getId()][$edge->getVertexEnd()->getId()] = array_map(function (DependencyType $type) {
                    return $type->toString();
                }, $types);
            }
        }

        return $ret;
    }

    public function count()
    {
        return count($this->graph->getVertices());
    }
}


nazonohito51 / dependency-analyzer

Push — master ( da3a15...020c57 )

DependencyGraph::getDependencyArrows() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like