I don't know if I understand this correctly, but is it making a array flat?
Then this is the fastest way I think:
var foo : Array = ["a", "b", "c", ["d", "e",["d", "e",["d", "e",["d",
"e"]]]], "f", ["g", ["h"]], [[], "i"], "j"];
var fooString:String = foo.join(";");
fooString = fooString.split(",").join(";");
foo = fooString.split(";");
output:
a,b,c,d,e,d,e,d,e,d,e,f,g,h,,i,j
Bernard
> -----Oorspronkelijk bericht-----
> Van: [EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] Namens
> Danny Kodicek
> Verzonden: dinsdag 25 juli 2006 21:51
> Aan: Flashcoders mailing list
> Onderwerp: Re: [Flashcoders] Attention Recursion & Speed Experts
>
> >Oh, I just noticed that Mark's was fastest.
>
> Sorry, replied to an easlier mail before noticing the thread
> continued...
>
> Danny
> _______________________________________________
> Flashcoders@chattyfig.figleaf.com
> To change your subscription options or search the archive:
> http://chattyfig.figleaf.com/mailman/listinfo/flashcoders
>
> Brought to you by Fig Leaf Software
> Premier Authorized Adobe Consulting and Training
> http://www.figleaf.com http://training.figleaf.com
>
_______________________________________________
Flashcoders@chattyfig.figleaf.com
To change your subscription options or search the archive:
http://chattyfig.figleaf.com/mailman/listinfo/flashcoders
Brought to you by Fig Leaf Software
Premier Authorized Adobe Consulting and Training
http://www.figleaf.com
http://training.figleaf.com
