note 79640 deleted from function.array-search by danbrown

Note Submitter: info at bitandbit dot com dot ar ---- Hi! i modify a little the function made by Chris, i thought it might be better to return an array width the keys only, for example array(2) { [0]=> int(36) [1]=> int(70) }. by the way chris awesome function, THANKS! Regards <?php /*Erratum from my previous post. * Returns all the keys to all the needles found *and put them in an array. */ function array_search_recursive($needle, $haystack, $a=0, $nodes_temp=array()){ global $nodes_found; $a++; foreach ($haystack as $key1=>$value1) { $nodes_temp[$a] = $key1; if (is_array($value1)){ array_search_recursive($needle, $value1, $a, $nodes_temp); } else if ($value1 === $needle){ $nodes_found[] = $nodes_temp[$a]; } } return $nodes_found; } ?>