aboutsummaryrefslogtreecommitdiffhomepage
path: root/gm/bigtext.cpp
diff options
context:
space:
mode:
authorGravatar commit-bot@chromium.org <commit-bot@chromium.org@2bbb7eff-a529-9590-31e7-b0007b416f81>2014-01-08 21:16:04 +0000
committerGravatar commit-bot@chromium.org <commit-bot@chromium.org@2bbb7eff-a529-9590-31e7-b0007b416f81>2014-01-08 21:16:04 +0000
commit506ecc24bfbc5edc3e43830a9fbd815c3d6da96a (patch)
treef1339245d0a7a3bd6bbd4d428861d82c12e3e1ad /gm/bigtext.cpp
parent4b5fba5a3cc29058088a9a62df1da83e1a3c7db0 (diff)
For comparison, add std::vector.
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
Diffstat (limited to 'gm/bigtext.cpp')
0 files changed, 0 insertions, 0 deletions