appzcoder / 30-seconds-of-php-code
- пятница, 8 июня 2018 г. в 00:14:25
PHP
A curated collection of useful PHP snippets that you can understand in 30 seconds or less.
A curated collection of useful PHP snippets that you can understand in 30 seconds or less.
Returns true
if the provided function returns true
for all elements of an array, false
otherwise.
function all($items, $func)
{
return count(array_filter($items, $func)) === count($items);
}
all([2, 3, 4, 5], function ($item) {
return $item > 1;
}); // true
Returns true
if the provided function returns true
for at least one element of an array, false
otherwise.
function any($items, $func)
{
return count(array_filter($items, $func)) > 0;
}
any([1, 2, 3, 4], function ($item) {
return $item < 2;
}); // true
Chunks an array into smaller arrays of a specified size.
function chunk($items, $size)
{
return array_chunk($items, $size);
}
chunk([1, 2, 3, 4, 5], 2); // [[1, 2], [3, 4], [5]]
Deep flattens an array.
function deepFlatten($items)
{
$result = [];
foreach ($items as $item) {
if (!is_array($item)) {
$result[] = $item;
} else {
$result = array_merge($result, deepFlatten($item));
}
}
return $result;
}
deepFlatten([1, [2], [[3], 4], 5]); // [1, 2, 3, 4, 5]
Returns a new array with n
elements removed from the left.
function drop($items, $n = 1)
{
return array_slice($items, $n);
}
drop([1, 2, 3]); // [2,3]
drop([1, 2, 3], 2); // [3]
Returns the last element for which the provided function returns a truthy value.
function findLast($items, $func)
{
$filteredItems = array_filter($items, $func);
return array_pop($filteredItems);
}
findLast([1, 2, 3, 4], function ($n) {
return ($n % 2) === 1;
});
// 3
Returns the index of the last element for which the provided function returns a truthy value.
function findLastIndex($items, $func)
{
$keys = array_keys(array_filter($items, $func));
return array_pop($keys);
}
findLastIndex([1, 2, 3, 4], function ($n) {
return ($n % 2) === 1;
});
// 2
Flattens an array up to the one level depth.
function flatten($items)
{
$result = [];
foreach ($items as $item) {
if (!is_array($item)) {
$result[] = $item;
} else {
$result = array_merge($result, array_values($item));
}
}
return $result;
}
flatten([1, [2], 3, 4]); // [1, 2, 3, 4]
Groups the elements of an array based on the given function.
function groupBy($items, $func)
{
$group = [];
foreach ($items as $item) {
if ((!is_string($func) && is_callable($func)) || function_exists($func)) {
$key = call_user_func($func, $item);
$group[$key][] = $item;
} elseif (is_object($item)) {
$group[$item->{$func}][] = $item;
} elseif (isset($item[$func])) {
$group[$item[$func]][] = $item;
}
}
return $group;
}
groupBy(['one', 'two', 'three'], 'strlen') // [3 => ['one', 'two'], 5 => ['three']]
Checks a flat list for duplicate values. Returns true
if duplicate values exists and false
if values are all unique.
function hasDuplicates($items)
{
return count($items) !== count(array_unique($items));
}
hasDuplicates([1, 2, 3, 4, 5, 5]); // true
Returns the head of a list.
function head($items)
{
return reset($items);
}
head([1, 2, 3]); // 1
Returns the last element in an array.
function last($items)
{
return end($items);
}
last([1, 2, 3]); // 3
Retrieves all of the values for a given key:
function pluck($items, $key)
{
return array_map( function($item) use ($key) {
return is_object($item) ? $item->$key : $item[$key];
}, $items);
}
pluck([
['product_id' => 'prod-100', 'name' => 'Desk'],
['product_id' => 'prod-200', 'name' => 'Chair'],
], 'name');
// ['Desk', 'Chair']
Mutates the original array to filter out the values specified.
function pull(&$items, ...$params)
{
$items = array_values(array_diff($items, $params));
return $items;
}
$items = ['a', 'b', 'c', 'a', 'b', 'c'];
pull($items, 'a', 'c'); // $items will be ['b', 'b']
Filters the collection using the given callback.
function reject($items, $func)
{
return array_values(array_diff($items, array_filter($items, $func)));
}
reject(['Apple', 'Pear', 'Kiwi', 'Banana'], function ($item) {
return strlen($item) > 4;
}); // ['Pear', 'Kiwi']
Removes elements from an array for which the given function returns false.
function remove($items, $func)
{
$keys = array_keys(array_filter($items, $func));
foreach ($keys as $key) {
unset($items[$key]);
}
return $items;
}
remove([1, 2, 3, 4], function ($n) {
return ($n % 2) === 0;
});
// [0 => 1, 2 => 3]
Returns all elements in an array except for the first one.
function tail($items)
{
return count($items) > 1 ? array_slice($items, 1) : $items;
}
tail([1, 2, 3]); // [2, 3]
Returns an array with n elements removed from the beginning.
function take($items, $n = 1)
{
return array_slice($items, 0, $n);
}
take([1, 2, 3], 5); // [1, 2, 3]
take([1, 2, 3, 4, 5], 2); // [1, 2]
Filters out the elements of an array, that have one of the specified values.
function without($items, ...$params)
{
return array_values(array_diff($items, $params));
}
without([2, 1, 2, 3], 1, 2); // [3]
Returns the average of two or more numbers.
function average(...$items)
{
return array_sum($items) / count($items);
}
average(1, 2, 3); // 2
Calculates the factorial of a number.
function factorial($n)
{
if ($n <= 1) {
return 1;
}
return $n * factorial($n - 1);
}
factorial(6); // 720
Generates an array, containing the Fibonacci sequence, up until the nth term.
function fibonacci($n)
{
$sequence = [0, 1];
for ($i = 0; $i < $n - 2; $i++) {
array_push($sequence, array_sum(array_slice($sequence, -2, 2, true)));
}
return $sequence;
}
fibonacci(6); // [0, 1, 1, 2, 3, 5]
Calculates the greatest common divisor between two or more numbers.
function gcd(...$numbers)
{
if (count($numbers) > 2) {
return array_reduce($numbers, 'gcd');
}
$r = $numbers[0] % $numbers[1];
return $r === 0 ? abs($numbers[1]) : gcd($numbers[1], $r);
}
gcd(8, 36); // 4
gcd(12, 8, 32); // 4
Returns true
if the given number is even, false
otherwise.
function isEven($number)
{
return ($number % 2) === 0;
}
isEven(4); // true
Checks if the provided integer is a prime number.
function isPrime($number)
{
$boundary = floor(sqrt($number));
for ($i = 2; $i <= $boundary; $i++) {
if ($number % $i === 0) {
return false;
}
}
return $number >= 2;
}
isPrime(3); // true
Returns the least common multiple of two or more numbers.
function lcm(...$numbers)
{
$ans = $numbers[0];
for ($i = 1; $i < count($numbers); $i++) {
$ans = ((($numbers[$i] * $ans)) / (gcd($numbers[$i], $ans)));
}
return $ans;
}
lcm(12, 7); // 84
lcm(1, 3, 4, 5); // 60
Returns the median of an array of numbers.
function median($numbers)
{
sort($numbers);
$totalNumbers = count($numbers);
$mid = floor($totalNumbers / 2);
return ($totalNumbers % 2) === 0 ? ($numbers[$mid - 1] + $numbers[$mid]) / 2 : $numbers[$mid];
}
median([1, 3, 3, 6, 7, 8, 9]); // 6
median([1, 2, 3, 6, 7, 9]); // 4.5
Check if a string is ends with a given substring.
function endsWith($haystack, $needle)
{
return substr($haystack, -strlen($needle)) === $needle;
}
endsWith('Hi, this is me', 'me'); // true
Compare two strings and returns true
if both strings are anagram, false
otherwise.
function isAnagram($string1, $string2)
{
return count_chars($string1, 1) === count_chars($string2, 1);
}
isAnagram('act', 'cat'); // true
Returns true
if the given string is lower case, false
otherwise.
function isLowerCase($string)
{
$char = mb_substr($string, 0, 1, "UTF-8");
return mb_strtolower($char, "UTF-8") === $char;
}
isLowerCase('Morning shows the day!'); // false
isLowerCase('hello'); // true
Returns true
if the given string is upper case, false otherwise.
function isUpperCase($string)
{
$char = mb_substr($string, 0, 1, "UTF-8");
return mb_strtolower($char, "UTF-8") !== $char;
}
isUpperCase('Morning Shows The Day!'); // true
isUpperCase('qUick Fox'); // false
Returns true
if the given string is a palindrome, false
otherwise.
function palindrome($string)
{
return strrev($string) === $string;
}
palindrome('racecar'); // true
Check if a string is starts with a given substring.
function startsWith($haystack, $needle)
{
return substr($haystack, 0, strlen($needle)) === $needle;
}
startsWith('Hi, this is me', 'Hi'); // true
You're always welcome to contribute to this project. Please read the contribution guide.
This project is licensed under the MIT License - see the License File for details