aboutsummaryrefslogtreecommitdiffhomepage
path: root/bench
diff options
context:
space:
mode:
authorGravatar joshualitt <joshualitt@chromium.org>2015-07-14 11:07:53 -0700
committerGravatar Commit bot <commit-bot@chromium.org>2015-07-14 11:07:53 -0700
commit5ca41c1647d241633ee7880c27d10e8d61d77d98 (patch)
tree8862169f4924f137cdf2cd4afb5a6b2784b17887 /bench
parent889579287770ba35156a73aa02d9ef5d2313c490 (diff)
Remove GrRedBlackTree
Diffstat (limited to 'bench')
-rw-r--r--bench/GrOrderedSetBench.cpp148
1 files changed, 0 insertions, 148 deletions
diff --git a/bench/GrOrderedSetBench.cpp b/bench/GrOrderedSetBench.cpp
deleted file mode 100644
index f532a83b36..0000000000
--- a/bench/GrOrderedSetBench.cpp
+++ /dev/null
@@ -1,148 +0,0 @@
-/*
- * Copyright 2014 Google Inc.
- *
- * Use of this source code is governed by a BSD-style license that can be
- * found in the LICENSE file.
- */
-
-#include "Benchmark.h"
-#include "SkCanvas.h"
-#include "SkRandom.h"
-#include "SkString.h"
-#if SK_SUPPORT_GPU
-#include "GrOrderedSet.h"
-
-static const int NUM_ELEMENTS = 1000;
-
-// Time how long it takes to build a set
-class GrOrderedSetBuildBench : public Benchmark {
-public:
- GrOrderedSetBuildBench() {
- fName.append("ordered_set_build");
- }
-
- bool isSuitableFor(Backend backend) override {
- return kNonRendering_Backend == backend;
- }
-
- virtual ~GrOrderedSetBuildBench() {}
-
-protected:
- const char* onGetName() override {
- return fName.c_str();
- }
-
- void onPreDraw() override {
- SkRandom rand;
- for (int j = 0; j < NUM_ELEMENTS; ++j) {
- fData[j] = rand.nextU() % NUM_ELEMENTS;
- }
- }
-
- void onDraw(const int loops, SkCanvas* canvas) override {
- for (int i = 0; i < loops; ++i) {
- GrOrderedSet<int> set;
- for (int j = 0; j < NUM_ELEMENTS; ++j) {
- set.insert(fData[j]);
- }
- set.reset();
- }
- }
-
-private:
- SkString fName;
- int fData[NUM_ELEMENTS];
- typedef Benchmark INHERITED;
-};
-
-// Time how long it takes to find elements in a set
-class GrOrderedSetFindBench : public Benchmark {
-public:
- GrOrderedSetFindBench() {
- fName.append("ordered_set_find");
- }
-
- bool isSuitableFor(Backend backend) override {
- return kNonRendering_Backend == backend;
- }
-
- virtual ~GrOrderedSetFindBench() {}
-
-protected:
- const char* onGetName() override {
- return fName.c_str();
- }
-
- void onPreDraw() override {
- SkRandom rand;
- for (int j = 0; j < NUM_ELEMENTS; ++j) {
- fData[j] = rand.nextU() % 1500;
- fSet.insert(rand.nextU() % NUM_ELEMENTS);
- }
- }
-
- void onDraw(const int loops, SkCanvas* canvas) override {
- for (int i = 0; i < loops; ++i) {
- for (int j = 0; j < NUM_ELEMENTS; ++j) {
- fSet.find(fData[j]);
- }
- }
- }
-
-private:
- SkString fName;
- int fData[NUM_ELEMENTS];
- GrOrderedSet<int> fSet;
- typedef Benchmark INHERITED;
-};
-
-// Time how long it takes to iterate over and remove all elements from set
-class GrOrderedSetRemoveBench : public Benchmark {
-public:
- GrOrderedSetRemoveBench() {
- fName.append("ordered_set_remove");
- }
-
- bool isSuitableFor(Backend backend) override {
- return kNonRendering_Backend == backend;
- }
-
- virtual ~GrOrderedSetRemoveBench() {}
-
-protected:
- const char* onGetName() override {
- return fName.c_str();
- }
-
- void onPreDraw() override {
- SkRandom rand;
- for (int j = 0; j < NUM_ELEMENTS; ++j) {
- fSet.insert(rand.nextU() % NUM_ELEMENTS);
- }
- }
-
- void onDraw(const int loops, SkCanvas* canvas) override {
- typedef GrOrderedSet<int>::Iter SetIter;
- for (int i = 0; i < loops; ++i) {
- GrOrderedSet<int> testSet;
- for (SetIter s = fSet.begin(); fSet.end() != s; ++s) {
- testSet.insert(*s);
- }
- for (int j = 0; j < NUM_ELEMENTS; ++j) {
- testSet.remove(testSet.find(j));
- }
- }
- }
-
-private:
- SkString fName;
- GrOrderedSet<int> fSet;
- typedef Benchmark INHERITED;
-};
-
-///////////////////////////////////////////////////////////////////////////////
-
-DEF_BENCH(return SkNEW_ARGS(GrOrderedSetBuildBench, ());)
-DEF_BENCH(return SkNEW_ARGS(GrOrderedSetFindBench, ());)
-DEF_BENCH(return SkNEW_ARGS(GrOrderedSetRemoveBench, ());)
-#endif