src/MathParser/Parsing/Nodes/Factories/AdditionNodeFactory.php
<?php
/*
* @package Parsing
* @author Frank Wikström <frank@mossadal.se>
* @copyright 2015 Frank Wikström
* @license http://www.opensource.org/licenses/lgpl-license.php LGPL
*
*/
namespace MathParser\Parsing\Nodes\Factories;
use MathParser\Parsing\Nodes\Interfaces\ExpressionNodeFactory;
use MathParser\Parsing\Nodes\Node;
use MathParser\Parsing\Nodes\NumberNode;
use MathParser\Parsing\Nodes\IntegerNode;
use MathParser\Parsing\Nodes\RationalNode;
use MathParser\Parsing\Nodes\ExpressionNode;
use MathParser\Parsing\Nodes\Traits\Sanitize;
use MathParser\Parsing\Nodes\Traits\Numeric;
/**
* Factory for creating an ExpressionNode representing '+'.
*
* Some basic simplification is applied to the resulting Node.
*
*/
class AdditionNodeFactory implements ExpressionNodeFactory
{
use Sanitize;
use Numeric;
/**
* Create a Node representing 'leftOperand + rightOperand'
*
* Using some simplification rules, create a NumberNode or ExpressionNode
* giving an AST correctly representing 'leftOperand + rightOperand'.
*
* ### Simplification rules:
*
* - To simplify the use of the function, convert integer or float params to NumberNodes
* - If $leftOperand and $rightOperand are both NumberNodes, return a single NumberNode containing their sum
* - If $leftOperand or $rightOperand are NumberNodes representing 0, return the other term unchanged
*
* @param Node|int $leftOperand First term
* @param Node|int $rightOperand Second term
* @retval Node
*/
public function makeNode($leftOperand, $rightOperand)
{
$leftOperand = $this->sanitize($leftOperand);
$rightOperand = $this->sanitize($rightOperand);
$node = $this->numericTerms($leftOperand, $rightOperand);
if ($node) return $node;
return new ExpressionNode($leftOperand, '+', $rightOperand);
}
/** Simplify addition node when operands are numeric
*
* @param Node $leftOperand
* @param Node $rightOperand
* @retval Node|null
*/
protected function numericTerms($leftOperand, $rightOperand)
{
if ($this->isNumeric($leftOperand) && $leftOperand->getValue() == 0) return $rightOperand;
if ($this->isNumeric($rightOperand) && $rightOperand->getValue() == 0) return $leftOperand;
if (!$this->isNumeric($leftOperand) || !$this->isNumeric($rightOperand)) {
return null;
}
$type = $this->resultingType($leftOperand, $rightOperand);
switch($type) {
case Node::NumericFloat:
return new NumberNode($leftOperand->getValue() + $rightOperand->getValue());
case Node::NumericRational:
$p = $leftOperand->getNumerator() * $rightOperand->getDenominator() + $leftOperand->getDenominator() * $rightOperand->getNumerator();
$q = $leftOperand->getDenominator() * $rightOperand->getDenominator();
return new RationalNode($p, $q);
case Node::NumericInteger:
return new IntegerNode($leftOperand->getValue() + $rightOperand->getValue());
}
return null;
}
}