Botonomous\utility\ArrayUtility

Complexity

Total Complexity

7

Size/Duplication

Total Lines	43
Duplicated Lines	0 %

Coupling/Cohesion

Components	0
Dependencies	1

Test Coverage

Coverage

91.67%

Importance

Changes

0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	filterArray()	0	4	1
B	arrayKeyValueExists()	0	20	6

<?php

namespace Botonomous\utility;

/**
 * Class ArrayUtility.
 */
class ArrayUtility extends AbstractUtility
{
    /**
     * @param array $toFilter
     * @param array $keepKeys Includes the keys that need to be kept in $toFilter array
     *
     * @return array
     */
    public function filterArray(array $toFilter, array $keepKeys)
    {
        return array_intersect_key($toFilter, array_flip($keepKeys));
    }

    /**
     * Check if key is present in $search array and has got a value
     * It considers values such as 0, '0', true and false AS true
     *
     * @param       $key
     * @param array $search
     *
     * @return bool
     */
    public function arrayKeyValueExists($key, array $search)
    {
        if (!array_key_exists($key, $search)) {
            return false;
        }

        if (is_string($search[$key])) {
            if (strlen(trim($search[$key])) > 0) {

The if-else statement can be simplified to return strlen(trim($search[$key])) > 0;.

                return true;
            } else {
                return false;
            }
        }

        if (empty($search[$key]) && !in_array($search[$key], [0, true, false])) {

This if statement, and the following return statement can be replaced with return !(empty($search[$key]) && !in_array($search[$key], array(0, true, false)));.

            return false;
        }

        return true;
    }
}