Vine\Tree

Complexity

Total Complexity

6

Size/Duplication

Total Lines	47
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Test Coverage

Coverage

100%

Importance

Changes

0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	5	1
A	count()	0	4	1
A	findByIndex()	0	4	1
A	findManyByIndex()	0	12	3

<?php

namespace Vine;

/**
 * Class Tree
 * Tree collection is exactly the same as a node collection with the difference
 * that a tree contains a flat index reference to each node, based on the primary key.
 * This allows for fast retrieval of nodes by searching on their primary key.
 *
 * @package Vine
 */
class Tree extends NodeCollection
{
    /**
     * Flat listing of nodes with primary id as collection key.
     *
     * @var NodeCollection
     */
    private $index;

    public function __construct(NodeCollection $nodeCollection, NodeCollection $index)
    {
        $this->nodes = $nodeCollection->all();
        $this->index = $index;
    }

    /**
     * Count of all nodes
     *
     * @return int
     */
    public function count()
    {
        return $this->index->count();
    }

    /**
     * @param $id
     * @return null|Node
     */
    public function findByIndex($id)
    {
        return $this->findManyByIndex((array)$id)->first();
    }

    public function findManyByIndex(array $ids): NodeCollection
    {
        $nodes = new NodeCollection;

        foreach($ids as $id)
        {
            if(!isset($this->index[$id])) continue;
            $nodes->add($this->index[$id]);
        }

        return $nodes;
    }
}