Pop the element off the end of array. This function will reset() the array pointer of the input array after use.
Back
DEFINITION
array_walk_recursive
Front
Apply a user function recursively to every member of an array
Back
DEFINITION
array_fill_keys
Front
Create array specifying the keys with a default value
Back
DEFINITION
array_filter
Front
Filters elements of an array using a callback function
Back
DEFINITION
array
Front
Create an array
Back
DEFINITION
key
Front
Returns the index element of the current array position.
Back
DEFINITION
array_pad
Front
Pad array to the specified length with a (positive/right or negative/left) value. Length must be larger than current array size.
Back
DEFINITION
array_combine
Front
Creates an array by using one array for keys and another for its value
Back
DEFINITION
array_rand
Front
Pick one or more random keys out of an array
Back
DEFINITION
array_reverse
Front
Return an array with elements in reverse order, with the option to preserve the keys for numeric keys.
Back
DEFINITION
prev
Front
Rewind the internal array pointer
Back
DEFINITION
current (pos)
Front
Return current element that the internal array pointer is set to.
Back
DEFINITION
next
Front
Advance the internal pointer of an array
Back
DEFINITION
array_shift
Front
Shift an element off the beginning of array. This function will reset() the array pointer of the input array after use.
Back
DEFINITION
array_unshift
Front
Prepend one or more elements to the beginning of an array. All numerical array keys will be modified to start counting from zero while literal keys won't be changed.
Back
DEFINITION
array_chunk
Front
Splits an array into smaller parts
Back
DEFINITION
array_fill
Front
Creates an array specifying the starting index and length with a default value
Back
DEFINITION
compact
Front
Creates an associative array using variables. (Opposite of extract)
Back
DEFINITION
in_array
Front
Checks if a value exists in an array optionally using a strict comparison
Back
DEFINITION
array_replace
Front
Replaces the values of the initial array with the values from all the following arrays with the same keys leaving values untouched for keys not found in any of the subsequent arrays and creating new entries for keys not found in the initial array but present in subsequent arrays in the order they are listed.
Back
DEFINITION
array_keys
Front
Return all the keys or a subset of the keys of an array matching a search value that can be strictly compared
Back
DEFINITION
array_flip
Front
Exchanges all keys with their associated values in an array.
Back
DEFINITION
array_merge_recursive
Front
Merge one or more arrays recursively
Back
DEFINITION
range
Front
Create a numeric or character array containing a range start, stop, and step
Back
DEFINITION
array_key_first
Front
Gets the first key of an array
Back
DEFINITION
array_slice
Front
Extract a slice of the array with a given offset and length optionally preserving keys.
Back
DEFINITION
end
Front
Set the internal pointer of an array to its last element
Back
DEFINITION
array_count_values
Front
Calculates the frequency of each value that appears in the array
Back
DEFINITION
array_reduce
Front
Iteratively reduce the array to a single value using a callback function and an optional initial value
Back
DEFINITION
array_push
Front
Push one or more elements onto the end of array
Back
DEFINITION
extract
Front
Creates variables using an associative array. (Opposite of compact)
Back
DEFINITION
array_map
Front
Applies the callback to the elements of the given arrays
Back
DEFINITION
array_unique
Front
Removes duplicate values from an array and optionally set the comparison type. Note that keys are preserved. If multiple elements compare equal under, then the key and value of the first equal element will be retained
Back
DEFINITION
list
Front
Creates variables by extracting any number of values in an array.
Back
DEFINITION
array_search
Front
Searches the array for a given value (strictly compared or not) and returns the first corresponding key if successful
Back
DEFINITION
array_merge
Front
Merge one or more arrays
Back
DEFINITION
array_product
Front
Calculate the product of values in an array
Back
DEFINITION
array_sum
Front
Calculate the sum of values in an array
Back
DEFINITION
array_change_key_case
Front
Changes the casing of each key in an array.
Back
DEFINITION
array_replace_recursive
Front
Replaces recursively the values of the initial array with the values from all the following arrays with the same keys leaving values untouched for keys not found in any of the subsequent arrays and creating new entries for keys not found in the initial array but present in subsequent arrays in the order they are listed.
Back
DEFINITION
array_multisort
Front
Sort multiple or multi-dimensional arrays in a specifiable order and sort type. Associative (string) keys will be maintained, but numeric keys will be re-indexed.
Back
DEFINITION
array_splice
Front
Removes a portion of the array and replace it with something else at a given offset and length
Back
DEFINITION
reset
Front
Set the internal pointer of an array to its first element
Back
DEFINITION
array_key_last
Front
Gets the last key of an array
Back
DEFINITION
array_key_exists (key_exists)
Front
Checks if the given key or index exists in the array
Back
DEFINITION
shuffle
Front
Shuffle the order of an array
Back
DEFINITION
array_values
Front
Return all the values of an array and indexes the array numerically.
Back
DEFINITION
array_column
Front
Extract a single column from a multidimensional array or array of objects.
Back
DEFINITION
count (sizeof)
Front
Counts the total elements in an array
Back
DEFINITION
array_walk
Front
Apply a user supplied function to every member of an array. Array walk can operate with keys while array map cannot and can modify existing array.
Finds the difference between the initial array and any number of arrays comparing all key/value pairs with a user value compare and key compare function
Back
DEFINITION
ksort
Front
Sort an array by key maintaining key to data correlations. This is useful mainly for associative arrays.
Back
DEFINITION
uasort
Front
Sort an array with a user-defined value comparison function and maintain index association
Back
DEFINITION
sort
Front
Sort an array by value, indices are reordered.
Back
DEFINITION
arsort
Front
Sort an array by value in reverse order and maintain index association. Optionally choose the sorting method
Finds the intersection between the initial array and any number of arrays comparing all key/value pairs with a user value compare and key compare function
Back
DEFINITION
usort
Front
Sort an array by values using a user-defined value comparison function. This function assigns new keys to the elements in array. It will remove any existing keys that may have been assigned, rather than just reordering the keys.