My guess would be that postincrement it takes longer because it needs to store and return the original value, while preincrement only needs to return the result after performing the operation. But that's only a guess.
― Mike Keesey > -----Original Message----- > From: [EMAIL PROTECTED] [mailto:flashcoders- > [EMAIL PROTECTED] On Behalf Of Steven Sacks | BLITZ > Sent: Tuesday, September 19, 2006 1:45 AM > To: Flashcoders mailing list > Subject: RE: [Flashcoders] Find item in array > > As to why exactly --i -(-1) runs faster in a while loop than i--, well, > it can't be the same exact pcode or it wouldn't be faster so it must be > less pcode. I didn't bother to verify it myself because at the time, > somebody did for me. It's explained somewhere in the archives. If you > dig, you'll find it, and you'll find my name somewhere in there along > with it since I was part of the discussion on most occasions that it > came up. > > I do like mustard, now, by the way. :) > > _______________________________________________ > [email protected] > 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 _______________________________________________ [email protected] 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
