diff options
author | Sona Kurazyan <sona.kurazyan@qt.io> | 2019-06-20 17:32:24 +0200 |
---|---|---|
committer | Sona Kurazyan <sona.kurazyan@qt.io> | 2019-06-20 22:02:49 +0200 |
commit | 76880675d096fa5e443c4a55161ac36ce9169811 (patch) | |
tree | 8fa34c7cdb66f64583bfea10005f885bec33656f /tests/benchmarks | |
parent | 84f8ceef3f3b1cf3f63d52d44a2ed8292aca68c3 (diff) |
Remove usages of deprecated qSort
Task-number: QTBUG-76491
Change-Id: If8dbbc129a07bedc5970b82c6698cfcfad755b49
Reviewed-by: Volker Hilsheimer <volker.hilsheimer@qt.io>
Diffstat (limited to 'tests/benchmarks')
-rw-r--r-- | tests/benchmarks/qml/librarymetrics_performance/tst_librarymetrics_performance.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/tests/benchmarks/qml/librarymetrics_performance/tst_librarymetrics_performance.cpp b/tests/benchmarks/qml/librarymetrics_performance/tst_librarymetrics_performance.cpp index 7db01180be..64b909caf5 100644 --- a/tests/benchmarks/qml/librarymetrics_performance/tst_librarymetrics_performance.cpp +++ b/tests/benchmarks/qml/librarymetrics_performance/tst_librarymetrics_performance.cpp @@ -251,7 +251,7 @@ void tst_librarymetrics_performance::compilation() } // sort the list - qSort(nResults); + std::sort(nResults.begin(), nResults.end()); // remove IGNORE_N_OUTLIERS*2 from ONLY the worst end (remove gc interference) for (int i = 0; i < IGNORE_N_OUTLIERS; ++i) { @@ -300,7 +300,7 @@ void tst_librarymetrics_performance::instantiation_cached() } // sort the list - qSort(nResults); + std::sort(nResults.begin(), nResults.end()); // remove IGNORE_N_OUTLIERS*2 from ONLY the worst end (remove gc interference) for (int i = 0; i < IGNORE_N_OUTLIERS; ++i) { @@ -357,7 +357,7 @@ void tst_librarymetrics_performance::instantiation() } // sort the list - qSort(nResults); + std::sort(nResults.begin(), nResults.end()); // remove IGNORE_N_OUTLIERS*2 from ONLY the worst end (remove gc interference) for (int i = 0; i < IGNORE_N_OUTLIERS; ++i) { @@ -423,7 +423,7 @@ void tst_librarymetrics_performance::positioners() } // sort the list - qSort(nResults); + std::sort(nResults.begin(), nResults.end()); // remove IGNORE_N_OUTLIERS*2 from ONLY the worst end (remove gc interference) for (int i = 0; i < IGNORE_N_OUTLIERS; ++i) { |