If you want the best performance you can get: http://lab.polygonal.de/2007/11/26/data-structures-more-on-linked-lists/
His doubly linked list is insanely fast. What I mean is, I had some code that moved non-sequential items around a list. Using an Array, I could easily cause Flash to timeout from code taking too long with 25,000 items. Using a DLinkedList, I could do the same operation with 200,000 items in about 300ms. 25,000 items was < 10ms on average.
Obviously, YMMV, but these classes are fantastic. Leandro Ferreira wrote:
There's also a performance issue there, since some array operations(ie. splice) are more expensive than in dictionaries and some dictionaries operations(ie. for in) are more expensive than array ones.
_______________________________________________ Flashcoders mailing list [email protected] http://chattyfig.figleaf.com/mailman/listinfo/flashcoders
