HansOtt\GraphQL\Query\VisitorMany

Complexity

Total Complexity

9

Size/Duplication

Total Lines	40
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Test Coverage

Coverage

0%

Importance

Changes

0

5 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	4	1
A	beforeTraverse()	0	6	2
A	enterNode()	0	6	2
A	leaveNode()	0	6	2
A	afterTraverse()	0	6	2

<?php

namespace HansOtt\GraphQL\Query;

final class VisitorMany implements Visitor
{
    private $visitors;

    /**
     * @param Visitor[] $visitors
     */
    public function __construct(array $visitors)
    {
        $this->visitors = $visitors;
    }

    public function beforeTraverse(Document $document)
    {
        foreach ($this->visitors as $visitor) {
            $visitor->beforeTraverse($document);
        }
    }

    public function enterNode(Node $node)
    {
        foreach ($this->visitors as $visitor) {
            $visitor->enterNode($node);
        }
    }

    public function leaveNode(Node $node)
    {
        foreach ($this->visitors as $visitor) {
            $visitor->leaveNode($node);
        }
    }

    public function afterTraverse(Document $document)
    {
        foreach ($this->visitors as $visitor) {
            $visitor->afterTraverse($document);
        }
    }
}