aboutsummaryrefslogtreecommitdiffhomepage
path: root/bench/StackBench.cpp
Commit message (Collapse)AuthorAge
* Revert of https://codereview.chromium.org/127223004/Gravatar commit-bot@chromium.org2014-01-08
| | | | | | | | | | | | | | | | Reason for revert: VS can't comprehend std::vector without exceptions. R=bsalomon@google.com, caryclark@google.com, mtklein@chromium.org TBR=bsalomon@google.com, caryclark@google.com, mtklein@chromium.org NOTREECHECKS=true NOTRY=true BUG= Author: mtklein@google.com Review URL: https://codereview.chromium.org/129443002 git-svn-id: http://skia.googlecode.com/svn/trunk@12975 2bbb7eff-a529-9590-31e7-b0007b416f81
* For comparison, add std::vector.Gravatar commit-bot@chromium.org2014-01-08
| | | | | | | | | | | | | Where I've tested, it's second-place to SkTDArray, though the closest API equivalent in our code is SkTArray, which it's significantly faster than. This is probably a good approximation to how fast we can possibly make something like SkTArray that constructs and destroys its values. In fact, it might be worth trying making SkTArray a thin shim over std::vector. BUG= R=bsalomon@google.com, caryclark@google.com, mtklein@google.com Author: mtklein@chromium.org Review URL: https://codereview.chromium.org/127223004 git-svn-id: http://skia.googlecode.com/svn/trunk@12969 2bbb7eff-a529-9590-31e7-b0007b416f81
* Add StackBench to measure performance on stack-like (fixed element size) ↵Gravatar commit-bot@chromium.org2014-01-07
work loads. BUG=303282 R=reed@google.com, caryclark@google.com, mtklein@chromium.org Author: mtklein@google.com Review URL: https://codereview.chromium.org/110893007 git-svn-id: http://skia.googlecode.com/svn/trunk@12940 2bbb7eff-a529-9590-31e7-b0007b416f81