NestedTypeParanoia::ObtainFirstOrLast() - Code Metrics - Inspection of "shifting conditional" - SignpostMarv/daft-nested-object - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( 307714...7149d2 )

by SignpostMarv

created 2019-02-10 18:18 UTC

NestedTypeParanoia::ObtainFirstOrLast() A

↳ Parent: NestedTypeParanoia

Complexity

Conditions	2
Paths	2

Size

Total Lines	10
Code Lines	3

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	4
CRAP Score	2

Importance

Changes

Metric	Value
cc	2
eloc	3
nc	2
nop	3
dl	0
loc	10
ccs	4
cts	4
cp	1
crap	2
rs	10
c	0
b	0
f	0

<?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;
    }
}


1		<?php
2		/**
3		* Base daft objects.
4		*
5		* @author SignpostMarv
6		*/
7		declare(strict_types=1);
8
9		namespace SignpostMarv\DaftObject;
10
11		class NestedTypeParanoia
12		{
13		/**
14		* @param mixed $needle
15		*/
16	60	public static function MaybeFoundInArray($needle, array $haystack) : ? int
17		{
18	60	$out = array_search($needle, $haystack, true);
19
20	60	return is_int($out) ? $out : null;
21		}
22
23		/**
24		* @param mixed $maybe
25		*/
26	96	public static function ForceInt($maybe) : int
27		{
28	96	return is_int($maybe) ? $maybe : (int) $maybe;
29		}
30
31	88	public static function NotYetAppendedToTree(DaftNestedObject $object) : bool
32		{
33	88	$left = $object->GetIntNestedLeft();
34	88	$right = $object->GetIntNestedRight();
35	88	$level = $object->GetIntNestedLevel();
36
37	88	return 0 === $left && 0 === $right && 0 === $level;
38		}
39
40	24	public static function ObtainFirstOrLast(
41		bool $before,
42		DaftNestedWriteableObject $first,
43		DaftNestedWriteableObject ...$leaves
44		) : DaftNestedWriteableObject {
45	24	array_unshift($leaves, $first);
46
47	24	$reference = $before ? current($leaves) : end($leaves);
48
49	24	return $reference;
50		}
51		}
52

SignpostMarv / daft-nested-object

Push — master ( 307714...7149d2 )

NestedTypeParanoia::ObtainFirstOrLast() A

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like