I'm having a heck of a time converting this search of nested arrays from fixed depth to variable depth using recursion. Any recursion gurus willing to help?
public function filterFolderFromPath(fullPath:String):void { for each (var currentFolder:Folder in folders) { if(currentFolder.path == fullPath) { filterFolder = currentFolder; break; } else { for each (var currentFolder2:Folder in currentFolder.children) { if(currentFolder2.path == fullPath) { filterFolder = currentFolder2; break; } else { for each (var currentFolder3:Folder in currentFolder2.children) { if(currentFolder3.path == fullPath) { filterFolder = currentFolder3; break; } else { for each (var currentFolder4:Folder in currentFolder3.children) { if(currentFolder4.path == fullPath) { filterFolder = currentFolder4; break; } else { for each (var currentFolder5:Folder in currentFolder4.children) { if(currentFolder5.path == fullPath) { filterFolder = currentFolder5; break; } } } } } } } } } } }