I have this haystack array:
$array = [
[
"name" => "Intro",
"id" => "123",
"children" => [
"name" => "foo",
"id" => "234",
"children" => [
"name" => "mur",
"id" => "445",
]
]
],[
"name" => "chapter one",
"id" => "9876",
"children" => [
"name" => "foo",
"id" => "712",
"children" => [
"name" => "bar",
"id" => "888",
]
]
]
];
And this needle array: $needle = ["chapter one","foo","bar"]
I'm working on a recursive search function that will return the id value of the child element matching on column name following the path of $needle.
In the example, it should return 888. I have this so far but I don't find how to follow the $needle path as opposed to finding values assuming they're unique. Appreciate any help putting me on the right track.
function searchTree( $needle, $haystack, $strict=false, $path=array() )
{
if( !is_array($haystack) ) {
return false;
}
foreach( $haystack as $key => $val ) {
if( is_array($val) && $subPath = searchTree($needle, $val, $strict, $path) ) {
$path = array_merge($path, array($key), $subPath);
return $path;
} elseif( (!$strict && $val == $needle) || ($strict && $val === $needle) ) {
$path[] = $key;
return $path;
}
}
return false;
}
$needlecan hold infinite values or will it always be 3?