From 4e5a89570b4ae40e716ab66a139b1d05e0406066 Mon Sep 17 00:00:00 2001 From: "bungeman@google.com" Date: Mon, 4 Feb 2013 19:54:15 +0000 Subject: Simplify and speed up SkIntroSort. https://codereview.appspot.com/7273048/ git-svn-id: http://skia.googlecode.com/svn/trunk@7552 2bbb7eff-a529-9590-31e7-b0007b416f81 --- bench/SortBench.cpp | 8 -------- 1 file changed, 8 deletions(-) (limited to 'bench/SortBench.cpp') diff --git a/bench/SortBench.cpp b/bench/SortBench.cpp index 8d6a7167ee..a0a5393298 100644 --- a/bench/SortBench.cpp +++ b/bench/SortBench.cpp @@ -10,15 +10,7 @@ #include "SkTSort.h" #include "SkString.h" -#ifdef SK_DEBUG -// Windows-debug builds (at least) don't implement tail-recursion, and we have -// a bench that triggers a worst-case behavior in SkTQSort (w/ repeated keys) -// which can overflow the stack if N is too big. So we reduce it for debug -// builds (for which we don't care about sorting performance anyways). -static const int N = 100; -#else static const int N = 1000; -#endif static void rand_proc(int array[], int count) { SkRandom rand; -- cgit v1.2.3