Comment #4 on issue 2639 by [email protected]: List is more inefficient
than std::vector. Can't push work from Blink to V8 without regressing
performance.
http://code.google.com/p/v8/issues/detail?id=2639
There could be a simple explanation for this: qsort calls a function to
compare elements. C++ std sort will inline the comparison, which in turn
causes more optimizations to occur.
Just reimplementing qsort in C++ should give you a speed boost.
--
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.
