StefanoTree\NestedSet\MoveStrategy\Top

Complexity

Total Complexity

25

Size/Duplication

Total Lines	98
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	3

Test Coverage

Coverage

97.78%

Importance

Changes	5
Bugs	2	Features	0

9 Methods

Rating	Name	Duplication	Size	Complexity
A	getNewParentId()	0	4	1
A	getLevelShift()	0	4	1
A	getHoleLeftIndex()	0	14	4
A	getHoleRightIndex()	0	14	4
A	getSourceNodeIndexShift()	0	14	4
A	fixHoleFromIndex()	0	14	4
A	makeHoleFromIndex()	0	4	1
A	isSourceNodeAtRequiredPosition()	0	9	3
A	canMoveBranch()	0	9	3

<?php
namespace StefanoTree\NestedSet\MoveStrategy;

use StefanoTree\Exception;

class Top
    extends MoveStrategyAbstract

The extends keyword must be on the same line as the class name

{
    public function getNewParentId()
    {
        return $this->getTargetNode()->getParentId();
    }

    public function getLevelShift()
    {
        return $this->getTargetNode()->getLevel() - $this->getSourceNode()->getLevel();
    }

    public function getHoleLeftIndex()
    {
        if ($this->isMovedToRoot()) {
            return $this->getSourceNode()->getLeft() + $this->getIndexShift();
        } elseif ($this->isMovedUp()) {
            return $this->getSourceNode()->getLeft() + $this->getIndexShift();
        } elseif ($this->isMovedDown()) {
            return $this->getSourceNode()->getLeft();
        } else {
            // @codeCoverageIgnoreStart
            throw new Exception\BaseException('Cannot move node');
            // @codeCoverageIgnoreEnd
        }
    }

    public function getHoleRightIndex()
    {
        if ($this->isMovedToRoot()) {
            return $this->getSourceNode()->getRight() + $this->getIndexShift();
        } elseif ($this->isMovedUp()) {
            return $this->getSourceNode()->getRight() + $this->getIndexShift();
        } elseif ($this->isMovedDown()) {
            return $this->getSourceNode()->getRight();
        } else {
            // @codeCoverageIgnoreStart
            throw new Exception\BaseException('Cannot move node');
            // @codeCoverageIgnoreEnd
        }
    }

    public function getSourceNodeIndexShift()
    {
        if ($this->isMovedToRoot()) {
            return $this->getTargetNode()->getLeft() - $this->getSourceNode()->getRight() - 1;
        } elseif ($this->isMovedUp()) {
            return $this->getTargetNode()->getLeft() - $this->getSourceNode()->getRight() - 1;
        } elseif ($this->isMovedDown()) {
            return $this->getTargetNode()->getLeft() - $this->getSourceNode()->getLeft();
        } else {
            // @codeCoverageIgnoreStart
            throw new Exception\BaseException('Cannot move node');
            // @codeCoverageIgnoreEnd
        }
    }

    public function fixHoleFromIndex()
    {
        if ($this->isMovedToRoot()) {
            return $this->getSourceNode()->getRight() + $this->getIndexShift();
        } elseif ($this->isMovedUp()) {
            return $this->getSourceNode()->getRight();
        } elseif ($this->isMovedDown()) {
            return $this->getSourceNode()->getLeft();
        } else {
            // @codeCoverageIgnoreStart
            throw new Exception\BaseException('Cannot move node');
            // @codeCoverageIgnoreEnd
        }
    }

    public function makeHoleFromIndex()
    {
        return $this->getTargetNode()->getLeft() - 1;
    }

    public function canMoveBranch()
    {
        if (false == parent::canMoveBranch()) {

It seems like you are loosely comparing two booleans. Considering using the strict comparison === instead.

            return false;
        }

        return ($this->getTargetNode()->isRoot()) ?
            false : true;
    }

    public function isSourceNodeAtRequiredPosition()
    {
        $sourceNode = $this->getSourceNode();
        $targetNode = $this->getTargetNode();

        return ($targetNode->getLeft() == ($sourceNode->getRight() + 1) &&
                $targetNode->getParentId() == $sourceNode->getParentId()) ?
            true : false;
    }
}