This builtin function of PHP is used to compute the intersection of two or more arrays. The function is different from array_intersect() and array_intersect_assoc() in a way that it uses the keys for the comparison and returns the matching key elements. The function prints only those elements of the first array whose keys matches with the elements of all other arrays.
You may refer to array_intersect() and array_intersect_assoc() for better understanding.
array array_intersect_key($array1, $array2, $array3, $array4...)
Parameters: The array_intersect_key() function takes at least two arrays as arguments. It can take any number of arrays greater than or equal to two separated by commas (‘,’).
Return Type: The function returns another array containing the elements of the first array that are present in all other arrays passed as the parameter whose key matches with each other. If no keys matches then, a NULL array is returned.
Input : $array1 = ("1" => "aakash", "2" => "rishav", "3" => "gaurav") $array2 = ("1" => "shyam", "2" => "rishi", "5" => "rishav") $array3 = ("1" => "aakash", "4" => "raghav", "2" => "ravi") Output : Array (  => aakash  => rishav )
Below program illustrate the array_intersect_key() function. In the below program, we have used array_intersect_key() to find the intersection between arrays. Let’s look closer at the outputs of this and other functions of array_intersect() and array_intersect_assoc() to know the difference.
Array (  => aakash  => rishav )
- How to get the function name inside a function in PHP ?
- PHP | Ds\Map first() Function
- PHP | end() Function
- p5.js | hex() function
- D3.js | d3.rgb() Function
- PHP | pow( ) Function
- D3.js | d3.hcl() Function
- CSS | hsl() Function
- CSS | var() Function
- PHP | next() Function
- PHP | Ds\Set xor() Function
- p5.js | str() function
- PHP | dir() 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 email@example.com. 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.