Menu
Community /Pin to ProfileBookmark[*]
[*]
[*]
[*]
[/LIST] 
@NogDogJun 24.2017 — #If the naming convention you used here is rigorously followed, you could just derive it from the text, and not bother with some sort of array traversal thing to loop through every part of the array until you find it.
Output:
@NogDogJun 26.2017 — #This seems to work, at least with my little test set:
Output:
?@NogDogJun 26.2017 — #
Welcome to the world of recursive functions. ?@NogDogJun 29.2017 — #
That can work pretty easily as long as there is a known limit to the number of "generations" (and it's not some large number). It gets a bit trickier if there is no limit, and you just want to traverse the "family tree" until you get to the root node. In the first, easier case, it could be something like:
It's the left joins on the same table to get the ancestors that does the magic. ?
Find a key’s location in multi-dimensional Array
So, here is the relevant part of this array’s structure:
[CODE]+–Animation
+–Arrays
+–Buttons
+–Cookies
+–Desctags
+–Dice
+–Directions–SubCats–+–DirectionsAbsolute
| +–DirectionsRelative
|
+–Dream——-SubCats–+–DreamArrival
| +–DreamLeaving
| +–DreamUpload
+–Effects
+–Floors
+–Furres——SubCats–+–FurresActions—–SubCats–+–FurresActionsIdle
| | +–FurresActionsInteract
| | +–FurresActionsMessage
| | +–FurresActionsMove
| | +–FurresActionsOrient
| | +–FurresActionsPosture
| | +–FurresActionsTurn
| |
| +–FurresAppearance–SubCats–+–FurresAppearanceGender
| | +–FurresAppearanceSpecies
| |
| +–FurresDreams
| +–FurreSelect
|
+–Kitterdust
+–Locations—SubCats–+–LocationsAbsolute
| +–LocationsRegions
| +–LocationsRelative
|
+–Messages
+–Objects
+–PhoenixSpeak
+–Request
+–Sound
+–Time
+–Variables
+–Walls
+–Window
+–ZZOther
All the words here are array [i]keys
[LIST=1][*]
Select an array key
See if the array that key is in has a parent array
Get the [I]grand
Repeat to top-level array
Have all returned values in an array
For example, if I select FurresAppearanceGender, the array would have three values: “FurresAppearanceGender”, “FurresAppearance” and “Furres”. If I select “Furres” then the array would have only one value: “Furres” itself, since that has no parent array.
How can I do this?
Sign in
to post a comment11 Comments(s) ↴
0
@NogDogJun 24.2017 — #If the naming convention you used here is rigorously followed, you could just derive it from the text, and not bother with some sort of array traversal thing to loop through every part of the array until you find it.[code=php]
$term = "CamelCaseTerm";
preg_match_all('/[A-Z][a-z]+/', $term, $matches);
$hierarchy = !empty($matches[0]) ? $matches[0] : false; // or null?
var_export($hierarchy);
[/code]Output:
<i>
</i>array (
0 => 'Camel',
1 => 'Case',
2 => 'Term',
)
0
@NogDogJun 26.2017 — #This seems to work, at least with my little test set:[code=php]
<?php
/**
* @param $search
* @param $array
* @param array $matches
* @return bool
*/
function getKeyHierarchy($search, $array, Array &$matches)
{
foreach($array as $key => $value) {
$matches[] = $key;
if($key == $search) {
return true;
}
elseif(is_array($value)) {
if(getKeyHierarchy($search, $value, $matches)) {
return true;
}
}
else {
array_pop($matches);
}
}
if(!empty($matches)) {
array_pop($matches);
}
return false;
}
// test
$data = array(
't1' => 'top no child',
't2' => array(
'c21' => 'child of t2',
'c22' => 'another child of t2'
),
't3' => array(
'c31' => 'child of t3',
'c32' => array(
'gc321' => 'grandchild of t3',
'gc322' => 'another grandchild of t3'
)
)
);
var_dump($data);
$tests = array('t1', 'c21', 'c32', 'gc322', 'c456');
foreach($tests as $test) {
echo "Testing '$test':".PHP_EOL;
$hierarchy = array();
$result = getKeyHierarchy($test, $data, $hierarchy);
var_dump($hierarchy);
echo PHP_EOL;
}
[/code]Output:
<i>
</i>array(3) {
["t1"]=>
string(12) "top no child"
["t2"]=>
array(2) {
["c21"]=>
string(11) "child of t2"
["c22"]=>
string(19) "another child of t2"
}
["t3"]=>
array(2) {
["c31"]=>
string(11) "child of t3"
["c32"]=>
array(2) {
["gc321"]=>
string(16) "grandchild of t3"
["gc322"]=>
string(24) "another grandchild of t3"
}
}
}
Testing 't1':
array(1) {
[0]=>
string(2) "t1"
}
Testing 'c21':
array(2) {
[0]=>
string(2) "t2"
[1]=>
string(3) "c21"
}
Testing 'c32':
array(2) {
[0]=>
string(2) "t3"
[1]=>
string(3) "c32"
}
Testing 'gc322':
array(3) {
[0]=>
string(2) "t3"
[1]=>
string(3) "c32"
[2]=>
string(5) "gc322"
}
Testing 'c456':
array(0) {
}
?
0
@NogDogJun 26.2017 — #... I have no idea how that works...[/QUOTE]
Welcome to the world of recursive functions. ?
0
@NogDogJun 29.2017 — #What I think I'm going to do is something through SQL instead--use a query so that, when I assign a category, the parent and grandparent categories (if they apply) are also assigned--or that parent categories and grandparent categories are also used in the searches. One of the two. Or both.[/QUOTE]
That can work pretty easily as long as there is a known limit to the number of "generations" (and it's not some large number). It gets a bit trickier if there is no limit, and you just want to traverse the "family tree" until you get to the root node. In the first, easier case, it could be something like:
<i>
</i>select
t1.name as child,
t2.name as parent,
t3.name as grandparent
from table_name t1
left join table_name t2 on t1.parent_id = t2.id
left join table_name t3 on t2.parent_id = t3.id
where t1.name = 'NameOfInterest'
It's the left joins on the same table to get the ancestors that does the magic. ?