TournamentGenerator\Helpers\Functions

Complexity

Total Complexity

9

Size/Duplication

Total Lines	73
Duplicated Lines	0 %

Test Coverage

Coverage

100%

Importance

Changes	1
Bugs	0	Features	0

5 Methods

Rating	Name	Duplication	Size	Complexity
A	previousPowerOf2()	0	3	1
A	nextPowerOf2()	0	3	1
A	isPowerOf2()	0	2	2
A	nestedCount()	0	6	2
A	sortAlternate()	0	16	3

<?php


namespace TournamentGenerator\Helpers;


/**
 * Static helper functions
 *
 * @package TournamentGenerator\Helpers
 *
 * @author  Tomáš Vojík <vojik@wboy.cz>
 *
 * @since   0.4
 */
class Functions
{
	/**
	 * Checks if the number is a power of 2
	 *
	 * @param int $x
	 *
	 * @return bool
	 */
	public static function isPowerOf2(int $x) : bool {
		return ($x !== 0) && ($x & ($x - 1)) === 0;
	}

	/**
	 * Get the next power of 2 larger than input
	 *
	 * @param int $x
	 *
	 * @return int
	 */
	public static function nextPowerOf2(int $x) : int {
		// Left bit shift by the bit length of the previous number
		return 1 << strlen(decbin($x));
	}

	/**
	 * Get the previous power of 2 smaller or equal than input
	 *
	 * @param int $x
	 *
	 * @return int
	 */
	public static function previousPowerOf2(int $x) : int {
		// Left bit shift by the bit length of the previous number
		return 1 << (strlen(decbin($x)) - 1);
	}

	/**
	 * Calculate a count of 2D array
	 *
	 * @param array[] $array
	 *
	 * @return int
	 */
	public static function nestedCount(array $array) : int {
		$count = 0;
		foreach ($array as $inner) {
			$count += count($inner);
		}
		return $count;
	}

	/**
	 * @param array $array
	 *
	 * @return array
	 */
	public static function sortAlternate(array &$array) : array {
		$new = [];
		$new2 = [];
		$count = count($array) / 2;
		for ($i = 0; $i < $count; $i++) {
			if ($i % 2 === 0) {
				$new[] = array_shift($array);
				$new[] = array_pop($array);
			}
			else {
				$new2[] = array_shift($array);
				$new2[] = array_pop($array);
			}
		}
		$array = array_values(array_filter(array_merge($new, array_reverse($new2))));
		return $array;
	}
}