PPP\Module\TreeSimplifier\NodeSimplifierFactoryTest

Complexity

Total Complexity

1

Size/Duplication

Total Lines	24
Duplicated Lines	0 %

Coupling/Cohesion

Components	0
Dependencies	11

Importance

Changes	4
Bugs	0	Features	2

1 Method

Rating	Name	Duplication	Size	Complexity
A	testNewNodeSimplifier()	0	21	1

<?php

namespace PPP\Module\TreeSimplifier;

use PPP\DataModel\FirstNode;
use PPP\DataModel\IntersectionNode;
use PPP\DataModel\LastNode;
use PPP\DataModel\MissingNode;
use PPP\DataModel\ResourceListNode;
use PPP\DataModel\SortNode;
use PPP\DataModel\StringResourceNode;
use PPP\DataModel\TripleNode;
use PPP\DataModel\UnionNode;

/**
 * @covers PPP\Module\TreeSimplifier\NodeSimplifierFactory
 *
 * @licence MIT
 * @author Thomas Pellissier Tanon
 */
class NodeSimplifierFactoryTest extends \PHPUnit_Framework_TestCase {

	public function testNewNodeSimplifier() {
		$factory = new NodeSimplifierFactory();

		$this->assertEquals(
			new TripleNode(
				new ResourceListNode(),
				new FirstNode(new SortNode(new resourceListNode(), new StringResourceNode('foo'))),
				new MissingNode()
			),
			$factory->newNodeSimplifier()->simplify(new TripleNode(
				new UnionNode(array()),
				new FirstNode(new SortNode(
					new IntersectionNode(array(
						new LastNode(new ResourceListNode())
					)),
					new StringResourceNode('foo')
				)),
				new MissingNode()
			))
		);
	}
}