array_key_exists()
Check a key at the first level independently of the stored value.
CKTIS / PHP
Programming syntax, operators and concepts. Find an explanation, explore an example and return to learning.
Check a key at the first level independently of the stored value.
Read the first key in the current iteration order without moving the internal array pointer.
Read the last key in the current iteration order without advancing or resetting the internal pointer.
List every key, or supply a value to list only its matching keys.
array_map builds an array of callback results for successive values. With one input array it preserves keys; with several it creates consecutive numeric keys.
Combine arrays in argument order.
Merge nested arrays recursively.
Sort arrays together by position, using later columns to break ties.
Extend an array to the absolute target length using a repeated value.
Remove and return the last value of an array, modifying the array passed by reference.
Multiply the elements to obtain one numeric product, for example a combined scaling factor.
Append values to an array passed by reference and return its new element count.
Select keys at random from a nonempty array.
Fold values from left to right using a callback that receives the previous accumulator and the next value.
Overlay later arrays on the first array by key, including integer keys.
Build an array in reverse iteration order without changing the original.
Return the key of the first matching value or false if no match exists.
Remove and return the first element, modifying the array passed by reference.
Copy a segment using positions in iteration order.
Replace a positional segment in the original array and return the removed elements.
Add numeric array values to calculate a total.
Return the first entry of each group of equal values and preserve its key.
Insert values at the start of the array in their argument order and return the new element count.
Discard the original keys and return a list of values in iteration order, indexed from zero.