PPP\Module\TreeSimplifier\DispatchingSimplifier

Complexity

Total Complexity

9

Size/Duplication

Total Lines	50
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	2

Test Coverage

Coverage

100%

Importance

Changes	1
Bugs	0	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	3	1
A	isSimplifierFor()	0	9	3
A	simplify()	0	8	2
A	doDispatchedSimplification()	0	9	3

<?php

namespace PPP\Module\TreeSimplifier;

use PPP\DataModel\AbstractNode;

/**
 * Runs NodeSimplifiers as much as possible on the tree.
 *
 * @licence MIT
 * @author Thomas Pellissier Tanon
 */
class DispatchingSimplifier implements NodeSimplifier {

	/**
	 * @var NodeSimplifier[]
	 */
	private $simplifiers;

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

	/**
	 * @see NodeSimplifier::sSimplifierFor
	 */
	public function isSimplifierFor(AbstractNode $node) {
		foreach($this->simplifiers as $simplifier) {
			if($simplifier->isSimplifierFor($node)) {
				return true;
			}
		}

		return false;
	}

	/**
	 * @param AbstractNode $node
	 * @return AbstractNode
	 */
	public function simplify(AbstractNode $node) {
		do {
			$oldNode = $node;
			$node = $this->doDispatchedSimplification($node);
		} while(!$oldNode->equals($node));

		return $node;
	}

	private function doDispatchedSimplification(AbstractNode $node) {
		foreach($this->simplifiers as $simplifier) {
			if($simplifier->isSimplifierFor($node)) {
				$node = $simplifier->simplify($node);
			}
		}

		return $node;
	}
}