iterable_to_array() - Code Metrics - Inspection of "Merge pull request #45 from c-harris/BugFix" - c-harris/ODataMetadata - Measure and Improve Code Quality continuously with Scrutinizer

Completed

Push — master ( 66c45a...b9f89d )

by Alex

created 2020-07-01 08:51 UTC

iterable_to_array() A

↳ Parent: Project

Complexity

Conditions	3
Paths	3

Size

Total Lines	11
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Importance

Changes	3
Bugs	1	Features	1

Metric	Value
cc	3
eloc	7
c	3
b	1
f	1
nc	3
nop	1
dl	0
loc	11
rs	10

<?php

declare(strict_types=1);
if (!function_exists('mb_ord')) {
    function mb_ord($s, $encoding = null)
    {
        $getEncoding = function ($encoding) {
            if (null === $encoding) {
                return 'UTF-8';
            }

            if ('UTF-8' === $encoding) {
                return 'UTF-8';
            }

            $encoding = strtoupper($encoding);

            if ('8BIT' === $encoding || 'BINARY' === $encoding) {
                return 'CP850';
            }

            if ('UTF8' === $encoding) {
                return 'UTF-8';
            }

            return $encoding;
        };

        if ('UTF-8' !== $encoding = $getEncoding($encoding)) {
            $s = mb_convert_encoding($s, 'UTF-8', $encoding);
        }

        if (1 === \strlen($s)) {
            return \ord($s);
        }

        $code = ($s = unpack('C*', substr($s, 0, 4))) ? $s[1] : 0;
        if (0xF0 <= $code) {
            return (($code - 0xF0) << 18) + (($s[2] - 0x80) << 12) + (($s[3] - 0x80) << 6) + $s[4] - 0x80;
        }
        if (0xE0 <= $code) {
            return (($code - 0xE0) << 12) + (($s[2] - 0x80) << 6) + $s[3] - 0x80;
        }
        if (0xC0 <= $code) {
            return (($code - 0xC0) << 6) + $s[2] - 0x80;
        }

        return $code;
    }
}
if (!function_exists('iterable_to_array')) {
    function iterable_to_array(?iterable $it): array
    {
        if (null === $it) {
            return [];
        }
        if (is_array($it)) {
            return $it;
        }
        $ret = [];
        array_push($ret, ...$it);
        return $ret;
    }
}
if (!function_exists('iterable_to_traversable')) {
    function iterable_to_traversable(?iterable $it): Traversable
    {
        if (null === $it) {
            $it = [];
        }
        yield from $it;
    }
}


1			<?php
2
3			declare(strict_types=1);
4			if (!function_exists('mb_ord')) {
5			function mb_ord($s, $encoding = null)
6			{
7			$getEncoding = function ($encoding) {
8			if (null === $encoding) {
9			return 'UTF-8';
10			}
11
12			if ('UTF-8' === $encoding) {
13			return 'UTF-8';
14			}
15
16			$encoding = strtoupper($encoding);
17
18			if ('8BIT' === $encoding \|\| 'BINARY' === $encoding) {
19			return 'CP850';
20			}
21
22			if ('UTF8' === $encoding) {
23			return 'UTF-8';
24			}
25
26			return $encoding;
27			};
28
29			if ('UTF-8' !== $encoding = $getEncoding($encoding)) {
30			$s = mb_convert_encoding($s, 'UTF-8', $encoding);
31			}
32
33			if (1 === \strlen($s)) {
34			return \ord($s);
35			}
36
37			$code = ($s = unpack('C*', substr($s, 0, 4))) ? $s[1] : 0;
38			if (0xF0 <= $code) {
39			return (($code - 0xF0) << 18) + (($s[2] - 0x80) << 12) + (($s[3] - 0x80) << 6) + $s[4] - 0x80;
40			}
41			if (0xE0 <= $code) {
42			return (($code - 0xE0) << 12) + (($s[2] - 0x80) << 6) + $s[3] - 0x80;
43			}
44			if (0xC0 <= $code) {
45			return (($code - 0xC0) << 6) + $s[2] - 0x80;
46			}
47
48			return $code;
49			}
50			}
51			if (!function_exists('iterable_to_array')) {
52			function iterable_to_array(?iterable $it): array
53			{
54			if (null === $it) {
55			return [];
56			}
57			if (is_array($it)) {
58			return $it;
59			}
60			$ret = [];
61			array_push($ret, ...$it);
62			return $ret;
63			}
64			}
65			if (!function_exists('iterable_to_traversable')) {
66			function iterable_to_traversable(?iterable $it): Traversable
67			{
68			if (null === $it) {
69			$it = [];
70			}
71			yield from $it;
72			}
73			}
74

c-harris / ODataMetadata

Push — master ( 66c45a...b9f89d )

iterable_to_array() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like