Recursion is most likely the answer, however, if you could define the structure a little better it would be easier to help.
Showing a little code that defines the structure would be best. Paul R. Stearns Advanced Consulting Enterprises, Inc. 15280 NW 79th Ct. Suite 250 Miami Lakes, Fl 33016 Voice: (305)623-0360 x107 Fax: (305)623-4588 ---------------------------------------- From: Tucsonjhall <jh...@cactusware.com> Sent: 10/10/19 11:05 AM To: users@flex.apache.org Subject: Flattening a nested array of asymetrical depth I'm working with nested arrays of divisions in sports and need to flatten a nested array of divisions and subdivisions to find all instances of "division." I've been stumped how to recurse that structure so that I'm sure I traverse all branches of the array without arbitrarily setting a limit of how deep I will go searching for children. Suggestions on a script that should flatten any array of objects with children? Thanks! -- Sent from: http://apache-flex-users.2333346.n4.nabble.com/
