Aplisin\DingTalk\Kernel\Support\Arr

Complexity

Total Complexity

63

Size/Duplication

Total Lines	243
Duplicated Lines	0 %

Importance

Changes

0

21 Methods

Rating	Name	Duplication	Size	Complexity
A	except()	0	4	1
A	flatten()	0	11	4
A	crossJoin()	0	14	4
A	divide()	0	3	1
A	dot()	0	11	4
A	get()	0	16	5
A	first()	0	16	6
A	last()	0	6	3
A	add()	0	6	2
B	forget()	0	25	7
A	exists()	0	3	1
A	prepend()	0	8	2
A	set()	0	15	4
A	random()	0	11	3
A	where()	0	3	1
A	isAssoc()	0	4	1
A	pull()	0	5	1
A	isArrayUnValidated()	0	13	4
A	wrap()	0	3	2
A	only()	0	3	1
A	has()	0	19	6

<?php
/**
 * This file is part of the dingtalk.
 * User: Ilham Tahir <yantaq@bilig.biz>
 * This source file is subject to the MIT license that is bundled
 * with this source code in the file LICENSE.
 */

namespace Aplisin\DingTalk\Kernel\Support;

class Arr
{
    public static function add(array $array, $key, $value)
    {
        if (is_null(static::get($array, $key))) {
            static::set($array, $key, $value);
        }
        return $array;
    }

    public static function crossJoin(...$arrays)
    {
        $results = [[]];
        foreach ($arrays as $index => $array) {
            $append = [];
            foreach ($results as $product) {
                foreach ($array as $item) {
                    $product[$index] = $item;
                    $append[] = $product;

Equals sign not aligned with surrounding assignments; expected 8 spaces but found 1 space

                }
            }
            $results = $append;
        }
        return $results;
    }

    public static function divide(array $array)
    {
        return [array_keys($array), array_values($array)];
    }

    public static function dot(array $array, $prepend = '')
    {
        $results = [];
        foreach ($array as $key => $value) {
            if (is_array($value) && !empty($value)) {
                $results = array_merge($results, static::dot($value, $prepend.$key.'.'));
            } else {
                $results[$prepend.$key] = $value;
            }
        }
        return $results;
    }

    public static function except(array $array, $keys)
    {
        static::forget($array, $keys);
        return $array;
    }

    public static function exists(array $array, $key)
    {
        return array_key_exists($key, $array);
    }

    public static function first(array $array, callable $callback = null, $default = null)
    {
        if (is_null($callback)) {
            if (empty($array)) {
                return $default;
            }
            foreach ($array as $item) {
                return $item;
            }
        }
        foreach ($array as $key => $value) {
            if (call_user_func($callback, $value, $key)) {
                return $value;
            }
        }
        return $default;
    }

    public static function last(array $array, callable $callback = null, $default = null)
    {
        if (is_null($callback)) {
            return empty($array) ? $default : end($array);
        }
        return static::first(array_reverse($array, true), $callback, $default);
    }

    public static function flatten(array $array, $depth = INF)
    {
        return array_reduce($array, function($result, $item) use ($depth) {
            $item = $item instanceof Collection ? $item->all() : $item;
            if (!is_array($item)) {
                return array_merge($result, [$item]);
            } elseif (1 === $depth) {
                return array_merge($result, array_values($item));
            }
            return array_merge($result, static::flatten($item, $depth - 1));
        }, []);
    }

    public static function forget(array &$array, $keys)
    {
        $original = &$array;
        $keys = (array) $keys;

Equals sign not aligned with surrounding assignments; expected 5 spaces but found 1 space

        if (0 === count($keys)) {
            return;
        }
        foreach ($keys as $key) {
            // if the exact key exists in the top-level, remove it
            if (static::exists($array, $key)) {
                unset($array[$key]);
                continue;
            }
            $parts = explode('.', $key);
            // clean up before each pass
            $array = &$original;
            while (count($parts) > 1) {
                $part = array_shift($parts);
                if (isset($array[$part]) && is_array($array[$part])) {
                    $array = &$array[$part];
                } else {
                    continue 2;
                }
            }
            unset($array[array_shift($parts)]);
        }
    }

    public static function get(array $array, $key, $default = null)
    {
        if (is_null($key)) {
            return $array;
        }
        if (static::exists($array, $key)) {
            return $array[$key];
        }
        foreach (explode('.', $key) as $segment) {
            if (static::exists($array, $segment)) {
                $array = $array[$segment];
            } else {
                return $default;
            }
        }
        return $array;
    }

    public static function has(array $array, $keys)
    {
        if (self::isArrayUnValidated($array, $keys)) {
            return false;
        }
        foreach ($keys as $key) {
            $subKeyArray = $array;
            if (static::exists($array, $key)) {
                continue;
            }
            foreach (explode('.', $key) as $segment) {
                if (static::exists($subKeyArray, $segment)) {
                    $subKeyArray = $subKeyArray[$segment];
                } else {
                    return false;
                }
            }
        }
        return true;
    }

    protected static function isArrayUnValidated(array $array, $keys)
    {
        if (is_null($keys)) {
            return true;
        }
        $keys = (array) $keys;
        if (empty($array)) {
            return true;
        }
        if ($keys === []) {
            return true;
        }
        return false;
    }

    public static function isAssoc(array $array)
    {
        $keys = array_keys($array);
        return array_keys($keys) !== $keys;
    }

    public static function only(array $array, $keys)
    {
        return array_intersect_key($array, array_flip((array) $keys));
    }

    public static function prepend(array $array, $value, $key = null)
    {
        if (is_null($key)) {
            array_unshift($array, $value);
        } else {
            $array = [$key => $value] + $array;
        }
        return $array;
    }

    public static function pull(array &$array, $key, $default = null)
    {
        $value = static::get($array, $key, $default);
        static::forget($array, $key);
        return $value;
    }

    public static function random(array $array, int $amount = null)
    {
        if (is_null($amount)) {
            return $array[array_rand($array)];
        }
        $keys = array_rand($array, $amount);

Equals sign not aligned with surrounding assignments; expected 4 spaces but found 1 space

        $results = [];
        foreach ((array) $keys as $key) {
            $results[] = $array[$key];
        }
        return $results;
    }

    public static function set(array &$array, string $key, $value)
    {
        $keys = explode('.', $key);
        while (count($keys) > 1) {
            $key = array_shift($keys);
            // If the key doesn't exist at this depth, we will just create an empty array
            // to hold the next value, allowing us to create the arrays to hold final
            // values at the correct depth. Then we'll keep digging into the array.
            if (!isset($array[$key]) || !is_array($array[$key])) {
                $array[$key] = [];
            }
            $array = &$array[$key];
        }
        $array[array_shift($keys)] = $value;
        return $array;
    }


    public static function where(array $array, callable $callback)
    {
        return array_filter($array, $callback, ARRAY_FILTER_USE_BOTH);
    }

    public static function wrap($value)
    {
        return !is_array($value) ? [$value] : $value;
    }
}