Phossa2\Shared\Tree\Tree

Complexity

Total Complexity

14

Size/Duplication

Total Lines	132
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Importance

Changes	2
Bugs	0	Features	2

6 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	5	1
A	getTree()	0	4	1
A	getNode()	0	9	2
A	deleteNode()	0	15	3
A	fixTree()	0	9	3
A	searchNode()	0	19	4

<?php
/**
 * Phossa Project
 *
 * PHP version 5.4
 *
 * @category  Library
 * @package   Phossa2\Shared
 * @copyright Copyright (c) 2016 phossa.com
 * @license   http://mit-license.org/ MIT License
 * @link      http://www.phossa.com/
 */
/*# declare(strict_types=1); */

namespace Phossa2\Shared\Tree;

use Phossa2\Shared\Base\ObjectAbstract;

/**
 * Dealing with tree structure
 *
 * @package Phossa2\Shared
 * @author  Hong Zhang <phossa@126.com>
 * @version 2.0.3
 * @since   2.0.3 added
 * @since   2.0.5 added deleteNode()
 */
class Tree extends ObjectAbstract
{
    /**
     * node splitter
     *
     * @var    string
     * @access protected
     */
    protected $splitter = '.';

    /**
     * the result tree
     *
     * @var    array
     * @access protected
     */
    protected $tree;

    /**
     * construct a tree
     *
     * @param  array $data
     * @param  string $splitter
     * @access public
     * @api
     */
    public function __construct(array $data, /*# string */ $splitter = '.')
    {
        $this->splitter = $splitter;
        $this->tree = $this->fixTree($data);
    }

    /**
     * return the whole tree
     *
     * @return array
     * @access public
     * @api
     */
    public function getTree()/*# : array */
    {
        return $this->tree;
    }

    /**
     * Get one node, NULL if not found
     *
     * @param  string $nodeName
     * @return mixed
     * @access public
     * @api
     */
    public function &getNode(/*# string */ $nodeName)
    {
        if ('' === $nodeName) {
            $result = &$this->tree;
        } else {
            $result = &$this->searchNode($nodeName, $this->tree, false);
        }
        return $result;
    }

    /**
     * Delete one node if exists
     *
     * @param  string $nodeName
     * @return $this
     * @access public
     * @since  2.0.5
     * @api
     */
    public function deleteNode(/*# string */ $nodeName)
    {
        if ('' === $nodeName) {
            $this->tree = [];
        } else {
            $current = &$this->getNode($nodeName);
            if (null !== $current) {
                $split = explode($this->splitter, $nodeName);
                $name  = array_pop($split);
                $upper = &$this->getNode(join($this->splitter, $split));
                unset($upper[$name]);
            }
        }
        return $this;
    }

    /**
     * Fix array, convert flat name to tree node name
     *
     * @param  array $data
     * @return array
     * @access protected
     */
    protected function fixTree(array $data)/*# : array */
    {
        $result = [];
        foreach ($data as $k => $v) {
            $res = &$this->searchNode($k, $result);
            $res = is_array($v) ? $this->fixTree($v) : $v;
        }
        return $result;
    }

    /**
     * Search a node in the $data
     *
     * @param  string $key
     * @param  array &$data
     * @param  bool $create
     * @access protected
     */
    protected function &searchNode(
        /*# string */ $key,
        array &$data,
        /*# bool */ $create = true
    ) {
        $found = &$data;
        foreach (explode($this->splitter, $key) as $k) {
            if (isset($found[$k])) {
                $found = &$found[$k];
            } elseif ($create) {
                $found[$k] = [];
                $found = &$found[$k];
            } else {
                $found = null;
                break;
            }
        }
        return $found;
    }
}