Kaloa\Util\Tree\Node

Complexity

Total Complexity

16

Size/Duplication

Total Lines	92
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	0

Test Coverage

Coverage

100%

Importance

Changes	3
Bugs	0	Features	1

9 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	4	1
A	addChild()	0	5	1
A	setParent()	0	4	1
A	getContent()	0	4	1
A	hasChildren()	0	4	1
A	getParent()	0	4	1
A	getChildren()	0	4	1
B	display()	0	22	5
A	getNodesByFilter()	0	16	4

<?php

/*
 * This file is part of the kaloa/util package.
 *
 * For full copyright and license information, please view the LICENSE file
 * that was distributed with this source code.
 */

namespace Kaloa\Util\Tree;

use Closure;

/**
 * A simple tree structure
 *
 * There will always be a single distinct root node
 */
final class Node
{
    private $content  = null;
    private $children = array();
    private $parent   = null;

    public function __construct($value)
    {
        $this->content = $value;
    }

    public function addChild(Node $child)
    {
        $this->children[] = $child;
        $child->setParent($this);
    }

    public function hasChildren()
    {
        return (count($this->children) > 0);
    }

    public function setParent(Node $node)
    {
        $this->parent = $node;
    }

    public function getParent()
    {
        return $this->parent;
    }

    public function getChildren()
    {
        return $this->children;
    }

    public function getContent()
    {
        return $this->content;
    }

    /**
     * Displays all elements from a tree in hierarchic order
     *
     * @param int $level Current level of indentation
     */
    public function display($level = 0)
    {
        $value = $this->getContent();

        if (null === $value) {
            $value = 'null';
        } elseif (is_object($value)) {
            $value = get_class($value);
        } elseif (is_array($value)) {
            $value = 'Array';
        }

        $ret = str_repeat(' ', $level * 4) . $value . "\n";

        $children = $this->getChildren();

        foreach ($children as $child) {
            $ret .= $child->display($level + 1);
        }

        return $ret;
    }

    /**
     *
     * @param Closure $expr
     * @return array
     */
    public function getNodesByFilter(Closure $expr)
    {
        $nodes = array();

        foreach ($this->children as $child) {
            if ($expr($child->getContent())) {
                $nodes[] = $child;
            }

            foreach ($child->getNodesByFilter($expr) as $node) {
                $nodes[] = $node;
            }
        }

        return $nodes;
    }
}