PHP Array Function Summary _ PHP Tutorial

PHP array operation function summary. The most common data structure in PHP is an array. arrays can help us solve a large part of programming problems. In fact, many array operations do not need to be written by ourselves. the system already comes with an array which is the most commonly used data structure in PHP. arrays can help us solve a large part of programming problems. In fact, many array operations do not need to be written by ourselves. the system already comes with related functions. Next we will introduce some functions related to PHP array operations, which you may not have heard.

1. Search for a specific value in the array. If yes, return TRUE. Otherwise, return FALSE.

boolean in_array(mixed needle,array haystack[,boolean strict])

2. Find a specified key in the array. If yes, return TRUE. Otherwise, return FALSE.

boolean array_eky_exists(mixed key,array array)

3. Search for a specific value in the array. If yes, return TRUE. Otherwise, return FALSE.

boolean array_search(mixed needle,array haystack[,boolean strict])

4. Obtains a new array composed of all the keys in the array.

array array_keys(array array[,mixed search_value])

5. Obtains a new array composed of all values of the array.

array array_values(array array)

6. Determine the array size

integer count(array array[,int mode])integer sizeof(array array[,int mode])

7. Count the occurrence frequency of array elements

array array_count_values(array array)

8. Deletes repeated values in an array and returns an array consisting of unique values.

array array_unique(array array)

9. Returns the element order of the array. if the value of preserve_key is TRUE, the order of the key values of the array remains unchanged.

array array_reverse(array array[,boolean preserve_key])

10. Replace the array key and value

array array_flip(array array)

11. Sort arrays sequentially. the sort_flags parameter is optional. default behavior.

SORT_NUMBERIC, sorted by numerical value, SORT_REGULAR is useful for sorting integers or floating-point numbers, SORT_STRING is sorted by ASCII value, sort the keys and values of the asort function in the correct order recognized by the audience unchanged void sort (array [, int sort_flags]) void asort (array [, int sort_flags])

12. Array sorting in reverse order. the sort_flags parameter is optional. default behavior.

SORT_NUMBERIC, sorted by numerical value, SORT_REGULAR is useful for sorting integers or floating-point numbers, SORT_STRING is sorted by ASCII value, sort arsort function key values in the correct order recognized by the nearest person. The order of void rsort (array [, int sort_flags]) void arsort (array [, int sort_flags]) remains unchanged.

13. Natural sorting of arrays

void natsort(array array)

14. Case-insensitive natural sorting

void natcasesort(array array)

15. Sort the key-value pairs in an array

boolean ksort(array array[,int sort_flags])

16. Sort the key-value pairs in reverse order.

boolean krsort(array array[,int sort_flags])

17. Sort by user-defined order

void usort(array array,callback function_name)

18. Merges the arrays to return a Union array. Array_merge overwrites the front, and array_merge_recursive is merged.

Array array_merge (array array1 [array array2…]) // More than one array array_merge_recursive (array array1, array array2 [, array…]) // More than two

19. Key and value form a new array

array array_combine(array key,array value)

20. Returns a part of the array, starting from the offset and ending at the offse + length position.

array array_slice(array array, int offset [,int length])

21. Delete all elements starting from offset to ending with offset + length, and return the deleted elements as arrays.

array array_splice(array, int offset [,int length[,array peplacement]])

22. Returns the intersection of arrays. The key value is the key value in the first array.

array array_intersect(array array1,array array2[,arrayN……])

23. The intersection of the array contains the same key value. The key value is the key value of the first array.

array array_intersect_assoc(array array1,array array2[,arrayN……])

24. Evaluate the difference set of the array. the first array does not have values in other arrays.

array array_diff(array array1,array array2[,arrayN……])

25. Evaluate the difference set of the array. the first array does not have the same key value in other arrays.

array array_diffassoc(array array1,array array2[,arrayN……])

26. Returns one or more key values in the array.

mixed array_rand(array array[,int num_entries])

27. Shuffling function

void shuffle(array input_array)

28. Summation of values in the array

mixed array_sum(array array);

29. Splits an array into a multi-dimensional array that contains size elements.

array array_chunk(array array, int size [,boolean preserve_keys])

Bytes. In fact, there are a lot of array operations that we do not need to write, the system already comes with the phase...