The each() function is an inbuilt function in PHP and is used to get the current element key-value pair of the given array to which the internal pointer is currently pointing. After returning the key and value of the current element the internal pointer is incremented by one in the array.
Note: You can use reset() function if you want to traverse the array again using each().
Parameter: This function accepts a single parameter $array which is the input array in which we want to find the current key-value pair to which the internal pointer is currently pointing.
Return Value: This function returns the key-value pair of the current element of the input array $array. The key-value pair is returned in the form of a new array containing four elements. The first two elements with keys(1 and Value) are for the current element’s value, and next two elements with keys (0 and Key) are for the current element’s key. If the input array is empty or if the internal pointer has reached the end of the array then this function returns FALSE.
Input : each(array('Ram', 'Shita', 'Geeta')) Output : Array (  => Ram [value] => Ram  => 0 [key] => 0 ) Explanation: Here input array contain many elements but ram is the current element so the output contains its key and value pair.
Below programs illustrate the each() function in PHP:
Array (  => maya [value] => maya  => 0 [key] => 0 )
a => anny b => bunny c => chinky
- How to get the function name inside a function in PHP ?
- p5.js | log() function
- p5.js | red() function
- D3.js | d3.sum() function
- p5.js | box() Function
- p5.js | int() function
- p5.js | pow() function
- D3.js | d3.set.has() Function
- PHP Ds\Set get() Function
- p5.js | nf() Function
- p5.js | sin() function
- p5.js | nfc() function
- p5.js | nfs() Function
- p5.js | nfp() Function
- p5.js | tan() function
- PHP | pi( ) Function
- p5.js | cos() function
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.