SignpostMarv\DaftObject\NestedTypeParanoia

Complexity

Total Complexity

9

Size/Duplication

Total Lines	39
Duplicated Lines	0 %

Test Coverage

Coverage

100%

Importance

Changes

0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	MaybeFoundInArray()	0	5	2
A	ForceInt()	0	3	2
A	NotYetAppendedToTree()	0	7	3
A	ObtainFirstOrLast()	0	10	2

<?php
/**
* Base daft objects.
*
* @author SignpostMarv
*/
declare(strict_types=1);

namespace SignpostMarv\DaftObject;

class NestedTypeParanoia
{
    /**
    * @param mixed $needle
    */
    public static function MaybeFoundInArray($needle, array $haystack) : ? int
    {
        $out = array_search($needle, $haystack, true);

        return is_int($out) ? $out : null;
    }

    /**
    * @param mixed $maybe
    */
    public static function ForceInt($maybe) : int
    {
        return is_int($maybe) ? $maybe : (int) $maybe;
    }

    public static function NotYetAppendedToTree(DaftNestedObject $object) : bool
    {
        $left = $object->GetIntNestedLeft();
        $right = $object->GetIntNestedRight();
        $level = $object->GetIntNestedLevel();

        return 0 === $left && 0 === $right && 0 === $level;
    }

    public static function ObtainFirstOrLast(
        bool $before,
        DaftNestedWriteableObject $first,
        DaftNestedWriteableObject ...$leaves
    ) : DaftNestedWriteableObject {
        array_unshift($leaves, $first);

        $reference = $before ? current($leaves) : end($leaves);

        return $reference;
    }
}