Digia\GraphQL\Language\AST\Visitor\KindVisitor

Complexity

Total Complexity

5

Size/Duplication

Total Lines	63
Duplicated Lines	0 %

Importance

Changes

0

3 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	10	1
A	enterNode()	0	11	2
A	leaveNode()	0	11	2

<?php

namespace Digia\GraphQL\Language\AST\Visitor;

use Digia\GraphQL\Language\AST\Node\NodeInterface;
use Digia\GraphQL\Util\SerializationInterface;

class KindVisitor extends Visitor
{

    /**
     * @var array
     */
    protected $enterKinds = [];

    /**
     * @var array
     */
    protected $leaveKinds = [];

    /**
     * KindVisitor constructor.
     * @param array $enterKinds
     * @param array $leaveKinds
     * @param callable|null $enterFunction
     * @param callable|null $leaveFunction
     */
    public function __construct(
        array $enterKinds,
        array $leaveKinds,
        ?callable $enterFunction = null,
        ?callable $leaveFunction = null
    ) {
        parent::__construct($enterFunction, $leaveFunction);

        $this->enterKinds = $enterKinds;
        $this->leaveKinds = $leaveKinds;
    }


    /**
     * @inheritdoc
     */
    public function enterNode(
        NodeInterface $node,
        $key = null,
        ?NodeInterface $parent = null,
        array $path = []
    ): ?NodeInterface {
        if (\in_array($node->getKind(), $this->enterKinds, true)) {
            return parent::enterNode($node, $key, $parent, $path);
        }

        return $node;
    }

    /**
     * @inheritdoc
     */
    public function leaveNode(
        NodeInterface $node,
        $key = null,
        ?NodeInterface $parent = null,
        array $path = []
    ): ?NodeInterface {
        if (\in_array($node->getKind(), $this->leaveKinds, true)) {
            return parent::leaveNode($node, $key, $parent, $path);
        }

        return $node;
    }
}