Comment #2 on issue 3059 by [email protected]: Array.shift() is "slow"
(O(n)) for arrays in LO space
http://code.google.com/p/v8/issues/detail?id=3059
If you only need O(1) amortized complexity, you can easily implement a
queue by using 2 stacks, BTW (one stack is "reversed", copy entries from
the non-empty stack to the empty-stack if needed).
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings
--
--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev
---
You received this message because you are subscribed to the Google Groups "v8-dev" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/groups/opt_out.
