Romm\Formz\Condition\Parser\Node\BooleanNode

Complexity

Total Complexity

19

Size/Duplication

Total Lines	201
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Importance

Changes

0

11 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	6	1
A	getCssResult()	0	4	1
A	getJavaScriptResult()	0	4	1
A	getPhpResult()	0	4	1
A	getLogicalResult()	0	15	3
A	processLogicalAndCss()	0	14	3
A	processLogicalOrCss()	0	7	1
A	processLogicalAndJavaScript()	0	14	3
A	processLogicalOrJavaScript()	0	7	1
A	processLogicalAndPhp()	0	4	2
A	processLogicalOrPhp()	0	4	2

<?php
/*
 * 2016 Romain CANON <romain.hydrocanon@gmail.com>
 *
 * This file is part of the TYPO3 Formz project.
 * It is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License, either
 * version 3 of the License, or any later version.
 *
 * For the full copyright and license information, see:
 * http://www.gnu.org/licenses/gpl-3.0.html
 */

namespace Romm\Formz\Condition\Parser\Node;

use Romm\Formz\Condition\Parser\ConditionParser;

/**
 * A boolean node, which contains two sides and an operator.
 */
class BooleanNode extends AbstractNode
{

    /**
     * @var string
     */
    protected $operator;

    /**
     * @var AbstractNode
     */
    protected $leftSide;

    /**
     * @var AbstractNode
     */
    protected $rightSide;

    /**
     * Constructor.
     *
     * @param AbstractNode $leftSide  Left side of the boolean expression.
     * @param AbstractNode $rightSide Right side of the boolean expression.
     * @param string       $operator  One of the `ConditionParser::LOGICAL_*` constants.
     */
    public function __construct(AbstractNode $leftSide, AbstractNode $rightSide, $operator)
    {
        $this->leftSide = $leftSide;
        $this->rightSide = $rightSide;
        $this->operator = $operator;
    }

    /**
     * @inheritdoc
     */
    public function getCssResult()
    {
        return $this->getLogicalResult('processLogicalAndCss', 'processLogicalOrCss');
    }

    /**
     * @inheritdoc
     */
    public function getJavaScriptResult()
    {
        return $this->getLogicalResult('processLogicalAndJavaScript', 'processLogicalOrJavaScript');
    }

    /**
     * @inheritdoc
     */
    public function getPhpResult()
    {
        return $this->getLogicalResult('processLogicalAndPhp', 'processLogicalOrPhp');
    }

    /**
     * Global function to get the result of a logical operation, the processor
     * does not matter.
     *
     * @param string $logicalAndFunction Name of the internal function called for a logical "and" operation.
     * @param string $logicalOrFunction  Name of the internal function called for a logical "or" operation.
     * @return null
     * @throws \Exception
     */
    protected function getLogicalResult($logicalAndFunction, $logicalOrFunction)
    {
        switch ($this->operator) {
            case ConditionParser::LOGICAL_AND:
                $result = $this->$logicalAndFunction($this->leftSide, $this->rightSide);
                break;
            case ConditionParser::LOGICAL_OR:
                $result = $this->$logicalOrFunction($this->leftSide, $this->rightSide);
                break;
            default:
                throw new \Exception('The boolean node has a wrong operator: "' . $this->operator . '".', 1458150438);
        }

        return $result;
    }

    /**
     * Will process a logical "and" operation on the two given nodes. The result
     * will be an array containing all the result of the "and" operation on
     * every existing results of the two nodes.
     *
     * With CSS, it means to concatenate two condition strings. Example:
     *
     * Left   = [foo="bar"]
     * Right  = [pet="dog"]
     * Result = [foo="bar"][pet="dog"]
     *
     * @param AbstractNode $left  Left node instance.
     * @param AbstractNode $right Right node instance.
     * @return array
     */
    protected function processLogicalAndCss(AbstractNode $left, AbstractNode $right)
    {
        $leftResults = $this->toArray($left->getCssResult());
        $rightResults = $this->toArray($right->getCssResult());

        $result = [];
        foreach ($leftResults as $leftResult) {
            foreach ($rightResults as $rightResult) {
                $result[] = $leftResult . $rightResult;
            }
        }

        return $result;
    }

    /**
     * Will process a logical "or" operation on the two given nodes. The result
     * will be an array containing all the result of the "or" operation on
     * every existing results of the two nodes.
     *
     * @param AbstractNode $left  Left node instance.
     * @param AbstractNode $right Right node instance.
     * @return array
     */
    protected function processLogicalOrCss(AbstractNode $left, AbstractNode $right)
    {
        return array_merge(
            $this->toArray($left->getCssResult()),
            $this->toArray($right->getCssResult())
        );
    }

    /**
     * Will process a logical "and" operation on the two given nodes. The result
     * will be an array containing all the result of the "and" operation on
     * every existing results of the two nodes.
     *
     * With JavaScript, it means adding the operator `&&` between the two
     * expressions.
     *
     * @param AbstractNode $left  Left node instance.
     * @param AbstractNode $right Right node instance.
     * @return array
     */
    protected function processLogicalAndJavaScript(AbstractNode $left, AbstractNode $right)
    {
        $leftResults = $this->toArray($left->getJavaScriptResult());
        $rightResults = $this->toArray($right->getJavaScriptResult());

        $result = [];
        foreach ($leftResults as $leftResult) {
            foreach ($rightResults as $rightResult) {
                $result[] = $leftResult . ' && ' . $rightResult;
            }
        }

        return $result;
    }

    /**
     * Will process a logical "or" operation on the two given nodes. The result
     * will be an array containing all the result of the "or" operation on
     * every existing results of the two nodes.
     *
     * @param AbstractNode $left  Left node instance.
     * @param AbstractNode $right Right node instance.
     * @return array
     */
    protected function processLogicalOrJavaScript(AbstractNode $left, AbstractNode $right)
    {
        return array_merge(
            $this->toArray($left->getJavaScriptResult()),
            $this->toArray($right->getJavaScriptResult())
        );
    }

    /**
     * Will process a logical "and" operation on the two given nodes. The result
     * will be an array containing all the result of the "and" operation on
     * every existing results of the two nodes.
     *
     * With JavaScript, it means that the left and the right nodes are both
     * true.
     *
     * @param AbstractNode $left  Left node instance.
     * @param AbstractNode $right Right node instance.
     * @return bool
     */
    protected function processLogicalAndPhp(AbstractNode $left, AbstractNode $right)
    {
        return ($left->getPhpResult() && $right->getPhpResult());
    }

    /**
     * Will process a logical "or" operation on the two given nodes.
     *
     * @param AbstractNode $left  Left node instance.
     * @param AbstractNode $right Right node instance.
     * @return bool
     */
    protected function processLogicalOrPhp(AbstractNode $left, AbstractNode $right)
    {
        return ($left->getPhpResult() || $right->getPhpResult());
    }
}