PPP\Module\TreeSimplifier\LastNodeSimplifierTest

Complexity

Total Complexity

4

Size/Duplication

Total Lines	44
Duplicated Lines	0 %

Coupling/Cohesion

Components	0
Dependencies	8

Importance

Changes	2
Bugs	1	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	buildSimplifier()	0	3	1
A	simplifiableProvider()	0	7	1
A	nonSimplifiableProvider()	0	7	1
A	simplificationProvider()	0	21	1

<?php

namespace PPP\Module\TreeSimplifier;

use PPP\DataModel\IntersectionNode;
use PPP\DataModel\LastNode;
use PPP\DataModel\MissingNode;
use PPP\DataModel\ResourceListNode;
use PPP\DataModel\StringResourceNode;

/**
 * @covers PPP\Module\TreeSimplifier\LastNodeSimplifier
 *
 * @licence MIT
 * @author Thomas Pellissier Tanon
 */
class LastNodeSimplifierTest extends NodeSimplifierBaseTest {

	protected function buildSimplifier() {
		return new LastNodeSimplifier(new NodeSimplifierFactory());
	}

	public function simplifiableProvider() {
		return array(
			array(
				new LastNode(new ResourceListNode(array()))
			)
		);
	}

	public function nonSimplifiableProvider() {
		return array(
			array(
				new IntersectionNode(array())
			)
		);
	}

	public function simplificationProvider() {
		return array(
			array(
				new ResourceListNode(array(
					new StringResourceNode('bar')
				)),
				new LastNode(new ResourceListNode(array(
					new StringResourceNode('foo'),
					new StringResourceNode('bar')
				)))
			),
			array(
				new ResourceListNode(array()),
				new LastNode(new ResourceListNode(array()))
			),
			array(
				new LastNode(new MissingNode()),
				new LastNode(new MissingNode())
			),
		);
	}
}